標題: Pseudo-Banyan Optical WDM Packet Switching System With Near-Optimal Packet Scheduling
作者: Yuang, Maria C.
Tien, Po-Lung
Lin, Shih-Hsuan
資訊工程學系
電信工程研究所
Department of Computer Science
Institute of Communications Engineering
關鍵字: Optical packet switching (OPS);wavelength division multiplexing (WDM);fiber delay line (FDL);Banyan network;packet scheduling
公開日期: 1-八月-2009
摘要: We present a novel pseudo-Banyan optical packet switching system (SBOPSS) for optical wavelength division multiplexing (WDM) networks. The system includes a group of pseudo-Banyan space switches together with single-stage downsized fiber-delay-line-based optical buffers. SBOPSS is scalable, with the result that each pseudo-Banyan space switch performs packet switching only for a cluster of wavelengths. The downsized optical buffers that are shared by output ports via the use of a small number of internal wavelengths result in efficient reduction in packet loss. Essentially, SBOPSS employs a packet scheduling algorithm, referred to as the parallel and incremental packet scheduler (PIPS). Given a set of newly arriving packets per time slot, PIPS determines a maximum number of valid paths (packets) to be scheduled with the current buffers' state taken into account. The algorithm aims at maximizing the system throughput subject to satisfying three constraints, which are switch-contention free, buffer-contention free, and sequential delivery. Significantly, we prove that PIPS is incremental in the sense that the computed-path sets are monotonically non-decreasing over time. We then propose a hardware parallel system architecture for the implementation of PIPS. As is shown, PIPS achieves a near-optimal solution with an exceptionally low computational complexity, O, (|P| X log(2), NMW)), where P is the newly-arriving-packet set, N the number of input ports, and M and W the numbers of internal and external wavelengths, respectively. From simulation results that pit the PIPS algorithm against four other algorithms, we show that PIPS outperforms these algorithms on both system throughput and computational complexity.
URI: http://dx.doi.org/10.1364/JOCN.1.0000B1
http://hdl.handle.net/11536/6927
ISSN: 1943-0620
DOI: 10.1364/JOCN.1.0000B1
期刊: JOURNAL OF OPTICAL COMMUNICATIONS AND NETWORKING
Volume: 1
Issue: 3
起始頁: B1
結束頁: B14
顯示於類別:期刊論文


文件中的檔案:

  1. 000270408000002.pdf