Partial characterizations of networks supporting shortest path interval labeling schemes

In this paper, we consider the problem of shortest path interval routing, a space‐efficient strategy for routing in distributed networks. In this scheme, an ordering of the vertices is chosen so that the edges of the network can be labeled with one or more subintervals of the vertex ordering: The re...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:Networks Ročník 32; číslo 2; s. 103 - 113
Hlavní autori: Narayanan, Lata, Shende, Sunil
Médium: Journal Article
Jazyk:English
Vydavateľské údaje: New York Wiley Subscription Services, Inc., A Wiley Company 01.09.1998
John Wiley & Sons
Predmet:
Applied sciences
Computer science; control theory; systems
Exact sciences and technology
graph theory
Information retrieval. Graph
interval routing algorithms
Switching and signalling
Systems, networks and services of telecommunications
Telecommunications
Telecommunications and information theory
Theoretical computing
theory of parallel and distributed computation
Interval graph
Optimal strategy
Network
Shortest path
Routing
Parallel computation
Graph theory
Distributed computing
ISSN:0028-3045, 1097-0037
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Abstract In this paper, we consider the problem of shortest path interval routing, a space‐efficient strategy for routing in distributed networks. In this scheme, an ordering of the vertices is chosen so that the edges of the network can be labeled with one or more subintervals of the vertex ordering: The resulting routing tables must be deterministic and route along shortest paths between all pairs of vertices. We first show constructively that any interval graph can be labeled with one circular subinterval on each edge; this extends a known result for proper interval graphs. We also provide a partial characterization for networks that admit linear interval routing when edges are labeled with exactly one interval, in terms of the biconnected components of any such network. This is the first such characterization when the paths are required to be shortest paths under the distance metric. Finally, we show that the class of networks that can be labeled with k ≥ 1 subintervals per edge is closed under composition with a certain class of graphs. © 1998 John Wiley & Sons, Inc. Networks 32: 103–113, 1998
AbstractList In this paper, we consider the problem of shortest path interval routing, a space‐efficient strategy for routing in distributed networks. In this scheme, an ordering of the vertices is chosen so that the edges of the network can be labeled with one or more subintervals of the vertex ordering: The resulting routing tables must be deterministic and route along shortest paths between all pairs of vertices. We first show constructively that any interval graph can be labeled with one circular subinterval on each edge; this extends a known result for proper interval graphs. We also provide a partial characterization for networks that admit linear interval routing when edges are labeled with exactly one interval, in terms of the biconnected components of any such network. This is the first such characterization when the paths are required to be shortest paths under the distance metric. Finally, we show that the class of networks that can be labeled with k ≥ 1 subintervals per edge is closed under composition with a certain class of graphs. © 1998 John Wiley & Sons, Inc. Networks 32: 103–113, 1998
Author Narayanan, Lata
Shende, Sunil
Author_xml – sequence: 1
  givenname: Lata
  surname: Narayanan
  fullname: Narayanan, Lata
  email: lata@cs.concordia.ca
  organization: Department of Computer Science, Concordia University, Montreal, Quebec, Canada, H3G 1M8
– sequence: 2
  givenname: Sunil
  surname: Shende
  fullname: Shende, Sunil
  organization: Department of Computer Science and Engineering, University of Nebraska-Lincoln, Lincoln, Nebraska 68588
BackLink http://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=1700148$$DView record in Pascal Francis
BookMark eNqFkFFv0zAQxy00JLrBd8gDD9tDiu1L6rggpCmso1LVVloRiJfT2Tg0LEsiOzDGp8dZ0fYAEk-27_730_l3zI7arnWMvRF8KjiXr06vluXyTHCtUs5BnQqtC67PQM5lzMB8fr58l64vdvAWpnxabl7LdPGETR4GjtgkYooUeJY_Y8chfONciFwUE_ZpS36oqUnsnjzZwfn6Fw1114akq5LWDbedvw5J-N73XQy2X5OwjxcXhqSnYZ_UbRz5EecbMq6579u9u3HhOXtaURPciz_nCfuwuNiV79PV5nJZnq9SCyqD1HClCyuLmZOZdrmGTAljVF7EtUGSqaw2JnakMDMyOptlJL4AWE6WpKscnLCXB25PwVJTeWptHbD39Q35OxQqfjUrYmx3iFnfheBd9ZjgOEpGHCXj6AxHZ3iQjCBRxiogRsk4SkZAjuUmlheP2Nu6cXd_Mf-D_Afx_h2x6QFbh8H9fMCSv8aZApXjx_Ulrq7k52JbrnELvwHyQKGA
CODEN NTWKAA
ContentType Journal Article
Copyright Copyright © 1998 John Wiley & Sons, Inc.
1999 INIST-CNRS
Copyright_xml – notice: Copyright © 1998 John Wiley & Sons, Inc.
– notice: 1999 INIST-CNRS
DBID BSCLL
AAYXX
CITATION
IQODW
DOI 10.1002/(SICI)1097-0037(199809)32:2<103::AID-NET3>3.0.CO;2-F
DatabaseName Istex
CrossRef
Pascal-Francis
DatabaseTitle CrossRef
DatabaseTitleList
DeliveryMethod fulltext_linktorsrc
Discipline Engineering
Applied Sciences
EISSN 1097-0037
EndPage 113
ExternalDocumentID 1700148
10_1002__SICI_1097_0037_199809_32_2_103__AID_NET3_3_0_CO_2_F
NET3
ark_67375_WNG_LS2Z8PCN_P
Genre article
GrantInformation_xml – fundername: Concordia University
– fundername: NSERC, Canada
GroupedDBID -~X
.3N
.DC
.GA
.Y3
05W
0R~
10A
123
1L6
1OB
1OC
1ZS
31~
33P
3SF
3WU
4.4
4ZD
50Y
50Z
51W
51X
52M
52N
52O
52P
52S
52T
52U
52W
52X
5VS
66C
6TJ
6TU
702
7PT
8-0
8-1
8-3
8-4
8-5
8UM
930
A03
AAESR
AAEVG
AAHQN
AAMMB
AAMNL
AANHP
AANLZ
AAONW
AASGY
AAXRX
AAYCA
AAZKR
ABCQN
ABCUV
ABDPE
ABEFU
ABEML
ABIJN
ACAHQ
ACBWZ
ACCZN
ACGFS
ACIWK
ACPOU
ACRPL
ACSCC
ACXBN
ACXQS
ACYXJ
ADBBV
ADEOM
ADIZJ
ADKYN
ADMGS
ADMLS
ADNMO
ADOZA
ADZMN
AEFGJ
AEIGN
AEIMD
AENEX
AEUYR
AEYWJ
AFBPY
AFFPM
AFGKR
AFWVQ
AFZJQ
AGHNM
AGQPQ
AGXDD
AGYGG
AHBTC
AIDQK
AIDYY
AIQQE
AITYG
AIURR
AJXKR
ALAGY
ALMA_UNASSIGNED_HOLDINGS
ALUQN
ALVPJ
AMBMR
AMVHM
AMYDB
ARCSS
ASPBG
ATUGU
AUFTA
AVWKF
AZBYB
AZFZN
AZVAB
BAFTC
BDRZF
BFHJK
BHBCM
BMNLL
BNHUX
BROTX
BRXPI
BSCLL
BY8
CS3
D-E
D-F
DCZOG
DPXWK
DR2
DRFUL
DRSTM
DU5
EBS
EJD
F00
F01
F04
FEDTE
FSPIC
G-S
G.N
GODZA
H.T
H.X
HBH
HF~
HGLYW
HHY
HHZ
HVGLF
HZ~
H~9
IX1
J0M
JPC
KQQ
LATKE
LAW
LC2
LC3
LEEKS
LH4
LITHE
LOXES
LP6
LP7
LUTES
LW6
LYRES
M6L
MEWTI
MK4
MRFUL
MRSTM
MSFUL
MSSTM
MVM
MXFUL
MXSTM
N04
N05
N9A
NF~
NHB
NNB
O66
O9-
OIG
P2P
P2W
P2X
P4D
PALCI
PQQKQ
Q.N
Q11
QB0
QRW
R.K
RIWAO
RJQFR
ROL
RX1
RXW
SAMSI
SUPJJ
TAE
TN5
TUS
TWZ
UB1
V2E
W8V
W99
WBKPD
WH7
WIB
WIH
WIK
WJL
WOHZO
WQJ
WXSBR
WYISQ
XBAML
XG1
XPP
XV2
ZCA
ZY4
ZZTAW
~IA
~WT
AAYXX
CITATION
O8X
IQODW
ID FETCH-LOGICAL-c3743-b0798c286e249e593471bb75803732abfc9bb49e21b6ab9464a1d33c0aca2efe3
IEDL.DBID DRFUL
ISICitedReferencesCount 6
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000075672100003&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN 0028-3045
IngestDate Mon Jul 21 09:15:48 EDT 2025
Sat Nov 29 04:29:48 EST 2025
Wed Jul 16 12:24:59 EDT 2025
Sun Sep 21 06:17:19 EDT 2025
IsPeerReviewed true
IsScholarly true
Issue 2
Keywords Interval graph
Optimal strategy
Network
Shortest path
Routing
Parallel computation
Graph theory
Distributed computing
Language English
License http://doi.wiley.com/10.1002/tdm_license_1.1
CC BY 4.0
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-c3743-b0798c286e249e593471bb75803732abfc9bb49e21b6ab9464a1d33c0aca2efe3
Notes ArticleID:NET3
NSERC, Canada
istex:1BAD71E73C74A5F64FEE6C4A29F69DF0F2C28686
ark:/67375/WNG-LS2Z8PCN-P
Concordia University
PageCount 11
ParticipantIDs pascalfrancis_primary_1700148
crossref_primary_10_1002__SICI_1097_0037_199809_32_2_103__AID_NET3_3_0_CO_2_F
wiley_primary_10_1002_SICI_1097_0037_199809_32_2_103_AID_NET3_3_0_CO_2_F_NET3
istex_primary_ark_67375_WNG_LS2Z8PCN_P
PublicationCentury 1900
PublicationDate September 1998
PublicationDateYYYYMMDD 1998-09-01
PublicationDate_xml – month: 09
  year: 1998
  text: September 1998
PublicationDecade 1990
PublicationPlace New York
PublicationPlace_xml – name: New York
– name: New York, NY
PublicationTitle Networks
PublicationTitleAlternate Networks
PublicationYear 1998
Publisher Wiley Subscription Services, Inc., A Wiley Company
John Wiley & Sons
Publisher_xml – name: Wiley Subscription Services, Inc., A Wiley Company
– name: John Wiley & Sons
References J. van Leeuwen and R. Tan, Interval routing. Comput. J. 30 (4) (1987) 298-307.
B. Awerbuch, A. Bar-Noy, N. Linial, and D. Peleg, Improved routing strategies with succinct tables. J. Alg. 11 (1990) 307-341.
B. Bollobas, Graph Theory: An Introductory Course. Springer-Verlag, (1979).
E. Bakker, J. van Leeuwen, and R. Tan, Linear interval routing. Alg. Rev. 2 (1991) 45-61.
G. Frederickson and R. Janardan, Efficient message routing in planar networks. SIAM J. Comput. 18 (4) (1989) 843-857.
G. Frederickson and R. Janardan, Designing networks with compact routing tables. Algorithmica 3 (1988) 171-190.
M. Golumbic, Algorithmic Graph Theory and Perfect Graphs. Academic Press, New York (1980).
G. Frederickson and R. Janardan, Space-efficient message routing in c-decomposable networks. SIAM J. Comput. 19 (1) (1990) 164-181.
N. Santoro and R. Khatib, Labeling and implicit routing in networks. Comput. J. 28 (1) (1985) 5-8.
1991; 2
1985; 28
1988; 3
1990; 11
1987; 30
1990; 19
1995
1994
1993
1980
1991
1979
1989; 18
1988
References_xml – reference: B. Bollobas, Graph Theory: An Introductory Course. Springer-Verlag, (1979).
– reference: M. Golumbic, Algorithmic Graph Theory and Perfect Graphs. Academic Press, New York (1980).
– reference: B. Awerbuch, A. Bar-Noy, N. Linial, and D. Peleg, Improved routing strategies with succinct tables. J. Alg. 11 (1990) 307-341.
– reference: G. Frederickson and R. Janardan, Designing networks with compact routing tables. Algorithmica 3 (1988) 171-190.
– reference: J. van Leeuwen and R. Tan, Interval routing. Comput. J. 30 (4) (1987) 298-307.
– reference: G. Frederickson and R. Janardan, Efficient message routing in planar networks. SIAM J. Comput. 18 (4) (1989) 843-857.
– reference: E. Bakker, J. van Leeuwen, and R. Tan, Linear interval routing. Alg. Rev. 2 (1991) 45-61.
– reference: G. Frederickson and R. Janardan, Space-efficient message routing in c-decomposable networks. SIAM J. Comput. 19 (1) (1990) 164-181.
– reference: N. Santoro and R. Khatib, Labeling and implicit routing in networks. Comput. J. 28 (1) (1985) 5-8.
– volume: 11
  start-page: 307
  year: 1990
  end-page: 341
  article-title: Improved routing strategies with succinct tables
  publication-title: J. Alg.
– start-page: 216
  year: 1994
  end-page: 224
– year: 1980
– volume: 30
  start-page: 298
  issue: 4
  year: 1987
  end-page: 307
  article-title: Interval routing
  publication-title: Comput. J.
– start-page: 338
  year: 1993
  end-page: 349
– volume: 2
  start-page: 45
  year: 1991
  end-page: 61
  article-title: Linear interval routing
  publication-title: Alg. Rev.
– year: 1995
– volume: 3
  start-page: 171
  year: 1988
  end-page: 190
  article-title: Designing networks with compact routing tables
  publication-title: Algorithmica
– volume: 18
  start-page: 843
  issue: 4
  year: 1989
  end-page: 857
  article-title: Efficient message routing in planar networks
  publication-title: SIAM J. Comput.
– volume: 28
  start-page: 5
  issue: 1
  year: 1985
  end-page: 8
  article-title: Labeling and implicit routing in networks
  publication-title: Comput. J.
– year: 1991
– year: 1979
– start-page: 492
  year: 1988
  end-page: 500
– year: 1994
– volume: 19
  start-page: 164
  issue: 1
  year: 1990
  end-page: 181
  article-title: Space‐efficient message routing in ‐decomposable networks
  publication-title: SIAM J. Comput.
SSID ssj0011518
Score 1.5091238
Snippet In this paper, we consider the problem of shortest path interval routing, a space‐efficient strategy for routing in distributed networks. In this scheme, an...
SourceID pascalfrancis
crossref
wiley
istex
SourceType Index Database
Publisher
StartPage 103
SubjectTerms Applied sciences
Computer science; control theory; systems
Exact sciences and technology
graph theory
Information retrieval. Graph
interval routing algorithms
Switching and signalling
Systems, networks and services of telecommunications
Telecommunications
Telecommunications and information theory
Theoretical computing
theory of parallel and distributed computation
Title Partial characterizations of networks supporting shortest path interval labeling schemes
URI https://api.istex.fr/ark:/67375/WNG-LS2Z8PCN-P/fulltext.pdf
https://onlinelibrary.wiley.com/doi/abs/10.1002%2F%28SICI%291097-0037%28199809%2932%3A2%3C103%3A%3AAID-NET3%3E3.0.CO%3B2-F
Volume 32
WOSCitedRecordID wos000075672100003&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
journalDatabaseRights – providerCode: PRVWIB
  databaseName: Wiley Online Library Full Collection 2020
  customDbUrl:
  eissn: 1097-0037
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0011518
  issn: 0028-3045
  databaseCode: DRFUL
  dateStart: 19960101
  isFulltext: true
  titleUrlDefault: https://onlinelibrary.wiley.com
  providerName: Wiley-Blackwell
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwxV3db9MwELdGixA88I0oMJQHQNtDNsdOE6cgpJE1UKlkFfug4sWyHUdMiG5qOoT467mLk4wKJF6QkBIpcRKfc3eO7-K7nwl5pqmyIgoC35g49EMwen1NhfVjY4aB1iY2dSLtyTTOczGfJ7MN8qPNhXH4EN0PN-wZ9fcaO7jS1e4laCgYYIeTdAIOM06i-rROHheYMoYQmmCWgIhhTwPK4Qi2vcm-n4-P4GzMd-hOevCcv2F-doX0Gah92CP9_Q_Z8bSbg4CxULQYzjifeI28aqjvbiHl7Y7ulqO6zdmIwT18NGppvXaUXgKdtYGvjzL8joGYqgJZlG4RjXUDuR7hslv_kze3yc3GLvb2nCLfIRt2cZfc-AUt8R6Zz1DN4SbTgUw3OaTeWektXDx75VUX5-hTwCNe9RlDiauVh-sue6d1eCc8D4pfZ-F74Nnbr7a6T46z8VH6zm8WhvANR0hVTeNEGCYiC86jHSYcRlitwfOB9-RM6dIkWsMVFuhI6SSMQhUUnBuqjGK2tPwB6S3OFvYh8XRYcEGLQhXoWUZCWxsrzpUqy0JoGgzI-1Zq8tzhf0iH9MykRB63U_g8lo6_kjPJoJRLCVyVyFXJJZXpARRnA_KiFn1XmVp-wdi6eCg_5m_l9JB9ErM0l7MB2VzTjUvqGCkQCmhYrQG_teovjfpDm-rzR_-4vsfkukvfxHC8J6S3Wl7YTXLVfFudVsunTV_7CfSPJ-0
linkProvider Wiley-Blackwell
linkToHtml http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwxV3db9MwELdGixg88DlEgUEeAG0P2Rw7bZyCkEbWsIosq1gHFS-W7ThiQnRT0yEk_nnu8jUqkHhBQkqkxHFyzt05vovvfibkmabKioHnucYEvuuD0etqKqwbGNP3tDaBKRNpPyRBmorZLJyskR9NLkyFD9H-cMOeUX6vsYPjD-ndS9RQsMCOx9EYPGacRXVpmT0uMGcMMTTBLgEZwx55lMMRbHvjfTcdTeFsxHfoTnT0nL9hbnyFdH3Qwn6HdPffxydJOwkBg6FoQJxxQvEaeVVT391Cytst3a2K6jZnQwZ1-HDY0HpdUXoJdFZGvi4K8TtGYqoChJFXq2isWsjlEBff-q_MuU1u1paxs1ep8h2yZud3yY1f8BLvkdkEFR0qmRZmus4idc5yZ15FtBdOcXGOXgXc4hSfMZi4WDq48rJzWgZ4wv2g-mUevgO-vf1qiw1yEo-m0YFbLw3hGo6gqpoGoTBMDCy4j7YfchhjtQbfB96TM6VzE2oNV5inB0qH_sBXXsa5ocooZnPL75PO_GxuHxBH-xkXNMtUhr7lQGhrA8W5UnmeCU29HjlsxCbPKwQQWWE9MymRx80kPg9kxV_JmWRQyqUErkrkquSSyugIiuMeeVHKvn2YWnzB6LqgLz-mb2VyzD6JSZTKSY9srijHJXWMFfAFNKxUgd9a9ZdG_aFN5fnDf_y8p2T9YHqYyGScvntErlfJnBic95h0losLu0mumm_L02LxpO54PwHLSSvd
linkToPdf http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwxV3db9MwELfGiiZ44BtRYJAHQNtDtsROE6cgpJE2UFGyiG1Q8WLZjiMmRFc1HULin-cuTjIqkHhBQkqkxEl8zt05vovvfibkifKk4aHvu1pHgRuA0esqjxs30nrgK6UjXSfSfphGWcZnszjfID_aXBiLD9H9cMOeUX-vsYObRVHuX6CGggV2NEkm4DHjLKrr1dnjHHPGEEMT7BKQMeyJ7zE4gu1gMnKz8TGcjdmet5ccPmWvqJteIr1gEIfQq3uj9-nJtJuEgMGQtyDOOKG4RV401Pd3kPJuR3fHUt1ldEjhHjYctrReWkrPgc7ayNdDIX7HSExZgTBKu4rGuoVcD3Hp9f_KnBvkWmMZOwdWlW-SDTO_Ra7-gpd4m8xyVHS4SXcw000WqXNWOnMb0V451fkCvQp4xKk-YzBxtXJw5WXntA7whOdB9es8fAd8e_PVVHfISTo-Tt64zdIQrmYIqqq8KOaa8tCA-2gGMYMxVinwfeA9GZWq1LFScIX6KpQqDsJA-gVj2pNaUlMadpdszs_m5h5xVFAw7hWFLNC3DLkyJpKMSVmWBVee3yfvWrGJhUUAERbrmQqBPG4n8VkkLH8Fo4JCKRMCuCqQq4IJTySHUJz2ybNa9l1lcvkFo-uigfiYvRbTI_qJ50km8j7ZXlOOC-oYKxBwaFitAr-16i-N-kOb6vP7_7i-x2QrH6ViOsnePiBXbC4nxuY9JJur5bnZJpf1t9VptXzU9LufEnArWA
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%3Ajournal&rft.genre=article&rft.atitle=Partial+characterizations+of+networks+supporting+shortest+path+interval+labeling+schemes&rft.jtitle=Networks&rft.au=Narayanan%2C+Lata&rft.au=Shende%2C+Sunil&rft.date=1998-09-01&rft.pub=Wiley+Subscription+Services%2C+Inc.%2C+A+Wiley+Company&rft.issn=0028-3045&rft.eissn=1097-0037&rft.volume=32&rft.issue=2&rft.spage=103&rft.epage=113&rft_id=info:doi/10.1002%2F%28SICI%291097-0037%28199809%2932%3A2%3C103%3A%3AAID-NET3%3E3.0.CO%3B2-F&rft.externalDBID=10.1002%252F%2528SICI%25291097-0037%2528199809%252932%253A2%253C103%253A%253AAID-NET3%253E3.0.CO%253B2-F&rft.externalDocID=NET3
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0028-3045&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0028-3045&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0028-3045&client=summon