共查询到20条相似文献,搜索用时 78 毫秒
1.
2.
模拟技术可用于构造系统模型以预测系统在给定环境下的性能。本文基于排队系统的系统模拟之原理,提出了一个分时和前-后台优先级调度方式相结合的计算机随机服务系统的系统模型,产研制了模拟软件。 相似文献
3.
使用到达函数和服务函数描述不同优先级实时分组集的到达和处理,基于期望可调度性来刻画不同紧急程度的实时应用对延迟的要求。提出的方法能够实现实时QoS控制下的瞬时特性研究,判定某一时刻不同优先级分组集的可调度性。最后对指数分布服务时间下的不同优先级分组集的期望可调度性进行了研究,基于理论结论的数值结果和基于模型的模拟结果是一致的。 相似文献
4.
在信息分组以连续时间规律到达系统的基础上,对于轮询系统中不同优先级的业务问题,提出区分优先级的两级轮询服务模型。首先,在该模型中,低优先级站点采用门限服务,高优先级站点采用完全服务;然后,在高优先级转低优先级时,将传输服务与转移查询并行处理来降低服务器在查询转换期间所耗费的时间,提高轮询系统的效率;最后,运用马尔可夫链和概率母函数的方法建立了系统的数学模型,通过对数学模型精确解析,得到了连续时间两级服务系统每个站点的平均排队队长和平均等待时间的表达式,精确解析出平均排队队长和平均等待时间的值。仿真实验结果表明:理论计算值与实验仿真值近似相等,说明理论分析正确合理。该模型既能保障低优先级站点服务质量,又能为高优先级站点提供优质服务。 相似文献
5.
6.
7.
8.
基于固定优先级调度的分布式实时系统中,服务方对请求的处理分为两个阶段,请求接收阶段和请求执行阶段。其中请求的接收一般是由接收单元统一负责,而接收单元并不知道请求的优先级,只有在解码后才能知道请求的优先级并按照优先级进行相应的处理。那么接收单元本身的优先级如何确定呢?该文针对这一问题进行了深入的研究。在对系统进行建模并取得模拟结果后得出了重要结论,在基于固定优先级调度的分布式实时系统中,服务方接收单元的优先级要小于最高优先级,大于其他优先级。 相似文献
9.
针对提高轮询控制模型工作效率和区分网络优先级的问题,提出了区分站点忙闲状态的完全-门限两级轮询控制模型(ETTPSS)。模型以两级优先级为基础,依据站点的忙闲状态采用并行处理方式只对忙站点进行信息分组发送服务。模型既能区分传输服务优先级又能避开对无信息分组的空闲站点的查询,从而提高了模型资源利用率和工作效率。运用概率母函数与马尔可夫链相结合的方法对该模型进行理论分析研究,精确解析了模型各个重要性能参数。仿真实验结果表明,仿真值与理论值近似相等,说明理论分析正确合理。与普通轮询模型相比,该模型性能大幅度提高。 相似文献
10.
在智慧道路系统中,为区分不同类型和不同服务质量需求的数据流服务,提出一种基于优先级的资源预留模型。对不同服务质量需求的数据包进行优先级分类,放入不同的优先级队列,通过调度算法决定选取哪些数据包进行发送。当节点竞争得到信道后,采用资源预留机制抑制其他竞争节点的发送,直到剩下的相同优先级的数据包发送完毕。实验结果表明,该模型可有效地减少碰撞几率,提高信道利用率,并实现对不同优先级数据流的服务区分。 相似文献
11.
Chollette C.Chude-Olisah Uche A.K.Chude-Okonkwo Kamalrulnizam A.Bakar Ghazali Sulong 《计算机科学技术学报》2013,28(2):357-365
Addressing the problem of queue scheduling for the packet-switched system is a vital aspect of congestion control. In this paper, the fuzzy logic based decision method is adopted for queue scheduling in order to enforce some level of control for traffic of different quality of service requirements using predetermined values. The fuzzy scheduler proposed in this paper takes into account the dynamic nature of the Internet traffic with respect to its time-varying packet arrival process that affects the network states and performance. Three queues are defined, viz low, medium and high priority queues. The choice of prioritizing packets influences how queues are served. The fuzzy scheduler not only utilizes queue priority in the queue scheduling scheme, but also considers packet drop susceptibility and queue limit. Through simulation it is shown that the fuzzy scheduler is more appropriate for the dynamic nature of Internet traffic in a packet-switched system as compared with some existing queue scheduling methods. Results show that the scheduling strategy of the proposed fuzzy scheduler reduces packet drop, provides good link utilization and minimizes queue delay as compared with the priority queuing (PQ), first-in-first-out (FIFO), and weighted fair queuing (WFQ). 相似文献
12.
13.
Khalid Al-Begain Alexander Dudin Arseniy Kazimirsky Suleiman Yerima 《Computer Networks》2009,53(8):1186-1201
This paper investigates a queuing system for QoS optimization of multimedia traffic consisting of aggregated streams with diverse QoS requirements transmitted to a mobile terminal over a common downlink shared channel. The queuing system, proposed for buffer management of aggregated single-user traffic in the base station of High-Speed Downlink Packet Access (HSDPA), allows for optimum loss/delay/jitter performance for end-user multimedia traffic with delay-tolerant non-real-time streams and partially loss tolerant real-time streams. In the queuing system, the real-time stream has non-preemptive priority in service but the number of the packets in the system is restricted by a constant. The non-real-time stream has no service priority but is allowed unlimited access to the system. Both types of packets arrive in the stationary Poisson flow. Service times follow general distribution depending on the packet type. Stability condition for the model is derived. Queue length distribution for both types of customers is calculated at arbitrary epochs and service completion epochs. Loss probability for priority packets is computed. Waiting time distribution in terms of Laplace–Stieltjes transform is obtained for both types of packets. Mean waiting time and jitter are computed. Numerical examples presented demonstrate the effectiveness of the queuing system for QoS optimization of buffered end-user multimedia traffic with aggregated real-time and non-real-time streams. 相似文献
14.
Philippe Nain 《Performance Evaluation》1984,4(2):93-98
We derive the Laplace-Stieltjes transform of the limiting interdeparture times distribution for each class of customers of a queuing system with preemptive resume priority, Poisson inputs and general service times. Numerical results and an application to queuing networks are also given. 相似文献
15.
《IT Professional》2007,9(5):28-35
Engineering an enterprise to efficiently support integrated voice and data services requires sophisticated queuing disciplines to meet quality of service requirements. This study evaluates tradeoffs with three queuing schemes. Knowing that the choice of queuing discipline affects utilization, we ran a simulation for each of three queuing schemes - first come, first served (FCFS); priority queuing (PQ); and class-based weighted fair queuing (CBWFQ) - evaluating utilization at various bandwidths that would meet QoS requirements. The results showed that, with these three queuing disciplines, voice and data packets can receive the desired QoS. 相似文献
16.
The queuing processes of interest in this paper are that of waiting lines with two priorities and multiple service channels. The arrival process is assumed Poison and the service time distribution is negative exponential. Arriving units enter service if there is at least one idle channel, otherwise they join a finite queue and are served according to a non-preemptive priority discipline. If a low priority arriving unit finds the queue full, it is not allowed to enter the system and is considered “blocked” or lost. In the first model a high priority arrival may displace a low priority unit from the full queue and may be “blocked” if the queue consists of high priority units only. In the second model the high priority unit may still displace a low priority unit from the full queue but it will never be “blocked” and may wait “outside” the system if the system is full. Thus far there has been no discussion of such models in queuing theory literature. In this paper analytical expressions for average waiting times have been obtained for the two models. Two potential applications of the models are described and the usefulness of the models is illustrated by numerical examples. 相似文献
17.
18.
19.
在现实医疗服务中,面对医生座席数量供不应求的现状,采用传统的双队列独立排队系统很难高效利用医院资源。对此,在不改变医院现有资源的情况下设置系统动态用来合理配比各门诊患者容量,在传统双队列独立排队系统的基础上建立动态溢流门诊排队生灭模型,并考虑患者在感性与理性因素下退出系统的概率,便于更准确地分析系统的真实状态。借助ProModel这一灵活、可靠的离散事件仿真软件,将模型可视化研究,并与传统的门诊排队模型进行对比分析。仿真结果显示,新型排队模型的队列平均长度、患者等待时间等服务指标均优于传统的排队模型。 相似文献
20.
基于无线通信网的运行机制和实时性、非实时性混合业务对无线通信网络的不同服务质量(QoS)要求,设计了有限缓存下实时性业务优先接入控制策略,并建立了无线通信网络在有限缓存下混合业务带有优先接入控制的多服务台离散时间排队模型Geom1±Geom2/Geom1, Geom2/s, s(PP)/n+s, s.精确划分了系统的状态组成,分析了系统性能和状态转移概率,获得了系统的稳态分布、平均队长、损失率、以及信道的平均利用率.最后,对所建模型进行数值模拟,得到各业务到达率、服务率、信道个数、缓冲器容量与各业务损失率的关系.针对网络拥塞控制,本文提出通过增加信道个数、提高优先级业务的服务率能有效地降低两类业务的损失率. 相似文献