Optical Burst and Packet Switching are being considered as the most promising paradigms to increase bandwidth efficiency in IP over DWDM networks. In both cases, due to statistical multiplexing, a scheduling policy is needed to solve contentions at the node level caused by more than one burst/packet directed to the same output channel. The scheduling may be performed in the wavelength, time and space domains, turning this problem into a choice of the best available resource in the different domains. Because of the very large bandwidth on the wavelength channels, the burst/packet arrival rate at the network nodes is very high and therefore the time available to take the scheduling decision is very limited. As a consequence, whatever scheduling policy is adopted, it must be implemented in an extremely effective way in terms of computational complexity. This paper is focused on a cost-effective solution to the scheduling problem, which is not based on typical search algorithms and whose complexity can be made almost independent of the dimension of the resource set to be searched.

A cost-effective approach to optical packet/burst scheduling

CALLEGATI, FRANCO;CAMPI, ALDO;CERRONI, WALTER
2007

Abstract

Optical Burst and Packet Switching are being considered as the most promising paradigms to increase bandwidth efficiency in IP over DWDM networks. In both cases, due to statistical multiplexing, a scheduling policy is needed to solve contentions at the node level caused by more than one burst/packet directed to the same output channel. The scheduling may be performed in the wavelength, time and space domains, turning this problem into a choice of the best available resource in the different domains. Because of the very large bandwidth on the wavelength channels, the burst/packet arrival rate at the network nodes is very high and therefore the time available to take the scheduling decision is very limited. As a consequence, whatever scheduling policy is adopted, it must be implemented in an extremely effective way in terms of computational complexity. This paper is focused on a cost-effective solution to the scheduling problem, which is not based on typical search algorithms and whose complexity can be made almost independent of the dimension of the resource set to be searched.
Proceedings of IEEE ICC 2007
F. Callegati; A. Campi; W. Cerroni
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.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/11585/37675
 Attenzione

Attenzione! I dati visualizzati non sono stati sottoposti a validazione da parte dell'ateneo

Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 5
  • ???jsp.display-item.citation.isi??? 0
social impact