Abstract
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-many technique 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.Keywordsoptimizationanycastunicast
Published Version
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call