{"title":"A Topology-Aware Application Layer Multicast Protocol","authors":"R. Besharati, M. Bag-Mohammadi, M. Dezfouli","doi":"10.1109/CCNC.2010.5421721","DOIUrl":null,"url":null,"abstract":"Application Layer Multicast (ALM) is considered as an alternative approach to IP multicast. Topology awareness is an important metric for ALM because it reduces link stress and delay stretch considerably. This work describes a novel, stable and low overhead ALM approach using binning technique to cluster nearby receivers, referred to as Bincast. Bincast uses a constant number of landmarks to cluster nearby nodes. It then constructs a k-ary tree between cluster members. The most stable node is selected as the local header in each cluster. It monitors cluster membership events and decides to split or merge the cluster if necessary. Detailed performance evaluation revealed that Bincast has lower delay stretch than similar methods with approximately same stress.","PeriodicalId":172400,"journal":{"name":"2010 7th IEEE Consumer Communications and Networking Conference","volume":"2 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2010-01-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"11","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2010 7th IEEE Consumer Communications and Networking Conference","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CCNC.2010.5421721","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 11
Abstract
Application Layer Multicast (ALM) is considered as an alternative approach to IP multicast. Topology awareness is an important metric for ALM because it reduces link stress and delay stretch considerably. This work describes a novel, stable and low overhead ALM approach using binning technique to cluster nearby receivers, referred to as Bincast. Bincast uses a constant number of landmarks to cluster nearby nodes. It then constructs a k-ary tree between cluster members. The most stable node is selected as the local header in each cluster. It monitors cluster membership events and decides to split or merge the cluster if necessary. Detailed performance evaluation revealed that Bincast has lower delay stretch than similar methods with approximately same stress.