Random scheduling based on transmission delay and buffer size for hop-based burst-cluster transmission in OBS networks

摘要

Hop-based burst-cluster transmission improves fairness significantly in OBS ring networks. However, in mesh networks, the overall burst loss probability increases using the method because the transmission of a burst-cluster from an ingress node is often synchronized with a burst-cluster from another ingress node. In order to resolve the synchronization issue, we propose in this article the utilization of random scheduling for hop-based burst-cluster transmission. In random scheduling, the maximum waiting time is determined in advance from the maximum acceptable delay of an IP packet and the buffer size of the ingress node. Every time a burst-cluster is generated, a scheduler derives the actual waiting time at random based on the obtained maximum waiting time. When a timer becomes the actual waiting time, the burst cluster is transmitted from the scheduler. By simulation, we evaluate the effectiveness of random scheduling for NSF-NET. Numerical examples show that the random scheduling can resolve the synchronization issue and can decrease the overall burst loss probability. In addition, it is shown that random scheduling can also improve the fairness significantly.