Abstract
The multi-constrained path (MCP) selection problem occurs when the quality of services (QoS) are supported for point-to-point connections in the distributed multimedia applications deployed on the Internet. This NP-complete problem is concerned how to determine a feasible path between two end-points, so that a set of QoSpath constraints can be satisfied simultaneously. Based on the branch-and-bound technology and tabu-searching strategy, an optimal algorithm and a heuristic algorithm are proposed in this paper. The experimental results show that our heuristic algorithm not only has very good performance on several different network topologies, but also is very efficient method for solving large-scale MCP problem.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Jaffe, J. M.,: Algorithms for finding paths with multiple constraints, Networks, vol. 14 (1984) 95–116
Chen, Shiganag, Nahrstedt, Klara,: On Finding Multi-constrained Paths, in Proceedings of the ICC’98 Conference, IEEE (1998) 874–979
Yuan, Xin, Liu, Xingming,: Heuristic Algorithms for Multi-Constrained Quality of Service Routing, in Proceedings of the IEEE INFOCOM Conference, IEEE (2001) 844–853
Korkmaz, Turgay, Krunz, Marwan,: A Randomized Algorithm for Finding a Path Subject to Multiple QoS Constraints, in Proceedings of the IEEE Global Telecommunications Conference, IEEE (1999) 1694–1698
Widyono, R.,: The Design and Evaluation Algorithm for Real-time Channels,TR-94-024, International Computer Science Institute, UC Berkeley (1994)
Korkmaz, Turgay, Krunz, Marwan, Tragoudas, Spyros,: An efficient algorithm for finding a path subject to two additive constraints, Computer Communications, vol. 25 (2002) 225–238
Comer, D.E.,: Internetworking with TCP/IP, vol. I, Prentice Hall (1995)
Verma, Sanjeev, Pankaj, Rajesh K., Leon-Garica, Alberto,: QoS based multicast routing algorithms for real time applications, Performance Evaluation, vol. 34 (1998) 273–294
Korkmaz, Turgay, Krunz, Marwan,: Multi-Constrained Optimal Path Selection, in Proceedings of the IEEE INFOCOM Conference, IEEE (2001) 834–843
Orda, Ariel,: Routing with End-to-End QoSGuaran tees in Broadband Networks, IEEE/ACM Transactions on Networking, vol. 7, no. 3, (1999) 365–374
Yang, Wen-Lin,: Solving the MCOP Problem Optimally, in Proceedings of IEEE Conference on Local Computer Networks, IEEE (2002)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Yang, WL. (2002). Exact and Heuristic Algorithms for Multi-constrained Path Selection Problem. In: Chen, YC., Chang, LW., Hsu, CT. (eds) Advances in Multimedia Information Processing — PCM 2002. PCM 2002. Lecture Notes in Computer Science, vol 2532. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-36228-2_118
Download citation
DOI: https://doi.org/10.1007/3-540-36228-2_118
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-00262-8
Online ISBN: 978-3-540-36228-9
eBook Packages: Springer Book Archive