共查询到18条相似文献,搜索用时 156 毫秒
1.
2.
3.
多服务台混合制排队模型M/G/s/K的仿真研究 总被引:1,自引:1,他引:0
为更快、更方便地得到一般服务时间的多服务台混合制中M/G/s/K排队系统在达到稳定之后的系统状态,通过离散化处理仿真时间方法,并借鉴时间步长法的思想,给出一种基于Matlab编程的仿真算法。通过实验说明了该方法的有效性。对于处理此类排队问题提供了一个新的方法。 相似文献
4.
5.
本文提出了一种新的多级门限服务轮询系统MAC控制协议的分析模型.采用嵌入马尔可夫链理论,对离散时间的多级门限服务轮询系统进行了分析,获得了轮询时刻系统队长的概率母函数,精确解析了系统的平均排队队长、平均循环周期、信息分组的平均等待时延.通过对多级门限服务轮询系统的控制机理研究,分析获得了m控制参数的有效控制取值大小和系统的相关特性.多级门限服务轮询系统综合了基本门限服务轮询系统和完全服务轮询系统,在轮询系统的MAC控制协议的应用方面更为有效. 相似文献
6.
7.
8.
9.
多路离散周期串到达,单个服务台定长服务排队系统,是在研究CBR业务下ATM网络中间节点性能时所遇到的一种排队模型,在有线AT 的CBR精力接进无线ATM网时也会遇到这种排模型,本文分析了这一排队系统,得到 队长剩余分布的计算公式 相似文献
10.
一个具有随机丢弃分组机制的GI/M/1/N排队系统 总被引:3,自引:0,他引:3
由于标准GI/M/1/N排队系统仅当等待队列中没有空闲位置时才丢弃到达的分组,不适合为QoS控制中的缓存队列管理建模。利用随机过程中输入流稀疏化的方法,在标准的GI/M/1/N排队系统中嵌入随机丢弃分组的机制,建立了一个具有随机丢弃分组机制的扩充的GI/M/1/N排队系统,以及该排队系统的分组丢失率、系统利用率、队列长度的均值/方差、平均等待时间等性能评价指标。 相似文献
11.
The BMAP/G/1 queue is a field of intensive research since several years. We generalize the BMAP/G/1 queue by allowing the arrival process to depend on the state (level) of the queue, i.e., on the number of customers in the system. This will be called a BMAP/G/1 queueing system with level-dependent arrivals. A suitable arrival process is defined by nesting a countable number of BMAPs.We give conditions for the level-dependent BMAP/G/1 queue to be stable, i.e., in equilibrium. By analysing the fundamental periods, which now depend on their starting level, we determine the stationary queue length at service completion times and at an arbitrary time. 相似文献
12.
13.
We present a discrete time single-server two-level mixed service polling systems with two queue types, one center queue and N normal queues. Two-level means the center queue will be successive served after each normal queue. In the first level, server visits between the center queue and the normal queue. In the second level, normal queues are polled by a cyclic order. Mixed service means the service discipline are exhaustive for center queue, and parallel 1-limited for normal queues. We propose an imbedded Markov chain framework to drive the closed-form expressions for the mean cycle time, mean queue length, and mean waiting time. Numerical examples demonstrate that theoretical and simulation results are identical the new system efficiently differentiates priorities. 相似文献
14.
Hashida O. Takahashi Y. Shimogawa S. 《Selected Areas in Communications, IEEE Journal on》1991,9(3):394-401
A doubly stochastic point process is proposed and analyzed. It is a switched batch Bernoulli process (SBBP) for modeling bursty and correlated input to discrete-time queuing systems. Through the investigation of the counting process, statistical characterization measures of the SBBP are explicitly obtained. A discrete-time single-server queue with SBBP input and general service time (SBBP/G/1) is then considered. The SBBP/G/1 queue has a potential applicability to a statistical multiplexer in the network. The supplementary variable technique is used to obtain the probability generating functions of performance measures in the SBBP/G/1 queue. It is shown how the SBBP is suitable for analyzing a discrete-time queue with bursty and correlated input 相似文献
15.
ZHANG Qi-zhi 《中国邮电高校学报(英文版)》2008,15(2):114-121
The M/G/1 queueing system with multiclass customer arrivals, fixed feedback, and first come first served policy is considered, where different classes of customers have different arrival rates, service-time distributions, and feedback numbers. The joint probabifity generation function of queue size of each class and the Laplace-Stieltjes transform of the total sojourn time of a customer in each class are presented, which extended the results obtained by Choi B D. The mean queue size of each class and mean total sojourn time of a customer in each class are obtained with this result. The results can be used in computer and communication networks for their performance analysis. 相似文献
16.
In this paper, we study a tandem queue with retrials where the queue experiences disasters. The probability of system failure depends on the strength of equipment, which makes servers idle and causes the removal of all customers in queues and service areas at once. The customers in the queue are forced to orbit in a retrial queue during the system failure where they decide whether or not to come back to the system. Reducing the disaster arrival rate (the probability of system failure) by employing more servers and reducing the number of lost customers is very costly. Moreover, it is important to service the customers with no interruption and reduce the time in system. The developed scenarios are compared in five dimensions including time in system, cost of lost customer, operator cost, the number of uninterrupted service customers and cost of reducing disaster arrival rate (or empowering system cost). The scenarios are modeled by computer simulation. Then, the optimal scenario is chosen using data envelopment analysis. The optimal scenario maximizes system efficiency in terms of disaster arrival rate, cost of lost customers and the number of satisfied customers. In the main problem, the disasters arrive at the system according to Poisson process; the effect of changing the distribution function of disaster arrival has been investigated finally. We are among the first ones to study and optimize G/G/K tandem queuing systems with system failures and retrial phenomena in interactive voice response systems. 相似文献
17.
In many data communication and telephone switching systems, one processor must perform more than one type of task. In some systems it is advantageous to place the different tasks in different queues and have the processor serve the queues in a cyclic manner. Moreover, the system design often imposes a (finite or infinite) limit on the number of entries that may be served per cycle from any given queue; this limit typically varies from queue to queue. This paper will derive the capacity estimation of such systems. We consider systems which, in addition to servingn queues cyclically, must execute maintenance (or other low-priority jobs) without severely disrupting the queues' performance. For two alternative methods of scheduling the maintenance, we compute steady state values of i) the average cycle time, ii) the average number of entries of each queue served per cycle, iii) the average time spent at each queue per cycle, iv) the average amount of elapsed time necessary to complete a given amount of maintenance execution real time, and v) if the arrival rate to queuei,lambda_{i} , is proportional toN , the number of customers in the system, i.e.,lambda_{i} = Nalpha_{i} , then we a) compute the value ofN which saturates the system and b) predict which queue will first become saturated asN is increased towards this value. 相似文献
18.
在通信网互连中,若被连子网具有不同的最大允许分组长度,那么有信关中一个较长的分组就可能要被拆分为多个较小的分组,这就是公组再分问题,已经证明,在某些情况下。再分后的公组流可以用一个修正的开关泊松过程来,本文RSPP和RSPP/M/1排队。文中推导出了RSPP到达间隔分布的表达式,并给出了平均到达率。文中还给出了队长分布,平均等候时间的表达式;信关输出流的特性对于全网的性能分析是必需的,因此本文着重 相似文献