Abstract — Traditional approaches to mirroring, caching, and content distribution have an underlying assumption that minimizing network hop count minimizes client latency. However, with uncongested backbones and potentially high-latency service times for dynamic content, such techniques are of limited effectiveness. In this paper we present an architecture in which dispatchers at an overloaded Internet Data Center (IDC) redirect requests for dynamic content to a geographically remote but less loaded IDC. We show with both analytical modeling as well as testbed experiments that the delay savings of redirecting requests to a lightly loaded IDC can far outweigh the overhead in inter-IDC network latency. Consequently, client end-to-end delays are significantly reduced without requiring modifications to clients, servers, or DNS.
|
334
|
Consistent hashing and random trees: Distributed caching protocols for relieving hot spots on the World Wide Web
– Karger, Lehman, et al.
- 1997
|
|
320
|
Predicting internet network distance with coordinates-based approaches
– Ng, Zhang
|
|
185
|
On the placement of web server replicas
– Qiu, Padmanabham, et al.
- 2001
|
|
137
|
Locating nearby copies of replicated Internet servers
– Guyton, Schwartz
- 1995
|
|
129
|
Flash crowds and denial of service attacks: Characterization and implications for cdns and web sites
– JUNG, KRISHNAMURTHY, et al.
- 2002
|
|
126
|
Scalable content-aware request distribution in cluster-based network servers
– Aron, Sanders, et al.
- 2000
|
|
121
|
A Novel Server Selection Technique for Improving the Response Time of a Replicated Service
– Fei, Bhattacharjee, et al.
- 1998
|
|
100
|
Server Selection Using Dynamic Path Characterization
– Carter, Crovella
- 1997
|
|
88
|
On the effectiveness of DNS-based server selection
– Shaikh, Tewari, et al.
- 2001
|
|
88
|
Packet-level traffic measurements from the sprint IP backbone
– Fraleigh, Moon, et al.
- 2003
|
|
69
|
The Case for Cooperative Networking
– Padmanabhan, Sripanidkulchai
- 2002
|
|
64
|
Web caching with consistent hashing
– SHERMAN, KARGER, et al.
- 1999
|
|
64
|
Constrained mirror placement on the Internet
– Jamin, Jin, et al.
- 2001
|
|
55
|
The Effectiveness of Request Redirection on CDN Robustness
– Wang, Pai, et al.
- 2002
|
|
48
|
Qos-driven server migration for internet data centers
– Ranjan, Rolia, et al.
- 2002
|
|
38
|
Dynamic Replica Placement for Scalable Content Delivery
– Chen, Katz, et al.
- 2002
|
|
36
|
Conflict-aware scheduling for dynamic content applications
– Amza, Cox, et al.
- 2003
|
|
30
|
Geographic load balancing for scalable distributed web systems
– Cardellini, Colajanni, et al.
- 2000
|
|
29
|
Distributed Versioning: Consistent Replication for Scaling Back-End DBs of Dynamic Content Web Sites
– Amza, Cox, et al.
- 2003
|
|
25
|
Do We Need Replica Placement Algorithms in Content Delivery Networks
– Karlsson, Mahalingam
- 2002
|
|
25
|
Performance evaluation of redirection schemes in content distribution networks
– Kangasharju, Roberts, et al.
- 1999
|
|
25
|
Computing on the edge: A platform for replicating internet applications
– Rabinovich, Xiao, et al.
- 2003
|
|
17
|
Request redirection algorithms for distributed web systems
– Cardellini, Colajanni, et al.
- 2003
|
|
13
|
Data Networks are Mostly Empty and for Good Reason
– Odlyzko
- 1999
|
|
6
|
Optimal stochastic scheduling in multiclass parallel queues
– Sethuraman, Squillante
- 1999
|
|
6
|
Specification and implementation of dynamic content benchmarks.In
– Amza, Cecchet, et al.
- 1998
|
|
5
|
A Queuing Analysis of Server Sharing Collectives for Content Distribution
– Villela, Rubenstein
- 2002
|
|
2
|
Uitert, “Generalized processor sharing with heterogeneous traffic classes
– Borst, Mandjes, et al.
- 2002
|
