Condicions d'accésAccés restringit per política de l'editorial
Loss-free schemes are defined to ensure successful packet/burst transmissions in optical packet/burst
switching networks. To this end, they rely on a collision-free routing and wavelength assignment (CF-RWA)
scheme combined with simple contention resolution mechanisms that guarantee the absence of losses in
intermediate links. Here, the CF-RWA problem is studied. In particular, by using graph theory, the problem of
finding CF-RWA schemes that minimise the number of wavelengths to serve a given traffic matrix is set. The
problem is simplified when it is formulated by using pre-defined sets of non-colliding paths. Within this
framework, the problem is shown to be equivalent to finding a given vertex-set colouring of the so-called
restriction digraph. Here, two heuristic algorithms are proposed to obtain such vertex-set colourings. One of
them provides a suitable CF-RWA without having to solve the minimisation problem. By way of example, the
proposed method is applied to the NSFNet and the EON network providing quasi-optimal results.
CitacióAgustí, A.; Cervelló Pastor, C.; Fiol, M. A. Load-balanced wavelength assignment strategies for optical burst/packet switching networks. "IET communications", Març 2009, vol. 3, núm. 3, p. 381-390.