The effect of processing delay and QOS requirements in high speed networks
IEEE INFOCOM '92 Proceedings of the eleventh annual joint conference of the IEEE computer and communications societies on One world through communications (Vol. 1)
SIGCOMM '92 Conference proceedings on Communications architectures & protocols
Multicast routing for multimedia communication
IEEE/ACM Transactions on Networking (TON)
IEEE/ACM Transactions on Networking (TON)
End-to-end guaranteed QoS with statistical multiplexing for ATM networks
Proceedings of the Second IFIP Workshop on Performance Modelling and Evaluation of ATM Networks: ATM Networks, Performance Modelling and Analysis, Volume 1
A scheme for real-time channel establishment in wide-area networks
IEEE Journal on Selected Areas in Communications
Equivalent capacity and its application to bandwidth allocation in high-speed networks
IEEE Journal on Selected Areas in Communications
A framing strategy for congestion management
IEEE Journal on Selected Areas in Communications
A distributed algorithm for delay-constrained unicast routing
IEEE/ACM Transactions on Networking (TON)
Evaluating the impact of stale link state on quality-of-service routing
IEEE/ACM Transactions on Networking (TON)
Design of Run-Time Configuration Manager for a Multimedia Network Environment
SMW '96 Proceedings of the 2nd IEEE International Workshop on Systems Management (SMW'96)
Provisioning multicast QoS for WDM-based optical wireless networks
Computer Communications
QoS-driven multicast tree generation using Tabu search
Computer Communications
| Hi-index | 0.24 |
Interactive voice and video applications (e.g. teleconferencing) over multi-hop packet-switched networks require bounds on delay, loss and jitter. This paper compares routing algorithms and admission control methods which are intended to provide the quality of service required by such applications. The method of comparison is detailed simulation. As part of this work, we propose several novel real-time routing algorithms. The best-performing routing algorithm is a new method which takes into account the constraints imposed by the admission control algorithm. A routing algorithm similar to those used in the phone system is the worst of the dynamic algorithms; static routing is far worse than any of these. The differences between the routing algorithms are greatest when the network is highly connected, and when admission control constraints are difficult to meet. The issue of fairness is also considered in the evaluation of the routing algorithms. Three admission control algorithms were compared under varying traffic conditions and QoS requirements. The impact of traffic shaping on link utilizations was investigated. Overall, the choice of admission control method was more important than the choice of routing algorithm. This work is the first detailed evaluation of routing algorithms for voice and video traffic in multi-hop networks that provide strong end-to-end guarantees.