{"title":"动态成员支持下延迟约束组播的主动重排","authors":"K. Yong, G. Poo, T. Cheng","doi":"10.1109/ICCCN.2008.ECP.115","DOIUrl":null,"url":null,"abstract":"We propose an efficient heuristic algorithm to rearrange multicast trees proactively in delay constrained dynamic membership multicast networks. The objective is to construct low cost multicast tree with controlled number of disrupted members within a very short rearrangement time when a member joins and leaves the tree. In addition, a heuristic algorithm to obtain near-optimal solution to the problem is introduced as the benchmark. A new performance index to gauge the efficiency of the proposed heuristics more accurately is also introduced. Better performance is obtained when compared with existing methods using simulations.","PeriodicalId":314071,"journal":{"name":"2008 Proceedings of 17th International Conference on Computer Communications and Networks","volume":"105 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2008-11-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Proactive Rearrangement in Delay Constrained Multicast with Dynamic Membership Support\",\"authors\":\"K. Yong, G. Poo, T. Cheng\",\"doi\":\"10.1109/ICCCN.2008.ECP.115\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We propose an efficient heuristic algorithm to rearrange multicast trees proactively in delay constrained dynamic membership multicast networks. The objective is to construct low cost multicast tree with controlled number of disrupted members within a very short rearrangement time when a member joins and leaves the tree. In addition, a heuristic algorithm to obtain near-optimal solution to the problem is introduced as the benchmark. A new performance index to gauge the efficiency of the proposed heuristics more accurately is also introduced. Better performance is obtained when compared with existing methods using simulations.\",\"PeriodicalId\":314071,\"journal\":{\"name\":\"2008 Proceedings of 17th International Conference on Computer Communications and Networks\",\"volume\":\"105 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2008-11-17\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2008 Proceedings of 17th International Conference on Computer Communications and Networks\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICCCN.2008.ECP.115\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2008 Proceedings of 17th International Conference on Computer Communications and Networks","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCCN.2008.ECP.115","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Proactive Rearrangement in Delay Constrained Multicast with Dynamic Membership Support
We propose an efficient heuristic algorithm to rearrange multicast trees proactively in delay constrained dynamic membership multicast networks. The objective is to construct low cost multicast tree with controlled number of disrupted members within a very short rearrangement time when a member joins and leaves the tree. In addition, a heuristic algorithm to obtain near-optimal solution to the problem is introduced as the benchmark. A new performance index to gauge the efficiency of the proposed heuristics more accurately is also introduced. Better performance is obtained when compared with existing methods using simulations.