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)
Hierarchical packet fair queueing algorithms
IEEE/ACM Transactions on Networking (TON)
Rate-proportional servers: a design methodology for fair queueing algorithms
IEEE/ACM Transactions on Networking (TON)
Efficient admission control of piecewise linear traffic envelopes at EDF schedulers
IEEE/ACM Transactions on Networking (TON)
SCED: a generalized scheduling policy for guaranteeing quality-of-service
IEEE/ACM Transactions on Networking (TON)
A hierarchical fair service curve algorithm for link-sharing, real-time, and priority services
IEEE/ACM Transactions on Networking (TON)
Computer Networks: The International Journal of Computer and Telecommunications Networking
Network calculus: a theory of deterministic queuing systems for the internet
Network calculus: a theory of deterministic queuing systems for the internet
WF2Q: worst-case fair weighted fair queueing
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
Optimal multiplexing on a single link: delay and buffer requirements
IEEE Transactions on Information Theory
The single-queue switch: a building block for switches with programmable scheduling
IEEE Journal on Selected Areas in Communications
Multirate scheduling of VBR video traffic in ATM networks
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
Quality of service guarantees in virtual circuit switched networks
IEEE Journal on Selected Areas in Communications
A probabilistic approach to estimate the mean waiting times in the earliest deadline first polling
Computers and Industrial Engineering
| Hi-index | 0.24 |
Guaranteed service will provide high quality services to real-time applications, e.g., audio or video, over packet networks such as the Internet. To support guaranteed service, a service discipline must guarantee a delay bound to each session. In addition, a preferred service discipline should achieve high network utilization and good scalability. The service disciplines studied so far have problems in achieving these two objectives at the same time. Generalized processor sharing (GPS) service disciplines can have low network utilization. Rate-controlled (RC) service disciplines have difficulty in scalability because of regulators. For service curve (SC) service disciplines, both the network utilization and the scalability depend on the adopted SC. To date, there have been no studies on an SC which can make an SC discipline achieve these two objectives. We propose a new service discipline based on SC service disciplines. The proposed discipline achieves these two goals in a variable-sized packet environment. We show that the discipline can achieve the network utilization achievable by the RC service disciplines. We further show that our SC requires O(1) complexity for deadline calculation. Different from the RC service disciplines, the SC service discipline with our SC does not need regulators at all. Thus, it has better scalability than the RC service disciplines and is work-conserving. We also show that the proposed SC makes SC service disciplines have strictly higher network utilization than the GPS service disciplines including the multi-rate service discipline.