Destination-driven shortest path tree algorithms
文献类型：期刊论文
| 作者 | Zhang, BX; Mouftah, HT |
| 刊名 | Journal of high speed networks
 |
| 出版日期 | 2006 |
| 卷号 | 15期号:2页码:123-130 |
| 关键词 | Multicast Routing Shortest path tree |
| ISSN号 | 0926-6801 |
| 通讯作者 | Mouftah, ht(mouftah@site.uottawa.ca) |
| 英文摘要 | Shortest path tree (spt) is the most widely used type of tree for multicast provisioning due to its simplicity and low per-destination cost. an spt minimizes the accumulated cost, individually, from the source of a group to each destination of the group. however, spts have not considered the overall resource utilization in their constructions. this work aims at building cost-effective spts by enhancing link sharing between destinations of a group. we achieve this goal by introducing destination-driven characteristic into spt constructions. specifically, each destination is connected with the source via a shortest path. when equal cost multiple paths are available, priority is given to the one biasing through a destination among all such routes. we accordingly present the design of an algorithm building destination-driven spts. to achieve further improved performance in resource utilization, we also present an algorithm, which is designed to further enhance link sharing among the destinations of a group while meeting a maximum path length constraint for each destination. simulation results are used to demonstrate the high performance of the proposed algorithms. |
| WOS研究方向 | Computer Science ; Engineering ; Telecommunications |
| WOS类目 | Computer Science, Hardware & Architecture ; Computer Science, Information Systems ; Engineering, Electrical & Electronic ; Telecommunications |
| 语种 | 英语 |
| WOS记录号 | WOS:000237092600002 |
| 出版者 | IOS PRESS |
| URI标识 | http://www.irgrid.ac.cn/handle/1471x/2379111 |
| 专题 | 中国科学院大学 |
| 通讯作者 | Mouftah, HT |
| 作者单位 | 1.Grad Univ, Chinese Acad Sci, Coll Software Engn, Beijing 100049, Peoples R China 2.Univ Ottawa, Sch Informat Technol & Engn, Ottawa, ON K1N 6N5, Canada |
| 推荐引用方式 GB/T 7714 | Zhang, BX,Mouftah, HT. Destination-driven shortest path tree algorithms[J]. Journal of high speed networks,2006,15(2):123-130. |
| APA | Zhang, BX,&Mouftah, HT.(2006).Destination-driven shortest path tree algorithms.Journal of high speed networks,15(2),123-130. |
| MLA | Zhang, BX,et al."Destination-driven shortest path tree algorithms".Journal of high speed networks 15.2(2006):123-130. |
入库方式： iSwitch采集
来源：中国科学院大学
浏览0
下载0
收藏0
其他版本
除非特别说明，本系统中所有内容都受版权保护，并保留所有权利。