{"title":"HRSQM: Heterogeneous Receivers Supporting QoS Multicast","authors":"M. Aajami, H. Saidi, M. Hashemi","doi":"10.1109/ICN.2009.65","DOIUrl":null,"url":null,"abstract":"In this paper we have proposed HRSQM, Heterogeneous Receivers Supporting QoS Multicast, which is a distributed protocol that creates multicast tree for receivers with heterogeneous QoS requirements. It relies only on local states and does not use any global state. Furthermore, through exhaustive search and carefully selecting branch to connect the new node to the tree, the efficiency of tree is always near optimal. Also it reshapes the multicast tree to improve resource utilization. Thanks to the current high-speed networks, HRSQM combines resource reservation with routing. By comparing it with other related protocols through simulations, we find that it has higher success ratio, also the resulting multicast trees of HRSQM require much fewer links than other methods.","PeriodicalId":299215,"journal":{"name":"2009 Eighth International Conference on Networks","volume":"34 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2009-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2009 Eighth International Conference on Networks","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICN.2009.65","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
Abstract
In this paper we have proposed HRSQM, Heterogeneous Receivers Supporting QoS Multicast, which is a distributed protocol that creates multicast tree for receivers with heterogeneous QoS requirements. It relies only on local states and does not use any global state. Furthermore, through exhaustive search and carefully selecting branch to connect the new node to the tree, the efficiency of tree is always near optimal. Also it reshapes the multicast tree to improve resource utilization. Thanks to the current high-speed networks, HRSQM combines resource reservation with routing. By comparing it with other related protocols through simulations, we find that it has higher success ratio, also the resulting multicast trees of HRSQM require much fewer links than other methods.