{"title":"基于lp的流量控制与长链路容量崩溃传播建模","authors":"W. Gebremariam, M. Bikdash","doi":"10.1109/SECON.2012.6196940","DOIUrl":null,"url":null,"abstract":"The main focus of this paper is to understand how congestion due to link failure propagates to successive links, and how well the network maintains system flow under abnormal conditions. We consider the multi-commodity flow problem, in which each commodity (origin-destination pair) uses k link-disjoint paths to satisfy flow rate demands. The congestion in the links is used to calculate the prices of the links which affect the cost of travelling. We solve minimum-cost linear-programming to control path flow rate routing decisions triggered by the changes in the cost coefficients. We conclude that efficient path flow rate re-routing in response to the congestion in the links could contribute significantly to network survivability.","PeriodicalId":187091,"journal":{"name":"2012 Proceedings of IEEE Southeastcon","volume":"54 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2012-03-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"LP-based flow rate control and modeling of capacity collapse propagation over long links\",\"authors\":\"W. Gebremariam, M. Bikdash\",\"doi\":\"10.1109/SECON.2012.6196940\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The main focus of this paper is to understand how congestion due to link failure propagates to successive links, and how well the network maintains system flow under abnormal conditions. We consider the multi-commodity flow problem, in which each commodity (origin-destination pair) uses k link-disjoint paths to satisfy flow rate demands. The congestion in the links is used to calculate the prices of the links which affect the cost of travelling. We solve minimum-cost linear-programming to control path flow rate routing decisions triggered by the changes in the cost coefficients. We conclude that efficient path flow rate re-routing in response to the congestion in the links could contribute significantly to network survivability.\",\"PeriodicalId\":187091,\"journal\":{\"name\":\"2012 Proceedings of IEEE Southeastcon\",\"volume\":\"54 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2012-03-15\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2012 Proceedings of IEEE Southeastcon\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/SECON.2012.6196940\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2012 Proceedings of IEEE Southeastcon","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SECON.2012.6196940","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
LP-based flow rate control and modeling of capacity collapse propagation over long links
The main focus of this paper is to understand how congestion due to link failure propagates to successive links, and how well the network maintains system flow under abnormal conditions. We consider the multi-commodity flow problem, in which each commodity (origin-destination pair) uses k link-disjoint paths to satisfy flow rate demands. The congestion in the links is used to calculate the prices of the links which affect the cost of travelling. We solve minimum-cost linear-programming to control path flow rate routing decisions triggered by the changes in the cost coefficients. We conclude that efficient path flow rate re-routing in response to the congestion in the links could contribute significantly to network survivability.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
