@conference {12218,
	title = {IP geolocation in metropolitan areas},
	booktitle = {Proceedings of the ACM SIGMETRICS joint international conference on Measurement and modeling of computer systems},
	series = {SIGMETRICS {\textquoteright}11},
	year = {2011},
	month = {2011///},
	pages = {155 - 156},
	publisher = {ACM},
	organization = {ACM},
	address = {New York, NY, USA},
	abstract = {Current IP geoloation techniques can geolocate an IP address to a region approximately 700 square miles, roughly the size of a metropolitan area. We model geolocation as a pattern-recognition problem, and introduce techniques that geolocate addresses to within 5 miles inside a metropolitan area. We propose two complementary algorithms: The first algorithm, Pattern Based Geolocation (PBG), models the distribution of latencies to the target and compares it to those of the reference landmarks to resolve an address to within 5 miles in a metropolitan area. The second approach, Perturbation Augmented PBG (PAPBG), provides higher resolution by sending extra traffic in the network. While sending an aggregate of 600 Kbps extra traffic to 20 nodes for approximately 2 minutes, PAPBG geolocates addresses to within 3 miles.},
	keywords = {geolocation, pattern recognition, perturbation},
	isbn = {978-1-4503-0814-4},
	doi = {10.1145/1993744.1993803},
	url = {http://doi.acm.org/10.1145/1993744.1993803},
	author = {Singh,Satinder Pal and Baden,Randolph and Lee,Choon and Bhattacharjee, Bobby and La,Richard and Shayman,Mark}
}
