Expand this Topic clickable element to expand a topic
Skip to content
Optica Publishing Group
  • Journal of Lightwave Technology
  • Vol. 16,
  • Issue 10,
  • pp. 1757-
  • (1998)

The "Packing" and the "Scheduling Packet" Switch Architectures for Almost All-Optical Lossless Networks

Not Accessible

Your library or personal account may give you access


This paper proposes two almost all-optical packet switch architectures, called the "packing switch" and the "scheduling switch" architecture, which when combined with appropriate wait-for-reservation or tell-and-go connection and flow control protocols provide lossless communication for traffic that satisfies certain smoothness properties. Both switch architectures preserve the order of packets that use a given input-output pair, and are consistent with virtual circuit switching. The scheduling switch requires 2k\log T + k^2 two-state elementary switches (or 2k\log T + 2k\log k elementary switches, if a different version is used) where k is the number of inputs and T is a parameter that measures the allowed burstiness of the traffic. The packing switch requires very little processing of the packet header, and uses k^2\log T + k\log k two-state switches. We also examine the suitability of the proposed architectures for the design of circuit switched networks. We find that the scheduling switch combines low hardware cost with little processing requirements at the nodes, and is an attractive architecture for both packet-switched and circuit-switched high-speed networks.


PDF Article

Cited By

You do not have subscription access to this journal. Cited by links are available to subscribers only. You may subscribe either as an Optica member, or as an authorized user of your institution.

Contact your librarian or system administrator
Login to access Optica Member Subscription

Select as filters

Select Topics Cancel
© Copyright 2023 | Optica Publishing Group. All Rights Reserved