A scheduling algorithm minimizing voids generated by arriving bursts in optical burst switched WDM network

Masanori Iizuka, Makoto Sakuta, Yoshiyuki Nishino, Iwao Sasase

Research output: Contribution to conferencePaper

Abstract

We propose a scheduling algorithm minimizing voids generated by arriving bursts in optical burst switched WDM network. In the proposed scheduling algorithm, when the burst which has arrived at optical core router at a certain time can be transmitted in some data channels by using the unused data channel capacity(it is called void), our proposed scheduling algorithm selects the data channel in which a void newly being generated after the burst transmission becomes minimum. We compare the performance of our proposed scheduling algorithm with that of the conventional one with respect to burst loss ratio by computer simulations. It is shown that our proposed algorithm can improve burst loss ratio.

Original languageEnglish
Pages2736-2740
Number of pages5
Publication statusPublished - 2002 Dec 1
EventGLOBECOM'02 - IEEE Global Telecommunications Conference - Taipei, Taiwan, Province of China
Duration: 2002 Nov 172002 Nov 21

Other

OtherGLOBECOM'02 - IEEE Global Telecommunications Conference
CountryTaiwan, Province of China
CityTaipei
Period02/11/1702/11/21

    Fingerprint

ASJC Scopus subject areas

  • Electrical and Electronic Engineering
  • Global and Planetary Change

Cite this

Iizuka, M., Sakuta, M., Nishino, Y., & Sasase, I. (2002). A scheduling algorithm minimizing voids generated by arriving bursts in optical burst switched WDM network. 2736-2740. Paper presented at GLOBECOM'02 - IEEE Global Telecommunications Conference, Taipei, Taiwan, Province of China.