On multicast routing using rectilinear Steiner trees for LEO satellite networks
Resource
Global Telecommunications Conference, 2004. GLOBECOM '04. IEEE
Journal
Global Telecommunications Conference, 2004. GLOBECOM '04. IEEE
Pages
2712-27
Date Issued
2004-12
Date
2004-12
Author(s)
Yang, De-Nian
DOI
N/A
Abstract
In this paper, we propose a bandwidth-efficient multicast routing mechanism using rectilinear Steiner trees for IP-based LEO satellite networks. Different from the previous approach which minimizes the end-to-end delay, our mechanism minimizes the total bandwidth, i.e, the number of hops, used by a multicast tree since the wireless bandwidth in satellite networks is a limited and scarce resource. We propose a new integer linear programming formulation for network planning and a distributed algorithm for protocol design. Our simulation results show that the trees created by our approach use less bandwidth than shortest-path trees. Moreover, the difference of the optimal solutions and the solutions obtained by our distributed algorithm is within 5% on average.
Type
conference paper
File(s)![Thumbnail Image]()
Loading...
Name
01378848.pdf
Size
657.09 KB
Format
Adobe PDF
Checksum
(MD5):10637436482abfe7eb3b7dcd23b221e6