IEEE/ACM Transactions on Networking (TON)
Resource partitioning for real-time communication
IEEE/ACM Transactions on Networking (TON)
Generalized guaranteed rate scheduling algorithms: a framework
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)
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)
Local Allocation of End-to-End Quality-of-Service in High-Speed Networks
Proceedings of the IFIP TC6 Task Group/WG6.4 International Workshop on Performance of Communication Systems: Modelling and Performance Evaluation of ATM Technology
Resource Division Policies for EDF Scheduling in ATM Networks
ISCC '01 Proceedings of the Sixth IEEE Symposium on Computers and Communications
Call admission and resource reservation for multicast sessions
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
Efficiency of packet voice with deterministic delay
IEEE Communications Magazine
A scheme for real-time channel establishment in wide-area networks
IEEE Journal on Selected Areas in Communications
Hi-index | 0.24 |
We address the issue of reserving resources at packet switches along the path of calls requiring a deterministic bound on end-to-end delay. The switches are assumed to schedule outgoing packets using the packet-by-packet generalized processor sharing scheduling discipline. We propose an algorithm for call admission control and a number of resource reservation policies that are used to map the end-to-end delay requirement into a local rate to be reserved at each switch. The proposed reservation policies are the uniform reservation (EVEN) policy, the capacity proportional policy, and the remaining capacity proportional policy. We present extensive simulation results to evaluate the performance of these resource allocation policies for various topologies and traffic characteristics. We also propose a resource-based routing algorithm and show the performance gain when it is used.