Hajime Karasawa, Shinsuke Terada, T. Miyoshi, K. Yamori, Yoshiaki Tanaka
{"title":"多对多组播路由树时延性能评价指标研究","authors":"Hajime Karasawa, Shinsuke Terada, T. Miyoshi, K. Yamori, Yoshiaki Tanaka","doi":"10.1109/APCC.2006.255771","DOIUrl":null,"url":null,"abstract":"The optimization of multicast routing tree is an important issue for efficient multicast communication. Some previous papers have tried to analyze the one-to-many multicast tree and have obtained that the most efficient tree depends on the characteristics of the receivers such as the number of receivers. For many-to-many multicast, on the other hand, the efficiency of the tree has not been analyzed. This paper analyzes how various components affect the efficiency of the many-to-many multicast tree. As a result, it is shown that the most efficient many-to-many multicast tree does not depend on the number of multicast members. The result also tells that the diameter of the tree, the variance of node degrees, and the number of leaf nodes mostly decide the delay performance of the tree","PeriodicalId":205758,"journal":{"name":"2006 Asia-Pacific Conference on Communications","volume":"52 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2006-12-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Evaluation Indices of Many-to-Many Multicast Routing Tree to Represent Delay Performance\",\"authors\":\"Hajime Karasawa, Shinsuke Terada, T. Miyoshi, K. Yamori, Yoshiaki Tanaka\",\"doi\":\"10.1109/APCC.2006.255771\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The optimization of multicast routing tree is an important issue for efficient multicast communication. Some previous papers have tried to analyze the one-to-many multicast tree and have obtained that the most efficient tree depends on the characteristics of the receivers such as the number of receivers. For many-to-many multicast, on the other hand, the efficiency of the tree has not been analyzed. This paper analyzes how various components affect the efficiency of the many-to-many multicast tree. As a result, it is shown that the most efficient many-to-many multicast tree does not depend on the number of multicast members. The result also tells that the diameter of the tree, the variance of node degrees, and the number of leaf nodes mostly decide the delay performance of the tree\",\"PeriodicalId\":205758,\"journal\":{\"name\":\"2006 Asia-Pacific Conference on Communications\",\"volume\":\"52 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2006-12-11\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2006 Asia-Pacific Conference on Communications\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/APCC.2006.255771\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2006 Asia-Pacific Conference on Communications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/APCC.2006.255771","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Evaluation Indices of Many-to-Many Multicast Routing Tree to Represent Delay Performance
The optimization of multicast routing tree is an important issue for efficient multicast communication. Some previous papers have tried to analyze the one-to-many multicast tree and have obtained that the most efficient tree depends on the characteristics of the receivers such as the number of receivers. For many-to-many multicast, on the other hand, the efficiency of the tree has not been analyzed. This paper analyzes how various components affect the efficiency of the many-to-many multicast tree. As a result, it is shown that the most efficient many-to-many multicast tree does not depend on the number of multicast members. The result also tells that the diameter of the tree, the variance of node degrees, and the number of leaf nodes mostly decide the delay performance of the tree
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
