[an error occurred while processing this directive]
   
 
���¿��ټ��� �߼�����
   ��ҳ  �ڿ�����  ��ί��  Ͷ��ָ��  �ڿ�����  ��������  �� �� ��  ��ϵ����
�������պ����ѧѧ�� 2006, Vol. 32 Issue (03) :311-315    DOI:
���� ����Ŀ¼ | ����Ŀ¼ | ������� | �߼����� << | >>
�����ۻ�ЧӦ�Ĺ⽻������������㷨
������1, �����1, ������2*
1. �������պ����ѧ ������Ϣ����ѧԺ, ���� 100083;
2. ����ң���豸�о���,���� 100854
Novel scheduling algorithm based on packet aggregation effect for optical switches
Xiong Qingxu1, Feng Jinxin1, Wang Fengzhou2*
1. School of Electronics and Information Engineering, Beijing University of Aeronautics and Astronautics, Beijing 100083, China;
2. Institute of Remote-Sensing Equipment, Beijing 100854, China

ժҪ
�����
�������
Download: PDF (493KB)   HTML 1KB   Export: BibTeX or EndNote (RIS)      Supporting Info
ժҪ �⽻�����еĹ�·������Ҫ�ϳ���ʱ��,������ȱ����ǻ���֡��.Ϊ��ߴ���Ч��֡��ͨ���ϴ�,�Ӷ������˹⽻���������еķ����ۻ�ЧӦ.��Ը�ЧӦ,���һ���µķ�������㷨p-LQF(Longest Queue First)+Hold.ͨ����ҵ���������ֽ�õ��û�����, ѡ��ƥ��ռ�������û��������˿�ƥ��.��4×4�˿ڵ�VOQ(Virtual Output Queue)�ṹ�Ĺ⽻������,�ֱ�Ծ��ȡ��Ǿ����Լ��Խ��ߵ�Bernoulli��ON/OFFҵ������˷���.��������ʾ���㷨���ڷ���ǿ��������Ŀɽ���ҵ���ܻ��100%��ͨ����,��ƽ������ʱ�ӽӽ���������������LQF+Hold�㷨,�����Ӷȸ���.���㷨�ܹ��ṩ����֤�Լ����ڹ�ƽ��,ͬʱ����Ӧ����Ķ�̬����.
Service
�ѱ����Ƽ�������
�����ҵ����
�������ù�����
Email Alert
RSS
�����������
�ؼ����� �⽻����   �����Ŷ�   ����   ���齻��     
Abstract�� The packet scheduling in optical switches has to be frame based because the configuration consumes much time. The frame size is usually selected to be large enough in order to improve transmission efficiency, leading packet aggregation effect. With consideration of the packet aggregation effect, a novel packet scheduling algorithm called permutation-based longest queue first+hold (p-LQF+Hold) was proposed. A set of permutations were calculated by using of the traffic requirement matrix. The permutation with the largest matched occupancy was used to find the matching on each frame boundary. Simulation was made on a 4×4 virtual output queue(VOQ) optical switch under uniform, nonuniform and diagonal Bernoulli and ON/OFF traffic patterns, respectively. The simulation results show p-LQF+Hold can achieve 100% throughput under any admissible traffic that satisfies the strong law of large numbers, and has close to or even lower average packet delay than the popular LQF+Hold algorithm. p-��LQF+��Hold can guarantees bandwidth requirement and short-term fairness and efficiently accommodate the dynamical packet arrivals.
Keywords�� optical switches   queuing networks   scheduling   packet switching     
Received 2005-06-07;
About author: ������(1965-),��,�����ϲ���,������,qxxiong@ieee.org.
���ñ���:   
������, �����, ������.�����ۻ�ЧӦ�Ĺ⽻������������㷨[J]  �������պ����ѧѧ��, 2006,V32(03): 311-315
Xiong Qingxu, Feng Jinxin, Wang Fengzhou.Novel scheduling algorithm based on packet aggregation effect for optical switches[J]  JOURNAL OF BEIJING UNIVERSITY OF AERONAUTICS AND A, 2006,V32(03): 311-315
���ӱ���:  
http://bhxb.buaa.edu.cn//CN/     ��     http://bhxb.buaa.edu.cn//CN/Y2006/V32/I03/311
Copyright 2010 by �������պ����ѧѧ��