IEEE/ACM Transactions on Networking (TON)
IEEE/ACM Transactions on Networking (TON)
IEEE/ACM Transactions on Networking (TON)
Efficient network QoS provisioning based on per node traffic shaping
IEEE/ACM Transactions on Networking (TON)
Exact admission control for networks with a bounded delay service
IEEE/ACM Transactions on Networking (TON)
D-BIND: an accurate traffic model for providing QoS guarantees to VBR traffic
IEEE/ACM Transactions on Networking (TON)
Statistical properties of MPEG video traffic and their impact on traffic modeling in ATM systems
LCN '95 Proceedings of the 20th Annual IEEE Conference on Local Computer Networks
Efficient Admission Control for EDF Schedulers
INFOCOM '97 Proceedings of the INFOCOM '97. Sixteenth Annual Joint Conference of the IEEE Computer and Communications Societies. Driving the Information Revolution
H-BIND: a new approach to providing statistical performance guarantees to VBR traffic
INFOCOM'96 Proceedings of the Fifteenth annual joint conference of the IEEE computer and communications societies conference on The conference on computer communications - Volume 3
Admission control for hard real-time connections in ATM LANs
INFOCOM'96 Proceedings of the Fifteenth annual joint conference of the IEEE computer and communications societies conference on The conference on computer communications - Volume 1
A calculus for network delay. I. Network elements in isolation
IEEE Transactions on Information Theory
A calculus for network delay. II. Network analysis
IEEE Transactions on Information Theory
A scheme for real-time channel establishment in wide-area networks
IEEE Journal on Selected Areas in Communications
Quality of service guarantees in virtual circuit switched networks
IEEE Journal on Selected Areas in Communications
Weighted fair discard scheme for buffer management in the presence of network congestion
Computer Communications
Hi-index | 0.24 |
We present an admission control scheme for the real-time VBR traffic in the ATM network. The deterministic guarantee on the end-to-end delay bound is adopted as the measure of quality-of-service (QoS). The network environment of our admission control algorithm is the connection-oriented network, in which every network node uses the rate-controlled service (RCS) discipline based on the earliest deadline first (EDF) scheduling policy. Unlike the previous studies on the admission control, this paper focuses on designing an efficient bandwidth allocation scheme, in which the service curve and the spare capacity curve are two important features employed. There are two main features in our algorithm design: to fully utilize the network bandwidth and to reduce the computation complexity. Our algorithm has a simple structure and can be used for distributive admission control. Experiments using the parameters derived from some real video traces show that our admission control algorithm performs better than previous ones in terms of both the network bandwidth utilization and the computation time needed.