A multi-layer network model based on ITU-T G.805

  • Authors:
  • Freek Dijkstra;Bert Andree;Karst Koymans;Jeroen van der Ham;Paola Grosso;Cees de Laat

  • Affiliations:
  • System and Network Engineering Group, University of Amsterdam, Kruislaan 403, 1098 SJ Amsterdam, The Netherlands;System and Network Engineering Group, University of Amsterdam, Kruislaan 403, 1098 SJ Amsterdam, The Netherlands;System and Network Engineering Group, University of Amsterdam, Kruislaan 403, 1098 SJ Amsterdam, The Netherlands;System and Network Engineering Group, University of Amsterdam, Kruislaan 403, 1098 SJ Amsterdam, The Netherlands and TNO Defence, Security and Safety, Postbus 96864, 2509 JG Den Haag, The Netherla ...;System and Network Engineering Group, University of Amsterdam, Kruislaan 403, 1098 SJ Amsterdam, The Netherlands;System and Network Engineering Group, University of Amsterdam, Kruislaan 403, 1098 SJ Amsterdam, The Netherlands

  • Venue:
  • Computer Networks: The International Journal of Computer and Telecommunications Networking
  • Year:
  • 2008

Quantified Score

Hi-index 0.00

Visualization

Abstract

In recent years, dynamic multi-layer networks have emerged. Unlike regular networks these multi-layer networks allow users and other networks to interface on different technology layers. While path finding on a single layer is currently well understood, path finding on multi-layer networks is far from trivial. Even the constraints (the possible incompatibilities) are not always clear. This paper proposes a model for multi-layer circuit-switched computer networks, based on ITU-T G.805 and GMPLS standards. Furthermore, it defines a simple algebra that can be used to verify the validity of network connections through such networks. The most important contribution of our model and algebra is that they are technology independent: they can describe any circuit-switched network technology without modifications or tuning to the model and algebra. The model and algebra have been implemented in a syntax and network tool, which are briefly discussed.