A flow deviation algorithm for joint optimization of unicast and anycast flows in connection-oriented networks

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

Volumn 5073 LNCS, Issue PART 2, 2008, Pages 797-807

  Walkowiak, Krzysztof ^a  

^a WROCLAW UNIVERSITY OF TECHNOLOGY   (Poland)

Author keywords

Anycast; Optimization; Unicast

Indexed keywords

BOOLEAN FUNCTIONS; DISTRIBUTED COMPUTER SYSTEMS; FIBER OPTICS; HEURISTIC ALGORITHMS; HEURISTIC METHODS; KETONES; NETWORK PROTOCOLS; NUCLEAR PROPULSION; OPTIMIZATION; SENSOR NETWORKS;

ANYCAST; CONTENT DELIVERY NETWORKS; HEURISTICS; JOINT OPTIMIZATIONS; NEW SERVICES; NUMERICAL EXPERIMENTS; ON FLOWS; OPTIMIZATION PROBLEMS; PEER-TO-PEER NETWORKS; TRANSPORT NETWORKS; UNICAST; UNICAST TRAFFICS;

COMPUTER NETWORKS;

EID: 54249135555     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-69848-7_63     Document Type: Conference Paper

References (25)

1. Awerbuch, B., Brinkmann, A., Scheideler, C.: Anycasting in adversarial systems: routing and admission control. In: Baeten, J.C.M., Lenstra, J.K., Parrow, J., Woeginger, G.J. (eds.) ICALP 2003. LNCS, vol. 2719, pp. 1153-1168. Springer, Heidelberg (2003)
2. Byun, S., Yoo, C.: Minimum DVS gateway deployment in DVS-based overlay streaming. Computer Communications 31, 537-550 (2008)
3. Bums, J., Ott, T., Rrzesinski, A., Muller, K.: Path selection and bandwidth allocation in MPLS networks. Performance Evaluation 52, 133-152 (2003)
4. Doi, S., Ata, S., Kitamura, K., Murata, M.: IPv6 anycast for simple and effective serviceoriented communications. IEEE Communication Magazine (5), 163-171 (2004)
5. Duhamel, C., Matul, A.: An Augmented Lagrangean Approach for the QoS Constrained Routing Problem. In: Proc. International Network Optimization Conference INOC (2007)
6. Fratta, L., Gerla, M., Kleinrock, L.: The Flow Deviation Method: An Approach to Storeand-Forward Communication Network Design. Networks 3, 97-133 (1973)
7. Hao, F., Zegura, E., Ammar, M.: QoS routing for anycast communications: motivation and an architecture for DiffServ networks. IEEE Comm. Magazine 6, 48-56 (2002)
8. Hou, Y.T., Shi, Y., Sherali, H.D.: Optimal base station selection for anycast routing in wireless sensor networks. IEEE Transactions on Vehicular Technology 3, 813-821 (2006)
9. Hyytia, E.: Heuristic Algorithms for the Generalized Routing and Wavelength Assignment Problem. In: Proc. of Seventeenth Nordic Teletraffic Seminar NTS-17, pp. 373-386 (2004)
10. Jia, W., Xuan, D., Tu, W., Lin, L., Zhao, W.: Distributed admission control for anycast flows. IEEE Transactions on Parallel and Distributed Systems 8, 673-686 (2004)
11. Kasprzak, A.: Designing of Wide Area Networks. Wroclaw Univ. of Tech. Press (2001)
12. Markowski, M., Kasprzak, A.: An Approximate Algorithm for Web Replica Allocation and Topology Assignment Problem in WAN. In: Proc. of 17th IMACS World Congress, Paris, France (2005)
13. Peng, G.: CDN: Content Distribution Networks. Technical Report (2003), http://sunysb.edu/tr/rpe13.ps.gz
14. Pióro, M., Medhi, D.: Routing, Flow, and Capacity Design in Communication and Computer Networks. Morgan Kaufman Publishers, San Francisco (2004)
15. Rabinovich, M.: Issues in Web Content Replication. Data Engineering Bulletin 4 (1998)
16. Ryba, P., Kasprzak, A.: The Gateways Location and Capacity Assignment Problem in Hierarchical WANs: An Approximate Algorithm and Computational Results. In: Proc. Of 18th European Meetings on Cybernetics and Systems Research (EMCSR) (2006)
17. Tang, M., Jia, W., Wang, H., Wang, J.: Routing and Wavelength Assignment for Anycast in WDM Networks. In: Proc. of 3rd International Conference on Wireless and Optical Communication WOC, pp. 301-306 (2003)
18. Walkowiak, K.: A New Method of Primary Routes Selection for Local Restoration. In: Mitrou, N.M., Kontovasilis, K., Rouskas, G.N., Iliadis, I., Merakos, L. (eds.) NETWORKING 2004. LNCS, vol. 3042, pp. 1024-1035. Springer, Heidelberg (2004)
19. Walkowiak, K.: Heuristic Algorithm for Anycast Flow Assignment in Connection-Oriented Networks. In: Sunderam, V.S., van Albada, G.D., Sloot, P.M.A., Dongarra, J. (eds.) ICCS 2005. LNCS, vol. 3516, pp. 1092-1095. Springer, Heidelberg (2005)
20. Walkowiak, K.: A Unified Approach to Survivability of Connection-Oriented Networks. In: Yolum, p., Güngör, T., Gürgen, F., Özturan, C. (eds.) ISCIS 2005. LNCS, vol. 3733, pp. 3-12. Springer, Heidelberg (2005)
21. Walkowiak, K.: Lagrangean Heuristic for Anycast Flow Assignment in Connection-Oriented Networks. In: Alexandrov, V.N., van Albada, G.D., Sloot, P.M.A., Dongarra, J. (eds.) ICCS 2006. LNCS, vol. 3991, pp. 618-625. Springer, Heidelberg (2006)
22. Walkowiak, K.: Unsplittable Anycast Flow Problem Formulation and Algorithms. In: Alexandrov, V.N., van Albada, G.D., Sloot, P.M.A., Dongarra, J. (eds.) ICCS 2006. LNCS, vol. 3991, pp. 626-633. Springer, Heidelberg (2006)
23. Walkowiak, K.: A New Function for Optimization of Working Paths in Survivable MPLS Networks. In: Levi, A., Savaş, E., Yenigün, H., Balcisoy, S., Saygin, Y. (eds.) ISCIS 2006. LNCS, vol. 4263, pp. 424-433. Springer, Heidelberg (2006)
24. Walkowiak, K.: Anycast Communication - A New Approach to Survivability of Connection-Oriented Networks. Communications in Computer and Information Science 1, 378-389 (2007)
25. Yamada, H., Okamura, A., Nakamichi, K., Sakai, K., Chugo, A.: QoS Control by Traffic Engineering in Content Delivery Networks. Fujitsu Sci. Tech. J. 2, 244-254 (2003)