{"title":"覆盖组播树的构建与维护","authors":"T. M. Kwan, K. Yeung","doi":"10.1109/COLCOM.2005.1651247","DOIUrl":null,"url":null,"abstract":"Overlay multicast tree construction and maintenance is a major challenge in designing application layer multicast protocols. In this paper, we focus on improving the joining and maintenance procedures of an overlay multicast tree. Unlike the existing direct-tree protocols, our proposed overlay multicast tree protocol (OMTP) has the following characteristics. First, by leveraging on the IP hierarchical addressing locality, we can speed up the formation of overlay multicast tree and enhance the efficiency of the tree maintenance. Second, we take both bandwidth availability and round-trip-time (RTT) into consideration when a newcomer selects its parent node. Finally, an effective mechanism is designed to disperse the simultaneous rejoin crowds in the tree repair phase. Simulation results show that with our proposed protocol, the join latency can be reduced by as large as 50% as compared with a popular direct-tree protocol HMTP","PeriodicalId":365186,"journal":{"name":"2005 International Conference on Collaborative Computing: Networking, Applications and Worksharing","volume":"28 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2005-12-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"6","resultStr":"{\"title\":\"On overlay multicast tree construction and maintenance\",\"authors\":\"T. M. Kwan, K. Yeung\",\"doi\":\"10.1109/COLCOM.2005.1651247\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Overlay multicast tree construction and maintenance is a major challenge in designing application layer multicast protocols. In this paper, we focus on improving the joining and maintenance procedures of an overlay multicast tree. Unlike the existing direct-tree protocols, our proposed overlay multicast tree protocol (OMTP) has the following characteristics. First, by leveraging on the IP hierarchical addressing locality, we can speed up the formation of overlay multicast tree and enhance the efficiency of the tree maintenance. Second, we take both bandwidth availability and round-trip-time (RTT) into consideration when a newcomer selects its parent node. Finally, an effective mechanism is designed to disperse the simultaneous rejoin crowds in the tree repair phase. Simulation results show that with our proposed protocol, the join latency can be reduced by as large as 50% as compared with a popular direct-tree protocol HMTP\",\"PeriodicalId\":365186,\"journal\":{\"name\":\"2005 International Conference on Collaborative Computing: Networking, Applications and Worksharing\",\"volume\":\"28 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2005-12-19\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"6\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2005 International Conference on Collaborative Computing: Networking, Applications and Worksharing\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/COLCOM.2005.1651247\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2005 International Conference on Collaborative Computing: Networking, Applications and Worksharing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/COLCOM.2005.1651247","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
On overlay multicast tree construction and maintenance
Overlay multicast tree construction and maintenance is a major challenge in designing application layer multicast protocols. In this paper, we focus on improving the joining and maintenance procedures of an overlay multicast tree. Unlike the existing direct-tree protocols, our proposed overlay multicast tree protocol (OMTP) has the following characteristics. First, by leveraging on the IP hierarchical addressing locality, we can speed up the formation of overlay multicast tree and enhance the efficiency of the tree maintenance. Second, we take both bandwidth availability and round-trip-time (RTT) into consideration when a newcomer selects its parent node. Finally, an effective mechanism is designed to disperse the simultaneous rejoin crowds in the tree repair phase. Simulation results show that with our proposed protocol, the join latency can be reduced by as large as 50% as compared with a popular direct-tree protocol HMTP