CSPF routed and traffic-driven construction of LSP hierarchies

  • Authors:
  • Michael Menth;Andreas Reifert;Jens Milbrandt

  • Affiliations:
  • Department of Distributed Systems, Institute of Computer Science, University of Würzburg, Würzburg, Germany;Department of Distributed Systems, Institute of Computer Science, University of Würzburg, Würzburg, Germany;Department of Distributed Systems, Institute of Computer Science, University of Würzburg, Würzburg, Germany

  • Venue:
  • Art-QoS'03 Proceedings of the 2003 international conference on Architectures for quality of service in the internet
  • Year:
  • 2003

Quantified Score

Hi-index 0.00

Visualization

Abstract

The objective of this work is the analysis of reservation aggregation and the description of a network architecture for scalable Quality of Service support. This architecture applies Differentiated Services for packet forwarding, admission control is done on a per flow basis at the access, and resource allocation is based on reservations. The reservations of individual flows are aggregated recursively to achieve scalability in the core. Multiprotocol Label Switching is applied to reflect these aggregates in Label Switched Paths (LSPs). The construction of the LSP hierarchy is traffic-driven and based on explicit routes that are determined by Constraint Shortest Path First routing. We describe the architecture of that system and suggest several mechanisms to operate it also in networking scenarios with heavy signaling load.