Delay-bound guarantee in combined input-output buffered switches

H. Jonathan Chao, Li Sheng Chen

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

Abstract

CIOB (Combined Input-Output Buffered) switches with a moderate speedup have been widely considered as the most feasible solution for large-capacity switches. In this paper, we adopt the hierarchical link sharing (HLS) algorithm in non-blocking CIOB switches to guarantee delay bound that is independent of the switch size. We also propose a feasible architecture to implement the HLS algorithm in the switch, which can accommodate the packet carried over a 10 G bps line without a speedup requirement. Furthermore, we design a new Serial Comparator to find minimum time-stamp values.

Original languageEnglish (US)
Title of host publicationConference Record / IEEE Global Telecommunications Conference
PublisherIEEE
Pages515-525
Number of pages11
Volume1
StatePublished - 2000

Fingerprint

Switches

ASJC Scopus subject areas

  • Electrical and Electronic Engineering
  • Global and Planetary Change

Cite this

Chao, H. J., & Chen, L. S. (2000). Delay-bound guarantee in combined input-output buffered switches. In Conference Record / IEEE Global Telecommunications Conference (Vol. 1, pp. 515-525). IEEE.

Delay-bound guarantee in combined input-output buffered switches. / Chao, H. Jonathan; Chen, Li Sheng.

Conference Record / IEEE Global Telecommunications Conference. Vol. 1 IEEE, 2000. p. 515-525.

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

Chao, HJ & Chen, LS 2000, Delay-bound guarantee in combined input-output buffered switches. in Conference Record / IEEE Global Telecommunications Conference. vol. 1, IEEE, pp. 515-525.
Chao HJ, Chen LS. Delay-bound guarantee in combined input-output buffered switches. In Conference Record / IEEE Global Telecommunications Conference. Vol. 1. IEEE. 2000. p. 515-525
Chao, H. Jonathan ; Chen, Li Sheng. / Delay-bound guarantee in combined input-output buffered switches. Conference Record / IEEE Global Telecommunications Conference. Vol. 1 IEEE, 2000. pp. 515-525
@inproceedings{f46f3b6f5fea450d917ecb8371763e67,
title = "Delay-bound guarantee in combined input-output buffered switches",
abstract = "CIOB (Combined Input-Output Buffered) switches with a moderate speedup have been widely considered as the most feasible solution for large-capacity switches. In this paper, we adopt the hierarchical link sharing (HLS) algorithm in non-blocking CIOB switches to guarantee delay bound that is independent of the switch size. We also propose a feasible architecture to implement the HLS algorithm in the switch, which can accommodate the packet carried over a 10 G bps line without a speedup requirement. Furthermore, we design a new Serial Comparator to find minimum time-stamp values.",
author = "Chao, {H. Jonathan} and Chen, {Li Sheng}",
year = "2000",
language = "English (US)",
volume = "1",
pages = "515--525",
booktitle = "Conference Record / IEEE Global Telecommunications Conference",
publisher = "IEEE",

}

TY - GEN

T1 - Delay-bound guarantee in combined input-output buffered switches

AU - Chao, H. Jonathan

AU - Chen, Li Sheng

PY - 2000

Y1 - 2000

N2 - CIOB (Combined Input-Output Buffered) switches with a moderate speedup have been widely considered as the most feasible solution for large-capacity switches. In this paper, we adopt the hierarchical link sharing (HLS) algorithm in non-blocking CIOB switches to guarantee delay bound that is independent of the switch size. We also propose a feasible architecture to implement the HLS algorithm in the switch, which can accommodate the packet carried over a 10 G bps line without a speedup requirement. Furthermore, we design a new Serial Comparator to find minimum time-stamp values.

AB - CIOB (Combined Input-Output Buffered) switches with a moderate speedup have been widely considered as the most feasible solution for large-capacity switches. In this paper, we adopt the hierarchical link sharing (HLS) algorithm in non-blocking CIOB switches to guarantee delay bound that is independent of the switch size. We also propose a feasible architecture to implement the HLS algorithm in the switch, which can accommodate the packet carried over a 10 G bps line without a speedup requirement. Furthermore, we design a new Serial Comparator to find minimum time-stamp values.

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

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

M3 - Conference contribution

AN - SCOPUS:0034482324

VL - 1

SP - 515

EP - 525

BT - Conference Record / IEEE Global Telecommunications Conference

PB - IEEE

ER -