Hostname: page-component-586b7cd67f-dsjbd Total loading time: 0 Render date: 2024-11-30T23:16:32.970Z Has data issue: false hasContentIssue false
  • English
  • Français

A distributed transportation simplex applied to a ContentDistribution Network problem

Published online by Cambridge University Press:  07 March 2014

Rafaelli de C. Coutinho ,
Lúcia M.A. Drummond  and
Yuri Frota
Rafaelli de C. Coutinho
Affiliation:
Institute of Computing – Fluminense Federal University, RJ, Brazil.. [email protected],[email protected],[email protected]
Lúcia M.A. Drummond
Affiliation:
Institute of Computing – Fluminense Federal University, RJ, Brazil.. [email protected],[email protected],[email protected]
Yuri Frota
Affiliation:
Institute of Computing – Fluminense Federal University, RJ, Brazil.. [email protected],[email protected],[email protected]
Get access

Abstract

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

Keywords

CDNtransportation simplex algorithmdistributed algorithm
Type
Research Article
Information
RAIRO - Operations Research , Volume 48 , Issue 2: Isco 2012, guest editors Nelson Maculan, A. Ridha Mahjoub, Eduardo Uchoa , April 2014 , pp. 189 - 210
Copyright
© EDP Sciences, ROADEF, SMAI, 2014

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

R.K. Ahuja, T.L. Magnanti and J.B. Orlin, Network flows: Theory, algorithms, and applications. Prentice Hall (1993).
Barr, R.S. and Hickman, B.L., Parallel simplex for large pure network problems: Computational testing and sources of speedup. Oper. Res. 42 (1994) 65–80. Google Scholar
M.S. Bazaraa, J.J. Jarvis and H.F. Sherali, Linear programming and network flows. John Wiley & Sons, New York, USA, 2nd edn. (1990).
Bektas, Tolga, Oguz, Osman, and Ouveysi, Iradj, Designing cost-effective content distribution networks. Comput. Oper. Res. 34 (2007) 2436–2449. Google Scholar
Bertsekas, D.P. and Castañon, D.A., The auction algorithm for the transportation problem. Ann. Oper. Res. 20 (1989) 67–96. Google Scholar
Bertsekas, Dimitri P. and Castañon, David A., Parallel synchronous and asynchronous implementations of the auction algorithm. Parallel Comput. 17 (1991) 707–732. Google Scholar
BRITE. http://www.cs.bu.edu/brite/, March 2013, 12.
Chang, M.D., Engquist, M., Finkel, R. and Meyer, R.R., Parallel algorithm for generalized networks. Ann. Oper. Res. 14 (1988) 125–145. Google Scholar
Krishna R. Pattipati Chulwoo Park, 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).
G.B. Dantzig, 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.
Pekny, J.F. Miller, D.L. and Thompson, G.L., Solution of large dense transportation problems using a parallel primal algorithm. Oper. Res. Lett. 9 (1990) 319–324. Google Scholar
Hall, J., Towards a practical parallelisation of the simplex method. Comput. Management Sci. 7 (2010) 139–170. Google Scholar
RRSP Instances. http://www.ic.uff.br/˜yuri/files/RRSP.zip, March 2013, 12.
LABIC. http://labic.ic.uff.br/Instance/index.php?dir=rprdp/&file=dynamic.zip, September 2012, 25.
MPICH2. http://www.mcs.anl.gov/research/projects/mpich2/, September 2012, 25.
Neves, Tiago Araújo, Drummond, Lúcia Maria de A., Ochi, Luiz Satoru, Albuquerque, Célio, and Uchoa, Eduardo, Solving replica placement and request distribution in content distribution networks. Electronic Notes in Discrete Mathematics 36 (2010) 89–96. Google Scholar
Nygren, Erik, Sitaraman, Ramesh K., and Sun, Jennifer, The akamai network: a platform for high-performance internet applications. SIGOPS Oper. Syst. Rev. 44 (2010) 2–19. Google Scholar
K. Thulasiraman, R.P. Chalasani and M.A. Comeau, Parallel network dual simplex method on a shared memory multiprocessor, in Proceedings of the Fifth IEEE Symposium on (1993) 408 –415.
M.M. Zavlanos, Leonid Spesivtsev, and George J. Pappas, A distributed auction algorithm for the assignment problem, in 47th IEEE Conference on Decision and Control (CDC 2008) (2008) 1212–1217.
Zhou, Xiaobo and Xu, Cheng-Zhong, Efficient algorithms of video replication and placement on a cluster of streaming servers. J. Netw. Comput. Appl. 30 (2007) 515–540. Google Scholar