{"title":"A multicast routing algorithm for overlay network built on leased lines","authors":"Xiaoyu Zhang, Guangzhao Zhang","doi":"10.1109/SAINT.2005.6","DOIUrl":null,"url":null,"abstract":"Overlay networks have been recently developed to support multicast framework. Specially, overlay architectures based on proxies and leased lines can provide applications with optimal performance in terms of bandwidth, reliability, delay guarantee, etc. In this paper, we propose a balanced multicast routing algorithm for these proxy-based overlay architectures to utilize the network resources efficiently while keeping the delay guarantee for each multicast session. We first model the routing problem as a diameter-constraint Steiner tree problem. Then, a balanced solution which takes both the cost and diameter into account is proposed. Extensive simulations show that our multicast routing algorithm provides superior performance with respect to other heuristics.","PeriodicalId":169669,"journal":{"name":"The 2005 Symposium on Applications and the Internet","volume":"122 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2005-01-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"The 2005 Symposium on Applications and the Internet","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SAINT.2005.6","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 4
Abstract
Overlay networks have been recently developed to support multicast framework. Specially, overlay architectures based on proxies and leased lines can provide applications with optimal performance in terms of bandwidth, reliability, delay guarantee, etc. In this paper, we propose a balanced multicast routing algorithm for these proxy-based overlay architectures to utilize the network resources efficiently while keeping the delay guarantee for each multicast session. We first model the routing problem as a diameter-constraint Steiner tree problem. Then, a balanced solution which takes both the cost and diameter into account is proposed. Extensive simulations show that our multicast routing algorithm provides superior performance with respect to other heuristics.