Sciweavers

INFOCOM
2007
IEEE

Finding Minimum-Cost Paths with Minimum Sharability

13 years 10 months ago
Finding Minimum-Cost Paths with Minimum Sharability
Abstract— In communication networks, multiple communication paths sharing minimum number of links or/and nodes may be desirable for improved performance, resource utilization and reliability. We introduce the notion of link sharability and node sharability, and consider the problems of finding minimum-cost k paths subject to minimum link/node sharability constraints. We identify 65 different link/node sharability constraints, and consider the fundamental problem of finding minimum-cost k paths between a pair of nodes under these constraints. We present a unified polynomial-time algorithm scheme for solving this problem subject to 25 of these different sharability constraints.
Si-Qing Zheng, Bing Yang, Mei Yang, Jianping Wang
Added 03 Jun 2010
Updated 03 Jun 2010
Type Conference
Year 2007
Where INFOCOM
Authors Si-Qing Zheng, Bing Yang, Mei Yang, Jianping Wang
Comments (0)