By Topic

Improving Prediction Accuracy of Matrix Factorization Based Network Coordinate Systems

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Yang Chen ; Inst. of Comput. Sci., Univ. of Goettingen, Goettingen, Germany ; Peng Sun ; Xiaoming Fu ; Tianyin Xu

Network Coordinate (NC) systems provide a lightweight and useful way for scalable Internet distance prediction while serving as an important component in many Peer-to-Peer applications. Most of the existing NC systems utilize the Euclidean distance model, which is largely impaired by the persistent occurrence of Triangle Inequality Violation (TIV) in the Internet. Recently, matrix factorization (MF) based NC systems, which can completely remove the TIV constraint, provide an alternative approach towards better prediction accuracy. Phoenix, an NC system based on the MF model, well explores the advantage of the MF model and becomes the most accurate NC system so far. However, through experimental study, we find that the prediction accuracy of Phoenix for short links is significantly worse compared with the overall prediction accuracy. Based on the observation, we propose a new NC system, named Pancake, aiming at reducing the high prediction error for short links. By introducing a two-level architecture, Pancake achieves much higher prediction accuracy than other selected existing NC systems. Through extensive experiments, we demonstrate that Pancake reduces the 90th percentile relative error by up to 25.37% from Phoenix. Moreover, Pancake converges very fast and is robust to different dimension values. For further insights, we study the performance of Pancake using a dynamic data set in addition to the widely used aggregate data sets. With varying RTTs over time, Pancake outperforms other NC systems consistently.

Published in:

Computer Communications and Networks (ICCCN), 2010 Proceedings of 19th International Conference on

Date of Conference:

2-5 Aug. 2010