Phoenix: Towards an Accurate, Practical and Decentralized Network Coordinate System Yang Chen 1, Xiao Wang 1, Xiaoxiao Song 1, Eng Keong Lua 2, Cong Shi.

Slides:



Advertisements
Similar presentations
T. S. Eugene Ng Mellon University1 Towards Global Network Positioning T. S. Eugene Ng and Hui Zhang Department of Computer.
Advertisements

Topology-Aware Overlay Construction and Server Selection Sylvia Ratnasamy Mark Handley Richard Karp Scott Shenker Infocom 2002.
A Construction of Locality-Aware Overlay Network: mOverlay and Its Performance Found in: IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, VOL. 22, NO.
Sequoia: Virtual-Tree Models for Internet Path Metrics Rama Microsoft Research Also:Ittai Abraham (Hebrew Univ.) Mahesh Balakrishnan (Cornell) Archit Gupta.
A Network Positioning System for the Internet T. S. Eugene Ng and Hui Zhang USENIX 04 Presented By: Imranul Hoque 1.
Intel Research Internet Coordinate Systems - 03/03/2004 Internet Coordinate Systems Marcelo Pias Intel Research Cambridge
Pastry Peter Druschel, Rice University Antony Rowstron, Microsoft Research UK Some slides are borrowed from the original presentation by the authors.
Maximum Battery Life Routing to Support Ubiquitous Mobile Computing in Wireless Ad Hoc Networks By C. K. Toh.
Cristian Lumezanu Dave Levin Neil Spring PeerWise Discovery and Negotiation of Faster Paths.
1 RegionKNN: A Scalable Hybrid Collaborative Filtering Algorithm for Personalized Web Service Recommendation Xi Chen, Xudong Liu, Zicheng Huang, and Hailong.
EL9331 Meridian: A Lightweight Network Location Service without Virtual Coordinates Bernard Wong, Aleksandrs Slivkins, Emin Gun Sirer SIGCOMM’05 ( Slides.
Sylvia Ratnasamy, Paul Francis, Mark Handley, Richard Karp, Scott Schenker Presented by Greg Nims.
Introduction to Bioinformatics
Design Of New Index Structures For The ISAT Algorithm By Biswanath Panda, Mirek Riedewald, Paul Chew, Johannes Gehrke.
Improving Online Gaming Quality using Detour Paths Cong Ly, Cheng-Hsin Hsu, and Mohamed Hefeeda Simon Fraser University, Canada Deutsche Telekom Labs,
DIMENSIONALITY REDUCTION BY RANDOM PROJECTION AND LATENT SEMANTIC INDEXING Jessica Lin and Dimitrios Gunopulos Ângelo Cardoso IST/UTL December
Vivaldi Coordinate Service Justin Ma, Patrick Verkaik, Michael Vrable Department of Computer Science And Engineering UCSD CSE222A, Winter 2005.
Network Coding for Large Scale Content Distribution Christos Gkantsidis Georgia Institute of Technology Pablo Rodriguez Microsoft Research IEEE INFOCOM.
An Algebraic Approach to Practical and Scalable Overlay Network Monitoring Yan Chen, David Bindel, Hanhee Song, Randy H. Katz Presented by Mahesh Balakrishnan.
PlanetLab Deployment and Analysis of Network Coordinate Systems Fenglin Liao Keshava Subramanya Veljko Pejovic cs.ucsb.edu.
Predicting Communication Latency in the Internet Dragan Milic Universität Bern.
T. S. Eugene Ng Mellon University1 Global Network Positioning: A New Approach to Network Distance Prediction Tze Sing Eugene.
1 An Overlay Scheme for Streaming Media Distribution Using Minimum Spanning Tree Properties Journal of Internet Technology Volume 5(2004) No.4 Reporter.
Planning operation start times for the manufacture of capital products with uncertain processing times and resource constraints D.P. Song, Dr. C.Hicks.
Jana van Greunen - 228a1 Analysis of Localization Algorithms for Sensor Networks Jana van Greunen.
On Self Adaptive Routing in Dynamic Environments -- A probabilistic routing scheme Haiyong Xie, Lili Qiu, Yang Richard Yang and Yin Yale, MR and.
EQ-BGP: an efficient inter- domain QoS routing protocol Andrzej Bęben Institute of Telecommunications Warsaw University of Technology,
1 Speaker : 童耀民 MA1G Authors: Ze Li Dept. of Electr. & Comput. Eng., Clemson Univ., Clemson, SC, USA Haiying Shen ; Hailang Wang ; Guoxin.
PIC: Practical Internet Coordinates for Distance Estimation Manuel Costa joint work with Miguel Castro, Ant Rowstron, Peter Key Microsoft Research Cambridge.
Packet Vaccine: Blackbox Exploit Detection and Signature Generation Authors: XiaoFeng Wang Zhuowei Li Jong Youl Choi School of Informatics, Indiana University.
Phoenix: A Weight-Based Network Coordinate System Using Matrix Factorization Yang Chen Department of Computer Science Duke University
Non Negative Matrix Factorization
Aadil Zia Khan and Shahab Baqai LUMS School of Science and Engineering QoS Aware Path Selection in Content Centric Networks Fahad R. Dogar Carnegie Mellon.
SISAP’08 – Approximate Similarity Search in Genomic Sequence Databases using Landmark-Guided Embedding Ahmet Sacan and I. Hakki Toroslu
Improving Capacity and Flexibility of Wireless Mesh Networks by Interface Switching Yunxia Feng, Minglu Li and Min-You Wu Presented by: Yunxia Feng Dept.
11 Experimental and Analytical Evaluation of Available Bandwidth Estimation Tools Cesar D. Guerrero and Miguel A. Labrador Department of Computer Science.
Huazhong University of Science and Technology Evaluating Latency-Sensitive Applications’ Performance Degradation in Datacenters with Restricted Power Budget.
Interaction of Overlay Networks: Properties and Implications Joe W.J. Jiang Dah-Ming Chiu John C.S. Lui The Chinese University of Hong Kong.
1 Vivaldi: A Decentralized Network Coordinate System Frank Dabek, Russ Cox, Frans Kaashoek, Robert Morris Presented by: Chen Qian.
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‡
Zibin Zheng DR 2 : Dynamic Request Routing for Tolerating Latency Variability in Cloud Applications CLOUD 2013 Jieming Zhu, Zibin.
Localized Algorithm for Aggregate Fairness in Wireless Sensor Networks Authors : Shigang Chen, Zhan Zhang CISE university of Florida CISE university of.
TCP with Variance Control for Multihop IEEE Wireless Networks Jiwei Chen, Mario Gerla, Yeng-zhong Lee.
A Content-Based Approach to Collaborative Filtering Brandon Douthit-Wood CS 470 – Final Presentation.
A Trust Based Distributed Kalman Filtering Approach for Mode Estimation in Power Systems Tao Jiang, Ion Matei and John S. Baras Institute for Systems Research.
Optimal Dimensionality of Metric Space for kNN Classification Wei Zhang, Xiangyang Xue, Zichen Sun Yuefei Guo, and Hong Lu Dept. of Computer Science &
WSP: A Network Coordinate based Web Service Positioning Framework for Response Time Prediction Jieming Zhu, Yu Kang, Zibin Zheng and Michael R. Lyu The.
Network Coordinates : Internet Distance Estimation Jieming ZHU
Network Computing Laboratory 1 Vivaldi: A Decentralized Network Coordinate System Authors: Frank Dabek, Russ Cox, Frans Kaashoek, Robert Morris MIT Published.
Evaluation of gene-expression clustering via mutual information distance measure Ido Priness, Oded Maimon and Irad Ben-Gal BMC Bioinformatics, 2007.
INM 2008 Orlando, Florida A Hidden Markov Model Approach to Available Bandwidth Estimation and Monitoring Cesar D. Guerrero Miguel A. Labrador Department.
The simulation experiment of induction lightning overvoltage on the distribution line Huang Ying1,2, Zeng Rong1, Yu Zhanqing1, Lu Guojun3, Liu Yu3, Wang.
Collaborative Filtering via Euclidean Embedding M. Khoshneshin and W. Street Proc. of ACM RecSys, pp , 2010.
Zhonglong Zheng, Jie Yang, Yitan Zhu Engineering Applications of Artificial Intelligence 20 (2007) 101–110 Presenter Chia-Cheng Chen 1.
A Protocol for Tracking Mobile Targets using Sensor Networks H. Yang and B. Sikdar Department of Electrical, Computer and Systems Engineering Rensselaer.
Application of the GA-PSO with the Fuzzy controller to the robot soccer Department of Electrical Engineering, Southern Taiwan University, Tainan, R.O.C.
Gang Wang, Shining Wu, Guodong Wang, Beixing Deng, Xing Li Tsinghua University Tsinghua Univ. Oct Experimental Study on Neighbor Selection Policy.
1 Network Tomography Using Passive End-to-End Measurements Lili Qiu Joint work with Venkata N. Padmanabhan and Helen J. Wang.
-1/16- Maximum Battery Life Routing to Support Ubiquitous Mobile Computing in Wireless Ad Hoc Networks C.-K. Toh, Georgia Institute of Technology IEEE.
Lecture 13 – Network Mapping
Vivaldi: A Decentralized Network Coordinate System
WSRec: A Collaborative Filtering Based Web Service Recommender System
Mohammad Malli Chadi Barakat, Walid Dabbous Alcatel meeting
Lottery Scheduling Ish Baid.
CMPE 252A : Computer Networks
MEgo2Vec: Embedding Matched Ego Networks for User Alignment Across Social Networks Jing Zhang+, Bo Chen+, Xianming Wang+, Fengmei Jin+, Hong Chen+, Cuiping.
CMPE 252A : Computer Networks
Binghui Wang, Le Zhang, Neil Zhenqiang Gong
Graph-based Security and Privacy Analytics via Collective Classification with Joint Weight Learning and Propagation Binghui Wang, Jinyuan Jia, and Neil.
Lec 7 Network Layer: Logical Addressing
Presentation transcript:

Phoenix: Towards an Accurate, Practical and Decentralized Network Coordinate System Yang Chen 1, Xiao Wang 1, Xiaoxiao Song 1, Eng Keong Lua 2, Cong Shi 3, Xiaohan Zhao 1, Beixing Deng 1, Xing Li 1 1 Department of Electronic Engineering, Tsinghua University, Beijing , China 2 College of Engineering, Carnegie Mellon University, Pittsburgh, PA College of Computing, Georgia Institute of Technology, Atlanta, GA 30332

Outline Introduction Related Work Design of Phoenix Performance Evaluation Conclusion

Introduction Problem ▫Distance (Latency) information is very important in Internet applications: Server Selection, Overlay Construction, Overlay Multicast, Overlay Routing, Application Layer Anycast ▫Direct measurement: Bad scalability Network Coordinate (NC) System ▫Scalable way for Internet distance prediction ▫Use O(N) measurement to predict the distances of N 2 end-to-end links

Related Work Euclidean Distance based Network Coordinates and Triangle Inequality Violation (TIV) Dot Product based NC and IDES

Euclidean Distance based NC Euclidean distance based NC is an embedding of N hosts into d-dimensional Euclidean space R d Typical NC systems ▫GNP,Vivaldi,PIC,NPS… d=3

Triangle Inequality Violation (TIV) D(A,C)+D(C,B)<D(A, B) D E (A,C)+D E (C,B)>D E (A, B) Any three hosts with TIV cannot be embedded into Euclidean space within some level of accuracy, for the distances among them in Euclidean space must obey triangle inequality.

Dot Product based NC D E (A,C)+D E (C,B)>D E (A, B) tolerate the constraints of TIVs.

IDES First dot product based NC system Problems ▫Negative Distance ▫Fair Prediction Accuracy

Negative Distance in IDES Cause the malfunction of the system because the distance (Round Trip Time) can not be negative.

Fair Prediction Accuracy ▫Reason: Error Propagation ▫A certain host gives equal confidence to each referred NC ▫However, some NCs are very inaccurate due to different factors Prediction Accuracy: No better than GNP/Vivaldi/…!!

Design Goal of Phoenix Accurate ▫Dot Product based NC ▫Weighted Model Decentralized Practical ▫Never give negative predicted distance

Architecture of Phoenix Early Hosts Ordinary Hosts

Early Hosts If N ≤ m, the new host H new will be considered as one of the early hosts. ▫These early hosts will probe each other to obtain the N × N distance matrix ▫The system will use NMF (Non-negative Matrix Factorization) algorithm to get the NCs (incoming vectors and the outgoing vectors) of these early hosts.

Ordinary Hosts N>m ▫For each new host H new  select any m existing hosts randomly  H new measures its RTTs to these m hosts as well as retrieves the NCs (X new and Y new )of these m hosts.  NC can be calculated and updated periodically.

NC Calculation of Ordinary Hosts Calculation of X new and Y new Predicted Distance between H new and R i Different weights are assigned to each referred vectors

Weight Calculation C is set as 5 in our Phoenix implementation. The more accurate the referred vector is, the higher confidence (weight) should be given to this NC. In contrast, some referred vectors with abnormal high error will not be considered for NC calculation.

Performance Evaluation Setup of the Experiment Metrics Evaluation Results on Prediction Accuracy Convergence Behavior of Phoenix Robustness over Measurement Anomalies

Setup of the Experiment All of these three systems use 10-dimensional coordinates. Phoenix: each host has m reference hosts IDES: m randomly selected landmarks Vivaldi: each host has m neighbors. (c c =0.25,c e =0.25) m=32 10 runs are performed on each data set and the average results are reported.

Datasets

Metrics Relative Error (RE) ▫Smaller RE indicates higher prediction accuracy. When measured distance equals to predicted distance, the RE value will be zero. ▫More attention is paid to the 90th Percentile Relative Error (NPRE) since it can guarantee 90% of the hosts have lower RE values than it

Prediction Accuracy Compared with Vivaldi, the representative Euclidean distance based NC, Phoenix can reduce the NPRE by between 18.34% (P2PSim data set) and 52.17% (AMP data set). Our simulation results demonstrate that Phoenix can achieve high prediction accuracy in a decentralized and practical way.

Convergence Behavior of Phoenix  Basically, Phoenix will converge in less than 10 rounds.  the final median prediction error of Phoenix is about 31% smaller than Vivaldi. Therefore the convergence of Phoenix is very fast and effective.

Robustness over Measurement Anomalies Phoenix is very robust to small amount of measurements anomalies. The difference between Phoenix and Phoenix(Simple) demonstrates that the weighted model can eliminate the impact of measurement anomalies greatly.

Conclusion Phoenix achieves much higher prediction accuracy than state-of-the-art NC systems in different typical Internet data sets Phoenix is an accurate, practical and decentralized solution to scalable Internet distance prediction.

Download the Simulator

Phoenix: Towards an Accurate, Practical and Decentralized Network Coordinate System Network Coordinate System Triangle Inequality Violation (TIV) Negative Distance Distance Prediction Accuracy Approach Vivaldi  ★★★ Euclidean Distance IDES  ★★★ Matrix Factorization Phoenix ★★★★★ Matrix Factorization + Weighted Model