The input-buffered wavelength-routed (IBWR) switch is a scalable switch fabric for optical packet switching (OPS) networks. In synchronous operation, when optical packets are of a fixed duration and aligned at switch inputs, the scheduling of this architecture can be characterised by a type of bipartite graph matching problem. This challenges the design of feasible algorithms in terms of implementation complexity and response time. A previous work presented and evaluated the insistent parallel desynchronized block matching (I-PDBM) algorithm for the IBWR switch. I-PDBM is a parallel iterative scheduler with a good performance and a simple hardware implementation. However, the algorithm does not maintain the packet sequence. In this paper, we present the I-PDBM algorithm with packet ordering (OI-PDBM), which prevents mis-sequencing and behaves as I-PDBM in terms of delay, buffer requirements and convergence speed.
Guaranteeing packet order in IBWR optical packet switches with parallel iterative schedulers / M. Rodelgo-Lacruz; P. Pavon-Marino; F. J. Gonzalez-Castano; J. Garcıa-Haro; C. Lopez-Bravo; J. Veiga-Gontan; F. Gil-Castineira; C. Raffaelli. - In: EUROPEAN TRANSACTIONS ON TELECOMMUNICATIONS. - ISSN 1124-318X. - STAMPA. - 20:(2009), pp. 734-745. [10.1002/ett.1365]
Guaranteeing packet order in IBWR optical packet switches with parallel iterative schedulers
RAFFAELLI, CARLA
2009
Abstract
The input-buffered wavelength-routed (IBWR) switch is a scalable switch fabric for optical packet switching (OPS) networks. In synchronous operation, when optical packets are of a fixed duration and aligned at switch inputs, the scheduling of this architecture can be characterised by a type of bipartite graph matching problem. This challenges the design of feasible algorithms in terms of implementation complexity and response time. A previous work presented and evaluated the insistent parallel desynchronized block matching (I-PDBM) algorithm for the IBWR switch. I-PDBM is a parallel iterative scheduler with a good performance and a simple hardware implementation. However, the algorithm does not maintain the packet sequence. In this paper, we present the I-PDBM algorithm with packet ordering (OI-PDBM), which prevents mis-sequencing and behaves as I-PDBM in terms of delay, buffer requirements and convergence speed.I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.