By Topic

CARMA Based MST Approximation for Multicast Provision in P2P Networks

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
$33 $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

3 Author(s)
Poryev, G. ; Nat. Tech. Univ. of Ukraine, Kiev, Ukraine ; Schloss, H. ; Oechsle, R.

The Minimum Spanning Tree (MST) problem is one of the most popular and important problems in the research area of distributed computing and networks. Contrary to the theoretical models where we usually have a global knowledge of all nodes and the corresponding distances for MST construction, in a realistic network (e.g., Internet) a node always has to rely on local knowledge only, that is it neither knows all other nodes nor exact distances between these nodes. In this paper we propose an approach for MST approximation based on local knowledge of a small subset of existing nodes by using the CARMA metric as a distance substitute. According to the evaluation results, our approach achieves a good MST approximation with respect to a communication cost and avoids extraneous communication needed for latency measurements.

Published in:

Networking and Services (ICNS), 2010 Sixth International Conference on

Date of Conference:

7-13 March 2010