IEEE/ACM Transactions on Networking (TON)
IEEE/ACM Transactions on Networking (TON)
Link-sharing and resource management models for packet networks
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)
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)
A service-curve approach to performance guarantees in integrated-service networks
A service-curve approach to performance guarantees in integrated-service networks
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
Quality of service guarantees in virtual circuit switched networks
IEEE Journal on Selected Areas in Communications
| Hi-index | 0.00 |
The number of real-time applications, such as video-on-demand and video conferencing, is rapidly increasing. Real-time data now occupies a significant portion of network traffic. These applications require real-time service; as such, they need to bound end-to-end delays. Generally, real-time service is provided by reserving bandwidth in advance. Thus, to admit a large number of real-time applications, bandwidth needs to be reserved efficiently. In addition, to share limited bandwidth effectively among multiple agencies, a link-sharing service is required. A link-sharing service provides a guaranteed share of link bandwidth to each agency. To provide both real-time and link-sharing services simultaneously, several hierarchical link-sharing schemes have been proposed. However, existing hierarchical schemes still have problems in achieving a high level of network utilization, especially when variable-bit-rate (VBR) video sessions participate in a hierarchy. The problem is serious since a large portion of real-time applications transmit MPEG-coded VBR data. We propose a new scheduling algorithm that can achieve a high level of network utilization even with VBR video sessions. The proposed scheduling algorithm is a hierarchical link-sharing scheme; it is an extension of the H-FSC generalized with a new bandwidth reservation scheme. The new scheme provides tight bandwidth reservations for VBR video sessions. Even with the advantage in network utilization, the generalized H-FSC does not require high overhead for scheduling; the scheduling complexity remains the same as that of the H-FSC.