For Full-Text PDF, please login, if you are a member of IEICE,|
or go to Pay Per View on menu list, if you are a nonmember of IEICE.
Scheduling Algorithm with Consideration to Void Space Reduction in Photonic Packet Switch
Takashi YAMAGUCHI Ken-ichi BABA Masayuki MURATA Ken-ichi KITAYAMA
IEICE TRANSACTIONS on Communications
Publication Date: 2003/08/01
Print ISSN: 0916-8516
Type of Manuscript: Special Section PAPER (Special Issue on Photonic IP Network Technologies for Next Generation Broadband Access)
WDM, photonic packet switch, FDL buffer, variable length size packet, packet scheduling algorithm,
Full Text: PDF(693KB)>>
In this paper, we comparatively evaluate two photonic packet switch architectures with WDM-FDL buffers for synchronized variable length packets. The first one is an output buffer type switch, which stores packets in the FDL buffer attached to each output port. Another is a shared buffer type switch, which stores packets in the shared FDL buffer. The performance of a switch is greatly influenced by its architecture and a packet scheduling algorithm. We compare the performances of these two packet switches by applying different packet scheduling algorithms. Through simulation experiments, we show that each architecture has a parameter region for achieving better performance. For the shared buffer type switch, we found that void space introduces unacceptable performance degradation when the traffic load is high. Accordingly, we propose a void space reduction method. Our simulation results show that our proposed method enables to the shared buffer type switch to outperform the output buffer type switch even under high traffic load conditions.