New algorithms for the unsplittable flow problem

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

Volumn 3981 LNCS, Issue , 2006, Pages 1101-1110

  Walkowiak, Krzysztof ^a  

^a WROCLAW UNIVERSITY OF TECHNOLOGY   (Poland)

Author keywords

Connection oriented network; Survivability; UFP

Indexed keywords

ALGORITHMS; BANDWIDTH; COMPUTER NETWORKS; HEURISTIC METHODS; PROBLEM SOLVING;

CONNECTION-ORIENTED NETWORK; HEURISTIC ALGORITHMS; SURVIVABILITY; UFP;

DATA FLOW ANALYSIS;

EID: 33745928447     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11751588_117     Document Type: Conference Paper

References (15)

1. Bagula, B., Botha, M., Krzesinski, A.: Online Traffic Engineering: The Least Interference Optimization Algorithm. IEEE ICC 2004 (2004)
2. Crawley, E., Nair, R., Jajagopalan, B., Sandick, H.: A Framework for QoS-based Routing in the Internet. RFC2386 (1998)
3. Fratta, L., Gerla, M., Kleinrock, L.: The Flow Deviation Method: An Approach to Store- and-Forward Communication Network Design. Networks (1973) 97-133
4. 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)
5. Kasprzak, A.: Designing of Wide Area Networks. Wroclaw Univ. of Tech. Press, (2001)
6. Kleinberg, J.: Approximation algorithms for disjoint paths problems. PhD thesis, MIT, Cambridge, (1996)
7. Kodialam, M., Lakshman, T.: Minimum Interference Routing with Applications to MPLS Traffic Engineering. In Proceedings of INFOCOM (2000), 884-893
8. Kolman, P., Scheideler, C.: Improved bounds for the unsplittable flow problem. In Proc. of the Symposium on Discrete Algorithms (2002), 184-193
9. Markowski, M., Kasprzak, A.: The web replica allocation and topology assignment problem in wide area networks: algorithms and computational results. Lectures Notes in Computer Science, Vol. 3483 (2005), 772-781
10. Murakami, K., Kim, H.: Virtual Path Routing for Survivable ATM Networks. IEEE/ACM Trans. on Networking, 2 (1996) 22-39
11. Pióro, M., Medhi, D.: Routing, Flow, and Capacity Design in Communication and Computer Networks. Morgan Kaufman Publishers (2004)
12. Rosen, E., Viswanathan, A., Callon, R.: Multiprotocol Label Switching Architecture. RFC 3031 (2001)
13. Sharma, V., Hellstrand, F. (ed.): Framework for MPLS-based Recovery. RFC 3469 (2003)
14. Walkowiak, K.: A New Method of Primary Routes Selection for Local Restoration. Lectures Notes in Computer Science, Vol. 3042 (2004), 1024-1035
15. Walkowiak, K.: Survivable Online Routing for MPLS Traffic Engineering. Lectures Notes in Computer Science, Vol. 3266 (2004), 288-297