Computational geometry: algorithms and applications
Computational geometry: algorithms and applications
A distributed algorithm for delay-constrained unicast routing
IEEE/ACM Transactions on Networking (TON)
IDMaps: a global internet host distance estimation service
IEEE/ACM Transactions on Networking (TON)
Profile-Based Routing: A New Framework for MPLS Traffic Engineering
COST 263 Proceedings of the Second International Workshop on Quality of Future Internet Services
Hierarchical QoS routing in delay-bandwidth sensitive networks
LCN '00 Proceedings of the 25th Annual IEEE Conference on Local Computer Networks
Quality of Service Routing Algorithms for Bandwidth-Delay Constrained Applications
ICNP '01 Proceedings of the Ninth International Conference on Network Protocols
Routing support for providing guaranteed end-to-end quality-of-service
Routing support for providing guaranteed end-to-end quality-of-service
MPLS and traffic engineering in IP networks
IEEE Communications Magazine
TAMCRA: a tunable accuracy multiple constraints routing algorithm
Computer Communications
Quality-of-service routing for supporting multimedia applications
IEEE Journal on Selected Areas in Communications
Evaluation of multicast routing algorithms for real-time communication on high-speed networks
IEEE Journal on Selected Areas in Communications
IEEE Journal on Selected Areas in Communications
IEEE Network: The Magazine of Global Internetworking
Capacity management and routing policies for voice over IP traffic
IEEE Network: The Magazine of Global Internetworking
An efficient distributed scheme for source routing protocol in communication networks
ICDCIT'04 Proceedings of the First international conference on Distributed Computing and Internet Technology
Hi-index | 0.00 |
The development of technologies like Multi-Protocol Label Switching (MPLS) and Differentiated Services has laid the foundation for Internet to support multimedia applications like Voice over IP. Although much work has been done on laying MPLS paths to optimize performance, most has focused on satisfying bandwidth requirements. Relatively little research has been done on laying paths with both bandwidth and delay constraints. In this paper, we present bandwidth-delay constrained routing algorithms that use knowledge of the ingress-egress node pairs in the network in reducing the rejection rates for setting up new paths. Simulation is used to evaluate the algorithms and compare their performance against some existing algorithms for bandwidth constraints that have been modified to handle delay constraints. The results show that the proposed algorithms outperform all others under a wide range of workload, topology and system parameters.