{"title":"在非常大的广域网中分层消息分发","authors":"S. Chatterjee, M. Bassiouni","doi":"10.1109/LCN.1992.228108","DOIUrl":null,"url":null,"abstract":"A hierarchical broadcasting technique in very large arbitrary networks which achieves near optimal cost and time measures is proposed. The network is partitioned into hierarchical clusters which are interconnected with each other through gate nodes. The approach is based on using a fully distributed minimum spanning tree algorithm within the gate-node network while achieving time optimal broadcasting within the local clusters by formulating the problem as finding maximum matching in constrained bipartite graphs. Extensive simulation results are presented which show the tradeoff between the two conflicting performance criteria.<<ETX>>","PeriodicalId":249184,"journal":{"name":"[1992] Proceedings 17th Conference on Local Computer Networks","volume":"25 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1992-09-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":"{\"title\":\"Hierarchical message dissemination in very large WANs\",\"authors\":\"S. Chatterjee, M. Bassiouni\",\"doi\":\"10.1109/LCN.1992.228108\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A hierarchical broadcasting technique in very large arbitrary networks which achieves near optimal cost and time measures is proposed. The network is partitioned into hierarchical clusters which are interconnected with each other through gate nodes. The approach is based on using a fully distributed minimum spanning tree algorithm within the gate-node network while achieving time optimal broadcasting within the local clusters by formulating the problem as finding maximum matching in constrained bipartite graphs. Extensive simulation results are presented which show the tradeoff between the two conflicting performance criteria.<<ETX>>\",\"PeriodicalId\":249184,\"journal\":{\"name\":\"[1992] Proceedings 17th Conference on Local Computer Networks\",\"volume\":\"25 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1992-09-13\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"5\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"[1992] Proceedings 17th Conference on Local Computer Networks\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/LCN.1992.228108\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"[1992] Proceedings 17th Conference on Local Computer Networks","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/LCN.1992.228108","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Hierarchical message dissemination in very large WANs
A hierarchical broadcasting technique in very large arbitrary networks which achieves near optimal cost and time measures is proposed. The network is partitioned into hierarchical clusters which are interconnected with each other through gate nodes. The approach is based on using a fully distributed minimum spanning tree algorithm within the gate-node network while achieving time optimal broadcasting within the local clusters by formulating the problem as finding maximum matching in constrained bipartite graphs. Extensive simulation results are presented which show the tradeoff between the two conflicting performance criteria.<>
![[1992] Proceedings 17th Conference on Local Computer Networks](/Content/css/sci/img/zetp.jpg)
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
