Finding Minimum-Cost Paths with Minimum Sharability

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...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:IEEE INFOCOM 2007 - 26th IEEE International Conference on Computer Communications s. 1532 - 1540
Hlavní autoři: Zheng, S.Q., Bing Yang, Mei Yang, Jianping Wang
Médium: Konferenční příspěvek
Jazyk:angličtina
Vydáno: IEEE 01.05.2007
Témata:
Communication networks
Communications Society
Computer science
Costs
Peer to peer computing
Polynomials
Protection
Routing protocols
Telecommunication network reliability
USA Councils
ISBN:1424410479, 9781424410477
ISSN:0743-166X
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí: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.
ISBN:1424410479
9781424410477
ISSN:0743-166X
DOI:10.1109/INFCOM.2007.180