目的端发起的组播路由协议，用于构建最短路径树

GLOBECOM '03. IEEE Global Telecommunications Conference (IEEE Cat. No.03CH37489) Pub Date : 2003-12-01 DOI:10.1109/GLOCOM.2003.1258753

Baoxian Zhang, H. Mouftah

{"title":"目的端发起的组播路由协议，用于构建最短路径树","authors":"Baoxian Zhang, H. Mouftah","doi":"10.1109/GLOCOM.2003.1258753","DOIUrl":null,"url":null,"abstract":"In this work, we design a destination-initiated protocol, which aims at building source-rooted shortest path tree (SPT) in a hop-by-hop manner for providing scalable multicast. The designed protocol can support group applications with dynamic membership well. Performance analysis and simulation results show that the destination-initiated characteristic can significantly reduce the computation, storage and communication overhead associated with SPT constructions.","PeriodicalId":301154,"journal":{"name":"GLOBECOM '03. IEEE Global Telecommunications Conference (IEEE Cat. No.03CH37489)","volume":"5 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2003-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"8","resultStr":"{\"title\":\"A destination-initiated multicast routing protocol for shortest path tree constructions\",\"authors\":\"Baoxian Zhang, H. Mouftah\",\"doi\":\"10.1109/GLOCOM.2003.1258753\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this work, we design a destination-initiated protocol, which aims at building source-rooted shortest path tree (SPT) in a hop-by-hop manner for providing scalable multicast. The designed protocol can support group applications with dynamic membership well. Performance analysis and simulation results show that the destination-initiated characteristic can significantly reduce the computation, storage and communication overhead associated with SPT constructions.\",\"PeriodicalId\":301154,\"journal\":{\"name\":\"GLOBECOM '03. IEEE Global Telecommunications Conference (IEEE Cat. No.03CH37489)\",\"volume\":\"5 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2003-12-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"8\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"GLOBECOM '03. IEEE Global Telecommunications Conference (IEEE Cat. No.03CH37489)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/GLOCOM.2003.1258753\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"GLOBECOM '03. IEEE Global Telecommunications Conference (IEEE Cat. No.03CH37489)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/GLOCOM.2003.1258753","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 8

摘要

在这项工作中，我们设计了一个目的地发起的协议，旨在以逐跳的方式构建源根最短路径树(SPT)，以提供可扩展的多播。所设计的协议能够很好地支持具有动态成员关系的组应用。性能分析和仿真结果表明，目标初始化特性可以显著降低SPT构造相关的计算、存储和通信开销。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

A destination-initiated multicast routing protocol for shortest path tree constructions

In this work, we design a destination-initiated protocol, which aims at building source-rooted shortest path tree (SPT) in a hop-by-hop manner for providing scalable multicast. The designed protocol can support group applications with dynamic membership well. Performance analysis and simulation results show that the destination-initiated characteristic can significantly reduce the computation, storage and communication overhead associated with SPT constructions.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

GLOBECOM '03. IEEE Global Telecommunications Conference (IEEE Cat. No.03CH37489)

自引率

0.00%

发文量