Intradomain QoS routing in IP networks: A feasibility and cost/benefit analysis

George Apostolopoulos; Roch Guérin; Sanjay Kamat; Ariel Orda; Satish K. Tripathi

doi:10.1109/65.793691

Intradomain QoS routing in IP networks: A feasibility and cost/benefit analysis

George Apostolopoulos, Roch Guérin, Sanjay Kamat, Ariel Orda, Satish K. Tripathi

Research output: Contribution to journal › Article › peer-review

63 Scopus citations

Abstract

Constraint-based routing gradually becomes an essential enabling mechanism for a variety of emerging network services such as virtual private networking and QoS support. A number of recent works have recognized its significance and investigated many aspects of the operation of constraint-based routing and in particular its variant concerned with determining paths for requests with specific QoS requirements, known as QoS routing. In this work we build on previous results on the cost of QoS routing and investigate the performance/cost trade-offs involved in the operation of a representative QoS routing architecture, elaborate on the constituents of this cost, and identify the main methods for containing the cost that QoS routing incurs on routers. Our results show that the cost of QoS routing is not excessive and that there indeed exist operational configurations, which can achieve reasonable performance gains with only a minimal increase in processing cost when compared to conventional best-effort routing.

Original language	English
Pages (from-to)	42-54
Number of pages	13
Journal	IEEE Network
Volume	13
Issue number	5
DOIs	https://doi.org/10.1109/65.793691
State	Published - Sep 1999

Access to Document

10.1109/65.793691

Cite this

@article{bb4046fcc7ae4942ab79c997c2932a64,

title = "Intradomain QoS routing in IP networks: A feasibility and cost/benefit analysis",

abstract = "Constraint-based routing gradually becomes an essential enabling mechanism for a variety of emerging network services such as virtual private networking and QoS support. A number of recent works have recognized its significance and investigated many aspects of the operation of constraint-based routing and in particular its variant concerned with determining paths for requests with specific QoS requirements, known as QoS routing. In this work we build on previous results on the cost of QoS routing and investigate the performance/cost trade-offs involved in the operation of a representative QoS routing architecture, elaborate on the constituents of this cost, and identify the main methods for containing the cost that QoS routing incurs on routers. Our results show that the cost of QoS routing is not excessive and that there indeed exist operational configurations, which can achieve reasonable performance gains with only a minimal increase in processing cost when compared to conventional best-effort routing.",

author = "George Apostolopoulos and Roch Gu{\'e}rin and Sanjay Kamat and Ariel Orda and Tripathi, {Satish K.}",

year = "1999",

month = sep,

doi = "10.1109/65.793691",

language = "English",

volume = "13",

pages = "42--54",

journal = "IEEE Network",

issn = "0890-8044",

number = "5",

}

TY - JOUR

T1 - Intradomain QoS routing in IP networks

T2 - A feasibility and cost/benefit analysis

AU - Apostolopoulos, George

AU - Guérin, Roch

AU - Kamat, Sanjay

AU - Orda, Ariel

AU - Tripathi, Satish K.

PY - 1999/9

Y1 - 1999/9

N2 - Constraint-based routing gradually becomes an essential enabling mechanism for a variety of emerging network services such as virtual private networking and QoS support. A number of recent works have recognized its significance and investigated many aspects of the operation of constraint-based routing and in particular its variant concerned with determining paths for requests with specific QoS requirements, known as QoS routing. In this work we build on previous results on the cost of QoS routing and investigate the performance/cost trade-offs involved in the operation of a representative QoS routing architecture, elaborate on the constituents of this cost, and identify the main methods for containing the cost that QoS routing incurs on routers. Our results show that the cost of QoS routing is not excessive and that there indeed exist operational configurations, which can achieve reasonable performance gains with only a minimal increase in processing cost when compared to conventional best-effort routing.

AB - Constraint-based routing gradually becomes an essential enabling mechanism for a variety of emerging network services such as virtual private networking and QoS support. A number of recent works have recognized its significance and investigated many aspects of the operation of constraint-based routing and in particular its variant concerned with determining paths for requests with specific QoS requirements, known as QoS routing. In this work we build on previous results on the cost of QoS routing and investigate the performance/cost trade-offs involved in the operation of a representative QoS routing architecture, elaborate on the constituents of this cost, and identify the main methods for containing the cost that QoS routing incurs on routers. Our results show that the cost of QoS routing is not excessive and that there indeed exist operational configurations, which can achieve reasonable performance gains with only a minimal increase in processing cost when compared to conventional best-effort routing.

UR - http://www.scopus.com/inward/record.url?scp=17444452105&partnerID=8YFLogxK

U2 - 10.1109/65.793691

DO - 10.1109/65.793691

M3 - Article

AN - SCOPUS:17444452105

SN - 0890-8044

VL - 13

SP - 42

EP - 54

JO - IEEE Network

JF - IEEE Network

IS - 5

ER -

Intradomain QoS routing in IP networks: A feasibility and cost/benefit analysis

Abstract

Access to Document

Other files and links

Fingerprint

Cite this