Heuristic constraint-path routing decision system

Proceedings of the 3rd Annual Communication Networks and Services Research Conference

Volumn 2005, Issue , 2005, Pages 3-8

  Goodridge, Wayne ^a   Robertson, William ^a   Phillips, William J ^a   Sivakumar, Shyamala ^b  

^a DALHOUSIE UNIVERSITY   (Canada)

^b SAINT MARY S UNIVERSITY   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

CONSTRAINT PATH PROBLEM (MCP); REAL NETWORKS; REALISTIC APPROACH; TRAFFIC ENGINEERING (TE);

ALGORITHMS; DECISION THEORY; GRAPH THEORY; HEURISTIC METHODS; ONLINE SYSTEMS; PROBLEM SOLVING; QUALITY OF SERVICE; ROUTERS; TELECOMMUNICATION TRAFFIC;

CONSTRAINT THEORY;

EID: 33746577929     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CNSR.2005.36     Document Type: Conference Paper

References (14)

1. D. Mitra and Q. Wang, "Stochastic traffic engineering, with applications to network revenue management," in INFOCOM 2003. Twenty-Second Annual Joint Conference of the IEEE Computer and Communications Societies, vol. 1, pp. 396-405.
2. J. M. Jaffe, "Algorithms for finding paths with multiple constraints," Networks, vol. 14, p. 95U116, 1984.
3. S. Chen and K. Nahrstedt, "On finding multi-constrained paths," in Conference Record. 1998 IEEE International Conference on Coomunications, 1998.
4. A. Iwata, R. Izmailov, D.-S. Lee, B. Sengupta, G. Ramamurthy, and H. Suzuki, "Atm routing algorithms with multifile qos requirements for multimedia internetworking," IEICE Transactions Communications, vol. E79-B, pp. 281-291, August 1996.
5. P. V. Mieghem and F. A. Kuipers, "On the complexity of qos routing," Computer Communications, special issue on QofIS'01, vol. 26, pp. 376-387, March 2003.
6. T. Korkmaz and M. Krunz, "Multi-constrained optimal path selection," in Proceedings of the IEEE INFOCOM 2001 Conference, vol. 2, (Alaska), p. 834U843, April 2001.
7. G. Liu and K. Ramakrishnan, "A*prune: An algorithm for finding k shortest paths subject to multiple constraints," IEEE INFOCOM 2001, vol. 2, p. 743U749, 2001.
8. F. Kuipers, T. Korkmaz, M. Krunz, and P. V. Mieghem, "Performance evaluation of constraint-based path selection algorithms," IEEE Network, vol. 18, pp. 16-23, 2004.
9. K. Kar, M. Kodialam, and T. V. Lakshman, "Minimum interference routing with applications to mpls traffic engineering," in IEEE INFOCOM, vol. 2, (Tel-Aviv, Israel), pp. 884-893, 2000.
10. G. Figueiredo, N. da Fonseca, and J. Monteiro, "A minimum interference routing algorithm," 2004 IEEE International Conference on Communications, vol. 4, pp. 1942-1947, 2004.
11. P. Aukia, M. Kodialam, P. Koppol, T. Lakshman, H. Sarin, and B. Suter, "Rates: a server for mpls traffic engineering," Network, IEEE, vol. 14, pp. 34-41, 2000.
12. W. Goodridge, W. Robertson, W. Phillips, and S. Sivakumar, "Traffic driven multiple constraint-optimization for qos routing," Inaugural issue of International Journal of Internet Protocol Technology, vol. To Appear, 2005.
13. J. Barzilai, "Measurement foundations for preference function modelling," in Proceedings of the IEEE International Conference on Systems, 1998.
14. A. M. I. Matta and J. Byers, "Brite: A flexible generator of internet topologies," internet draft, Boston MA, 2000.