Scalable cooperative latency estimation

Szymaniak, Michal; Pierre, Guillaume; Steen, Maarten van

doi:10.1109/icpads.2004.1316116

Cited by 16 publications

(17 citation statements)

References 15 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…O-King has been used extensively in the literature [2], [3], [5], [8], [9], [10], [12], [20], [22], [34], [36], [37], [39], [43], [48], [49] as a way to easily collect latency information from the Internet; however, no formal or detailed analysis of its pitfalls exists to date. We first describe the measurement algorithm used by O-King, which is necessary for understanding its limitations and our proposed system later in the paper.…”

Section: Understanding Original Kingmentioning

confidence: 99%

“…King approximates the distance between end-hosts using the delay between DNS servers authoritative for IP addresses of the hosts in question. While generally accepted as a sound methodology for estimating delay and used in many papers [2], [3], [5], [8], [9], [10], [12], [20], [22], [34], [36], [37], [39], [43], [48], [49], King has not been analyzed for accuracy and pitfalls since the original paper [13], nor has it been involved in measurements larger than 2500×2500 nodes. Furthermore, some of the advanced techniques suggested in [13] have never been implemented and their feasibility in practice has not been assessed in the literature.…”

Section: Introductionmentioning

confidence: 99%

“…Widespread interest in distance estimation in the Internet has recently evolved into a large field [4], [6], [7], [10], [11], [13], [14], [19], [21], [23], [30], [31], [32], [35], [40], [41], [43], [44], [48], [50]. The purpose of this research is to estimate or measure the latency between hosts, which can then be leveraged to provide better service to end-users and construct more efficient networks.…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Turbo King: Framework for Large-Scale Internet Delay Measurements

Leonard

Loguinov

2008

IEEE INFOCOM 2008 - The 27th Conference on Computer Communications

View full text Add to dashboard Cite

Abstract-Distance estimation and topological proximity in the. Besides deploying tracers and using virtual coordinates, distance is often estimated using end-to-end methods such as King [13] that rely on the existing DNS infrastructure. However, the question of accuracy in such end-to-end estimation and its ability to produce a large-scale map of Internet delays has never been examined. We undertake this task below and show that King suffers from non-negligible error when DNS zones employ geographically diverse authoritative servers or utilize forwarders, both of which are very common in the existing Internet. We also show that King requires insertion of numerous unwanted DNS records in caches of remote servers (which is called cache pollution) and requires large traffic overhead when deployed in large-scale. To overcome these limitations, we propose a new framework we call Turbo King (T-King) that obtains end-to-end delay samples without bias in the presence of distant authoritative servers and forwarders, while consuming half the bandwidth needed by King and reducing the impact of cache pollution by several orders of magnitude. We finish the paper by evaluating Turbo King in several experiments.

show abstract

Section: Understanding Original Kingmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Turbo King: Framework for Large-Scale Internet Delay Measurements

Leonard

Loguinov

2008

IEEE INFOCOM 2008 - The 27th Conference on Computer Communications

View full text Add to dashboard Cite

show abstract

“…We estimated the latencies between each pair of hosts using SCOLE [14]. SCOLE associates hosts with co-ordinates in an N -dimensional space by measuring their latency to a fixed number of known landmarks.…”

Section: Performance Evaluationmentioning

confidence: 99%

Scalable strong consistency for web applications

Sivasubramanian

Pierre

Steen

2004

Proceedings of the 11th Workshop on ACM SIGOPS European Workshop

View full text Add to dashboard Cite

Web application workloads are often characterized by a large number of unique read requests and a significant fraction of write requests. Hosting these applications drives the need for the next generation CDN architecture that does more than caching the results of Web applications but replicates both the application code and its underlying data. We propose the design of a system that guarantees strong consistency for Web applications with high scalability. The proposed system is based on partial replication, where data units are replicated only to servers that access them often. This reduces the consistency overhead as updates are sent to a reduced number of servers. The novelty of our system is that the proposed partial replication is performed by the system automatically by analyzing the system's access patterns periodically. We explore the design space of this system, find the key issues that need to be addressed to build it and propose solutions to solve them. We further show that the proposed algorithms offer significant performance gains compared to existing solutions for a wide range of Web access patterns.

show abstract

“…En lugar de enviar una gran cantidad de mensajes entre ambas máquinas, su método estaba basado en un número muy reducido de medidas [Szy_04]. Dicha investigación culminó en un prototipo que finalmente no terminó de integrarse dentro del sistema Globule.…”

Section: Comparación Con Otras Implementacionesunclassified

Estudio, análisis y desarrollo de una red de distribución de contenido y su algoritmo de redirección de usuarios para servicios web y streaming

Moreno¹

View full text Add to dashboard Cite

Scalable cooperative latency estimation

Abstract: Abstract

Cited by 16 publications

References 15 publications

Turbo King: Framework for Large-Scale Internet Delay Measurements

Turbo King: Framework for Large-Scale Internet Delay Measurements

Scalable strong consistency for web applications

Estudio, análisis y desarrollo de una red de distribución de contenido y su algoritmo de redirección de usuarios para servicios web y streaming

Contact Info

Product

Resources

About