Longest Queue First Scheduled Assembly for Optical Burst Switching Networks
光突发交换网络中最长队列优先调度组装机制

The longest queue first scheduled assembly (LQF-SA) mechanism was proposed, where burst assembly and burst scheduling for optical bu rst-switching networks were integrated.The proposed mechanism, ingress edge nod es have been multipled assembly queues where IP packets were stored according to their egresses and QoS classes. Among these queues, the longest one was schedul ed to assemble bursts by a scheduler at a fixed interval. In real networks, traf fic usually distributed non-uniformly and there existed heavier traffic between some source and destination pairs. Simulation results show that LQF-SA could a dapt 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 te rms of burst size distribution, assembly efficiency and burst loss rate.