By Topic

Tree Optimization In Overlay Multicast Based on Location and Bandwidth

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

2 Author(s)
Bagheri, M. ; Eng. Dept., Azad Univ., Zarghan, Iran ; Movaghar, A.

One of the main parts of peer-to-peer multicast is the structure of overlay network. Most of the existing works utilize some common parameters for constructing overlay tree. These parameters are bandwidth and delay. The mismatch between current overlay structure and underlying network topology causes severe link stress and then leads to high end to end latency. According to these problems, we propose a new overlay construction algorithm called OLT in this paper that finds the location of peers and tries to connect peers that are as close as possible. OLT exploits a number of heuristic techniques to reach an optimized tree even in case of peer heterogeneity and high churn rate. Our simulations show that OLT reduces link stress and latency because it constructs a logical tree more compatible to physical network than the existing algorithms.

Published in:

Computer Technology and Development, 2009. ICCTD '09. International Conference on  (Volume:2 )

Date of Conference:

13-15 Nov. 2009