{"title":"Models and algorithms for elastic-demand network equilibrium problems in communication networks with multicast sessions","authors":"Xuefeng Ma, J. Huai, B. Li, Hanwen Wang, Ye Jiao","doi":"10.1109/LCN.2012.6423637","DOIUrl":null,"url":null,"abstract":"We consider the problem of elastic-demand network equilibrium in communication networks which support both multirate multicast sessions and unicast sessions. Extending existing work for unicast sessions, we first present the elastic-demand network equilibrium models in different multicast sessions, which can be formulated as a convex programming problem. To solve the convex programming problem we use the augmented Lagrangian multiplier algorithm in which the attractive features of the exterior penalty with primal-dual methods and Lagrangian multipliers concepts are combined while curtailing the disadvantage of both. Some numerical results about unicast sessions and multirate multicast sessions are demonstrated through efficient implementations of the augmented Lagrangian multiplier algorithm.","PeriodicalId":209071,"journal":{"name":"37th Annual IEEE Conference on Local Computer Networks","volume":"16 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2012-10-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"37th Annual IEEE Conference on Local Computer Networks","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/LCN.2012.6423637","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
Abstract
We consider the problem of elastic-demand network equilibrium in communication networks which support both multirate multicast sessions and unicast sessions. Extending existing work for unicast sessions, we first present the elastic-demand network equilibrium models in different multicast sessions, which can be formulated as a convex programming problem. To solve the convex programming problem we use the augmented Lagrangian multiplier algorithm in which the attractive features of the exterior penalty with primal-dual methods and Lagrangian multipliers concepts are combined while curtailing the disadvantage of both. Some numerical results about unicast sessions and multirate multicast sessions are demonstrated through efficient implementations of the augmented Lagrangian multiplier algorithm.