留言板

尊敬的读者、作者、审稿人, 关于本刊的投稿、审稿、编辑和出版的任何问题, 您可以本页添加留言。我们将尽快给您答复。谢谢您的支持!

姓名
邮箱
手机号码
标题
留言内容
验证码

低树代价的低轨卫星网络组播算法

程连贞 张军 刘凯

程连贞, 张军, 刘凯等 . 低树代价的低轨卫星网络组播算法[J]. 北京航空航天大学学报, 2007, 33(07): 821-825.
引用本文: 程连贞, 张军, 刘凯等 . 低树代价的低轨卫星网络组播算法[J]. 北京航空航天大学学报, 2007, 33(07): 821-825.
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)

低树代价的低轨卫星网络组播算法

基金项目: 国家自然科学基金资助项目(60532030,10577005)
详细信息
    作者简介:

    程连贞(1978- ),女,山东菏泽人,博士生,clz_tea@sina.com.

  • 中图分类号: TN 927.2

Multicast routing algorithms with low tree cost for LEO satellite networks

  • 摘要: 为了解决低轨卫星网络中现有典型源组播算法的信道资源浪费问题,提出了一套单核共享树组播算法,即核心群合并共享树(CCST)和加权核心群合并共享树(w-CCST)算法.CCST算法包括动态近似中心(DAC)选核方法和核心群合并组播路径构建方法.在核心群合并方法中,以核节点作为初始核心群,通过核心群和剩余组成员的最短路径方法逐步扩展直至整棵组播树构建完成,从而大大提高了网络带宽利用率.在w-CCST算法中,通过调整加权因子可以适度增大树代价、降低端到端传播时延,以支持某些时延性能要求严格的实时业务.仿真结果说明,CCST算法的树代价性能比其它算法有显著改善,w-CCST算法的端到端传播时延性能好于CCST算法.

     

  • [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
  • 加载中
计量
  • 文章访问数:  8370
  • HTML全文浏览量:  154
  • PDF下载量:  1669
  • 被引次数: 0
出版历程
  • 收稿日期:  2006-07-01
  • 网络出版日期:  2007-07-31

目录

    /

    返回文章
    返回
    常见问答