检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:李秀芹[1,2] 兰巨龙[2] 杨喜亮[1] 程东年[2]
机构地区:[1]华北水利水电学院软件学院,郑州450045 [2]解放军信息工程大学国家数字交换系统工程技术研究中心,郑州450002
出 处:《北京邮电大学学报》2011年第4期23-27,33,共6页Journal of Beijing University of Posts and Telecommunications
基 金:国家重点基础研究发展计划项目(2007CB307102);国家高技术研究发展计划项目(2009AA01A346);河南省科技攻关项目(092102210059)
摘 要:在对现有并行分组交换(PPS)分析的基础上,将标识的概念引入交换结构,提出了一种基于标识支持区分服务质量(QoS)的PPS调度机制.该机制以业务类为单位管理网络数据流,采用按序排队的思想解决保序问题,在汇聚模块设置少量缓存,采用双指针轮询算法实现区分QoS保障,保证了交换对高层不同业务类的有效支持.仿真实验结果表明,该机制在满负载情况下可获得高达99%以上的吞吐率,在过载情况下根据预定带宽分配输出链路带宽,确保分组具有时延的上界,能够比较均衡地将负载分配到各中间交换平面.With in-depth study and analysis about the existing parallel packet switching (PPS) scheduling mechanism, a PPS scheduling for differentiated quality of service (QoS) based on identifier is proposed which is introduced to switch fabric. The network data flow in denomination of traffic classes is managed by the mechanism. The packets sequence for each traffic stream by queuing in order is ensured by the scheme. At the same time, if set a small amount of buffer in the multiplexer, double pointer round robin scheduling algorithm could be adopted to provide differentiated QoS guarantee for different traffics, which ensured the switch provide effective support for different high-level traffic classes. Simulation indicates that the throughput of the mechanism reaches up to 99% at full load, and can be accordance to the reservation bandwidth to allocate the bandwidth of output links, and ensure that packets have an upper delay bound, and also can balance the load to the exchange planes.
关 键 词:标识 基于联合输入交叉节点排队的并行交换 区分服务质量 信元按序发送 调度算法
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:3.132.215.146