基于OPNET的M/M/m队列仿真

M/M/m队列是排队论中的一个服务系统模型.OPNET是一个使用非常广泛的仿真工具.通过OPNET采集的两个统计量:数据包排队延时和队列长度平均时间,可对M/M/m队列模型进行仿真.通过仿真,得出稳态下数据包平均延时Ws和队列长度平均时间Ls随平均间隔时间的增加而降低;增加服务器m的数量,Ws和Ls都快速减少,并且Ws和Ls与平均数据包长度以及服务容量有关.     

多服务台中流失比例的高负荷极限的模拟仿真

为了得到多服务台队列中流失率的高负荷极限,通过对有顾客流失的G/G/1/K队列进行推广得到G/GI/m/K队列,在高负荷条件下,获得了有m个服务台的队列系统中队长过程、流失过程的极限定理与流失比例的高负荷极限。以M/M/m/K队列为例,用Matlab编程进行模拟仿真,验证了理论结果的合理性,这是分析多服务台队列系统的一种新方法。     

基于M/M/1的无线mesh网络网关分析模型

根据排队论M/M/1模型的特性以及无线mesh网络中顾客请求服务的生成特点,构建了基于M/M/1模型的无线mesh网络网关队列模型,该模型将请求服务中原来的无序状态集转变为有序状态集,在网关节点前进行排队,网关作为单一的服务台服务于整个集合;利用数学方法对模型进行求解,即推导出网络系统的关键参量和目标分析函数.通过验证实验,该模型可以求得网络中非饱和资源分配状态下的一些关键参量值.理论分析和实验结果都说明了新模型是合理、有效的.     

M/M/n模型的高负荷极限及仿真

通过对于标准的多服务台队列M/M/n模型的负荷过程的高负荷极限的证明来解释鞅定理,该系统为泊松到达,指数服务。通过对所考虑的负荷过程进行流体刻画,并且使用鞅方法来证明多服务台队列M/M/n模型的负荷过程的高负荷极限,并得到所考虑的负荷过程收敛的结论。在高负荷条件下使用Matlab编程对此过程进行仿真模拟,模拟仿真以产生随机数的方式来进行计算,为今后排队论中证明随机过程（比如等待时间,流失过程,放弃过程等）的收敛提供了新的方法。     

AAL2分组话音复接器缓冲器队列容量的确定方法

该文研究AAL2分组话音复接器缓冲器队列容量的确定方法，提出并从理论上证明用话音分组的最大排队时延为9ms作为确定缓冲器队列容量的标准，可很好地满足分组话音业务服务质量要求的结论。并推导出缓冲器队列容量及门限值的计算公式，仿真结果表明，按作者提出的方法确定缓冲器队列容量及门限值，可获得较低的分组丢弃概率和较小的平均分组排队时延；在满足分组话音业务服务质量要求的前提下，减少了话音分组缓冲器队列的容量，是一种很好的确定缓冲器队列容量和门限值的方法。     

基于AOS的Hurst-优先级自适应RED与动态调度算法

为有效传输空间数据系统中多类型、大容量、突发性的数据,基于高级在轨系统(AOS)虚拟信道复用技术,提出了一种自相似参数Hurst-优先级自适应的随机早检测(RED)与动态调度算法——HPRED-DS。该算法在队列管理中设计了基于Hurst参数与优先级的2级丢弃分组策略,在虚拟信道调度中设计了VIP/同步/异步混合的动态调度模式,并将队列管理与虚拟信道调度有效结合起来。实验结果表明该算法在保持高处理效率和吞吐率的基础上,稳定了队列长度,降低了排队延时和延时抖动,并能满足AOS中不同业务的传输要求。     

主动队列管理中的智能分组丢弃新机制

主动队列管理通过网络中间节点有控制的分组丢弃实现了较低的排队延时和较高的有效吞吐量,是TCP端到端拥塞控制近来研究的一个技术热点.已有的大多数算法在判定分组丢弃时大都沿袭了RED的概率丢弃机制,具有一定计算复杂度的随机数生成过程不利于路由器性能的优化.在本文中,我们首先定义了拥塞指数这一新的测度变量来量化描述网络的拥塞状态.接着,利用模糊逻辑设计了一种新的智能分组丢弃机制,离线的合成推理使得分组丢弃的判定仅需要简单的查表操作和比较运算即可完成,为优化路由器的性能提供了便利.数字仿真的结果表明:智能分组丢弃机制的性能优于经典的RED算法,控制队列的能力强,鲁棒性好,稳定工作域大,能很好地抵抗突发性和非弹性业务的干扰,适合工作在瞬息万变的动态网络环境中.     

非强占权优先制排队系统研究

有限的资源和随机的需求是排队论存在的基础,而在如今的社会,这种现象越发广泛和复杂。我们将要求服务的顾客和提供服务的机构组合成一个系统,称之为排队系统。这种系统存在于各个方面,本文研究的是排队论运用在通信网络中的各端业务问题。排队论系统分为优先制排队系统和非优先制排队系统,本文描述了带有非强占权优先制的排队系统,其模型为两队中其中一对带有优先制度的M/M/1的模型。根据此模型可以定义变量,画出状态转移图并列出状态方程,最后求出稳态解。通过性能分析发现,带有优先权的M/M/1模型系统与一般模型相比性能将会有所提高,这也是优先制度的体现。     

GPRS数据业务性能分析

基于D-BMAP/D/1排队模型分析GPRS数据业务在简化的一步接入模式以及不同服务速率下的性能,包括RLC/MAC缓冲区队列的平均长度、小分组(Mini-Packet)的平均时延和丢弃率等.分析结果表明:当定时器T₃₁₈₂时间变长时,时延缩短,丢弃率降低;处于空闲状态的移动台产生新会话的概率越大,时延越长;缓冲区容量增加,丢弃率明显降低.但是随着每个会话中分组呼叫数目的变化,时延变化不显著.     

一种基于多M/M/m/m+M排队系统的分散型云计算建模方法

基于Erlang-A同Erlang-C相结合的排队系统模型,由多云域组成的分散型云计算被抽象为多排队系统.基于丢弃率参数实现了对延迟敏感服务请求的准入控制,等待的服务请求以一定的丢弃概率被溢出.将丢弃概率引入Riordan公式,在Hayward近似中提出基于空间随机过程的汇聚溢出流渐进峰度因子,利用等效随机理论研究了溢出流丢失问题.通过仿真实验验证了基于丢弃率准入控制下多排队系统的性能提升.     

单服务员排队模型及其蒙特卡洛模拟

单服务员的排队模型(M/M/1模型)是排队论中重要的排队系统。介绍排队论的基本概念,讨论和研究单服务员排队模型的过程和基本原理,通过数学计算得出单服务员排队模型中重要的运行指标。针对典型实例,借助于计算机软件包Matlab 6.5进行了蒙特卡洛模拟。     

反馈次数服从几何分布的M/G/1排队系统的队长分布

本文从队长过程本身出发,直接研究了具有反馈的M/G/1型排队模型的队长分布,获得了在任意时间t的瞬时队长分布的拉普拉斯变换的递推表达式,以及便于计算的平稳队长分布的递推表达式.值得注意的是本文分析的方法简洁、直观.     

基于Matlab的M/M/m排队模型的仿真

在排队论中，排队模型的经典分析方法一般是通过建立Markov链，对其稳态系统进行求解。但是当Markov链状态数较多或排队模型比较复杂时，求解稳态方程将变得比较困难，甚至是无法求解。本文采用基于事件调度(ES)的离散事件的仿真方法，以静态仿真的思想实现动态系统的仿真，利用Matlab语言对M／M／m模型进行了仿真。仿真结果表明，该方法是切实可行的。     

Exact analysis of a class of GI/G/1-type performability models

We present an exact decomposition algorithm for the analysis of Markov chains with a GI/G/1-type repetitive structure. Such processes exhibit both M/G/1-type & GI/M/1-type patterns, and cannot be solved using existing techniques. Markov chains with a GI/G/1 pattern result when modeling open systems which accept jobs from multiple exogenous sources, and are subject to failures & repairs; a single failure can empty the system of jobs, while a single batch arrival can add many jobs to the system. Our method provides exact computation of the stationary probabilities, which can then be used to obtain performance measures such as the average queue length or any of its higher moments, as well as the probability of the system being in various failure states, thus performability measures. We formulate the conditions under which our approach is applicable, and illustrate it via the performability analysis of a parallel computer system.     

Proof of a Conjecture on the Interarrival-Time Distribution in an M/M/1 Queue with Feedback

In a Jackson-type queuing network with feedback, the equilibrium state distribution of each queue is that of anM/M/ssystem. In support of a previous conjecture that nevertheless the input processes in such a network are not Poisson, the marginal interarrival-time distribution for an equilibriumM/M/1queuing system with feedback, counting both fed-back and exogenous customers as arrivals, is calculated. Since this distribution is a mixture of two exponentials, the total input to such a system is not Poisson.     

A novel framework for G/M/1 queuing system based on scheduling-cum-polling mechanism to analyze multiple classes of self-similar and LRD traffic

Provisioning guaranteed Quality of Service (QoS) in multiservice wireless internet is challenging due to diverse nature of end-user traffic (e.g., voice, streaming video, interactive gaming) passing through heterogeneous interconnected domains with their own policies and procedures. Numerous studies have shown that multimedia traffic carried in wireless internet possesses self-similar and long-range dependent characteristics. Nonetheless, published work on wireless traffic modeling is merely based on traditional Poisson traffic distribution which fails to capture these characteristics and hence yield misleading results. Moreover, existing work related to self-similar traffic modeling is primarily based on conventional queuing and scheduling combinations which are simple approximations.This paper presents a novel analytical framework for G/M/1 queuing system based on realistic internet traffic distribution to provide guaranteed QoS. We analyze the behavior of multiple classes of self-similar traffic based on newly proposed scheduling-cum-polling mechanism (i.e., combination of priority scheduling and limited service polling model). We formulate the Markov chain for G/M/1 queuing system and present closed form expressions for different QoS parameters i.e., packet delay, packet loss rate, bandwidth, jitter and queue length. We develop a customized discrete event simulator to validate the performance of the proposed analytical framework. The proposed framework can help in building comprehensive service level agreements for heterogeneous wireless domains.     

The M/G/1 queue with permanent customers

The authors examine an M/G/1 FCFS (first come, first served) queue with two types of customers: ordinary customers, who arrive according to a Poisson process, and permanent customers, who immediately return to the end of the queue after having received a service. The influence of the permanent customers on queue length and sojourn times of the Poisson customers is studied using results from queuing theory and from the theory of branching processes. In particular, it is shown that, when the service time distributions of the Poisson customers and all K permanent customers are negative exponential with identical means, the queue length and sojourn time distributions of the Poisson customers are the (K+1)-fold convolution of those for the case without permanent customers     

Self-Similar Traffic in G/M/1 Queue Defined by the Weibull Distribution

The work considers a queuing system of the G/M/1 type that simulates service of self-similar traffic in a NodeB (e-NodeB) base station of a mobile operator. The feature of quality of service (QoS) characteristics estimation process for the self-similar traffic defined by the Weibull distribution is the solution based on the Laplace–Stieltjes transformation. The Laplace transformation for an infinite number of items under the Weibull distribution condition was found. It was shown that this series was equiconvergent to some convergence domain. The following QoS characteristics were obtained for the self-similar traffic: the average amount of time that a request spends in the system; the average number of requests waiting in the queue and the average queue length. The obtained results allowed to consider the real values of traffic serviced by a NodeB (e-NodeB) for their optimal deployment over a covered territory at the stage of frequency planning and operation of the 3G/UMTS and 4G/LTE networks.     

Queuing analysis of cooperative GBN-ARQ in wireless networks with peers contending for a common helper

This paper presents a new queuing model for performance analysis of go-back-N automatic repeat request (GBN-ARQ) protocol in cooperative wireless networks. In the model, cooperative medium access control (CoopMAC) protocol and dynamic radio link adaptation are taken into consideration. We analyze the probability distribution of the total delay witnessed by packets at the source side. Multi-rate transmissions are considered for all links with link adaptation. An enhanced Markov model is introduced in our model, which encompasses the following aspects: CoopMAC protocol at the MAC sub-layer; GBN-ARQ protocol at the logical link control sub-layer and the transmission using decode-and-forward cooperative diversity at the physical layer. The stochastic process of random feedback delay because of peers contending for a common helper is analyzed. The queuing system is modeled as a GI/M/1 Markov chain to acquire statistics of the exact queue length and the total delay. We analyze the effects of Doppler frequency shift and packet arrival rate on the total delay. The analysis is validated by simulation.     

Loss probability behavior of Pareto/M/1/K queue

In this letter, we investigate the queue behavior with Pareto interarrival and exponential service time distribution. By numerical analysis and simulations, we analyze the asymptotic and the exact loss probabilities of GI/M/1/K to show the big discrepancy between the asymptotic and the actual loss probability and propose a model for the loss probability of Pareto/M/1/K as a function of the buffer size K and the geometric parameter.