A Flow Deviation Algorithm for Joint Optimization of Unicast and Anycast Flows in Connection-Oriented Networks

Our discussion in this article centers around a new heuristic algorithm based on Flow Deviation (FD) method deployed for joint optimization of unicast and anycast flows in connection-oriented networks. The optimization problem is NP-complete. Anycast is a one-to-one-of-manytechnique to deliver a packet to one of many hosts. Current computer networks convey mostly unicast traffic. However, the quantity of anycast traffic will grow in near future, since many new services that can use anycast paradigm are developed, e.g. peer-to-peer networks, content delivery networks, sensor networks, etc. In this work we focus on connection-oriented networks, in view of the fact that many transport networks are based on technologies like MPLS, GMPLS, and DWDM. Results of numerical experiments that compare performance of our approach against other heuristics are presented and discussed.

[1]  Akiko Okamura,et al.  QoS control by traffic engineering in content delivery networks , 2003 .

[2]  Weijia Jia,et al.  Distributed admission control for anycast flows , 2004, IEEE Transactions on Parallel and Distributed Systems.

[3]  Krzysztof Walkowiak,et al.  A Unified Approach to Survivability of Connection-Oriented Networks , 2005, ISCIS.

[4]  Krzysztof Walkowiak.  A New Method of Primary Routes Selection for Local Restoration , 2004, NETWORKING.

[5]  Christian Scheideler,et al.  Anycasting in Adversarial Systems: Routing and Admission Control , 2003, ICALP.

[6]  Yucel Saygin,et al.  Computer and Information Sciences - ISCIS 2006, 21th International Symposium, Istanbul, Turkey, November 1-3, 2006, Proceedings , 2006, ISCIS.

[7]  Krzysztof Walkowiak.  Lagrangean Heuristic for Anycast Flow Assignment in Connection-Oriented Networks , 2006, International Conference on Computational Science.

[8]  Robin Milner,et al.  On Observing Nondeterminism and Concurrency , 1980, ICALP.

[9]  Chuck Yoo,et al.  Minimum DVS gateway deployment in DVS-based overlay streaming , 2008, Comput. Commun..

[10]  Masayuki Murata,et al.  IPv6 anycast for simple and effective service-oriented communications , 2004, IEEE Communications Magazine.

[11]  Krzysztof Walkowiak.  Heuristic Algorithm for Anycast Flow Assignment in Connection-Oriented Networks , 2005, International Conference on Computational Science.

[12]  Gang Peng,et al.  CDN: Content Distribution Network , 2004, ArXiv.

[13]  Udi Manber,et al.  Connecting Diverse Web Search Facilities , 1998, IEEE Data Eng. Bull..

[14]  Moon-Jung Chung,et al.  Linear Recursive Networks and Their Applications in Distributed Systems , 1997, IEEE Trans. Parallel Distributed Syst..

[15]  Mostafa Ammar,et al.  QoS routing for anycast communications: motivation and an architecture for DiffServ networks , 2002, IEEE Commun. Mag..

[16]  Stephen Gilmore,et al.  Combining Measurement and Stochastic Modelling to Enhance Scheduling Decisions for a Parallel Mean Value Analysis Algorithm , 2006, International Conference on Computational Science.

[17]  Krzysztof Walkowiak,et al.  A New Function for Optimization of Working Paths in Survivable MPLS Networks , 2006, ISCIS.

[18]  C. Duhamel,et al.  An Augmented Lagrangean Approach for the QoS Constrained Routing Problem , 2006 .

[19]  Krzysztof Walkowiak,et al.  Unsplittable Anycast Flow Problem: Formulation and Algorithms , 2006, International Conference on Computational Science.

[20]  Anthony E. Krzesinski,et al.  Path selection and bandwidth allocation in MPLS networks , 2003, Perform. Evaluation.

[21]  Deep Medhi,et al.  Routing, flow, and capacity design in communication and computer networks , 2004 .

[22]  Krzysztof Walkowiak.  Anycast Communication—A New Approach to Survivability of Connection-Oriented Networks , 2007 .

[23]  Hanif D. Sherali,et al.  Optimal base station selection for anycast routing in wireless sensor networks , 2006, IEEE Transactions on Vehicular Technology.

[24]  Jack Dongarra,et al.  Computational Science - ICCS 2005, 5th International Conference, Atlanta, GA, USA, May 22-25, 2005, Proceedings, Part I , 2005, International Conference on Computational Science.

[25]  Esa Hyytiä.  Heuristic Algorithms for the Generalized Routing and Wavelength Assignment Problem , 2004 .

[26]  Pinar Yolum,et al.  Computer and Information Sciences - ISCIS 2005, 20th International Symposium, Istanbul, Turkey, October 26-28, 2005, Proceedings , 2005, ISCIS.

[27]  Luigi Fratta,et al.  The flow deviation method: An approach to store-and-forward communication network design , 1973, Networks.