Class-based Minimum Interference Routing for Traffic Engineering in optical networks

J. Tapolcai, Péter Fodor, Gábor Rétvári, Markosz Maliosz, T. Cinkler

Research output: Chapter in Book/Report/Conference proceedingConference contribution

5 Citations (Scopus)

Abstract

In this paper an advanced framework for Minimum Interference Routing is proposed, which, despite its universal nature, is best suited for Traffic Engineering in optical networks. Minimum Interference Routing is a method for engineering network resources to minimize the interference among high-volume traffic sources, in an attempt to maximize the useful throughput of the network. The main motivation behind the proposed framework is a more advanced way of defining the "interference" between routes. This promotes the allocation of light-paths in an optical network without presuming any knowledge of future requests. The basic idea is that network links are classified into distinct criticality classes and additional capacity is defined for each criticality class. This additional capacity represents the amount of additional traffic that can be routed on those links, without increasing the network-wide interference. We provide a concise mathematical formula for class-based interference and propose a polynomial time heuristic to derive criticality classes. Based on our findings a flexible path selection scheme called MIRO is introduced. Finally, through extensive simulation studies, we show that the class-based interference framework more thoroughly describes link criticality than traditional methods, which transforms into more efficient routing in optical transport networks.

Original languageEnglish
Title of host publicationNGI 2005 - Next Generation Internet Networks: Traffic Engineering
Pages31-38
Number of pages8
Volume2005
DOIs
Publication statusPublished - 2005
EventNext Generation Internet Networks, NGI 2005 - Roma, Italy
Duration: Apr 18 2005Apr 20 2005

Other

OtherNext Generation Internet Networks, NGI 2005
CountryItaly
CityRoma
Period4/18/054/20/05

Fingerprint

Fiber optic networks
Throughput
Polynomials

Keywords

  • Graph Theory
  • Minimum Interference Routing
  • Network Flows
  • QoS Routing
  • Traffic Engineering

ASJC Scopus subject areas

  • Engineering(all)

Cite this

Tapolcai, J., Fodor, P., Rétvári, G., Maliosz, M., & Cinkler, T. (2005). Class-based Minimum Interference Routing for Traffic Engineering in optical networks. In NGI 2005 - Next Generation Internet Networks: Traffic Engineering (Vol. 2005, pp. 31-38). [1431644] https://doi.org/10.1109/NGI.2005.1431644

Class-based Minimum Interference Routing for Traffic Engineering in optical networks. / Tapolcai, J.; Fodor, Péter; Rétvári, Gábor; Maliosz, Markosz; Cinkler, T.

NGI 2005 - Next Generation Internet Networks: Traffic Engineering. Vol. 2005 2005. p. 31-38 1431644.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Tapolcai, J, Fodor, P, Rétvári, G, Maliosz, M & Cinkler, T 2005, Class-based Minimum Interference Routing for Traffic Engineering in optical networks. in NGI 2005 - Next Generation Internet Networks: Traffic Engineering. vol. 2005, 1431644, pp. 31-38, Next Generation Internet Networks, NGI 2005, Roma, Italy, 4/18/05. https://doi.org/10.1109/NGI.2005.1431644
Tapolcai J, Fodor P, Rétvári G, Maliosz M, Cinkler T. Class-based Minimum Interference Routing for Traffic Engineering in optical networks. In NGI 2005 - Next Generation Internet Networks: Traffic Engineering. Vol. 2005. 2005. p. 31-38. 1431644 https://doi.org/10.1109/NGI.2005.1431644
Tapolcai, J. ; Fodor, Péter ; Rétvári, Gábor ; Maliosz, Markosz ; Cinkler, T. / Class-based Minimum Interference Routing for Traffic Engineering in optical networks. NGI 2005 - Next Generation Internet Networks: Traffic Engineering. Vol. 2005 2005. pp. 31-38
@inproceedings{63189cdd32c94717a2eb29c333b8cf0b,
title = "Class-based Minimum Interference Routing for Traffic Engineering in optical networks",
abstract = "In this paper an advanced framework for Minimum Interference Routing is proposed, which, despite its universal nature, is best suited for Traffic Engineering in optical networks. Minimum Interference Routing is a method for engineering network resources to minimize the interference among high-volume traffic sources, in an attempt to maximize the useful throughput of the network. The main motivation behind the proposed framework is a more advanced way of defining the {"}interference{"} between routes. This promotes the allocation of light-paths in an optical network without presuming any knowledge of future requests. The basic idea is that network links are classified into distinct criticality classes and additional capacity is defined for each criticality class. This additional capacity represents the amount of additional traffic that can be routed on those links, without increasing the network-wide interference. We provide a concise mathematical formula for class-based interference and propose a polynomial time heuristic to derive criticality classes. Based on our findings a flexible path selection scheme called MIRO is introduced. Finally, through extensive simulation studies, we show that the class-based interference framework more thoroughly describes link criticality than traditional methods, which transforms into more efficient routing in optical transport networks.",
keywords = "Graph Theory, Minimum Interference Routing, Network Flows, QoS Routing, Traffic Engineering",
author = "J. Tapolcai and P{\'e}ter Fodor and G{\'a}bor R{\'e}tv{\'a}ri and Markosz Maliosz and T. Cinkler",
year = "2005",
doi = "10.1109/NGI.2005.1431644",
language = "English",
volume = "2005",
pages = "31--38",
booktitle = "NGI 2005 - Next Generation Internet Networks: Traffic Engineering",

}

TY - GEN

T1 - Class-based Minimum Interference Routing for Traffic Engineering in optical networks

AU - Tapolcai, J.

AU - Fodor, Péter

AU - Rétvári, Gábor

AU - Maliosz, Markosz

AU - Cinkler, T.

PY - 2005

Y1 - 2005

N2 - In this paper an advanced framework for Minimum Interference Routing is proposed, which, despite its universal nature, is best suited for Traffic Engineering in optical networks. Minimum Interference Routing is a method for engineering network resources to minimize the interference among high-volume traffic sources, in an attempt to maximize the useful throughput of the network. The main motivation behind the proposed framework is a more advanced way of defining the "interference" between routes. This promotes the allocation of light-paths in an optical network without presuming any knowledge of future requests. The basic idea is that network links are classified into distinct criticality classes and additional capacity is defined for each criticality class. This additional capacity represents the amount of additional traffic that can be routed on those links, without increasing the network-wide interference. We provide a concise mathematical formula for class-based interference and propose a polynomial time heuristic to derive criticality classes. Based on our findings a flexible path selection scheme called MIRO is introduced. Finally, through extensive simulation studies, we show that the class-based interference framework more thoroughly describes link criticality than traditional methods, which transforms into more efficient routing in optical transport networks.

AB - In this paper an advanced framework for Minimum Interference Routing is proposed, which, despite its universal nature, is best suited for Traffic Engineering in optical networks. Minimum Interference Routing is a method for engineering network resources to minimize the interference among high-volume traffic sources, in an attempt to maximize the useful throughput of the network. The main motivation behind the proposed framework is a more advanced way of defining the "interference" between routes. This promotes the allocation of light-paths in an optical network without presuming any knowledge of future requests. The basic idea is that network links are classified into distinct criticality classes and additional capacity is defined for each criticality class. This additional capacity represents the amount of additional traffic that can be routed on those links, without increasing the network-wide interference. We provide a concise mathematical formula for class-based interference and propose a polynomial time heuristic to derive criticality classes. Based on our findings a flexible path selection scheme called MIRO is introduced. Finally, through extensive simulation studies, we show that the class-based interference framework more thoroughly describes link criticality than traditional methods, which transforms into more efficient routing in optical transport networks.

KW - Graph Theory

KW - Minimum Interference Routing

KW - Network Flows

KW - QoS Routing

KW - Traffic Engineering

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

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

U2 - 10.1109/NGI.2005.1431644

DO - 10.1109/NGI.2005.1431644

M3 - Conference contribution

AN - SCOPUS:33744495769

VL - 2005

SP - 31

EP - 38

BT - NGI 2005 - Next Generation Internet Networks: Traffic Engineering

ER -