Multidomain shared protection with limited information via MPP and p-cycles

János Szigeti, Laszlo Gyarmati, Tibor Cinkler

Research output: Contribution to journalArticle

5 Citations (Scopus)

Abstract

The Internet consists of a collection of more than 21,000 domains called autonomous systems operated mostly under different authorities (operators-providers) that, although they cooperate over different geographical areas, compete in a country or other area. Recently, the path computation element concept has been proposed to generalized multiprotocol label switching controlled optical borne networks to make routing decisions for interdomain connections taking into account traffic engineering, quality of service, and resilience considerations. Still the question of protection shareability emerges. For dedicated protection it is enough to know the topology of the network to be able to calculate disjoint paths. However, to reduce network resource usage by sharing of protection resources (e.g., end-to-end shared protection) it is also mandatory to know the exact working and protection path pairs for all the demands. This can be checked within a domain where not only the full topology and link-state information is flooded but also the working and protection paths are known for each connection; however; over the domain boundaries for security and scalability reasons no such information is being spread. We propose using two techniques that do not require flooding the information on working and protection paths while still allowing the sharing of resources. These two techniques are the multidomain p-cycles and the multidomain multipath routing with protection. After explaining the principles of these methods we evaluate the trade-off between the resource requirement and availability of these techniques by simulations.

Original languageEnglish
Pages (from-to)400-409
Number of pages10
JournalJournal of Optical Networking
Volume7
Issue number5
DOIs
Publication statusPublished - 1 May 2008
Externally publishedYes

Fingerprint

massively parallel processors
Topology
cycles
Telecommunication traffic
Scalability
Labels
resources
Quality of service
Availability
Internet
topology
resilience
traffic
availability
engineering
operators
requirements

ASJC Scopus subject areas

  • Computer Networks and Communications
  • Atomic and Molecular Physics, and Optics

Cite this

Multidomain shared protection with limited information via MPP and p-cycles. / Szigeti, János; Gyarmati, Laszlo; Cinkler, Tibor.

In: Journal of Optical Networking, Vol. 7, No. 5, 01.05.2008, p. 400-409.

Research output: Contribution to journalArticle

@article{60f9c9ff170743828a39bae1e7403f4c,
title = "Multidomain shared protection with limited information via MPP and p-cycles",
abstract = "The Internet consists of a collection of more than 21,000 domains called autonomous systems operated mostly under different authorities (operators-providers) that, although they cooperate over different geographical areas, compete in a country or other area. Recently, the path computation element concept has been proposed to generalized multiprotocol label switching controlled optical borne networks to make routing decisions for interdomain connections taking into account traffic engineering, quality of service, and resilience considerations. Still the question of protection shareability emerges. For dedicated protection it is enough to know the topology of the network to be able to calculate disjoint paths. However, to reduce network resource usage by sharing of protection resources (e.g., end-to-end shared protection) it is also mandatory to know the exact working and protection path pairs for all the demands. This can be checked within a domain where not only the full topology and link-state information is flooded but also the working and protection paths are known for each connection; however; over the domain boundaries for security and scalability reasons no such information is being spread. We propose using two techniques that do not require flooding the information on working and protection paths while still allowing the sharing of resources. These two techniques are the multidomain p-cycles and the multidomain multipath routing with protection. After explaining the principles of these methods we evaluate the trade-off between the resource requirement and availability of these techniques by simulations.",
author = "J{\'a}nos Szigeti and Laszlo Gyarmati and Tibor Cinkler",
year = "2008",
month = "5",
day = "1",
doi = "10.1364/JON.7.000400",
language = "English",
volume = "7",
pages = "400--409",
journal = "Journal of Optical Networking",
issn = "1536-5379",
publisher = "The Optical Society",
number = "5",

}

TY - JOUR

T1 - Multidomain shared protection with limited information via MPP and p-cycles

AU - Szigeti, János

AU - Gyarmati, Laszlo

AU - Cinkler, Tibor

PY - 2008/5/1

Y1 - 2008/5/1

N2 - The Internet consists of a collection of more than 21,000 domains called autonomous systems operated mostly under different authorities (operators-providers) that, although they cooperate over different geographical areas, compete in a country or other area. Recently, the path computation element concept has been proposed to generalized multiprotocol label switching controlled optical borne networks to make routing decisions for interdomain connections taking into account traffic engineering, quality of service, and resilience considerations. Still the question of protection shareability emerges. For dedicated protection it is enough to know the topology of the network to be able to calculate disjoint paths. However, to reduce network resource usage by sharing of protection resources (e.g., end-to-end shared protection) it is also mandatory to know the exact working and protection path pairs for all the demands. This can be checked within a domain where not only the full topology and link-state information is flooded but also the working and protection paths are known for each connection; however; over the domain boundaries for security and scalability reasons no such information is being spread. We propose using two techniques that do not require flooding the information on working and protection paths while still allowing the sharing of resources. These two techniques are the multidomain p-cycles and the multidomain multipath routing with protection. After explaining the principles of these methods we evaluate the trade-off between the resource requirement and availability of these techniques by simulations.

AB - The Internet consists of a collection of more than 21,000 domains called autonomous systems operated mostly under different authorities (operators-providers) that, although they cooperate over different geographical areas, compete in a country or other area. Recently, the path computation element concept has been proposed to generalized multiprotocol label switching controlled optical borne networks to make routing decisions for interdomain connections taking into account traffic engineering, quality of service, and resilience considerations. Still the question of protection shareability emerges. For dedicated protection it is enough to know the topology of the network to be able to calculate disjoint paths. However, to reduce network resource usage by sharing of protection resources (e.g., end-to-end shared protection) it is also mandatory to know the exact working and protection path pairs for all the demands. This can be checked within a domain where not only the full topology and link-state information is flooded but also the working and protection paths are known for each connection; however; over the domain boundaries for security and scalability reasons no such information is being spread. We propose using two techniques that do not require flooding the information on working and protection paths while still allowing the sharing of resources. These two techniques are the multidomain p-cycles and the multidomain multipath routing with protection. After explaining the principles of these methods we evaluate the trade-off between the resource requirement and availability of these techniques by simulations.

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

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

U2 - 10.1364/JON.7.000400

DO - 10.1364/JON.7.000400

M3 - Article

VL - 7

SP - 400

EP - 409

JO - Journal of Optical Networking

JF - Journal of Optical Networking

SN - 1536-5379

IS - 5

ER -