A weightiest Scheduling Based on Queue Length and Queue Delay Restriction for Asynchronous Optical Packet Switch

Abstract

Packet scheduling plays an important role in the asynchronous optical switched node. An intelligence scheduling algorithm can reduce packet loss probability and increase the throughput to guarantee the quality of service. A weighted scheduling algorithm based on the queue length associated with waiting delay restriction was proposed to solve the problem of packet queue starvation and time delay. The work has contributed with a much 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 port with NxK 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.