Routing bandwidth-guaranteed paths in MPLS traffic engineering: A multiple race track learning approach

IEEE Transactions on Computers

Volumn 56, Issue 7, 2007, Pages 959-976

  Oommen, B John ^a,b   Misra, Sudip ^c   Granmo, Ole Christoffer ^b  

^a CARLETON UNIVERSITY   (Canada)

^b UNIVERSITY OF AGDER   (Norway)

^c Yale University   (United States)

Author keywords

Algorithms; MPLS; Random races; Routing; Traffic engineering

Indexed keywords

ALGORITHMS; BANDWIDTH; ROUTING PROTOCOLS; SWITCHING NETWORKS; TELECOMMUNICATION TRAFFIC;

MULTIPROTOCOL LABEL SWITCHING (MPLS); RANDOM RACES; TRAFFIC ENGINEERING;

COMPUTER NETWORKS;

EID: 34547875703     PISSN: 00189340     EISSN: None     Source Type: Journal    
DOI: 10.1109/TC.2007.1045     Document Type: Article

References (30)

1. R.K. Ahuja, T.L. Magnanti, and J.B. Orlin, Network Flows: Theory Algorithms, and Applications. Prentice Hall, 1993.
2. Traffic Engineering with Multi-Protocol Label Switching, white paper, Avici Systems Inc., http://www.avici.com/technology/whitepapers/ mpls_wp.pdf, 2000.
3. R. Bellman, "On a Routing Problem," Quarterly Applied Math., vol. 16, pp. 87-90, 1958.
4. R. Boutaba, W. Szeto, and Y. Iraqi, "DORA: Efficient Routing for MPLS Traffic Engineering," J. Network and Systems Management, vol. 10, no. 3, pp. 309-325, 2002.
5. T.H. Cormen, C. Leiserson, and R.L. Rivest, Introduction to Algorithms, second ed. MIT Press, 2001.
6. B. Fortz and M. Thorup, "Internet Traffic Engineering by Optimizing OSPF Weights," Proc. INFOCOM '00, pp. 519-528, Mar. 2000.
7. E.W. Dijkstra, "A Note on Two Problems in Connection with Graphs," Numerische Mathematik, vol. 1, pp. 269-271, 1959.
8. I. Iliadis and D. Bauer, "A New Class of Online Minimum-Interference Routing Algorithms," Proc. Second Biennial IFIP TC6 Int'l Conf. Networking (Networking '02), pp. 959-971, 2002.
9. Z. Liu, Y. Sun, and X. Xue, "A Static Routing Algorithm Used in the Internet Traffic Engineering," Proc. Seventh IEEE Asia Pacific Conf. Circuits and Systems (APCCAS '00), pp. 231-234, Dec. 2000.
10. R. Guerin, A. Orda, and D. Williams, "QoS Routing Mechanisms and OSPF Extensions," Proc. Global Internet Miniconf., Nov. 1997.
11. K. Kar, M. Kodialam, and T.V. Lakshman, "Minimum Interference Routing of Bandwidth Guaranteed Tunnels with MPLS Traffic Engineering Applications," IEEE J. Selected Areas in Comm., vol. 18, no. 12, pp. 2566-2579, Dec. 2000.
12. S. Lakshmivarahan, Learning Algorithms Theory and Applications. Springer, 1981.
13. K.S. Narendra and M.A.L. Thathachar, Learning Automata. Prentice Hall, 1989.
14. D.T.H. Ng, B.J. Oommen, and E.R. Hansen, "Adaptive Learning Mechanisms for Ordering Actions Using Random Races," IEEE Trans. Systems, Man, and Cybernetics, vol. 23, no. 5, 1993.
15. M.S. Obaidat, G.I. Papadimitriou, and A.S. Pomportsis, "Learning Automata: Theory, Paradigms and Applications," IEEE Trans. Systems, Man, and Cybernetics, vol. 32, no. 6, pp. 706-709, 2002.
16. B.J. Oommen and M. Agache, "A Comparison of Continuous and Discretized Pursuit Learning Schemes," Proc. IEEE Int'l Conf. Systems, Man, and Cybernetics (SMC '99), pp. 1061-1067, 1999.
17. B.J. Oommen and E.V. de St. Croix, "Graph Partitioning Using Learning Automata," IEEE Trans. Computers, vol. 45, no. 2, pp. 195-208, Feb. 1995.
18. B.J. Oommen and J.K. Lanctot, "Discretized Pursuit Learning Automata," IEEE Trans. Systems, Man, and Cybernetics, vol. 20, no. 4, pp. 931-938, 1990.
19. E. Osborne and A. Simha, Traffic Engineering with MPLS. Cisco Press, July 2002.
20. S. Suri, M. Waldvogel, D. Bauer, and P.R. Warkhede, "Profile-Based Routing and Traffic Engineering," Computer Comm., vol. 26, pp. 351-365, 2003
21. M.A.L. Thathachar and P.S. Sastry, "Estimator Algorithms for Learning Automata," Proc. Platinum Jubilee Conf. Systems and Signal Processing '99, 1986.
22. M.A.L. Thathachar and P.S. Sastry, Networks of Learning Automata. Kluwer Academic, 2003.
23. A. Vasilakos and G. Papadimitriou, "Ergodic Discretized Estimator Learning Automata for High Accuracy and High Adaptation Rate for Non-Stationary Environments," Neurocomputing, vol. 4, pp. 181-196, May 1992.
24. A. Vasilakos and G. Papadimitriou, "A New Approach to Learning Automata: Stochastic Estimator Learning Algorithms," Neurocomputing vol. 7, pp. 275-297, 1995.
25. A. Vasilakos, M.P. Saltouros, A.F. Atlassis, and W. Pedrycz, "Optimizing QoS Routing in Hierarchical ATM Networks Using Computational Intelligence Techniques," IEEE Trans. Systems, Man, and Cybernetics, Part C, vol. 33, no. 3, pp. 297-312, Aug. 2003.
26. Z. Wang and J. Crowcroft, "Quality-of-Service Routing for Supporting Multimedia Applications," IEEE J. Selected Areas in Comm., vol. 14, no. 7, pp. 1228-1234, Sept. 1996.
27. B. Wang, X. Su, and C.L.P. Chen, "A New Bandwidth Guaranteed Routing Algorithm for MPLS Traffic Engineering," Proc. IEEE Int'l Conf. Comm. (ICC '02), pp. 1001-1005, 2002.
28. S.W.H. Wong, "The Online and Offline Properties of Routing Algorithms in MPLS," master's thesis, Dept. Computer Science, Univ. of British Columbia, 2002.
29. Y. Wang and Z. Wang, "Explicit Routing Algorithms for Internet Traffic Engineering," Proc. Eighth IEEE Conf. Computer Comm. and Networks (ICCCN '99), pp. 582-588, Oct. 1999.
30. Zipf's Law, http://www.nist.gov/dads/HTML/zipfslaw.html, 2007.