Unsplittable anycast flow problem: formulation and algorithms

Authors:
Krzysztof Walkowiak
Affiliations:
Chair of Systems and Computer Networks, Faculty of Electronics, Wroclaw University of Technology, Wroclaw, Poland
Venue:
ICCS'06 Proceedings of the 6th international conference on Computational Science - Volume Part I
Year:
2006

Citing 6
Cited 2

Improved bounds for the unsplittable flow problem

SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Approximation algorithms for disjoint paths problems

Approximation algorithms for disjoint paths problems
Mesh-based Survivable Transport Networks: Options and Strategies for Optical, MPLS, SONET and ATM Networking

Mesh-based Survivable Transport Networks: Options and Strategies for Optical, MPLS, SONET and ATM Networking
Heuristic algorithm for anycast flow assignment in connection-oriented networks

ICCS'05 Proceedings of the 5th international conference on Computational Science - Volume Part III
The web replica allocation and topology assignment problem in wide area networks: algorithms and computational results

ICCSA'05 Proceedings of the 2005 international conference on Computational Science and Its Applications - Volume Part IV
QoS routing for anycast communications: motivation and an architecture for DiffServ networks

IEEE Communications Magazine

An approximate algorithm for the servers replication problem with two cost constraints in WAN

PDCN'07 Proceedings of the 25th conference on Proceedings of the 25th IASTED International Multi-Conference: parallel and distributed computing and networks
A Flow Deviation Algorithm for Joint Optimization of Unicast and Anycast Flows in Connection-Oriented Networks

ICCSA '08 Proceedings of the international conference on Computational Science and Its Applications, Part II

Quantified Score

Hi-index	0.00

Visualization

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.