%0 Journal Article
%T Longest Queue First Scheduled Assembly for Optical Burst Switching Networks<br>光突发交换网络中最长队列优先调度组装机制
%A Lü Zhao
%A Wang Hongbo
%A Zhang Min
%A Ye Peida
%A <br>吕召彪
%A 王洪波
%A 张民
%A 叶培大
%J 光子学报
%D 2006
%I 
%X 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.
%K Optical burst switching
%K Burst assembly
%K Burst scheduling
%K Non-uniform traffic
%K Longest queue first<br>光突发交换
%K 突发组装
%K 突发调度
%K 非均匀业务
%K 最长队列优先
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=6E709DC38FA1D09A4B578DD0906875B5B44D4D294832BB8E&cid=47EA7CFDDEBB28E0&jid=9F6139E34DAA109F9C104697BF49FC39&aid=6611CCB2B225744F&yid=37904DC365DD7266&vid=6209D9E8050195F5&iid=9CF7A0430CBB2DFD&sid=2A46E9718B53247E&eid=9129323FE7AA9847&journal_id=1004-4213&journal_name=光子学报&referenced_num=5&reference_num=12