On computing per-session performance bounds in high-speed multi-hop computer networks
SIGMETRICS '92/PERFORMANCE '92 Proceedings of the 1992 ACM SIGMETRICS joint international conference on Measurement and modeling of computer systems
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)
Hierarchical packet fair queueing algorithms
IEEE/ACM Transactions on Networking (TON)
Start-time fair queueing: a scheduling algorithm for integrated services packet switching networks
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)
Proportional differentiated services: delay differentiation and packet scheduling
IEEE/ACM Transactions on Networking (TON)
Generalized processor sharing with light-tailed and heavy-tailed input
IEEE/ACM Transactions on Networking (TON)
SRR: an O(1) time-complexity packet scheduler for flows in multiservice packet networks
IEEE/ACM Transactions on Networking (TON)
IEEE/ACM Transactions on Networking (TON)
Optimal multiplexing on a single link: delay and buffer requirements
IEEE Transactions on Information Theory
A calculus for network delay. I. Network elements in isolation
IEEE Transactions on Information Theory
Proportional differentiation: a scalable QoS approach
IEEE Communications Magazine
Traffic modeling for telecommunications networks
IEEE Communications Magazine
Priority queue schedulers with approximate sorting in output-buffered switches
IEEE Journal on Selected Areas in Communications
A scheme for real-time channel establishment in wide-area networks
IEEE Journal on Selected Areas in Communications
| Hi-index | 0.25 |
A new scheduling scheme, called earliest-virtual-deadline-first (EVDF), is proposed to improve resource utilization in a high-speed packet network. The proposed EVDF scheduling is a generalized form of the earliest-deadline-first (EDF) scheduling [D. Ferrari, D. Verma, A scheme for real-time channel establishment in wide-area networks, IEEE J. Select Areas Commun. 8 (3) (1990) 368-379], using the concept of virtual delay bounds and it gives us the flexibility of controlling the delay violation probabilities of traffic flows. As a result, the EVDF scheduler can provide the flows with the quality-of-service (QoS) guarantees that cannot be supported by the EDF scheduler. The performance of the EVDF scheduler is very sensitive to the choice of virtual delay bounds. An iterative algorithm is developed to obtain the virtual delay bounds that achieve ideal service fairness while satisfying the QoS requirements of the flows. Numerical results show that the EVDF scheduler can utilize network resources more efficiently than the EDF scheduler.