Abstract
A new packet routing model proposed by the Internet Engineering Task Force, MultiProtocol Label Switching (MPLS), is discussed. Instead of each router's parsing the packet network layer header and doing its lookup based on that analysis, MPLS ensures that the analysis of the header is performed just once. This model has several advantages over conventional routing protocols, which includes reduced amount of header analysis at intermediate routers, which allows for faster switching times, and better traffic engineering capabilities and hence easier handeling of quality of service issues. MPLS protocols, and routing algorithms and lower bounds are given for a variety of situations and routing problems on the line are also studied.
Original language | English (US) |
---|---|
Pages (from-to) | 453-474 |
Number of pages | 22 |
Journal | SIAM Journal on Computing |
Volume | 34 |
Issue number | 2 |
DOIs | |
State | Published - 2005 |
Keywords
- Analysis of algorithms
- Distance labeling
- Graph separators
- MPLS routing
- Network routing
- Tree covers
ASJC Scopus subject areas
- Computer Science(all)
- Mathematics(all)
Access to Document
Other files and links
Fingerprint
Dive into the research topics of 'Traveling with a Pez dispenser (or, routing issues in MPLS)'. Together they form a unique fingerprint.
Cite this
- APA
- Standard
- Harvard
- Vancouver
- Author
- BIBTEX
- RIS
Gupta, A., Kumar, A., & Rastogi, R. (2005). Traveling with a Pez dispenser (or, routing issues in MPLS). SIAM Journal on Computing, 34(2), 453-474. https://doi.org/10.1137/S0097539702409927
Traveling with a Pez dispenser (or, routing issues in MPLS). / Gupta, Anupam; Kumar, Amit; Rastogi, Rajeev.
In: SIAM Journal on Computing, Vol. 34, No. 2, 2005, p. 453-474.
Research output: Contribution to journal › Article › peer-review
Gupta, A, Kumar, A & Rastogi, R 2005, 'Traveling with a Pez dispenser (or, routing issues in MPLS)', SIAM Journal on Computing, vol. 34, no. 2, pp. 453-474. https://doi.org/10.1137/S0097539702409927
Gupta A, Kumar A, Rastogi R. Traveling with a Pez dispenser (or, routing issues in MPLS). SIAM Journal on Computing. 2005;34(2):453-474. doi: 10.1137/S0097539702409927
Gupta, Anupam ; Kumar, Amit ; Rastogi, Rajeev. / Traveling with a Pez dispenser (or, routing issues in MPLS). In: SIAM Journal on Computing. 2005 ; Vol. 34, No. 2. pp. 453-474.
@article{d8ae764b546a4c8ba2387467c11d84fe,
title = "Traveling with a Pez dispenser (or, routing issues in MPLS)",
abstract = "A new packet routing model proposed by the Internet Engineering Task Force, MultiProtocol Label Switching (MPLS), is discussed. Instead of each router's parsing the packet network layer header and doing its lookup based on that analysis, MPLS ensures that the analysis of the header is performed just once. This model has several advantages over conventional routing protocols, which includes reduced amount of header analysis at intermediate routers, which allows for faster switching times, and better traffic engineering capabilities and hence easier handeling of quality of service issues. MPLS protocols, and routing algorithms and lower bounds are given for a variety of situations and routing problems on the line are also studied.",
keywords = "Analysis of algorithms, Distance labeling, Graph separators, MPLS routing, Network routing, Tree covers",
author = "Anupam Gupta and Amit Kumar and Rajeev Rastogi",
year = "2005",
doi = "10.1137/S0097539702409927",
language = "English (US)",
volume = "34",
pages = "453--474",
journal = "SIAM Journal on Computing",
issn = "0097-5397",
publisher = "Society for Industrial and Applied Mathematics Publications",
number = "2",
}
TY - JOUR
T1 - Traveling with a Pez dispenser (or, routing issues in MPLS)
AU - Gupta, Anupam
AU - Kumar, Amit
AU - Rastogi, Rajeev
PY - 2005
Y1 - 2005
N2 - A new packet routing model proposed by the Internet Engineering Task Force, MultiProtocol Label Switching (MPLS), is discussed. Instead of each router's parsing the packet network layer header and doing its lookup based on that analysis, MPLS ensures that the analysis of the header is performed just once. This model has several advantages over conventional routing protocols, which includes reduced amount of header analysis at intermediate routers, which allows for faster switching times, and better traffic engineering capabilities and hence easier handeling of quality of service issues. MPLS protocols, and routing algorithms and lower bounds are given for a variety of situations and routing problems on the line are also studied.
AB - A new packet routing model proposed by the Internet Engineering Task Force, MultiProtocol Label Switching (MPLS), is discussed. Instead of each router's parsing the packet network layer header and doing its lookup based on that analysis, MPLS ensures that the analysis of the header is performed just once. This model has several advantages over conventional routing protocols, which includes reduced amount of header analysis at intermediate routers, which allows for faster switching times, and better traffic engineering capabilities and hence easier handeling of quality of service issues. MPLS protocols, and routing algorithms and lower bounds are given for a variety of situations and routing problems on the line are also studied.
KW - Analysis of algorithms
KW - Distance labeling
KW - Graph separators
KW - MPLS routing
KW - Network routing
KW - Tree covers
UR - http://www.scopus.com/inward/record.url?scp=18444409992&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=18444409992&partnerID=8YFLogxK
U2 - 10.1137/S0097539702409927
DO - 10.1137/S0097539702409927
M3 - Article
AN - SCOPUS:18444409992
SN - 0097-5397
VL - 34
SP - 453
EP - 474
JO - SIAM Journal on Computing
JF - SIAM Journal on Computing
IS - 2
ER -