Effective switching scheduling algorithm using concatenated data block to reduce guard-time for opt-electronic packet switch

T. Kurimoto, E. Oki, K. Nakai, N. Yamanaka

Research output: Contribution to journalConference article

1 Citation (Scopus)

Abstract

A new scheduling algorithm that concatenates data blocks to increase switching throughput is proposed. The algorithm controls the degree of concatenation and reduces the number of switching instances to improve switch utilization. The switch architecture uses a virtual output queue switching architecture where the core switch fabric is an optical matrix switch. The optical matrix switch requires the guard-time overhead needed for optical switch control. By reducing the number of switching instances, guard-time overhead can be reduced and switch utilization can be improved. Computer simulations show that efficiency is dramatically increased and that fairness in terms of data throughput among output ports is achieved.

Original languageEnglish
Pages (from-to)985-989
Number of pages5
JournalIEEE International Conference on Communications
Volume4
Publication statusPublished - 2001 Jan 1
Externally publishedYes
EventInternational Conference on Communications (ICC2001) - Helsinki, Finland
Duration: 2000 Jun 112000 Jun 14

ASJC Scopus subject areas

  • Computer Networks and Communications
  • Electrical and Electronic Engineering

Fingerprint Dive into the research topics of 'Effective switching scheduling algorithm using concatenated data block to reduce guard-time for opt-electronic packet switch'. Together they form a unique fingerprint.

  • Cite this