A Content Distribution Network (CDN) can be defined as an overlay system that replicates copies of contents at multiple points of a network, close to the final users, with the objective of improving data access. CDN technology is widely used for the distribution of large-sized contents, like in video streaming. In this paper we address the problem of finding the best server for each customer request in CDNs, in order to minimize the overall cost. We consider the problem as a transportation problem and a distributed algorithm is proposed to solve it. The algorithm is composed of two independent phases: a distributed heuristic finds an initial solution that may be later improved by a distributed transportation simplex algorithm. It is compared with the sequential version of the transportation simplex and with an auction-based distributed algorithm. Computational experiments carried out on a set of instances adapted from the literature revealed that our distributed approach has a performance similar or better to its sequential counterpart, in spite of not requiring global information about the contents requests. Moreover, the results also showed that the new method outperforms the based-auction distributed algorithm.

Keywords: CDN, transportation simplex algorithm, distributed algorithm

@article{RO_2014__48_2_189_0, author = {Coutinho, Rafaelli de C. and Drummond, L\'ucia M. A. and Frota, Yuri}, title = {A distributed transportation simplex applied to a {Content} {Distribution} {Network} problem}, journal = {RAIRO - Operations Research - Recherche Op\'erationnelle}, pages = {189--210}, publisher = {EDP-Sciences}, volume = {48}, number = {2}, year = {2014}, doi = {10.1051/ro/2014007}, mrnumber = {3264375}, language = {en}, url = {http://archive.numdam.org/articles/10.1051/ro/2014007/} }

TY - JOUR AU - Coutinho, Rafaelli de C. AU - Drummond, Lúcia M. A. AU - Frota, Yuri TI - A distributed transportation simplex applied to a Content Distribution Network problem JO - RAIRO - Operations Research - Recherche Opérationnelle PY - 2014 SP - 189 EP - 210 VL - 48 IS - 2 PB - EDP-Sciences UR - http://archive.numdam.org/articles/10.1051/ro/2014007/ DO - 10.1051/ro/2014007 LA - en ID - RO_2014__48_2_189_0 ER -

%0 Journal Article %A Coutinho, Rafaelli de C. %A Drummond, Lúcia M. A. %A Frota, Yuri %T A distributed transportation simplex applied to a Content Distribution Network problem %J RAIRO - Operations Research - Recherche Opérationnelle %D 2014 %P 189-210 %V 48 %N 2 %I EDP-Sciences %U http://archive.numdam.org/articles/10.1051/ro/2014007/ %R 10.1051/ro/2014007 %G en %F RO_2014__48_2_189_0

Coutinho, Rafaelli de C.; Drummond, Lúcia M. A.; Frota, Yuri. A distributed transportation simplex applied to a Content Distribution Network problem. RAIRO - Operations Research - Recherche Opérationnelle, Volume 48 (2014) no. 2, pp. 189-210. doi : 10.1051/ro/2014007. http://archive.numdam.org/articles/10.1051/ro/2014007/

[1] Network flows: Theory, algorithms, and applications. Prentice Hall (1993). | MR | Zbl

, and ,[2] Parallel simplex for large pure network problems: Computational testing and sources of speedup. Oper. Res. 42 (1994) 65-80. | Zbl

and ,[3] Linear programming and network flows. John Wiley & Sons, New York, USA, 2nd edn. (1990). | MR | Zbl

, and ,[4] Designing cost-effective content distribution networks. Comput. Oper. Res. 34 (2007) 2436-2449. | Zbl

, , and ,[5] The auction algorithm for the transportation problem. Ann. Oper. Res. 20 (1989) 67-96. | MR | Zbl

and ,[6] Parallel synchronous and asynchronous implementations of the auction algorithm. Parallel Comput. 17 (1991) 707-732. | Zbl

and ,[7] BRITE. http://www.cs.bu.edu/brite/, March 2013, 12.

[8] Parallel algorithm for generalized networks. Ann. Oper. Res. 14 (1988) 125-145. | MR

, , and ,[9] Woosun An and David L. Kleinman, Distributed auction algorithms for the assignment problem with partial information, in Proceedings of the 15th International Command and Control Research and Technology Symposium (ICCRTS 10) (2010).

,[10] Application of the simplex method to a transportation problem, in Activity analysis of production and allocation, edited by T.C. Koopmans. J. Wiley, New York (1951), pp. 359-373. | MR | Zbl

,[11] D.L. Miller and G.L. Thompson, Solution of large dense transportation problems using a parallel primal algorithm. Oper. Res. Lett. 9 (1990) 319-324. | Zbl

[12] Towards a practical parallelisation of the simplex method. Comput. Management Sci. 7 (2010) 139-170. | MR | Zbl

,[13] RRSP Instances. http://www.ic.uff.br/˜yuri/files/RRSP.zip, March 2013, 12.

[14] LABIC. http://labic.ic.uff.br/Instance/index.php?dir=rprdp/&file=dynamic.zip, September 2012, 25.

[15] MPICH2. http://www.mcs.anl.gov/research/projects/mpich2/, September 2012, 25.

[16] Solving replica placement and request distribution in content distribution networks. Electronic Notes in Discrete Mathematics 36 (2010) 89-96. | Zbl

, , , , and ,[17] The akamai network: a platform for high-performance internet applications. SIGOPS Oper. Syst. Rev. 44 (2010) 2-19.

, , and ,[18] Parallel network dual simplex method on a shared memory multiprocessor, in Proceedings of the Fifth IEEE Symposium on (1993) 408 -415.

, and ,[19] A distributed auction algorithm for the assignment problem, in 47th IEEE Conference on Decision and Control (CDC 2008) (2008) 1212-1217.

, , and ,[20] Efficient algorithms of video replication and placement on a cluster of streaming servers. J. Netw. Comput. Appl. 30 (2007) 515-540.

and ,*Cited by Sources: *