Expand this Topic clickable element to expand a topic
Skip to content
Optica Publishing Group
  • Optical Fiber Communications Conference
  • OSA Trends in Optics and Photonics (Optica Publishing Group, 2002),
  • paper ThGG112

A Burst Assembly Algorithm in Optical Burst Switching Networks

Not Accessible

Your library or personal account may give you access

Abstract

Optical WDM network evolves from the traditional IP/ATM/SDH/WDM to IP over WDM network, by eliminating the ATM switching layer and SDH transport layer. In this situation, the current use of the wavelength-routing mechanism for carrying bursty IP traffic will suffer from various drawbacks associated with circuit-switched networks. Wavelength routing results in a low bandwidth utilization if the traffic is bursty and provides a low granularity. But optical packet switching technology is still facing significant cost and technological barriers because of optical Random Access Memory buffer problem and slow switching speed.1 Optical burst switching attracts the spot light because it compromises IPoW circuit switching and pure optical packet switching with limited use of optical buffer. In this paper we propose a new burst assembly algorithm using hysterisis characteristics in the queueing model in the edge node of optical burst switching network. We first discuss the functional model.

© 2002 Optical Society of America

PDF Article
More Like This
QoS Burstification for Optical Burst Switched WDM Networks

M. C. Yuang, J. Shih, and P. L. Tien
ThGG118 Optical Fiber Communication Conference (OFC) 2002

Priority-based wavelength assignment algorithm for burst switched photonic networks

Xi Wang, Hiroyuki Morikawa, and Tomonori Aoyama
ThGG108 Optical Fiber Communication Conference (OFC) 2002

Timescale analysis for wavelength-routed optical burst-switched (WR-OBS) networks

M. Düser, I. de Miguel, P. Bayvel, and D. Wischik
WG7 Optical Fiber Communication Conference (OFC) 2002

Select as filters


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