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

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

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

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
Title of host publicationIEEE International Conference on Communications
Pages985-989
Number of pages5
Volume4
Publication statusPublished - 2001
Externally publishedYes
EventInternational Conference on Communications (ICC2001) - Helsinki, Finland
Duration: 2000 Jun 112000 Jun 14

Other

OtherInternational Conference on Communications (ICC2001)
CountryFinland
CityHelsinki
Period00/6/1100/6/14

Fingerprint

Scheduling algorithms
Switches
Throughput
Optical switches
Computer simulation

ASJC Scopus subject areas

  • Media Technology

Cite this

Kurimoto, T., Oki, E., Nakai, K., & Yamanaka, N. (2001). Effective switching scheduling algorithm using concatenated data block to reduce guard-time for opt-electronic packet switch. In IEEE International Conference on Communications (Vol. 4, pp. 985-989)

Effective switching scheduling algorithm using concatenated data block to reduce guard-time for opt-electronic packet switch. / Kurimoto, T.; Oki, E.; Nakai, K.; Yamanaka, Naoaki.

IEEE International Conference on Communications. Vol. 4 2001. p. 985-989.

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

Kurimoto, T, Oki, E, Nakai, K & Yamanaka, N 2001, Effective switching scheduling algorithm using concatenated data block to reduce guard-time for opt-electronic packet switch. in IEEE International Conference on Communications. vol. 4, pp. 985-989, International Conference on Communications (ICC2001), Helsinki, Finland, 00/6/11.
Kurimoto T, Oki E, Nakai K, Yamanaka N. Effective switching scheduling algorithm using concatenated data block to reduce guard-time for opt-electronic packet switch. In IEEE International Conference on Communications. Vol. 4. 2001. p. 985-989
Kurimoto, T. ; Oki, E. ; Nakai, K. ; Yamanaka, Naoaki. / Effective switching scheduling algorithm using concatenated data block to reduce guard-time for opt-electronic packet switch. IEEE International Conference on Communications. Vol. 4 2001. pp. 985-989
@inproceedings{a7116470164b4961826718d0d222c3c4,
title = "Effective switching scheduling algorithm using concatenated data block to reduce guard-time for opt-electronic packet switch",
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.",
author = "T. Kurimoto and E. Oki and K. Nakai and Naoaki Yamanaka",
year = "2001",
language = "English",
volume = "4",
pages = "985--989",
booktitle = "IEEE International Conference on Communications",

}

TY - GEN

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

AU - Kurimoto, T.

AU - Oki, E.

AU - Nakai, K.

AU - Yamanaka, Naoaki

PY - 2001

Y1 - 2001

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=0034858532&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0034858532&partnerID=8YFLogxK

M3 - Conference contribution

VL - 4

SP - 985

EP - 989

BT - IEEE International Conference on Communications

ER -