On-Demand Branching Multicast
DOI:
Author:
Affiliation:

Clc Number:

Fund Project:

  • Article
  • |
  • Figures
  • |
  • Metrics
  • |
  • Reference
  • |
  • Related
  • |
  • Cited by
  • |
  • Materials
  • |
  • Comments
    Abstract:

    After analyzing and summarizing the main current research outcomes of IP multicast routing, a multicast routing algorithm called on-demand branching multicast is proposed. On-Demand branching multicast uses a new multicast tree maintenance method, in which the tree is maintained only by partial nodes or key nodes. That is different from the traditional methods in which the tree is maintained by all the nodes on the tree, and so as to save the Internet resources.

    Reference
    Related
    Cited by
Get Citation

金志权,项晓晶,陈佩佩.按需分枝组播.软件学报,2003,14(3):553-561

Copy
Share
Article Metrics
  • Abstract:
  • PDF:
  • HTML:
  • Cited by:
History
  • Received:October 17,2001
  • Revised:October 17,2001
  • Adopted:
  • Online:
  • Published:
You are the firstVisitors
Copyright: Institute of Software, Chinese Academy of Sciences Beijing ICP No. 05046678-4
Address:4# South Fourth Street, Zhong Guan Cun, Beijing 100190,Postal Code:100190
Phone:010-62562563 Fax:010-62562533 Email:jos@iscas.ac.cn
Technical Support:Beijing Qinyun Technology Development Co., Ltd.

Beijing Public Network Security No. 11040202500063