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žené v:
Podrobná bibliografia
Vydané v:IEEE INFOCOM 2007 - 26th IEEE International Conference on Computer Communications s. 1532 - 1540
Hlavní autori: Zheng, S.Q., Bing Yang, Mei Yang, Jianping Wang
Médium: Konferenčný príspevok..
Jazyk:English
Vydavateľské údaje: IEEE 01.05.2007
Predmet:
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 prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
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.
AbstractList 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.
Author Mei Yang
Zheng, S.Q.
Bing Yang
Jianping Wang
Author_xml – sequence: 1
  givenname: S.Q.
  surname: Zheng
  fullname: Zheng, S.Q.
  organization: Univ. of Texas at Dallas, Richardson
– sequence: 2
  surname: Bing Yang
  fullname: Bing Yang
– sequence: 3
  surname: Mei Yang
  fullname: Mei Yang
– sequence: 4
  surname: Jianping Wang
  fullname: Jianping Wang
BookMark eNo1zMtKw0AUgOEBK9jb2oWbvEDiOXOfpQSjhdYKVXBXppMzZqRJJYlI396FuvrhW_wzNulOHTF2jVAggrtdPVXldlNwAFOghQs2Q8mlRJDGTdgUjBQ5av12xZbD8AEA6LS12k2ZqFJXp-4926QutV9tXp6GMXv2YzNk32ls_j3bNb73h3RM43nBLqM_DrT865y9Vvcv5WO-3j6syrt1ntCoMbfGkieCYABqwWsbQFvjKDoRKfLofAxOqNqqEL0WgTtplIYQlDx4Cijm7Ob3m4ho_9mn1vfnveSojObiBzt4RvE
ContentType Conference Proceeding
DBID 6IE
6IH
CBEJK
RIE
RIO
DOI 10.1109/INFCOM.2007.180
DatabaseName IEEE Electronic Library (IEL) Conference Proceedings
IEEE Proceedings Order Plan (POP) 1998-present by volume
IEEE Xplore All Conference Proceedings
IEEE Electronic Library (IEL)
IEEE Proceedings Order Plans (POP) 1998-present
DatabaseTitleList
Database_xml – sequence: 1
  dbid: RIE
  name: IEEE Electronic Library (IEL)
  url: https://ieeexplore.ieee.org/
  sourceTypes: Publisher
DeliveryMethod fulltext_linktorsrc
Discipline Engineering
Computer Science
EndPage 1540
ExternalDocumentID 4215762
Genre orig-research
GroupedDBID 23M
29I
6IE
6IF
6IH
6IK
6IL
6IM
6IN
AAJGR
AAWTH
ABLEC
ACGFS
ADZIZ
ALMA_UNASSIGNED_HOLDINGS
BEFXN
BFFAM
BGNUA
BKEBE
BPEOZ
CBEJK
CHZPO
IEGSK
IJVOP
IPLJI
M43
OCL
RIE
RIL
RIO
RNS
ID FETCH-LOGICAL-i175t-878eaee0c700d32d8c06879ef93fef2f9afc935d85cfa63c2947560cc54baec13
IEDL.DBID RIE
ISBN 1424410479
9781424410477
ISICitedReferencesCount 6
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000249117702055&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN 0743-166X
IngestDate Wed Aug 27 01:43:54 EDT 2025
IsDoiOpenAccess false
IsOpenAccess true
IsPeerReviewed false
IsScholarly true
Language English
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-i175t-878eaee0c700d32d8c06879ef93fef2f9afc935d85cfa63c2947560cc54baec13
PageCount 9
ParticipantIDs ieee_primary_4215762
PublicationCentury 2000
PublicationDate 2007-May
PublicationDateYYYYMMDD 2007-05-01
PublicationDate_xml – month: 05
  year: 2007
  text: 2007-May
PublicationDecade 2000
PublicationTitle IEEE INFOCOM 2007 - 26th IEEE International Conference on Computer Communications
PublicationTitleAbbrev INFCOM
PublicationYear 2007
Publisher IEEE
Publisher_xml – name: IEEE
SSID ssj0001968869
ssj0008726
Score 1.7035414
Snippet In communication networks, multiple communication paths sharing minimum number of links or/and nodes may be desirable for improved performance, resource...
SourceID ieee
SourceType Publisher
StartPage 1532
SubjectTerms Communication networks
Communications Society
Computer science
Costs
Peer to peer computing
Polynomials
Protection
Routing protocols
Telecommunication network reliability
USA Councils
Title Finding Minimum-Cost Paths with Minimum Sharability
URI https://ieeexplore.ieee.org/document/4215762
WOSCitedRecordID wos000249117702055&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlZ09T8MwEIZPpWKApdAWUb6UgZHQNHb8MVdEINHSAVC3ynHOUoamqE2R-PfETtJ2YGFLPEW2cnc63_u8APcisQx1pX1OlZXkBNpPCKKPIjRGCaaJk0d_vvLpVMznctaCh50WBhHd8Bk-2kd3l5-u9Na2yoa0zE_cBtwjzlml1dr3UyQTwppl11FYcGe1ViE4GZs3oi6LJpAN66l-5zXzZxTI4cs0Hr9NKrbhyMIiD0xXXM6JO__72jPo78V73myXls6hhXkXOo17g1f_zF04PUAR9oDEmdO3eJMsz5bbpT9ebQpvVtaHG8_2apt1zxGe3UTtTx8-4qf38bNfGyr4WVklFGXkE6gQA82DICVhKnTABJdoJDFoQiOV0ZJEqYi0UYzoUFJeVkRaRzRRqEfkAtr5KsdL8CiNDDIZUYtAM5zIVCsmWCLLegM5JgPo2R1ZfFXMjEW9GVd_L1_DSdUztYOEN9Au1lu8hWP9XWSb9Z076F-ot6Hm
linkProvider IEEE
linkToHtml http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlZ3PT8IwFMcbgibqBQWMv93Bo5Oxdv1xJi4QYXJAw4103WuyA8PAMPG_d-024ODF29bT0mbvvby-7-eL0BOPDUNdKpcRaSQ5nnJjDOAC97WWnCps5dGfYxZFfD4X0wZ63mlhAMAOn8GLebR3-clKbU2rrEeK_MRMwD0KCPG9Uq2176gIyrmxy67iMGfWbK2EcFI6r2VdBk4gatpT9c4q6k_fE71RFA7eJyXdsG9wkQe2KzbrhK3_fe856u7le850l5guUAOyNmrV_g1O9Tu30dkBjLCDcJhahYszSbN0uV26g9Umd6ZFhbhxTLe2Xncs49nO1P500Uf4OhsM3cpSwU2LOiEvYh8HCeAp5nkJ9hOuPMqZAC2wBu1rIbUSOEh4oLSkWPmCsKImUiogsQTVx5eoma0yuEIOIYEGKgJiIGiaYZEoSTmNRVFxAIP4GnXMjiy-SmrGotqMm7-XH9HJcDYZL8aj6O0WnZYdVDNWeIea-XoL9-hYfefpZv1gD_0XTD2lLQ
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&rft.genre=proceeding&rft.title=IEEE+INFOCOM+2007+-+26th+IEEE+International+Conference+on+Computer+Communications&rft.atitle=Finding+Minimum-Cost+Paths+with+Minimum+Sharability&rft.au=Zheng%2C+S.Q.&rft.au=Bing+Yang&rft.au=Mei+Yang&rft.au=Jianping+Wang&rft.date=2007-05-01&rft.pub=IEEE&rft.isbn=9781424410477&rft.issn=0743-166X&rft.spage=1532&rft.epage=1540&rft_id=info:doi/10.1109%2FINFCOM.2007.180&rft.externalDocID=4215762
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0743-166X&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0743-166X&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0743-166X&client=summon