共查询到20条相似文献,搜索用时 156 毫秒
1.
基于联合输入交叉点排队(CICQ,combined input and cross-point queuing)交换结构探讨了单多播混合调度的公平性问题,提出了能够为单多播业务提供混合公平性的CICQ理想调度模型。基于理想调度模型,提出了逼近理想调度模型的MUMF(mixed uni-and multicast fair)调度算法,MUMF调度算法采用了分级和层次化的公平调度机制,通过输入调度和交叉点调度确保单多播业务混合调度的公平性。MUMF交换机制的每个输入、输出端口可独立地进行分组交换,具有良好可扩展特性。最后,基于SPES(switching performance evaluation system)的性能仿真结果表明MUMF调度算法具有良好的时延、公平性和吞吐量性能。 相似文献
2.
针对现有联合输入交叉点排队交换结构(CICQ,Combined Input and Cross-point Queuing)调度策略无法提供基于"流"的服务质量保障,探讨了在CICQ交换结构实施基于流调度的可能性,提出一种能够为到达流提供公平服务的分层混合公平服务调度策略—LHFS(Layered and Hybrid Fair Scheduling).LHFS对每个输入、输出端口可独立地进行变长分组交换,其算法复杂度为O(1),具有良好可扩展特性.理论分析结果表明,LHFS能够为业务流提供时延上限和公平性保障.最后,基于SPES(Switching Performance Evaluation System)仿真系统对LHFS的性能进行了评估. 相似文献
3.
本文提出一种新的输入排队crossbar调度算法——WMFS(weighted max-min fair scheduling)算法,可以为各个竞争的流提供近似的归一化公平服务,保证了带宽分配的加权max-min公平性.另外,仿真结果表明在均匀业务流到达情况下,WMFS具有100%的吞吐量和良好的时延性能. 相似文献
4.
5.
基于Crossbar的可重构网络输入排队分域调度研究 总被引:1,自引:0,他引:1
为解决传统网络技术体系中交换结构无法满足大量差异化业务规模化应用的问题,本文基于可重构网络技术体系,采用选择关闭部分Crossbar交叉节点的分域模型,提出了分域调度的思想,分析并推导了承载组内的SDRR调度算法和域内最长队列优先调度算法。最后采用交换性能仿真平台对该调度算法进行了复杂度和时延的仿真比较,结果表明:分域调度的最长队列优先算法比一般最长队列优先算法相对复杂度低,且随着调度域个数增加,相对复杂度降低。在相同业务源输入条件下,Crossbar三分域调度算法的时延小于非分域调度算法的时延,接近公平输出排队调度算法的时延。 相似文献
6.
该文提出了一种新的并行分组交换(PPS)网络调度算法。该算法通过在解复用器处采用以变长分组为业务分配单元的方式消除了信元的乱序问题;通过采用Credit机制进行业务分配,实现了业务到各个交换平面完全公平的分配;各个并行交换单元采用组合输入输出排队,降低了对缓存和交换平面的加速要求,同时可以充分利用现有单Crossbar网络调度算法的研究成果。文中证明了该算法对业务分配的公平性,对高速缓存的需求量以及整个网络的稳定性,仿真进一步证明了该算法具有良好性能。 相似文献
7.
服务质量(QoS)是目前网络应用研究的一个热点。由于低速链路在当前整个网络中占有相当大的比例,因此研究如何在低速链路上为用户提供具有QoS保证的实时业务已经成为一个重要的课题,其中采取何种调度算法则是实现QoS保证的关键因素之一。该文根据低速链路的特点,提出了一种适合实时分组转发的公平排队调度算法实时补偿型差额循环调度(RCDRR)算法,并用ns2软件对RCDRR算法和DRR算法进行了模拟对比。实验及仿真结果表明: RCDRR调度算法具有公平性好、算法复杂度低、可以降低实时分组在低速链路下的排队时延等特点。 相似文献
8.
CDMA2000 1xEV-DO中的分组调度算法 总被引:1,自引:0,他引:1
移动通信系统需要更好地支持分组数据业务,并满足高速分组数据业务的服务质置要求。这可以通过采用好的调度算法提高平均业务速率和系统整体稳定性实现。针对CDMA2000 1x EV-DO系统的有代表性的调度算法有3种:正比公平算法、速率受限的最大载干比算法、加权公平排队-正比公平(WFQ-PF)联合算法。正比公平调度算法是一种算法简单实用的调度方案,但不能满足用户的服务质景保证;速率受限的最大载干比算法具有比正比公平算法更高的平均吞吐量,可方便地在吞吐量和公平性之间获得很好的折衷;WFQ-PF联合算法具有良好的综合性能,但算法较复杂。 相似文献
9.
高性能交换结构中的输入排队调度算法综述 总被引:2,自引:0,他引:2
文章对各种输入排队调度算法进行了比较详细地分析,并着重对算法的吞吐量、稳定性、公平性、廷迟控制、组播支持等方面进行了分析,同时对各种输入排队调度算法作了总结并且指出了进一步研究的方向。 相似文献
10.
调度算法决定了输入排队交换结构的性能.本文根据Internet业务特征提出调度算法应保证短包的高优先级和低延迟.已有包方式调度中,长包信元的连续传输将造成短包长时间等待.为解决该问题,本文设计了一种低复杂度抢占式交换结构,并提出了相应的抢占式短包优先调度算法(P-SPF).短包优先可减小TCP流的RTT,并由此提高TCP之性能.通过排队论分析和实际业务源模型下仿真可知:P-SPF取得短包近似为零的平均包等待时间,同时达到94%的系统吞吐量. 相似文献
11.
12.
An evolution to crossbar switches with virtual output queuing and buffered cross points 总被引:2,自引:0,他引:2
Input queued (IQ) switch architectures with virtual output queues (VOQ) scale up to very high speeds and have been a subject of intense research in the past decade. VOQ IQ switches require switch matrix scheduling algorithms to match input ports to out ports. In this tutorial article, we present an overview of switch matrix scheduling for VOQ IQ switches with crossbar switch fabrics. We then describe what we believe will be the next generation of high-speed crossbar switches: the evolution of IQ switches to combined input and crossbar queued (CICQ) switches. With the continued increase in density of VLSI, sufficient buffering at crossbar cross points for one cell or packet has become feasible to implement. We show how CICQ switches have simple schedulers and result in lower delay than IQ switches. Both IQ and CICQ switches have unstable regions. We show how a threshold and bursting technique can feasibly achieve stability. We also show how CICQ switches are better suited (than IQ switches) for switching of variable-length packets such as IP packets. Many challenges remain in IQ and CICQ switches. In particular, the inclusion of QoS scheduling methods that are currently only suitable for output queued switches is a major open problem. 相似文献
13.
14.
This paper proposes a new multiuser scheduling algorithm that can simultaneously support a variety of different quality‐of‐service (QoS) user groups while satisfying fairness among users in the same QoS group in MIMO broadcast channels. Toward this goal, the proposed algorithm consists of two parts: a QoS‐aware fair (QF) scheduling within a QoS group and an antenna trade‐off scheme between different QoS groups. The proposed QF scheduling algorithm finds a user set from a certain QoS group which can satisfy the fairness among users in terms of throughput or delay. The antenna trade‐off scheme can minimize the QoS violations of a higher priority user group by trading off the number of transmit antennas allocated to different QoS groups. Numerical results demonstrate that the proposed QF scheduling method satisfies different types of fairness among users and can adjust the degree of fairness among them. The antenna trade‐off scheme combined with QF scheduling can improve the probability of QoS‐guaranteed transmission when supporting different QoS groups. 相似文献
15.
16.
在提供无线接入的网格网中,不同用户因所处地理位置的不同所获得的服务质量(吞吐量、延时)会有较大程度的差异。文中使用排队网络对Mesh网建立模型,从理论上分析了非饱和流量的情况下不同用户获得的延时的差异。分析发现,通过设置多个缓冲区并调度不同数据流在中间节点上的优先级别,可以使不同用户的延时趋于均匀从而保证网络的公平性。把优先级的分配问题归结为一个以公平性为目标的组合优化问题并提供了解法。使用Lorenz曲线来度量公平性,仿真结果表明,使用优化的调度算法可以获得更好的网络公平性。 相似文献
17.
18.
An Efficient Packet Scheduling Algorithm With Deadline Guarantees for Input-Queued Switches 总被引:1,自引:0,他引:1
Yong Lee Jianyu Lou Junzhou Luo Xiaojun Shen 《Networking, IEEE/ACM Transactions on》2007,15(1):212-225
Input-queued (IQ) switches overcome the scalability problem suffered by output-queued switches. In order to provide differential quality of services (QoS), we need to efficiently schedule a set of incoming packets so that every packet can be transferred to its destined output port before its deadline. If no such a schedule exists, we wish to find one that allows a maximum number of packets to meet their deadlines. Recently, this problem has been proved to be NP-complete if three or more distinct deadlines (classes) are present in the set. In this paper, we propose a novel algorithm named Flow-based Iterative Packet Scheduling (FIPS) for this scheduling problem. A key component in FIPS is a non-trivial algorithm that solves the problem for the case where two classes are present in the packet set. By repeatedly applying the algorithm for two classes, we solve the general case of an arbitrary number of classes more efficiently. Applying FIPS to a frame-based model effectively achieves differential QoS provision in IQ switches. Using simulations, we have compared FIPS performance with five well-known existing heuristic algorithms including Earliest-Deadline-First (EDF), Minimum-Laxity-First (MLF) and their variants. The simulation results demonstrate that our new algorithm solves the deadline guaranteed packet scheduling problem with a much higher success rate and a much lower packet drop ratio than all other algorithms 相似文献
19.
本文提出了一种新的分组循环调度算法LFRR(Large weight First Round Robin)。为了具有良好的时延特性和较低的实现复杂度,LFRR采取了以下方法:(1)在调度表中为流分配时隙时,LFRR以时隙完全均匀分布为参照,确保分配给一个流的时隙不会过早或过晚地出现在调度表中。(2)LFRR算法中采用了等权值流合并的技术,把权值大于1且权值相等的流合并成一个虚流,以虚流为处理对象,使算法需要处理的对象数目大为减小。(3)当一个时隙适合分配给多个虚流时,LFRR采用了简单的权值大的虚流优先占用时隙的原则。本文对LFRR进行了理论分析和计算机仿真,结果表明LFRR算法的时延性能比WRR(Weighted Round Robin)有了很大提高,同时LFRR算法的公平性也有保证。 相似文献
20.
Hsi-Lu Chao Wanjiun Liao 《Selected Areas in Communications, IEEE Journal on》2003,21(10):1642-1651
This paper studies resource management for multimedia mobile ad hoc networks (MANET). In particular, we focus on providing fair scheduling with quality-of-service (QoS) support for MANET. We consider two types of flows: guaranteed and best effort flows. The goal is to satisfy the QoS requirements of guaranteed flows and to provide global fairness for best effort flows. In this paper, a credit-based fair scheduling mechanism called credit-based slot allocation protocol (CSAP) is proposed. In CSAP, nodes are logically grouped into clusters, each with a scheduler. Each scheduler assigns time slots to nodes in its cluster based on the first tier algorithm. The node scheduled to send at the next time slot then in turn assigns the time slot to a relayed flow determined by the second-tier algorithm. Each multihop flow is treated as multiple single-hop flow segments. These segments are then correlated such that a downstream segment will not be allocated a slot unless the upstream segments have all been allocated. We evaluate the performance of CSAP by simulations. The results show that CSAP meets the QoS requirements of guaranteed flows, provides global fairness for best effort flows, and improves overall system throughput. 相似文献