A scheduling algorithm for reducing unused timeslots by considering head gap and tail gap in Time Sliced Optical Burst Switched networks

Takanori Ito, Daisuke Ishii, Kohei Okazaki, Naoaki Yamanaka, Iwao Sasase

Research output: Chapter in Book/Report/Conference proceedingConference contribution

2 Citations (Scopus)

Abstract

We propose a scheduling algorithm for reducing unused timeslots by considering head gap and tail gap newly generated by assigning a data burst in order to improve the burst loss probability and the throughput performances in Time Sliced Optical Burst Switched (TSOBS) networks. The proposed scheduling algorithm selects the timeslot in which either head gap or tail gap newly generated becomes the minimum. We show that the proposed scheduling algorithm can improve the burst loss probability and the throughput performances as compared with the conventional one.

Original languageEnglish
Title of host publicationOptical Networks and Technologies - IFIP TC6/WG6.10 1st Optical Networks and Technologies Conference, OpNeTec 2004
PublisherSpringer New York LLC
Pages79-86
Number of pages8
ISBN (Print)0387231773, 9780387231778
DOIs
Publication statusPublished - 2005
EventIFIP TC6/WG6.10 1st Optical Networks and Technologies Conference, OpNeTec 2004 - Pisa, Italy
Duration: 2004 Oct 182004 Oct 20

Publication series

NameIFIP Advances in Information and Communication Technology
Volume164
ISSN (Print)1868-4238

Other

OtherIFIP TC6/WG6.10 1st Optical Networks and Technologies Conference, OpNeTec 2004
Country/TerritoryItaly
CityPisa
Period04/10/1804/10/20

ASJC Scopus subject areas

  • Information Systems
  • Computer Networks and Communications
  • Information Systems and Management

Fingerprint

Dive into the research topics of 'A scheduling algorithm for reducing unused timeslots by considering head gap and tail gap in Time Sliced Optical Burst Switched networks'. Together they form a unique fingerprint.

Cite this