COD: Alternative architectures for high speed packet switching

R. L. Cruz, Jung Tsung Tsai

Research output: Contribution to journalArticle

70 Citations (Scopus)

Abstract

Current architectures for packet switches are approaching the limit of electronic switching speed. This raises the question of how best to utilize recent advances in photonic technology in order to enable higher speed operation. In this paper, we introduce cascaded optical delay line (COD) architectures for ultra high speed packet switching. The COD architectures utilize an extremely simple distributed electronic control algorithm to configure the states of 2 × 2 photonic switches and use optical fiber delay lines to temporarily buffer packets if necessary. The simplicity of the architectures may also make them suitable for "lightweight" all-electronic implementations. For optical implementations, the number of 2 × 2 photonic switches used is a significant factor determining cost. We present a "baseline" architecture for a 2 × 2 buffered packet switch that is work conserving (i.e. nonidling) and has the first-in, first-out (FIFO) property. If the arrival processes are independent and without memory, the maximum utilization factor is ρ, and the maximum acceptable packet loss probability is ε, then the required number of 2 × 2 photonic switches is O(log(ε)/log(γ)), where γ = ρ2 /(ρ2 + 4 - 4ρ). If we modify the baseline architecture by changing the delay line lengths then the system is no longer work conserving and loses the FIFO property, but the required number of 2 × 2 photonic switches is reduced to O(log [log (ε)/ log (γ)]). The required number of 2 × 2 photonic switches is essentially insensitive to the distribution of packet arrivals, but long delay lines are required for bursty traffic.

Original languageEnglish
Pages (from-to)11-21
Number of pages11
JournalIEEE/ACM Transactions on Networking
Volume4
Issue number1
DOIs
Publication statusPublished - 1996 Dec 1

Fingerprint

Packet switching
Optical switches
Electric delay lines
Switches
Packet loss
Photonics
Optical fibers
Data storage equipment
Costs

ASJC Scopus subject areas

  • Software
  • Computer Science Applications
  • Computer Networks and Communications
  • Electrical and Electronic Engineering

Cite this

COD : Alternative architectures for high speed packet switching. / Cruz, R. L.; Tsai, Jung Tsung.

In: IEEE/ACM Transactions on Networking, Vol. 4, No. 1, 01.12.1996, p. 11-21.

Research output: Contribution to journalArticle

@article{8ef8d43f0d044763b4a230fcb89fc957,
title = "COD: Alternative architectures for high speed packet switching",
abstract = "Current architectures for packet switches are approaching the limit of electronic switching speed. This raises the question of how best to utilize recent advances in photonic technology in order to enable higher speed operation. In this paper, we introduce cascaded optical delay line (COD) architectures for ultra high speed packet switching. The COD architectures utilize an extremely simple distributed electronic control algorithm to configure the states of 2 × 2 photonic switches and use optical fiber delay lines to temporarily buffer packets if necessary. The simplicity of the architectures may also make them suitable for {"}lightweight{"} all-electronic implementations. For optical implementations, the number of 2 × 2 photonic switches used is a significant factor determining cost. We present a {"}baseline{"} architecture for a 2 × 2 buffered packet switch that is work conserving (i.e. nonidling) and has the first-in, first-out (FIFO) property. If the arrival processes are independent and without memory, the maximum utilization factor is ρ, and the maximum acceptable packet loss probability is ε, then the required number of 2 × 2 photonic switches is O(log(ε)/log(γ)), where γ = ρ2 /(ρ2 + 4 - 4ρ). If we modify the baseline architecture by changing the delay line lengths then the system is no longer work conserving and loses the FIFO property, but the required number of 2 × 2 photonic switches is reduced to O(log [log (ε)/ log (γ)]). The required number of 2 × 2 photonic switches is essentially insensitive to the distribution of packet arrivals, but long delay lines are required for bursty traffic.",
author = "Cruz, {R. L.} and Tsai, {Jung Tsung}",
year = "1996",
month = "12",
day = "1",
doi = "10.1109/90.503758",
language = "English",
volume = "4",
pages = "11--21",
journal = "IEEE/ACM Transactions on Networking",
issn = "1063-6692",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
number = "1",

}

TY - JOUR

T1 - COD

T2 - Alternative architectures for high speed packet switching

AU - Cruz, R. L.

AU - Tsai, Jung Tsung

PY - 1996/12/1

Y1 - 1996/12/1

N2 - Current architectures for packet switches are approaching the limit of electronic switching speed. This raises the question of how best to utilize recent advances in photonic technology in order to enable higher speed operation. In this paper, we introduce cascaded optical delay line (COD) architectures for ultra high speed packet switching. The COD architectures utilize an extremely simple distributed electronic control algorithm to configure the states of 2 × 2 photonic switches and use optical fiber delay lines to temporarily buffer packets if necessary. The simplicity of the architectures may also make them suitable for "lightweight" all-electronic implementations. For optical implementations, the number of 2 × 2 photonic switches used is a significant factor determining cost. We present a "baseline" architecture for a 2 × 2 buffered packet switch that is work conserving (i.e. nonidling) and has the first-in, first-out (FIFO) property. If the arrival processes are independent and without memory, the maximum utilization factor is ρ, and the maximum acceptable packet loss probability is ε, then the required number of 2 × 2 photonic switches is O(log(ε)/log(γ)), where γ = ρ2 /(ρ2 + 4 - 4ρ). If we modify the baseline architecture by changing the delay line lengths then the system is no longer work conserving and loses the FIFO property, but the required number of 2 × 2 photonic switches is reduced to O(log [log (ε)/ log (γ)]). The required number of 2 × 2 photonic switches is essentially insensitive to the distribution of packet arrivals, but long delay lines are required for bursty traffic.

AB - Current architectures for packet switches are approaching the limit of electronic switching speed. This raises the question of how best to utilize recent advances in photonic technology in order to enable higher speed operation. In this paper, we introduce cascaded optical delay line (COD) architectures for ultra high speed packet switching. The COD architectures utilize an extremely simple distributed electronic control algorithm to configure the states of 2 × 2 photonic switches and use optical fiber delay lines to temporarily buffer packets if necessary. The simplicity of the architectures may also make them suitable for "lightweight" all-electronic implementations. For optical implementations, the number of 2 × 2 photonic switches used is a significant factor determining cost. We present a "baseline" architecture for a 2 × 2 buffered packet switch that is work conserving (i.e. nonidling) and has the first-in, first-out (FIFO) property. If the arrival processes are independent and without memory, the maximum utilization factor is ρ, and the maximum acceptable packet loss probability is ε, then the required number of 2 × 2 photonic switches is O(log(ε)/log(γ)), where γ = ρ2 /(ρ2 + 4 - 4ρ). If we modify the baseline architecture by changing the delay line lengths then the system is no longer work conserving and loses the FIFO property, but the required number of 2 × 2 photonic switches is reduced to O(log [log (ε)/ log (γ)]). The required number of 2 × 2 photonic switches is essentially insensitive to the distribution of packet arrivals, but long delay lines are required for bursty traffic.

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

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

U2 - 10.1109/90.503758

DO - 10.1109/90.503758

M3 - Article

AN - SCOPUS:0030083961

VL - 4

SP - 11

EP - 21

JO - IEEE/ACM Transactions on Networking

JF - IEEE/ACM Transactions on Networking

SN - 1063-6692

IS - 1

ER -