Internetworking with TCP/IP (2nd ed.), vol. I
Internetworking with TCP/IP (2nd ed.), vol. I
QoS based multicast routing algorithms for real time applications
Performance Evaluation - Special issue on performance and control of network systems
Routing with end-to-end QoS guarantees in broadband networks
IEEE/ACM Transactions on Networking (TON)
Multicast routing with multiple QoS constraints in ATM network
Information Sciences—Informatics and Computer Science: An International Journal
Optimal partition of QoS requirements on unicast paths and multicast trees
IEEE/ACM Transactions on Networking (TON)
Search space reduction in QoS routing
Computer Networks: The International Journal of Computer and Telecommunications Networking
Exact and Heuristic Algorithms for Multi-constrained Path Selection Problem
PCM '02 Proceedings of the Third IEEE Pacific Rim Conference on Multimedia: Advances in Multimedia Information Processing
QoS-driven multicast tree generation using Tabu search
Computer Communications
An efficient algorithm for finding a path subject to two additive constraints
Computer Communications
The use of multicast delivery to provide a scalable and interactive video-on-demand service
IEEE Journal on Selected Areas in Communications
Optimal partition of QoS requirements with discrete cost functions
IEEE Journal on Selected Areas in Communications
Optimal and heuristic algorithms for quality-of-service routing with multiple constraints
Performance Evaluation
| Hi-index | 0.00 |
Providing guaranteed end-to-end quality of service (QoS) is a key issue for deploying multimedia applications on the broadband integrated services networks. To support QoS-based services, an optimal path determination problem, which concerns how to select a feasible end-to-end path to simultaneously satisfy multiple QoS constraints, has to be studied. This problem is often referred as the multiple constrained optimal path problem. Two optimal algorithms: branch-and-bound and extended Bellman-Ford algorithms (EBFA) are proposed in this paper for this NP-complete problem. A number of simulations for different network topologies were carried out for comparing performances between these two algorithms. The experimental results show that the branch-and-bound based algorithm not only outperforms the EBFA, but also is an efficient and stable method when it applies to random networks and practical networks like ANSNET.