Unsplittable anycast flow problem: Formulation and algorithms

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

Volumn 3991 LNCS - I, Issue , 2006, Pages 618-625

  Walkowiak, Krzysztof ^a  

^a WROCLAW UNIVERSITY OF TECHNOLOGY   (Poland)

Author keywords

Anycast; Connection oriented network; UFP

Indexed keywords

ALGORITHMS; COMPUTER ARCHITECTURE; COMPUTER NETWORKS; COMPUTER SIMULATION; CONSTRAINT THEORY; HEURISTIC METHODS; PROBLEM SOLVING;

ANYCAST; CONNECTION-ORIENTED NETWORK; ONE-TO-ONE-OF-MANY DELIVERY TECHNIQUE; UNSPLITTABLE ANYCAST FLOW PROBLEM (UAFP);

COMPUTER SCIENCE;

EID: 33746648611     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11758501_83     Document Type: Conference Paper

References (10)

1. Crawley, E., Nair, R., Jajagopalan, B., Sandick, H.: A Framework for QoS-based Routing in the Internet. RFC2386 (1998)
2. 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)
3. Hao, F., Zegura, E., Ammar, M.: QoS routing for anycast communications: motivation and an architecture for DiffServ networks. IEEE Communication Magazine, 6 (2002), 48-56
4. Kasprzak, A.: Designing of Wide Area Networks. Wroclaw Univ. of Tech. Press, (2001)
5. Kleinberg, J.: Approximation algorithms for disjoint paths problems. PhD thesis, MIT, Cambridge, (1996)
6. Kodialam, M., Lakshman, T.: Minimum Interference Routing with Applications to MPLS Traffic Engineering. In Proceedings of INFOCOM (2000), 884-893
7. Kolman, P., Scheideler, C.: Improved bounds for the unsplittable flow problem. In Proc. of the Symposium on Discrete Algorithms (2002), 184-193
8. 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
9. Peng, G.: CDN: Content Distribution Network. Technical Report, sunysb.edu/tr/rpe13.ps.gz, (2003)
10. Walkowiak, K.: Heuristic Algorithm for Anycast Flow Assignment in Connection-Oriented Networks. Lectures Notes in Computer Science, Vol. 3516 (2005), 1092-1095