Abstract
One of the challenging issues in QoS routing (QoSR) is how to select a multi-constrained path (MCP) that can meet the QoS requirements. We consider the concept of Pareto optimality in the context of MCP problems and establish a Pareto optimal based partition framework (POPF). Based on the key concepts in POPF, we propose algorithm (DA_2CP) to deal with two additive QoS metric.
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.
Similar content being viewed by others
References
Zheng, Y., Dou, W., Tian, J., Xiao, M.: An overview of research on qos routing. In: Zhou, X., Xu, M., Jähnichen, S., Cao, J. (eds.) APPT 2003. LNCS, vol. 2834, pp. 387–397. Springer, Heidelberg (2003)
Jaffe, J.M.: Algorithms for finding paths with multiple constraints. Networks 14, 95–116 (1984)
Korkmaz, T., Krunz, M., Tragoudas, S.: An efficient algorithm for finding a path subject to two additive constraints. Computer Communications Journal 25, 225–238 (2002)
Handler, G.Y., Zang, I.: A dual algorithm for the constrained shortest path problem. Networks 10, 293–310 (1980)
Blokh, D., Gutin, G.: An approximate algorithm for combinatorial optimization problems with two parameters. Australasian Journal of Combinatorics 14, 157–164 (1996)
Juttner, A., Szviatovszki, B., Mecs, I., Rajko, Z.: Lagrange relaxation based method for the QoS routing problem. In: Proceedings of the INFOCOM 2001 Conference, vol. 2, pp. 859–868. IEEE, Los Alamitos (2001)
Cui, Y., Xu, K., Wu, J.: Precomputation for multi-constrained qos routing in highspeed networks. In: Proceedings of the INFOCOM 2003 Conference, San Francisco (2003)
Zheng, Y., Korkmaz, T., Dou, W.: Pareto optimal based partition framework for two additive constrained path selection. Technical report (2004), http://www.cs.utsa.edu/korkmaz/yanxing/POPF.pdf
Korkmaz, T., Krunz, M.: Multi-constrained optimal path selection. In: Proceedings of the INFOCOM 2001 Conference, Anchorage, Alaska, vol. 2, pp. 834–843. IEEE, Los Alamitos (2001)
Korkmaz, T., Krunz, M.: Routing multimedia traffic with QoS guarantees. IEEE Transactions on Multimedia 5, 429–443 (2003)
Zheng, Y., Tian, J., Liu, Z., Dou, W.: An efficient dynamic weight coefficient qos routing algorithm. In: International Network Conference (INC 2004), UK (2004)
Waxman, B.: Performance evaluation of multipoint routing algorithms. In: Proceedings of the INFOCOM 1993 Conference, vol. 3, pp. 980–986. IEEE, Los Alamitos (1993)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Zheng, Y., Korkmaz, T., Dou, W. (2005). Pareto Optimal Based Partition Framework for Two Additive Constrained Path Selection. In: Lorenz, P., Dini, P. (eds) Networking - ICN 2005. ICN 2005. Lecture Notes in Computer Science, vol 3420. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-31956-6_37
Download citation
DOI: https://doi.org/10.1007/978-3-540-31956-6_37
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-25339-6
Online ISBN: 978-3-540-31956-6
eBook Packages: Computer ScienceComputer Science (R0)