A scalable multicast routing protocol for building shortest path trees
文献类型：期刊论文
| 作者 | Zhang, Baoxian; Zheng, Jun; Mouftah, Hussein T. |
| 刊名 | International journal of communication systems
 |
| 出版日期 | 2007-08-01 |
| 卷号 | 20期号:8页码:993-1009 |
| 关键词 | Multicast Shortest path tree Routing |
| ISSN号 | 1074-5351 |
| DOI | 10.1002/dac.859 |
| 通讯作者 | Mouftah, hussein t.(mouftah@site.uottawa.ca) |
| 英文摘要 | Scalability is a great concern in the design of multicast routing protocols for the global internet. building shortest path trees (spt) is currently one of the most widely used approaches to supporting multicast routing because of the simplicity and low per-destination cost of such trees. however, the construction of an spt typically involves high protocol overhead, which leads to the scalability problem as the number of concurrent multicast sessions increases. in this paper, we present a destination-initiated shortest path tree (dspt) routing protocol. the design objective is to effectively reduce the protocol overhead associated with spt constructions for providing scalable multicast. to achieve this objective, we introduce destination-initiated joining operations in constructing spts. with dspt, each router receiving a request to join a specific multicast group makes a local decision on selecting its parent node through which it connects to the existing tree. a source-rooted spt is built as a result of such collaborative operations at nodes. dspt requires only limited routing information at routers. analytical results demonstrate that dspt scales well with respect to computation, storage and communication overhead when the number of concurrent multicast requests is large. simulation experiments are also conducted to verify the correctness of the theoretically deduced analytical results. copyright (c) 2006 john wiley & sons, ltd. |
| WOS研究方向 | Engineering ; Telecommunications |
| WOS类目 | Engineering, Electrical & Electronic ; Telecommunications |
| 语种 | 英语 |
| WOS记录号 | WOS:000248489500005 |
| 出版者 | WILEY-BLACKWELL |
| URI标识 | http://www.irgrid.ac.cn/handle/1471x/2381886 |
| 专题 | 中国科学院大学 |
| 通讯作者 | Mouftah, Hussein T. |
| 作者单位 | 1.Univ Ottawa, Sch Informat Technol & Engn, Ottawa, ON K1N 6N5, Canada 2.Grad Univ Chinese Acad Sci, Coll Comp & Commun Engn, Beijing 100049, Peoples R China |
| 推荐引用方式 GB/T 7714 | Zhang, Baoxian,Zheng, Jun,Mouftah, Hussein T.. A scalable multicast routing protocol for building shortest path trees[J]. International journal of communication systems,2007,20(8):993-1009. |
| APA | Zhang, Baoxian,Zheng, Jun,&Mouftah, Hussein T..(2007).A scalable multicast routing protocol for building shortest path trees.International journal of communication systems,20(8),993-1009. |
| MLA | Zhang, Baoxian,et al."A scalable multicast routing protocol for building shortest path trees".International journal of communication systems 20.8(2007):993-1009. |
入库方式： iSwitch采集
来源：中国科学院大学
浏览0
下载0
收藏0
其他版本
除非特别说明，本系统中所有内容都受版权保护，并保留所有权利。