Reliable Routing with QoS Guarantees for Multi-Domain IP/MPLS Networks

We present a distributed routing algorithm for finding two disjoint (primary and backup) QoS paths that run across multiple domains. Our work is inspired by the recent interest in establishing communication paths with QoS constrains spanning multiple IP/MPLS domains. In such settings, the routing de...

Full description

Saved in:
Bibliographic Details
Published inIEEE INFOCOM 2007 - 26th IEEE International Conference on Computer Communications pp. 1820 - 1828
Main Authors Sprintson, A., Yannuzzi, M., Orda, A., Masip-Bruin, X.
Format Conference Proceeding
LanguageEnglish
Published IEEE 01.05.2007
Subjects
Online AccessGet full text

Cover

Loading…
Abstract We present a distributed routing algorithm for finding two disjoint (primary and backup) QoS paths that run across multiple domains. Our work is inspired by the recent interest in establishing communication paths with QoS constrains spanning multiple IP/MPLS domains. In such settings, the routing decisions in each domain are made by the path computation element (PCE). We assume that the PCEs run a joint distributed routing protocol, decoupled from the BGP, which enables them to establish efficient paths across multiple domains. This study makes the following contributions. First, we present an aggregated representation of a multi-domain network that is small enough to minimize the link-state overhead, and, at the same time, is sufficiently accurate, so that the PCEs can find optimal disjoint QoS paths across multiple domains. Second, we present a distributed routing algorithm that uses the proposed representation to find disjoint paths in an efficient manner. Finally, we consider the problem of finding two disjoint paths subject to the export policy limitations, imposed by customer-provider and peer relationships between routing domains. We show that this problem can be efficiently solved by employing the concept of line graphs. To the best of our knowledge, this is the first scheme fully decoupled from BGP that enables to establish disjoint QoS IP/MPLS paths in a multi-domain environment with provable performance guarantees.
AbstractList We present a distributed routing algorithm for finding two disjoint (primary and backup) QoS paths that run across multiple domains. Our work is inspired by the recent interest in establishing communication paths with QoS constrains spanning multiple IP/MPLS domains. In such settings, the routing decisions in each domain are made by the path computation element (PCE). We assume that the PCEs run a joint distributed routing protocol, decoupled from the BGP, which enables them to establish efficient paths across multiple domains. This study makes the following contributions. First, we present an aggregated representation of a multi-domain network that is small enough to minimize the link-state overhead, and, at the same time, is sufficiently accurate, so that the PCEs can find optimal disjoint QoS paths across multiple domains. Second, we present a distributed routing algorithm that uses the proposed representation to find disjoint paths in an efficient manner. Finally, we consider the problem of finding two disjoint paths subject to the export policy limitations, imposed by customer-provider and peer relationships between routing domains. We show that this problem can be efficiently solved by employing the concept of line graphs. To the best of our knowledge, this is the first scheme fully decoupled from BGP that enables to establish disjoint QoS IP/MPLS paths in a multi-domain environment with provable performance guarantees.
Author Orda, A.
Sprintson, A.
Yannuzzi, M.
Masip-Bruin, X.
Author_xml – sequence: 1
  givenname: A.
  surname: Sprintson
  fullname: Sprintson, A.
  organization: Texas A&M Univ., College Station
– sequence: 2
  givenname: M.
  surname: Yannuzzi
  fullname: Yannuzzi, M.
– sequence: 3
  givenname: A.
  surname: Orda
  fullname: Orda, A.
– sequence: 4
  givenname: X.
  surname: Masip-Bruin
  fullname: Masip-Bruin, X.
BookMark eNotzE9PwjAYgPEmYiIgZw9e-gUGfdtubY9mOlyyAYIm3ki3vdXq2Mz-hPjtNdHT8zs9MzJp2gYJuQG2BGBmlW6SeJsvOWNqyYFfkBlILiUwqcyETJmSIoAoer0ii77_YIyBibSOzJQke6y9LWqk-3YcfPNGz354p0_tga5H29lmQOypazuaj_Xgg_v2ZH1D090q32UHusHh3Haf_TW5dLbucfHfOXlJHp7jxyDbrtP4Lgs8qHAItNMaGWqhgKMrfoXOQqFUVGEYCibAaCnKUigtFZjKoStNKTSvLFrgWszJ7d_XI-Lxq_Mn230fJYdQGSl-AP91TIA
ContentType Conference Proceeding
DBID 6IE
6IH
CBEJK
RIE
RIO
DOI 10.1109/INFCOM.2007.212
DatabaseName IEEE Electronic Library (IEL) Conference Proceedings
IEEE Proceedings Order Plan (POP) 1998-present by volume
IEEE Xplore All Conference Proceedings
IEEE Xplore
IEEE Proceedings Order Plans (POP) 1998-present
DatabaseTitleList
Database_xml – sequence: 1
  dbid: RIE
  name: IEEE Xplore
  url: https://proxy.k.utb.cz/login?url=https://ieeexplore.ieee.org/
  sourceTypes: Publisher
DeliveryMethod fulltext_linktorsrc
Discipline Engineering
EndPage 1828
ExternalDocumentID 4215794
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-8f88e0e83712efb0e8efa1b776de5530319843cc3784719dfefc9c382daea1283
IEDL.DBID RIE
ISBN 1424410479
9781424410477
ISSN 0743-166X
IngestDate Wed Aug 27 01:43:54 EDT 2025
IsPeerReviewed false
IsScholarly true
Language English
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-i175t-8f88e0e83712efb0e8efa1b776de5530319843cc3784719dfefc9c382daea1283
PageCount 9
ParticipantIDs ieee_primary_4215794
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.9006804
Snippet We present a distributed routing algorithm for finding two disjoint (primary and backup) QoS paths that run across multiple domains. Our work is inspired by...
SourceID ieee
SourceType Publisher
StartPage 1820
SubjectTerms Application software
Communication switching
Communications Society
Computer architecture
Contracts
IP networks
Multiprotocol label switching
Resilience
Routing protocols
Telecommunication network reliability
Title Reliable Routing with QoS Guarantees for Multi-Domain IP/MPLS Networks
URI https://ieeexplore.ieee.org/document/4215794
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
link http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwjV07T8MwELbaTrDwaBFveWAkfSRu7MyFqEWkFJVK3SrHvkgVIkE0Xfj13CXpQ4iBzfEQJc7l7nz-vu8YuxPSoG_ETY6ms3UhpXZiG1sHMHYACEwRCiJtNPaHM_E0789r7H7LhQGAAnwGbRoWZ_k2M2sqlXUExie0nzqr48at5Grt6imBrxQ1y668sJJFq7VSgtP35xtSF0kTBButp-paVpo_vW7QGY3DwUtUahu61Kdyr-lKEXPCIxZtnraEmry313ncNt-_hBz_-zrHrLVj9_HJNm6dsBqkp-xwT5iwyUJCKhOpihNiCKc41Wv5azblZFP0NWDFMd_lBYHXecg-9DLlo0knmjxP-bjElq9abBY-vg2GTtVxwVliGpE7KlEKuoCb1p4LSYwjSHQvltK3QP2F8H9VwjPGkxTUAptAYgLjKddq0BjpvDPWSLMUzhnXXWnAGitlIkQCOkBngvd0IZZe3wr3gjVpRRafpajGolqMy7-nr9hBWVQlpOE1a-Rfa7jBbCCPbwsz-AEp3Kxl
linkProvider IEEE
linkToHtml http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwjV1LT8JAEN4gHtSLDzC-3YNHy6Nduu0ZJaC0YoCEG9nuThNibI2Ui7_embYgMR68bffQtNvpfLOz833D2J2QGn0jbnIUna0LKZUVmchYgNgBIDBEyIm0Qej2p-Jp1plV2P2GCwMAefEZNGiYn-WbVK8oVdYUiE9oPztsF3G_YxdsrZ-Miu96HrXLLv2wJ_Nma4UIp-vO1rQuEifw12pP5bUsVX_aLb85CHvdl6BQN7SpU-VW25UcdXqHLFg_b1Fs8tZYZVFDf_2ScvzvCx2x-g-_j482yHXMKpCcsIMtacIa61GtMtGqONUM4RSnjC1_TcecrIq-Byw5Rrw8p_BaD-m7WiR8MGoGo-GYh0V1-bLOpr3HSbdvlT0XrAUGEpnlxZ4HLcBta9uGOMIRxKodSekaoA5D-Md6wtHakQRrvokh1r52PNsoUIh1zimrJmkCZ4yrltRgtJEyFiIG5aM7wXvaEEmnY4R9zmq0IvOPQlZjXi7Gxd_Tt2yvPwmG8-EgfL5k-0WKleoOr1g1-1zBNcYGWXSTm8Q3YjKvrw
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=Reliable+Routing+with+QoS+Guarantees+for+Multi-Domain+IP%2FMPLS+Networks&rft.au=Sprintson%2C+A.&rft.au=Yannuzzi%2C+M.&rft.au=Orda%2C+A.&rft.au=Masip-Bruin%2C+X.&rft.date=2007-05-01&rft.pub=IEEE&rft.isbn=9781424410477&rft.issn=0743-166X&rft.spage=1820&rft.epage=1828&rft_id=info:doi/10.1109%2FINFCOM.2007.212&rft.externalDocID=4215794
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