IEEE/ACM Transactions on Networking (TON)
On the self-similar nature of Ethernet traffic (extended version)
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)
End-to-end support for statistical quality-of-service guarantees in multimedia networks
End-to-end support for statistical quality-of-service guarantees in multimedia networks
Effective bandwidths with priorities
IEEE/ACM Transactions on Networking (TON)
Efficient admission control of piecewise linear traffic envelopes at EDF schedulers
IEEE/ACM Transactions on Networking (TON)
A central-limit-theorem-based approach for analyzing queue behavior in high-speed networks
IEEE/ACM Transactions on Networking (TON)
A framework for robust measurement-based admission control
IEEE/ACM Transactions on Networking (TON)
IEEE/ACM Transactions on Networking (TON)
Coordinated multihop scheduling: a framework for end-to-end services
IEEE/ACM Transactions on Networking (TON)
A measurement-analytic approach for QoS estimation in a network based on the dominant time scale
IEEE/ACM Transactions on Networking (TON)
Optimal multiplexing on a single link: delay and buffer requirements
IEEE Transactions on Information Theory
A scheme for real-time channel establishment in wide-area networks
IEEE Journal on Selected Areas in Communications
Statistical service assurances for traffic scheduling algorithms
IEEE Journal on Selected Areas in Communications
Statistical analysis of the generalized processor sharing scheduling discipline
IEEE Journal on Selected Areas in Communications
IEEE Journal on Selected Areas in Communications
Admission control for statistical QoS: theory and practice
IEEE Network: The Magazine of Global Internetworking
MPEG-4 and H.263 video traces for network performance evaluation
IEEE Network: The Magazine of Global Internetworking
Improving performance for multimedia traffic with distributed dynamic QoS adaptation
Computer Communications
A probabilistic approach to estimate the mean waiting times in the earliest deadline first polling
Computers and Industrial Engineering
| Hi-index | 0.00 |
The design of call admission control (CAC) mechanisms has been a critical issue in providing quality-of-service (QoS) guarantees for heterogeneous traffic flows over integrated service (IntServ) and/or differentiated service (DiffServ) networks. Earliest deadline first (EDF) is an ideal scheduler for real-time services because of its optimal admissible region and delay bound properties. The major difficulty in developing an effective and efficient CAC algorithm for statistical services is the analysis of per-class deadline violation (loss) probabilities with respect to the delay bounds. In this paper, we provide an analytical approach to evaluate the aggregate and per-class deadline violation probabilities of an EDF scheduler. Based on these theoretical foundations, we derive the admission control conditions and then propose a CAC algorithm for statistic services under EDF scheduling. In addition, we show that the QoS metrics that an EDF scheduler actually guarantees have an asymptotic ordering property, which provides an important insight into the design and control of EDF networks. The effectiveness and performance of our proposed algorithm have been validated by trace-driven simulation experiments using MPEG and H.263 encoded video sources.