Anycast Latency: How Many Sites are Enough?. Heidemann, J., de O. Schmidt, R., & Kuipers, J. H. Presentation at DNS-OARC Meeting, October, 2016. Based on the the technical report [Schmidt16a]
Anycast Latency: How Many Sites are Enough? [link]Paper  abstract   bibtex   
This talk will evaluate anycast latency. An anycast service uses multiple \emphsites to provide high availability, capacity and redundancy, with BGP routing associating users to nearby anycast sites. Routing defines the \emphcatchment of the users that each site serves. Although prior work has studied how users associate with anycast services informally, in this paper we examine the key question \emphhow many anycast sites are needed to provide good latency, and the worst case latencies that specific deployments see. To answer this question, we must first define the \emphoptimal performance that is possible, then explore how routing, specific anycast policies, and site location affect performance. We develop a new method capable of determining optimal performance and use it to study four real-world anycast services operated by different organizations: C-, F-, K-, and L-Root, each part of the Root DNS service. We measure their performance from more than νmbervps worldwide vantage points (VPs) in RIPE Atlas. (Given the VPs uneven geographic distribution, we evaluate and control for potential bias.) Key results of our study are to show that a few sites can provide performance nearly as good as many, and that geographic location and good connectivity have a far stronger effect on latency than having many nodes. We show how often users see the closest anycast site, and how strongly routing policy affects site selection.
@Misc{Heidemann16b,
	author = 	"John Heidemann and
                  Ricardo de O. Schmidt and Jan Harm Kuipers",
	title = 	"Anycast Latency: How Many Sites are Enough?",
	howpublished = "Presentation at DNS-OARC Meeting",
	note = "Based on the the technical report [Schmidt16a]",
	month = 	oct,
	year = 	2016,
	address = "Dallas, Texas, USA",
	sortdate = 	"2016-10-16",
	project = "ant, lacrend, retrofuture, researchroot, pinest, nipet",
	jsubject = "network_security",
	jlocation = 	"johnh: pafile",
	keywords = 	"based on [Schmidt16a], anycast, dns, design, latency",
	url =		"https://ant.isi.edu/%7ejohnh/PAPERS/Heidemann16b.html",
	pdfurl =	"https://ant.isi.edu/%7ejohnh/PAPERS/Heidemann16b.pdf",
	myorganization =	"USC/Information Sciences Institute",
	copyrightholder = "authors",
	abstract = "
This talk will evaluate anycast latency.  An anycast service uses
multiple \emph{sites} to provide high availability, capacity and
redundancy, with BGP routing associating users to nearby anycast
sites. Routing defines the \emph{catchment} of the users that each
site serves.  Although prior work has studied how users associate with
anycast services informally, in this paper we examine the key question
\emph{how many anycast sites are needed} to provide good latency, and
the worst case latencies that specific deployments see.  To answer
this question, we must first define the \emph{optimal performance}
that is possible, then explore how routing, specific anycast policies,
and site location affect performance. We develop a new method capable
of determining optimal performance and use it to study four real-world
anycast services operated by different organizations: C-, F-, K-, and
L-Root, each part of the Root DNS service. We measure their
performance from more than \numbervps worldwide vantage points (VPs)
in RIPE Atlas. (Given the VPs uneven geographic distribution, we
evaluate and control for potential bias.)  Key results of our study
are to show that a few sites can provide performance nearly as good as
many, and that geographic location and good connectivity have a far
stronger effect on latency than having many nodes. We show how often
users see the closest anycast site, and how strongly routing policy
affects site selection.
",
}

Downloads: 0