Loop-free constrained path computation for hop-by-hop QoS routing

Computer Networks

Volumn 51, Issue 11, 2007, Pages 3278-3293

  Li, Zhenjiang ^a   Garcia Luna Aceves, J J ^a,b  

^a University of California Santa Cruz   (United States)

^b PALO ALTO RESEARCH CENTER   (United States)

Author keywords

Constrained path; Logical distance; Loop freedom; QoS routing

Indexed keywords

COMPUTATIONAL METHODS; COMPUTER NETWORKS; CONSTRAINED OPTIMIZATION; MATHEMATICAL MODELS; QUALITY OF SERVICE;

CONSTRAINED PATHS; LOGICAL DISTANCES; LOGICAL SHORTEST MULTIPATH (LSM); LOOP FREEDOM;

ROUTING PROTOCOLS;

EID: 34248649586     PISSN: 13891286     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.comnet.2007.01.020     Document Type: Article

References (22)

1. Wang Z., and Crowcroft J. Quality-of-service routing for supporting multimedia applications. IEEE J. Select. Areas Commun. 14 7 (1996) 1228-1234
2. Mieghem P.V., Neve H.D., and Kuipers F. Hop-by-hop quality of service routing. Comput. Networks 37 3-4 (2001) 407-423
3. J. Wang, K. Nahrstedt, Hop-by-hop routing algorithms for premium-class traffic in DiffServ networks, in: Proceedings of IEEE INFOCOM, 2002.
4. Nelakuditi S., Zhang Z., Tsang R.P., and Du D.H.C. Adaptive proportional routing: a localized QoS routing approach. IEEE/ACM Trans. Netw. 10 6 (2002) 790-804
5. Sobrinho J.L. Algebra and algorithms for QoS path computation and hop-by-hop routing in the Internet. IEEE/ACM Trans. Netw. 10 4 (2002) 541-550
6. B. Smith, J.J. Garcia-Luna-Aceves, Efficient policy-based routing without virtual circuits, in: Proceedings of QSHINE'04, Dallas, TX, October 2004.
7. Z. Li, J.J. Garcia-Luna-Aceves, Solving the multi-constrained path selection problem by using depth first search, in: Proceedings of QSHINE'05, Orlando, FL, August 2005.
8. J.L. Sobrinho, Network routing with path vector protocols: theory and application, in: Proceedings of ACM SIGCOMM, 2003.
9. Mieghem P.V., and Kuipers F.A. Concepts of exact QoS routing algorithms. IEEE/ACM Trans. Netw. 12 5 (2004) 851-864
10. Jaffe J.M. Algorithms for finding paths with multiple constraints. IEEE Networks 14 (1984) 95-116
11. S. Chen, K. Nahrstedt, On finding multi-constrained paths, in: Proceedings of ICC'98, June 1998, pp. 874-879.
12. Yuan X. Heuristic algorithms for multiconstrained quality-of-service routing. IEEE/ACM Trans. Netw. 10 2 (2002) 244-256
13. Neve H.D., and Mieghem P.V. TAMCRA: a tunable accuracy multiple constraints routing algorithm. Comput. Commun. 23 (2000) 667-679
14. Doyle J. Routing TCP/IP (1998), Cisco Press
15. Bertsekas D., and Gallager R. Data Networks. second ed. (1992), Prentice-Hall
16. Garcia-Lunes-Aceves J.J. Loop-free routing using diffusing computations. IEEE/ACM Trans. Netw. 1 1 (1993) 130-141
17. S. Vutukury, J.J. Garcia-Luna-Aceves, MDVA: a distance-vector multipath routing protocol, in: Proceedings of IEEE INFOCOM, Anchorage, AK, USA, 2001.
18. W.T. Zaumen, J.J. Garcia-Luna-Aceves, Loop-free multipath routing using generalized diffusing computations, in: Proceedings of IEEE INFOCOM, San Francisco, CA, USA, 1998.
19. Z. Li, J.J. Garcia-Luna-Aceves, A distributed approach for multi-constrained path selection and routing optimization, in: Proceedings of QSHINE'06, Waterloo, Ont., Canada, August 2006.
20. Cormen T.H., et al. Introduction to Algorithms. second ed. (2003), McGraw-Hill
21. NS2, the Network Simulator, .
22. T. Korkmaz, M. Krunz, S. Tragoudas, An efficient algorithm for finding a path subject to two additive constraints, in: Proceedings of the ACM SIGMETRICS, 2000, pp. 318-327.