Volume 33 Issue 07
Jul.  2007
Turn off MathJax
Article Contents
Cheng Lianzhen, Zhang Jun, Liu Kaiet al. Multicast routing algorithms with low tree cost for LEO satellite networks[J]. Journal of Beijing University of Aeronautics and Astronautics, 2007, 33(07): 821-825. (in Chinese)
Citation: Cheng Lianzhen, Zhang Jun, Liu Kaiet al. Multicast routing algorithms with low tree cost for LEO satellite networks[J]. Journal of Beijing University of Aeronautics and Astronautics, 2007, 33(07): 821-825. (in Chinese)

Multicast routing algorithms with low tree cost for LEO satellite networks

  • Received Date: 01 Jul 2006
  • Publish Date: 31 Jul 2007
  • To resolve the channel resources waste problem of the typical source-based multicast routing algorithm in low earth orbit (LEO) satellite networks, a new core-based shared tree algorithm called the core-cluster combination shared tree (CCST) algorithm and its improved one (i.e. w-CCST algorithm) were proposed. The (w-)CCST algorithm consists of the dynamic approximate center (DAC) core selection method and the (weighted) core-cluster combination multicast routing construction method. The core-cluster combination method takes core node and its nearest group member in hops as initial core-cluster, and extends it to construct entire multicast tree step by step by a shortest path scheme between newly-generated core-cluster and surplus group members, which can greatly improve transport bandwidth utilization. In the w-CCST algorithm, a weighted factor was proposed to decrease end-to-end propagation delay and meanwhile increase tree cost a bit to support some real-time applications with strict delay requirements. Simulation results show that tree cost performance of the CCST algorithm is greatly better than that of other algorithms, while end-to-end propagation delay performance of the w-CCST algorithm is better than that of the CCST algorithm.

     

  • loading
  • [1] Ekici E, Akyildiz I F, Bender M D. A multicast routing algorithm for LEO satellite IP networks [J]. IEEE/ACM Transactions on Networking, 2002, 10(2):183-192 [2] Yang D N, Liao W. On multicast routing using rectilinear Steiner trees for LEO satellite networks Proc IEEE Globecom 2004. Dallas Texas, USA:, 2004:2712-2716 [3] Sahasrabuddhe L H, Mukherjee B. Multicast routing algorithms and protocols:a tutorial [J]. IEEE Network, 2000, 14(1):90-104 [4] Ekici E, Akyildiz I F, Bender M D. A distributed routing algorithm for datagram traffic in LEO satellite networks [J]. IEEE/ACM Trans Networking, 2001, 9:137-147 [5] Calvert K L, Zegura E W, Donahoo M J. Core selection methods for multicast routing International Conference on Computer Communications Networks. Las Vegas, Nevada:, 1995:638-642 [6] Raghavendra A D, Rai S, Iyengar S S. Multicast routing in internetworks using dynamic core based trees Conference Proceedings of the 1996 IEEE Fifteenth Annual International Phoenix Conference. Scottsdale, USA:, 1996:232-238 [7] Wall David W. Mechanisms for broadcast and selective broadcast . Palo Alto, California, USA:Dept Elec Eng, Computer Systems Laboratory, Stanford Univ, 1980 [8] Thaler D, Ravishankar C V. Distributed center location algorithms:proposals and comparisons Proc INFOCOM-96.San Francisco, CA:, 1996:75-84 [9] Ali S, Khokhar A. Distributed center location algorithm [J]. IEEE J Selected Areas in Communications, 1997, 15(3):291-303 [10] Wei L, Estrin D. A comparison of multicast trees and algorithms . USC-CS-93-560, 1993
  • 加载中

Catalog

    通讯作者: 陈斌, bchen63@163.com
    • 1. 

      沈阳化工大学材料科学与工程学院 沈阳 110142

    1. 本站搜索
    2. 百度学术搜索
    3. 万方数据库搜索
    4. CNKI搜索

    Article Metrics

    Article views(8489) PDF downloads(1672) Cited by()
    Proportional views
    Related

    /

    DownLoad:  Full-Size Img  PowerPoint
    Return
    Return