Share Email Print
cover

Proceedings Paper

Weighted scheduling based on queue length and delay for AOPS
Author(s): Qianbin Chen; Junyu Pang; Huanlin Liu
Format Member Price Non-Member Price
PDF $14.40 $18.00
cover GOOD NEWS! Your organization subscribes to the SPIE Digital Library. You may be able to download this paper for free. Check Access

Paper Abstract

Packet scheduling plays an important role in the asynchronous optical switched networks for node performance. A weighted scheduling algorithm based on the queue length associated with waiting delay was proposed to solve the packet starvation of queue length weighted scheduling for the length variable OPS. The contention is resolved either in wavelength domain by limited range wavelength converters and in time domain by fiber delay lines. The work has contributed with a very powerful scheduling mechanism which reduces resource contention at the asynchronous OPS core nodes and guarantees a reasonable packet delay thanks to its weighted scheduling algorithm based on queue length and waiting delay for variable length OPS network. The scheduler calculates every input ports with N×K virtual output queue (VOQ) weight and schedules the maximal weight queue packets to available output channel. The analysis and simulation results show that the proposed scheduling has high throughput and low packet loss ratio.

Paper Details

Date Published: 19 November 2007
PDF: 8 pages
Proc. SPIE 6783, Optical Transmission, Switching, and Subsystems V, 67833O (19 November 2007); doi: 10.1117/12.746117
Show Author Affiliations
Qianbin Chen, Chongqing Univ. of Posts and Telecommunications (China)
Junyu Pang, Chongqing Univ. of Posts and Telecommunications (China)
Huanlin Liu, Chongqing Univ. of Posts and Telecommunications (China)
Chongqing Univ. (China)


Published in SPIE Proceedings Vol. 6783:
Optical Transmission, Switching, and Subsystems V
Dominique Chiaroni; Wanyi Gu; Ken-ichi Kitayama; Chang-Soo Park, Editor(s)

© SPIE. Terms of Use
Back to Top