光突发交换网络中最长队列优先调度组装机制

提出了光突发交换网络中的最长队列优先调度（LQF-SA）机制，将边缘节点的突发组装和突发调度两种技术紧密结合在一起.在现实网络中，业务通常是非均匀分布的，即在某些源宿对之间存在更大的业务流量.仿真结果表明，LQF-SA机制可以很好地完成非均匀分布业务流的组装.即使在均匀分布业务流输入下，LQF-SA机制在突发大小分布、组装效率和突发丢失率等方面也优于已提出的轮询调度组装（RR-SA）机制.

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.