{"title":"基于总线的计算机网络中的组播路由","authors":"P. McKinley, J.W.-S. Liu","doi":"10.1109/CNS.1988.5006","DOIUrl":null,"url":null,"abstract":"The authors address multicast routing of integrated voice, video, and messages in bus-based computer networks, particularly in grids of buses. Graph theoretical formulations of the multicast routing problem are presented and an algorithm is given that produces optimal multicast routes in grids of buses. The performance of this algorithm is compared with that of heuristic algorithms. Finally, the bilevel grid, a hierarchical grid topology, is described, and an algorithm is given that produces optimal multicast routes in such networks.<<ETX>>","PeriodicalId":112149,"journal":{"name":"[1988] Proceedings. Computer Networking Symposium","volume":"25 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1988-04-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"Multicast routing in bus-based computer networks\",\"authors\":\"P. McKinley, J.W.-S. Liu\",\"doi\":\"10.1109/CNS.1988.5006\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The authors address multicast routing of integrated voice, video, and messages in bus-based computer networks, particularly in grids of buses. Graph theoretical formulations of the multicast routing problem are presented and an algorithm is given that produces optimal multicast routes in grids of buses. The performance of this algorithm is compared with that of heuristic algorithms. Finally, the bilevel grid, a hierarchical grid topology, is described, and an algorithm is given that produces optimal multicast routes in such networks.<<ETX>>\",\"PeriodicalId\":112149,\"journal\":{\"name\":\"[1988] Proceedings. Computer Networking Symposium\",\"volume\":\"25 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1988-04-11\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"[1988] Proceedings. Computer Networking Symposium\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CNS.1988.5006\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"[1988] Proceedings. Computer Networking Symposium","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CNS.1988.5006","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
The authors address multicast routing of integrated voice, video, and messages in bus-based computer networks, particularly in grids of buses. Graph theoretical formulations of the multicast routing problem are presented and an algorithm is given that produces optimal multicast routes in grids of buses. The performance of this algorithm is compared with that of heuristic algorithms. Finally, the bilevel grid, a hierarchical grid topology, is described, and an algorithm is given that produces optimal multicast routes in such networks.<>
![[1988] Proceedings. Computer Networking Symposium](/Content/css/sci/img/zetp.jpg)
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
