Fast and Effective Dimensioning Algorithm for End-to-End Optical Burst Switching Networks with ON-OFF Traffic Model

Abstract

Abstract.A novel algorithm for fast dimensioning of end-to-end optical burst switching networks is proposed. The proposed method determines the number of wavelengths for each network link according to the traffic load, the routing algorithm and the required blocking probability per connection. The burst input traffic is modeled by an ON-OFF alternating renewal process, which is more realistic for OBS networks than the typically used Poisson model. Compared to the two most typically used dimensioning approaches, the proposed method results in significant lower wavelength requirements whilst achieving the same target blocking probability. Additionally, the proposed method takes less than one second to dimension the network links which makes it several orders of magnitude faster than the conventional simulation approach.

Joint routing and dimensioning of optical burst switching networks

“…If the acceptable blocking probability is higher than zero, at low traffic loads this dimensioning algorithm requires a lower number of wavelengths than the static approach. It was proposed in [31], where it was shown to perform significantly better than the commonly applied homogenous or static dimensioning schemes.…”

“…It does so by allocating as many wavelengths as required by each network link in accordance with the traffic load, the target blocking probability and the number and length of routes using the link. This algorithm has been shown to achieve network costs of up to 50% lower than those for static or homogenous dimensioning [31]. Therefore, this method will be used in the joint routing and dimensioning (JRD) optimisation model presented here.…”

“…Authors of this article recently proposed a new dimensioning algorithm that overcomes the drawbacks of static and homogenous dimensioning [31]. It does so by allocating as many wavelengths as required by each network link in accordance with the traffic load, the target blocking probability and the number and length of routes using the link.…”

“…The optimisation problem is then solved by formulating an integer linear programming model that takes into account the dynamic nature of burst traffic, the blocking at connection level and the dimensioning method in [31]. The routes thus obtained are stored in a routing table which is searched during on-line operation of the network to rapidly establish/release routes as they are requested/released by the different connections.…”

A method for joint routing, wavelength dimensioning and fault tolerance for any set of simultaneous failures on dynamic WDM optical networks

“…Suppose also that the blocking of links belonging to connection c are independent of each other. This is obviously false in general, but it is an usual and useful trick, and it has been "numerically validated" [54], that is, it leads to very accurate approximations (see below). Under these conditions, we have:…”