Abstract:
Abstract—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. Index Terms—Content distribution, HTTP, Internet, mirroring, parallel access, peer-to-peer, replication, Web.
Citations
|
433
|
Summary cache: A scalable wide-area web cache sharing protocol
– Fan, Cao, et al.
- 1998
|
|
362
|
Efficient dispersal of information for security, load balancing, and fault tolerance
– Rabin
- 1989
|
|
185
|
SPAND: Shared passive network performance discovery
– SESHAN, STEMM, et al.
- 1997
|
|
157
|
Practical loss-resilient codes
– Luby, Mitzenmacher, et al.
- 1997
|
|
154
|
Improving HTTP Latency
– Padmanabhan, Mogul
- 1994
|
|
121
|
Accessing multiple mirror sites in parallel: Using Tornado codes to speed up downloads
– Byers, Luby, et al.
- 1999
|
|
117
|
A Novel Server Selection Technique for Improving the Response Time of a Replicated Service
– Fei, Bhattacharjee, et al.
- 1998
|
|
96
|
Dynamic Server Selection Using Dynamic Path Characterization in Wide-Area Networks
– Carter, Crovella
- 1997
|
|
62
|
Reduce, Reuse, Recycle: An Approach to Building Large Internet Caches
– Gadde, Rabinovich, et al.
- 1997
|
|
61
|
Selection algorithms for replicated web servers
– Sayal, Breitbart, et al.
- 1998
|
|
15
|
Locating copies of objects using the domain name system
– Kangasharju, Ross, et al.
- 1999
|
|
14
|
Information additive code generator and decoder for communication systems
– Luby
- 2003
|
|
10
|
Optimizing a generalized polling protocol for resource finding over a multiple access channel
– Bemabeu, Ammar, et al.
- 1995
|
|
9
|
Dispersity Routing in Store-and-Forward Networks
– Maxemchuk
- 1975
|
|
7
|
Performance Analysis of a Dynamic Parallel Downloading Scheme from Mirror Sites Throughout the Internet
– Miu, Shih
- 1999
|
|
3
|
Study of Parallel Access Schemes to Speed up the Internet
– Kirpal
- 1999
|
|
1
|
Berkeley Lab Network Research Group. [Online]. Available: http://www.caida.org/tools/utilities/others/pathchar/. Source: ftp://ftp.ee.lbl.gov/pathchar
– Lawrence
|
|
1
|
Key differences between HTTP/1.0 and HTTP/1.1,” presented at
– Krishnamurthy, Mogul, et al.
- 1999
|
|
1
|
Cache digests,” Comput
– Rousskov, Wessels
- 1998
|
|
1
|
Squid internet object cache. [Online]. Available: http://www.nlanr.net/Squid/ Pablo Rodriguez received the M.S. degree in telecommunication engineering from the University of Navarra (UPNA
– Wessels
- 1996
|
