Algorithms for precomputing constrained widest paths and multicast trees

IEEE/ACM Transactions on Networking

Volumn 13, Issue 5, 2005, Pages 1174-1187

  Siachalou, Stavroula ^a   Georgiadis, Leonidas ^a  

^a ARISTOTLE UNIVERSITY OF THESSALONIKI   (Greece)

Author keywords

Bottleneck paths; Graph theory; Multicast trees; Precomputation; QoS routing; Widest paths; Widest trees

Indexed keywords

ALGORITHMS; BANDWIDTH; COMPUTER SIMULATION; GRAPH THEORY; MATHEMATICAL MODELS; MULTICASTING; QUALITY OF SERVICE; TELECOMMUNICATION LINKS;

BOTTLENECK PATHS; MULTICAST TREES; QOS ROUTING;

INTERNET;

EID: 28044470536     PISSN: 10636692     EISSN: None     Source Type: Journal    
DOI: 10.1109/TNET.2005.857117     Document Type: Article

References (23)

1. C. Berge, Graphs. Amsterdam, The Netherlands: North-Holland Mathematical Library, 1991.
2. D. Blokh and G. Gutin, "An approximation algorithm for combinatorial optimization problems with two parameters," Australasian J. Combinatorics, vol. 14, pp. 157-164, 1996.
3. S. Chen and K. Nahrstedt, "On finding multi-constrained paths," in Proc. IEEE Int. Conf. Communications, Atlanta, GA, Jun. 1998, pp. 874-879.
4. T. H. Cormen, C. E. Leiserson, and R. L. Rivest, Introduction to Algorithms. New York: McGraw-Hill, 1990.
5. Y. Cui, K. Xu, and J. Wu, "Precomputation for multi-constrained QoS routing in high speed networks," in Proc. IEEE INFOCOM, vol. 2, 2003, pp. 1414-1424.
6. K. Deb, Multi-Objective Optimization Using Evolutionary Algorithms. New York: Wiley, 2001.
7. L. Georgiadis, "Bottleneck multicast trees in linear time," IEEE Commun. Lett., vol. 7, no. 11, pp. 564-566, Nov. 2003.
8. A. Goel, K. G. Ramakrishnan, D. Kataria, and L. Logothetis, "Efficient computation of delay-sensitive routes from one source to all destinations," in Proc. IEEE INFOCOM, Anchorage, AL, Apr. 2001, pp. 854-858.
9. R. Guerin and A. Orda, "Computing shortest paths for any number of hops," IEEE/ACM Trans. Netw., vol. 10, no. 5, pp. 613-620, Oct. 2002.
10. R. Guerin, A. Orda, and D. Williams, "QoS routing mechanisms and ospf extensions," in Proc. IEEE GLOBECOM, vol. 3, 1997, pp. 1903-1908.
11. R. Hassin, "Approximation shemes for the restricted shortest path problem," Math. Oper Res., vol. 17, no. 1, pp. 36-42, Feb. 1992.
12. T. Korkmaz and M. Krunz, "Source-oriented topology aggregation with multiple QoS parameters in hierarchical networks," ACM Trans. Modeling Comput. Simulation, vol. 10, no. 4, pp. 295-325, Oct. 2000.
13. T. Korkmaz, M. Krunz, and S. Tragoudas, "An efficient algorithm for finding a path subject to two additive constraints," Comput. Commun. J., vol. 25, no. 3, pp. 225-238, Feb. 2002.
14. T. Korkmaz and M. Krunz, "Bandwidth-delay constrained path selection under inaccurate state information," IEEE/ACM Trans. Netw., vol. 11, no. 3, pp. 384-398, Jun. 2003.
15. D. H. Lorena and D. Raz, "A simple efficient approximation scheme for the restricted shortest path problem," Open Res. Lett., vol. 28, no. 5, pp. 231-219, Jun. 2001.
16. K.-S. Lui, K. Nahrstedt, and S. Chen, "Routing with topology aggregation in delay-bandwidth sensitive networks," IEEE/ACM Trans. Netw., vol. 12, no. 1, pp. 17-24, Feb. 2004.
17. K. Mehlhorn and S. Naher, Leda: A Platform for Cornbinatorial and Geometric Computing. Cambridge, U.K.: Cambridge Univ. Press, 2000.
18. P. Van Mieghem, H. De Neve, and F. A. Kuipers, "Hop-by-hop quality of service routing," Comput. Networks, vol. 37, no. 3-4, pp. 407-423, Nov. 2001.
19. P. Narvaez, K.-Y. Siu, and H.-Y. Tzeng, "New dynamic algorithms for shortest path tree computation," IEEE/ACM Trans. Netw., vol. 8, no. 6, pp. 734-746, Dec. 2000.
20. A. Orda and A. Sprintson, "Precomputation schemes for QoS routing," IEEE/ACM Trans. Netw., vol. 11, no. 4, pp. 578-591, Aug. 2003.
21. A. Orda and A. Sprintson, "A scalable approach to the partition of QoS requirements in unicast and multicast," in Proc. IEEE INFOCOM, 2002, pp. 685-694.
22. S. Siachalou and L. Georgiadis, "Efficient QoS routing," Comput. Networks J., vol. 43, no. 3, pp. 351-367, 2003.
23. J. L. Sobrino, "Algebra and algorithms for QoS path computation and hop-by-hop routing in the internet," in Proc. IEEE INFOCOM, vol. 2, Anchorage, AL, Apr. 2001, pp. 727-735.