Dynamic parallel access to replicated content in the internet

Popular content is frequently replicated in multiple servers or caches in the Internet to offload origin servers and improve end-user experience. However, choosing the best server is a nontrivial task and a bad choice may provide poor end user experience. In contrast to retrieving a file from a single server, we propose a parallel-access scheme where end users access multiple servers at the same time, fetching different portions of that file from different servers and reassembling them locally. The amount of data retrieved from a particular server depends on the resources available at that server or along the path from the user to the server. Faster servers will deliver bigger portions of a file while slower servers will deliver smaller portions. If the available resources at a server or along the path change during the download of a file, a dynamic parallel access will automatically shift the load from congested locations to less loaded parts (server and links) of the Internet. The end result is that users experience significant speedups and very consistent response times. Moreover, there is no need for complicated server selection algorithms and load is dynamically shared among all servers. The dynamic parallel-access scheme presented in this paper does not require any modifications to servers or content and can be easily included in browsers, peer-to-peer applications or content distribution networks to speed up delivery of popular content.

[1]  Duane Wessels,et al.  Cache Digests , 1998, Comput. Networks.

[2]  Li Fan,et al.  Summary cache: a scalable wide-area web cache sharing protocol , 2000, TNET.

[3]  Syam Gadde,et al.  Reduce, reuse, recycle: an approach to building large Internet caches , 1997, Proceedings. The Sixth Workshop on Hot Topics in Operating Systems (Cat. No.97TB100133).

[4]  Roy T. Fielding,et al.  Hypertext Transfer Protocol - HTTP/1.1 , 1997, RFC.

[5]  Balachander Krishnamurthy,et al.  Key Differences Between HTTP/1.0 and HTTP/1.1 , 1999, Comput. Networks.

[6]  Roy Fielding.  RFC 2068 : Hypertext Transfer Protocol-HTTP/1.1 , 1997 .

[7]  Daniel A. Spielman,et al.  Practical loss-resilient codes , 1997, STOC '97.

[8]  Jussi Kangasharju.  Locating copies of objects using the Domain Name System , 1999 .

[9]  Allen Miu.  Performance Analysis of a Dynamic Parallel Downloading Scheme from Mirror Sites Throughout the Internet , 2000 .

[10]  Peter Scheuermann,et al.  Selection algorithms for replicated Web servers , 1998, PERV.

[11]  Mark Crovella,et al.  Server selection using dynamic path characterization in wide-area networks , 1997, Proceedings of INFOCOM '97.

[12]  Jeffrey C. Mogul,et al.  Improving HTTP Latency , 1995, Comput. Networks ISDN Syst..

[13]  Duane Wessels.  Squid internet object cache , 1996 .

[14]  Ellen W. Zegura,et al.  A novel server selection technique for improving the response time of a replicated service , 1998, Proceedings. IEEE INFOCOM '98, the Conference on Computer Communications. Seventeenth Annual Joint Conference of the IEEE Computer and Communications Societies. Gateway to the 21st Century (Cat. No.98.

[15]  Andreas Kirpal.  Study of Parallel Access Schemes to Speed up the Internet , 1999 .

[16]  Michael O. Rabin,et al.  Efficient dispersal of information for security, load balancing, and fault tolerance , 1989, JACM.

[17]  Mostafa Ammar,et al.  Optimizing a Generalized Polling Protocol for Resource Finding over a Multiple Access Channel , 1995, Comput. Networks ISDN Syst..

[18]  Tim Berners-Lee,et al.  Hypertext transfer protocol--http/i , 1993 .

[19]  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).

[20]  Srinivasan Seshan,et al.  SPAND: Shared Passive Network Performance Discovery , 1997, USENIX Symposium on Internet Technologies and Systems.

[21]  Nicholas F. Maxemchuk,et al.  DISPERSITY ROUTING IN STORE-AND-FORWARD NETWORKS. , 1975 .