拥塞控制与组播路由算法

Proceedings of COM'96. First Annual Conference on Emerging Technologies and Applications in Communications Pub Date : 1996-05-07 DOI:10.1109/ETACOM.1996.502480

A. Hác, Dongmei Wang

{"title":"拥塞控制与组播路由算法","authors":"A. Hác, Dongmei Wang","doi":"10.1109/ETACOM.1996.502480","DOIUrl":null,"url":null,"abstract":"A new multicast routing algorithm for reducing congestion is presented. The algorithm uses efficient routing by transmitting multicast packets across fewer links in the network. The algorithm balances the use of network nodes and links by reducing packet duplication in the nodes. The computation time of the algorithm is short. The results show that the algorithm can find the multicast paths by using the minimum number of links and reduce congestion.","PeriodicalId":130942,"journal":{"name":"Proceedings of COM'96. First Annual Conference on Emerging Technologies and Applications in Communications","volume":"24 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1996-05-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":"{\"title\":\"Congestion control with a multicast routing algorithm\",\"authors\":\"A. Hác, Dongmei Wang\",\"doi\":\"10.1109/ETACOM.1996.502480\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A new multicast routing algorithm for reducing congestion is presented. The algorithm uses efficient routing by transmitting multicast packets across fewer links in the network. The algorithm balances the use of network nodes and links by reducing packet duplication in the nodes. The computation time of the algorithm is short. The results show that the algorithm can find the multicast paths by using the minimum number of links and reduce congestion.\",\"PeriodicalId\":130942,\"journal\":{\"name\":\"Proceedings of COM'96. First Annual Conference on Emerging Technologies and Applications in Communications\",\"volume\":\"24 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1996-05-07\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"4\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of COM'96. First Annual Conference on Emerging Technologies and Applications in Communications\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ETACOM.1996.502480\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of COM'96. First Annual Conference on Emerging Technologies and Applications in Communications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ETACOM.1996.502480","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 4

摘要

提出了一种新的减少拥塞的组播路由算法。该算法通过在网络中较少的链路上传输组播数据包，从而实现高效路由。该算法通过减少节点间的数据包重复来平衡网络节点和链路的使用。该算法的计算时间短。结果表明，该算法可以利用最小的链路数找到组播路径，减少了拥塞。

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

查看原文本刊更多论文

Congestion control with a multicast routing algorithm

A new multicast routing algorithm for reducing congestion is presented. The algorithm uses efficient routing by transmitting multicast packets across fewer links in the network. The algorithm balances the use of network nodes and links by reducing packet duplication in the nodes. The computation time of the algorithm is short. The results show that the algorithm can find the multicast paths by using the minimum number of links and reduce congestion.

求助全文

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

来源期刊

Proceedings of COM'96. First Annual Conference on Emerging Technologies and Applications in Communications

自引率

0.00%

发文量