Abstract
Our discussion in this article centers on a new optimization problem called unsplittable anycast flow problem (UAFP). We are given a directed network with arc capacities and a set of anycast requests. Anycast is a one-to-one-of-many delivery technique that allows a client to choose a content server of a set of replicated servers. In the context of unsplittable flows, anycast request consists of two connections: upstream (from the client to the server) and the downstream (in the opposite direction). The objective of UAFP is to find a subset of the requests of maximum total demand for which upstream and downstream connection uses only one path and the capacity constraint is satisfied. To our best survey, this is the first study that addresses the UFP (unsplittable flow problem) in the context of anycast flows. After formulation of UAFP, we propose several heuristics to solve that problem. Next, we present results of simulation evaluation of these algorithms.
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 callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
