{"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}
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.