A novel burst assembly scheme for optical burst switching networks

Proposed in this paper is a novel burst assembly scheme called longest queue first scheduled assembly (LQF-SA) mechanism, where burst assembly and burst scheduling for optical burst-switching networks are integrated. In the proposed mechanism, ingress edge nodes have multiple assembly queues where IP packets are stored according to their egresses and QoS classes. Among these queues, the longest one is scheduled to assemble bursts by a scheduler at a fixed interval. In real networks, traffic usually distributes non-uniformly and there exists heavier traffic between some source and destination pairs. Simulation results show that LQF-SA could adapt well to the non-uniform traffic profiles. Furthermore, even under uniform traffic, LQF-SA is also super to round-robin scheduled assembly (RR-SA) in terms of burst size distribution, assembly efficiency, and burst loss rate.