QoS-oriented content delivery in e-learning systems

QoS-oriented content delivery is an important component in en-learning systems. In this paper, we study the object placement problem in the parallel-access context for QoS-oriented content delivery. The problem is formulated in terms of bandwidth maximization and further proved to be equivalent to the Fault Tolerant Facility Location Problem (FTFL). In this problem the bandwidth that violates the triangle inequality is measured by a cost function which forms a metric when the shortest-path routing is deployed. Though there have been efficient UFL algorithms with good performance guarantees, the challenge of the FTFL Problem arises due to the conflict of its connectivity requirement (multiple distinct connections) and cost minimization (which leads to identical connections with the minimum cost). We investigate possible solutions for addressing this conflict after giving an overview of the existing techniques. Extension of the problem to the context of QoE-aware multimedia delivery which has important applications in e-learning systems is also discussed.

[1]  Lawrence W. Dowdy,et al.  Comparative Models of the File Assignment Problem , 1982, CSUR.

[2]  Daniel Dajun Zeng,et al.  Efficient web content delivery using proxy caching techniques , 2004, IEEE Transactions on Systems, Man, and Cybernetics, Part C (Applications and Reviews).

[3]  Dimitris Papadias,et al.  An overview of data replication on the Internet , 2002, Proceedings International Symposium on Parallel Architectures, Algorithms and Networks. I-SPAN'02.

[4]  Xueyan Tang,et al.  Optimal Replica Placement under TTL-Based Consistency , 2007, IEEE Transactions on Parallel and Distributed Systems.

[5]  S. Thomas McCormick,et al.  Integer Programming and Combinatorial Optimization , 1996, Lecture Notes in Computer Science.

[6]  Rauf Izmailov,et al.  Fast replication in content distribution overlays , 2005, Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies..

[7]  Pablo Rodriguez,et al.  Dynamic parallel access to replicated content in the internet , 2002, TNET.

[8]  David P. Williamson,et al.  Improved approximation algorithms for capacitated facility location problems , 1999, IPCO.

[9]  Vijay V. Vazirani,et al.  Approximation algorithms for metric facility location and k-Median problems using the primal-dual schema and Lagrangian relaxation , 2001, JACM.

[10]  Michael Mitzenmacher,et al.  Accessing multiple mirror sites in parallel: using Tornado codes to speed up downloads , 1999, IEEE INFOCOM '99. Conference on Computer Communications. Proceedings. Eighteenth Annual Joint Conference of the IEEE Computer and Communications Societies. The Future is Now (Cat. No.99CH36320).

[11]  P. Krishnan,et al.  The cache location problem , 2000, TNET.

[12]  Maxim Sviridenko.  An Improved Approximation Algorithm for the Metric Uncapacitated Facility Location Problem , 2002, IPCO.

[13]  Pablo Rodriguez,et al.  Parallel-access for mirror sites in the Internet , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).

[14]  Jianliang Xu,et al.  QoS-aware replica placement for content distribution , 2005, IEEE Transactions on Parallel and Distributed Systems.

[15]  George Pallis,et al.  A similarity based approach for integrated Web caching and content replication in CDNs , 2006, 2006 10th International Database Engineering and Applications Symposium (IDEAS'06).

[16]  Kay Römer,et al.  Distributed Facility Location Algorithms for Flexible Configuration of Wireless Sensor Networks , 2007, DCOSS.

[17]  Samir Khuller,et al.  Greedy strikes back: improved facility location algorithms , 1998, SODA '98.

[18]  Ludmila Cherkasova,et al.  FastReplica: Efficient Large File Distribution Within Content Delivery Networks , 2003, USENIX Symposium on Internet Technologies and Systems.

[19]  Evangelos Markakis,et al.  Greedy facility location algorithms analyzed using dual fitting with factor-revealing LP , 2002, JACM.

[20]  Assuring QoE on Next Generation Networks , 2001 .

[21]  Chaitanya Swamy,et al.  Fault-tolerant facility location , 2003, SODA '03.

[22]  Xueyan Tang,et al.  Coordinated management of cascaded caches for efficient content distribution , 2003, Proceedings 19th International Conference on Data Engineering (Cat. No.03CH37405).

[23]  Vladimir Vlassov,et al.  DOH: A Content Delivery Peer-to-Peer Network , 2006, Euro-Par.

[24]  Ishfaq Ahmad,et al.  A powerful direct mechanism for optimal WWW content replication , 2005, 19th IEEE International Parallel and Distributed Processing Symposium.

[25]  Keqiu Li,et al.  Optimal methods for coordinated enroute web caching for tree networks , 2005, TOIT.

[26]  Sudipto Guha,et al.  Improved Combinatorial Algorithms for Facility Location Problems , 2005, SIAM J. Comput..

[27]  Xueyan Tang,et al.  Coordinated En-Route Web Caching , 2002, IEEE Trans. Computers.

[28]  Vijay V. Vazirani,et al.  An approximation algorithm for the fault tolerant metric facility location problem , 2000, APPROX.

[29]  Amin Saberi,et al.  A new greedy approach for facility location problems , 2002, STOC '02.

[30]  Jeffrey Considine,et al.  Informed content delivery across adaptive overlay networks , 2002, IEEE/ACM Transactions on Networking.

[31]  Rajmohan Rajaraman,et al.  Approximation algorithms for data placement in arbitrary networks , 2001, SODA '01.

[32]  Sudipto Guha,et al.  A constant factor approximation algorithm for the fault-tolerant facility location problem , 2003, J. Algorithms.

[33]  Cristina Hava Muntean,et al.  End-User Quality of Experience Oriented Adaptive E-learning System , 2006, J. Digit. Inf..

[34]  Shihong Xu,et al.  Coordinated En-Route Web Caching in Multiserver Networks , 2009, IEEE Transactions on Computers.

[35]  Spiro Philopoulos.  Experimental Study of Parallel Downloading Schemes for Internet Mirror Sites , 2007 .

[36]  Lili Qiu,et al.  On the placement of Web server replicas , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).

[37]  Keqiu Li,et al.  Coordinated enroute multimedia object caching in transcoding proxies for tree networks , 2005, TOMCCAP.