{"title":"Active congestion control mechanism for non-cumulative layered multicasting","authors":"G. A. Ebrahim, A. Younis","doi":"10.1109/AINA.2004.1283843","DOIUrl":null,"url":null,"abstract":"A new noncumulative layered multicast congestion control algorithm is proposed that can identify the location of congested branch(es) in the multicast tree and intelligently assign a dropping preference for each candidate layer. These preferences are assigned in a way that minimizes the number of affected receivers by dropping the corresponding layer. The algorithm assigns higher dropping preferences to the layers that cause simultaneous congestion in the multicast tree. It also minimizes the effect of receivers intentionally ignoring the congestion control algorithm, which provides tighter control of the receivers, and a bounded TCP-friendly behavior. Complexity analysis proves that the proposed algorithm has a linear computation time complexity. Simulation results show that the proposed congestion control algorithm in conjunction with a suitable layer coordination mechanism can increase the average normalized throughput of the receivers in the multicast session by more than 24%.","PeriodicalId":186142,"journal":{"name":"18th International Conference on Advanced Information Networking and Applications, 2004. AINA 2004.","volume":"81 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2004-03-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"18th International Conference on Advanced Information Networking and Applications, 2004. AINA 2004.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/AINA.2004.1283843","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
Abstract
A new noncumulative layered multicast congestion control algorithm is proposed that can identify the location of congested branch(es) in the multicast tree and intelligently assign a dropping preference for each candidate layer. These preferences are assigned in a way that minimizes the number of affected receivers by dropping the corresponding layer. The algorithm assigns higher dropping preferences to the layers that cause simultaneous congestion in the multicast tree. It also minimizes the effect of receivers intentionally ignoring the congestion control algorithm, which provides tighter control of the receivers, and a bounded TCP-friendly behavior. Complexity analysis proves that the proposed algorithm has a linear computation time complexity. Simulation results show that the proposed congestion control algorithm in conjunction with a suitable layer coordination mechanism can increase the average normalized throughput of the receivers in the multicast session by more than 24%.