Inter-autonomous system provisioning for end-to-end bandwidth guarantees

  • Authors:
  • Kin-Hon Ho;Michael Howarth;Ning Wang;George Pavlou;Stylianos Georgoulas

  • Affiliations:
  • Centre for Communication Systems Research, University of Surrey, Guildford, Surrey GU2 7XH, United Kingdom;Centre for Communication Systems Research, University of Surrey, Guildford, Surrey GU2 7XH, United Kingdom;Centre for Communication Systems Research, University of Surrey, Guildford, Surrey GU2 7XH, United Kingdom;Centre for Communication Systems Research, University of Surrey, Guildford, Surrey GU2 7XH, United Kingdom;Centre for Communication Systems Research, University of Surrey, Guildford, Surrey GU2 7XH, United Kingdom

  • Venue:
  • Computer Communications
  • Year:
  • 2007

Quantified Score

Hi-index 0.24

Visualization

Abstract

This paper addresses the issue of provisioning end-to-end bandwidth guarantees across multiple Autonomous Systems (ASes). We first review a cascaded model for negotiating and establishing service level agreements for end-to-end bandwidth guarantees between ASes. We then present a network dimensioning system that uses traffic engineering mechanisms for the provisioning of end-to-end bandwidth guarantees. The network dimensioning system solves two problems: (1) the economic problem of how to determine the optimum amount of bandwidth that needs to be purchased from adjacent downstream ASes at a minimum total cost; (2) given the available bandwidth resources within and beyond the AS as a result of (1), the engineering problem of how to assign bandwidth guaranteed routes to the predicted traffic while optimizing the network resource utilization. We formulate both as integer-programming problems and prove them to be NP-hard. An efficient genetic algorithm and an efficient greedy-penalty heuristic are, respectively, used to solve the two problems and we show that these perform significantly better than simple heuristic and random approaches.