No-Jump-into-Latency in China's Internet

Slides:



Advertisements
Similar presentations
Dude, where’s that IP? Circumventing measurement-based IP geolocation Presented by: Steven Zittrower.
Advertisements

Intel Research Internet Coordinate Systems - 03/03/2004 Internet Coordinate Systems Marcelo Pias Intel Research Cambridge
Relative Network Positioning via CDN Redirections A. Su, D. Choffnes, F. Bustamante, A. Kuzmanovic ICDCS 2008 Presented by: Imranul Hoque.
Phillipa Gill, Yashar Ganijali Dept. of CS University of Toronto Bernard Wong Dept. of CS Cornell University David Lie Dept. of Electrical and Computer.
1 Efficient and Robust Streaming Provisioning in VPNs Z. Morley Mao David Johnson Oliver Spatscheck Kobus van der Merwe Jia Wang.
IPlane: An Information Plane for Distributed Services Offence by: Anup Goyal Sagar Vemuri.
1 Estimating Shared Congestion Among Internet Paths Weidong Cui, Sridhar Machiraju Randy H. Katz, Ion Stoica Electrical Engineering and Computer Science.
King : Estimating latency between arbitrary Internet end hosts Krishna Gummadi, Stefan Saroiu Steven D. Gribble University of Washington Presented by:
Peer-to-Peer Based Multimedia Distribution Service Zhe Xiang, Qian Zhang, Wenwu Zhu, Zhensheng Zhang IEEE Transactions on Multimedia, Vol. 6, No. 2, April.
Scalable Application Layer Multicast Suman Banerjee Bobby Bhattacharjee Christopher Kommareddy ACM SIGCOMM Computer Communication Review, Proceedings of.
On the Geographic Distribution of On- line Game Servers and Players Wu-chang FengWu-chi Feng Discussion moderated By: John Carter.
Internet Cache Pollution Attacks and Countermeasures Yan Gao, Leiwen Deng, Aleksandar Kuzmanovic, and Yan Chen Electrical Engineering and Computer Science.
Novel Self-Configurable Positioning Technique for Multihop Wireless Networks Authors : Hongyi Wu Chong Wang Nian-Feng Tzeng IEEE/ACM TRANSACTIONS ON NETWORKING,
End-to-End Issues. Route Diversity  Load balancing o Per packet splitting o Per flow splitting  Spill over  Route change o Failure o policy  Route.
Network Measurement Bandwidth Analysis. Why measure bandwidth? Network congestion has increased tremendously. Network congestion has increased tremendously.
Proximity service Main idea – provide “glue” between experiments and sonar topology – mainly map sonars to storages and vice versa – determine existing.
Jennifer Rexford Fall 2014 (TTh 3:00-4:20 in CS 105) COS 561: Advanced Computer Networks Locations.
Network Layer4-1 NAT: Network Address Translation local network (e.g., home network) /24 rest of.
Towards Efficient Load Balancing in Structured P2P Systems Yingwu Zhu, Yiming Hu University of Cincinnati.
On the Power of Off-line Data in Approximating Internet Distances Danny Raz Technion - Israel Institute.
IP-Geolocation Mapping for Moderately Connected Internet Regions.
(jeez y) Where is the Internet? Answers from : (G. Whilikers) Out there. (Mike) the way I see it, the "internet" has to be somewhere. a router collects.
Oasis: Anycast for Any Service Michael J. Freedman Karthik Lakshminarayanan David Mazières in NSDI 2006 Presented by: Sailesh Kumar.
PingER: Research Opportunities and Trends R. Les Cottrell, SLAC University of Malaya.
Ao-Jan Su, David R. Choffnes, Fabián E. Bustamante and Aleksandar Kuzmanovic Department of EECS Northwestern University Relative Network Positioning via.
SOS: A Safe, Ordered, and Speedy Emergency Navigation Algorithm in Wireless Sensor Networks Andong Zhan ∗ †, Fan Wu ∗, Guihai Chen ∗ ∗ Shanghai Key Laboratory.
On the Scale and Performance of Cooperative Web Proxy Caching University of Washington Alec Wolman, Geoff Voelker, Nitin Sharma, Neal Cardwell, Anna Karlin,
Towards Street-Level Client- Independent IP Geolocation Yong Wang, UESTC/Northwestern Daniel Burgener, Northwestern Marcel Flores, Northwestern Aleksandar.
University of Central Florida CAP 6135: Malware and Software Vulnerability Spring 2012 Paper Presentation Dude, where’s that IP? Circumventing measurement-based.
1 On the Placement of Web Server Replicas Lili Qiu, Microsoft Research Venkata N. Padmanabhan, Microsoft Research Geoffrey M. Voelker, UCSD IEEE INFOCOM’2001,
An Efficient Approach for Content Delivery in Overlay Networks Mohammad Malli Chadi Barakat, Walid Dabbous Planete Project To appear in proceedings of.
Function Computation over Heterogeneous Wireless Sensor Networks Xuanyu Cao, Xinbing Wang, Songwu Lu Department of Electronic Engineering Shanghai Jiao.
Advanced Networking Lab. Given two IP addresses, the estimation algorithm for the path and latency between them is as follows: Step 1: Map IP addresses.
A Routing Underlay for Overlay Networks Akihiro Nakao Larry Peterson Andy Bavier SIGCOMM’03 Reviewer: Jing lu.
1 On the Placement of Web Server Replicas Lili Qiu, Microsoft Research Venkata N. Padmanabhan, Microsoft Research Geoffrey M. Voelker, UCSD IEEE INFOCOM’2001,
Towards Efficient Large-Scale VPN Monitoring and Diagnosis under Operational Constraints Yao Zhao, Zhaosheng Zhu, Yan Chen, Northwestern University Dan.
A Light-Weight Distributed Scheme for Detecting IP Prefix Hijacks in Real-Time Lusheng Ji†, Joint work with Changxi Zheng‡, Dan Pei†, Jia Wang†, Paul Francis‡
On the Topology of Wireless Sensor Networks Sen Yang, Xinbing Wang, Luoyi Fu Department of Electronic Engineering, Shanghai Jiao Tong University, China.
Network Coordinates : Internet Distance Estimation Jieming ZHU
On the Impact of Clustering on Measurement Reduction May 14 th, D. Saucez, B. Donnet, O. Bonaventure Thanks to P. François.
Towards Social User Profiling: Unified and Discriminative Influence Model for Inferring Home Locations Rui Li, Shengjie Wang, Hongbo Deng, Rui Wang, Kevin.
정하경 MMLAB Fundamentals of Internet Measurement: a Tutorial Nevil Brownlee, Chris Lossley, “Fundamentals of Internet Measurement: a Tutorial,” CMG journal.
Evaluation of a Novel Two-Step Server Selection Metric Presented by Karthik Lakshminarayanan
Topologically-Aware Overlay Construction and Sever Selection Sylvia Ratnasamy, Mark Handley, Richard Karp, Scott Shenker.
A Detailed Path-latency Model for Router Geolocation* Internetes hosztok mérés alapú geolokalizációja Sándor Laki, Péter Mátray, Péter Hága, István Csabai.
03/02/20061 Evaluating Top-k Queries Over Web-Accessible Databases Amelie Marian Nicolas Bruno Luis Gravano Presented By: Archana and Muhammed.
On the Placement of Web Server Replicas Yu Cai. Paper On the Placement of Web Server Replicas Lili Qiu, Venkata N. Padmanabhan, Geoffrey M. Voelker Infocom.
1 Plaxton Routing. 2 History Greg Plaxton, Rajmohan Rajaraman, Andrea Richa. Accessing nearby copies of replicated objects, SPAA 1997 Used in several.
Incrementally Improving Lookup Latency in Distributed Hash Table Systems Hui Zhang 1, Ashish Goel 2, Ramesh Govindan 1 1 University of Southern California.
PATH DIVERSITY WITH FORWARD ERROR CORRECTION SYSTEM FOR PACKET SWITCHED NETWORKS Thinh Nguyen and Avideh Zakhor IEEE INFOCOM 2003.
Drafting Behind Akamai (Travelocity-Based Detouring) Ao-Jan Su, David R. Choffnes, Aleksandar Kuzmanovic and Fabián E. Bustamante Department of EECS Northwestern.
1 On the Impact of Route Monitor Selection Ying Zhang* Zheng Zhang # Z. Morley Mao* Y. Charlie Hu # Bruce M. Maggs ^ University of Michigan* Purdue University.
Lecture 13 – Network Mapping
Zueyong Zhu† and J. William Atwood‡
Quantifying the Impact of Edge Computing on Mobile Applications
Mohammad Malli Chadi Barakat, Walid Dabbous Alcatel meeting
Server Allocation for Multiplayer Cloud Gaming
No Direction Home: The True cost of Routing Around Decoys
Presented by Prashant Duhoon
ISP and Egress Path Selection for Multihomed Networks
On the Scale and Performance of Cooperative Web Proxy Caching
Dude, where’s that IP? Circumventing measurement-based geolocation
Phillipa Gill University of Toronto
Chandrika Jayant Ethan Katz-Bassett
Presented by Jason L.Y. Lin
Congestion Control in SDN-Enabled Networks
Dhruv Gupta EEC 273 class project Prof. Chen-Nee Chuah
Smart Content Delivery in Large Networks: En-Route Caching
Congestion Control in SDN-Enabled Networks
Approximate Mean Value Analysis of a Database Grid Application
Presentation transcript:

No-Jump-into-Latency in China's Internet No-Jump-into-Latency in China's Internet! Toward Last-Mile Hop Count Based IP Geo-localization Chong Xiang1, Xinyu Wang1, Qingrong Chen2, Minhui Xue3, Zhaoyu Gao4, Haojin Zhu1, Cailian Chen1, Qiuhua Fan5 1 Shanghai Jiao Tong University 2 University of Illinois Urbana-Champaign 3 The University of Adelaide 4 University of Massachusetts Amherst 5 RTBAisa

Discussion & Conclusion 目录 Contents 1 Motivation 2 Algorithm 3 Evaluation 4 Discussion & Conclusion

Discussion & Conclusion 目录 Contents 1 Motivation 2 Algorithm 3 Evaluation 4 Discussion & Conclusion

IP Geo-Localization Targeted Advertising Digital Right Management

IP Geo-Localization Existing methods: map RTT to Physical distance[1] [1] Weinberg, Zachary, et al. "How to Catch when Proxies Lie: Verifying the Physical Locations of Network Proxies with Active Geolocation." Proceedings of the Internet Measurement Conference 2018. ACM, 2018.

Is RTT-based method good? Physical distance versus RTT latency across 10 province in China Physical distance versus RTT latency in Shanghai

Is RTT-based method good? Weak correlation and unstableness The path between network end points can often be circuitous RTT is also likely inflated by router queuing and processing delays Expensive cost Multiple ping servers and ping requests are required To obtain the RTT with least inflation To fit a complex mapping function

Hop Count Based Approach End points bounded to the same last-hop router The last few hops of the traceroute toward a target IP should be stable and reliable Is the physical distance between these two end points well bounded? If so, we can map hop count to the upper bound of physical distance!

Hop Count Based Approach The physical distance is well bounded! Reasoning: the last router only serves a limited physical area (e.g., a building or a block) CDF analysis of the physical distances between the landmarks bounded to the same last hop router

Advantages of Hop Count Better stableness and correlation Last few hops is unlikely to change significantly Last few hops are less circuitous; thus, simple mapping (e.g., linear function) is possible Cost efficiency One active vantage points with a set of passive landmarks Only requires one traceroute request

Discussion & Conclusion 目录 Contents 1 Motivation 2 Algorithm 3 Evaluation 4 Discussion & Conclusion

1. Derive the Network Topology Traceroute to derive the network topology One traceroute request is enough

2. Fit the Mapping Function Identity the last common router (instead of the last-hop router) Calculate the hop count distance Estimate coverage radius for provincial routers Divide the physical distance by hop count distance and take the arithmetic mean Only take nearby landmarks into account

3. Geo-Localize the Target IP Calculate the physical distance with hop count distance and estimated provincial router radii Localize the target IP to the position of its nearest landmark

Discussion & Conclusion 目录 Contents 1 Motivation 2 Algorithm 3 Evaluation 4 Discussion & Conclusion

Experiment Setup Dataset from RTBAsia: 244,344 IPs with corresponding GPS coordinates Choose 10 provinces for evaluation Compare with Base-IP[2] 5 ping requests to obtain minimum RTT 1 traceroute to derive network path Plot of IP locations across China [2] Yong Wang, Daniel Burgener, Marcel Flores, Aleksandar Kuzmanovic, and Cheng Huang. 2011. Towards Street-Level Client-Independent IP Geolocation. In NSDI, Vol. 11. 27–27.

Evaluation Result Our hop count based method significantly outperforms RTT based IP geo-localization! CDF analysis of the absolute distance error in ten provinces from our method and Base-IP

Evaluation Result Performance is insensitive to the location of the ping server! Further support our assumption. Since we only use the hop lying within a province. Should be insensitive CDF analysis of the influence of the vantage point lo cation

Evaluation Result Can benefit from multiple ping server more significantly than RTT based approach! CDF analysis of the incorporation of multiple ping servers

Discussion & Conclusion 目录 Contents 1 Motivation 2 Algorithm 3 Evaluation 4 Discussion & Conclusion

Band Remote Access Server BRAS is the last visible router to external observer IPs in a restricted area have a great variety of RTTs IPs under the same BRAS (50 km2 in Beijing) RTT distribution

Conclusion We shows RTT a not-so-good measure for the physical distance and give possible reasonings We proposes a hop count based IP geo-localization approach which fits a reliable mapping from the hop count to the physical distance We extensively evaluate the proposed method and show one traceroute request from one ping server is enough to outperform existing expensive RTT based methods We hope the insights of this work can inspire a new way of IP geo-localization

Thanks! Chong Xiang, NSEC Lab, Shanghai Jiao Tong University xiangchong97@gmail.com