A new function for optimization of working paths in survivable MPLS networks

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4263 LNCS, Issue , 2006, Pages 424-433

  Walkowiak, Krzysztof ^a  

^a WROCLAW UNIVERSITY OF TECHNOLOGY   (Poland)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTER SIMULATION; HEURISTIC METHODS; NETWORK PROTOCOLS; OPTIMIZATION; TELECOMMUNICATION LINKS;

NETWORK LINKS; NETWORK SURVIVABILITY; WORKING PATHS ASSIGNMENT;

TELECOMMUNICATION NETWORKS;

EID: 33845268798     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11902140_46     Document Type: Conference Paper

References (15)

1. Bagula, B., Botha, M., Krzesinski, A.: Online Traffic Engineering: The Least Interference Optimization Algorithm. In proccedigs of IEEE ICC 2004, Paris, France, (2004)
2. Bienstock, D.: Potential function methods for approximately solving linear programming problems. Theory and Practice. Kluwer Academic Publishers, Boston (2002)
3. Burns, J., Ott, T., Krzesinski, A., Muller, K.: Path selection and bandwidth allocation in MPLS networks. Performance Evaluation, 52 (2003) 133-152
4. Crawley, E., Nair, R., Jajagopalan, B., Sandick, H.: A framework for QoS-based routing in the Internet. RFC2386 (1998)
5. Fratta, L., Gerla, M., Kleinrock, L.: The Flow Deviation Method: An Approach to Store-and-Forward Communication Network Design. Networks (1973) 97-133
6. Grover, W.: Mesh-based Survivable Networks: Options and Strategies for Optical, MPLS, SONET and ATM Networking. Prentice Hall PTR, Upper Saddle River, New Jersey (2004)
7. Kar, K., Kodialam, M., Lakshman, T.: Minimum interference routing of bandwidth guaranteed tunnels with MPLS traffic engineering applications. IEEE JSAC, 12 (2000), 2566-2579
8. Markowski, M., Kasprzak, A.: The web replica allocation and topology assignment problem in wide area networks: algorithms and computational results. Lecture Notes in Computer Science, LNCS 3483 (2005) 772-781
9. Murakami, K., Kim, H.: Virtual Path Routing for Survivable ATM Networks. IEEE/ACM Transactions on Networking, 2 (1996) 22-39
10. Pioro, M., Medhi, D.: Routing, Row, and Capacity Design in Communication and Computer Networks. Morgan Kaufman Publishers (2004)
11. Ryba, P., Kasprzak, A.: The gateways location and topology assignment problem in hierarchical wide area networks: algorithms and computational results. Lecture Notes in Computer Science, Vol. 3982 (2006) 1100-1109
12. Sharma, V., Hellstrand, F. (ed.): Framework for MPLS-based Recovery. RFC 3469 (2003)
13. Walkowiak, K.: A New Method of Primary Routes Selection for Local Restoration. Lecture Notes in Computer Science, Vol. 3042 (2004) 1024-1035
14. Walkowiak, K.: Survivable Online Routing for MPLS Traffic Engineering. Lecture Notes in Computer Science, Vol. 3266 (2004) 288-297
15. th IMACS World Congress, Paris, France, (2005)