Fast scheduling algorithms are needed to implement optical burst or packet switching using the wavelength and time domains for congestion resolution. Because of the very large bandwidth of the optical links the burst/packet arrival rate at the network nodes is very large and therefore the time required to performing the scheduling decisions must be limited to very low values. This paper suggests an original formulation of the scheduling problem and a consequent implementation that proves to be very efficient, with a cost as low as a few computational units.
Titolo: | Efficient Implementation of Scheduling Algorithms for Optical Burst/Packet Switching |
Autore/i: | CALLEGATI, FRANCO; CAMPI, ALDO; CERRONI, WALTER |
Autore/i Unibo: | |
Anno: | 2006 |
Titolo del libro: | Proceedings of ONDM 2006 |
Abstract: | Fast scheduling algorithms are needed to implement optical burst or packet switching using the wavelength and time domains for congestion resolution. Because of the very large bandwidth of the optical links the burst/packet arrival rate at the network nodes is very large and therefore the time required to performing the scheduling decisions must be limited to very low values. This paper suggests an original formulation of the scheduling problem and a consequent implementation that proves to be very efficient, with a cost as low as a few computational units. |
Data prodotto definitivo in UGOV: | 14-feb-2007 |
Appare nelle tipologie: | 4.01 Contributo in Atti di convegno |
File in questo prodotto:
Eventuali allegati, non sono esposti
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.