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

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

一个具有随机丢弃分组机制的GI/M/1/N排队系统

由于标准GI/M/1/N排队系统仅当等待队列中没有空闲位置时才丢弃到达的分组,不适合为QoS控制中的缓存队列管理建模。利用随机过程中输入流稀疏化的方法,在标准的GI/M/1/N排队系统中嵌入随机丢弃分组的机制,建立了一个具有随机丢弃分组机制的扩充的GI/M/1/N排队系统,以及该排队系统的分组丢失率、系统利用率、队列长度的均值/方差、平均等待时间等性能评价指标。     

自相似网络流量建模及分析

利用RMD方法生成了自相似分形FGN流量,并分别利用R/S分析法、时间方差分析法和小波功率谱密度分析法估计自相似流量的Hurst参数.然后,利用OPNET仿真软件对传统的排队模型M/M/1和自相似下的排队模型的平均排队延时和平均队列长度进行了网络仿真,从而得出自相似对排队性能的影响.     

M/M/C/m/m排队系统模型的飞机战伤抢修研究

抢修力量配置是飞机战伤抢修复杂系统的核心因素.损伤飞机在抢修系统中的停留时间是进行抢修力量配置的关键指标.首先用排队论的观点,从飞机战伤抢修系统的特性出发,结合对系统榆入过程的分析,得出抢修力量预测模型即M/M/C/m/m排队模型.然后通过对该排队系统状态转移方程求解,计算出损伤飞机在系统停留时间.最后通过实例分析,得出对战伤抢修力量配置的方法.     

动态权重调整RED

IETF推荐RED(Random Early Detection)作为下一代Internet路由器的拥塞控制算法.但RED中平均队列长度对实际队列变化反应较慢,导致出现拥塞的时间增加,丢包增多,本文在现有RED算法的基础上通过改进RED算法的平均队列长度计算,使用平均队列长度的均值,判断拥塞的发生和结束,动态调整权重,提高RED对拥塞发生和拥塞结束的反应速度.仿真结果表明算法减少了拥塞时间,能够维持较低的实际队列长度,进而减少了数据包排队时间.     

基于排队论的路由器缓存系统建模与分析

路由器是通信网络中重要的存储转发设备,其缓存大小与性能指标密切相关。文章以M/M/1/K排队系统为基础构建路由器缓存系统的模型,得出系统的性能指标丢包率和数据包的平均传输时延,并通过仿真分析探讨路由器缓存容量对系统性能的影响。最后,提出在不同网络环境下根据系统的技术指标设计路由器缓存容量的具体算法。     

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

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

多服务台混合制排队模型M/G/s/K的仿真研究

为更快、更方便地得到一般服务时间的多服务台混合制中M/G/s/K排队系统在达到稳定之后的系统状态,通过离散化处理仿真时间方法,并借鉴时间步长法的思想,给出一种基于Matlab编程的仿真算法。通过实验说明了该方法的有效性。对于处理此类排队问题提供了一个新的方法。     

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

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

航空电子系统中FC网络的仿真和延迟估计

对采用单交换机光纤通道(FC)网络的航空电子系统进行了描述,建立了网络的排队模型.根据M/G/1模型对FC网络的队列长度、服务时间等参数进行了分析和估计.在OPNET平台下对4种周边节点数不同的FC网络进行了仿真;通过仿真分析了FC网络端到端延迟和网络节点数关系,并对评估的数学模型进行了修正;研究了网络中的延迟"抖动"...     

修正开关泊松过程（RSPP）和RSPP／M／1排队

在通信网互连中，若被连子网具有不同的最大允许分组长度，那么有信关中一个较长的分组就可能要被拆分为多个较小的分组，这就是公组再分问题，已经证明，在某些情况下。再分后的公组流可以用一个修正的开关泊松过程来，本文ＲＳＰＰ和ＲＳＰＰ／Ｍ／１排队。文中推导出了ＲＳＰＰ到达间隔分布的表达式，并给出了平均到达率。文中还给出了队长分布，平均等候时间的表达式；信关输出流的特性对于全网的性能分析是必需的，因此本文着重     

Analysis of an M/G/1/N queue with vacations and its iterativeapplication to FDDI timed-token rings

We present the analysis of an M/G/1/N queueing system with vacations under a dynamic time-limited service policy. This method is used to develop a procedure for performance analysis of a fiber distributed data interface (FDDI) network serving buffer-limited stations under asynchronous service. An efficient iteration procedure is employed to evaluate the limiting state distribution of the embedded Markov chain representing the system state process. Using supplementary variables and sample biasing techniques, we derive the queue size distribution at an arbitrary instant of time as well as the packet blocking probability and the mean packet delay. By exploiting the subtle structure of conditional supplementary variables and the recursive property of the conditional residual delay, the Laplace-Stieltjes transform of the packet delay distribution and a time-domain approximation of the packet delay distribution are obtained. For the analysis of a heterogeneous multi-station FDDI network, an iterative procedure which uses repeatedly the M/G/1/N vacation model described above is presented. This procedure provides for a numerically efficient analysis method by employing constructions of the approximate vacation time distributions. We illustrate the application of our analytical techniques to both symmetric and nonsymmetric FDDI network systems     

On the Large Deviations of Resequencing Queue Size: 2-M/M/1 Case

In data communication networks, packets that arrive at the receiving host may be disordered for reasons such as retransmission of dropped packets or multipath routing. Reliable protocols such as the Transmission Control Protocol (TCP) require packets to be accepted, i.e., delivered to the receiving application, in the order they are transmitted at the sender. In order to do so, the receiver's transport layer is responsible for temporarily buffering out-of-order packets and resequencing them as more packets arrive. In this paper, we analyze a model where the disordering is caused by multipath routing. Packets are generated according to a Poisson process. Then, they arrive at a disordering network (DN) modeled by two parallel M/M/1 queues, and are routed to each of the queues according to an independent Bernoulli process. A resequencing buffer follows the DN. In such a model, the packet resequencing delay is known. However, the size of the resequencing queue (RSQ) is unknown. We derive the probability for the large deviations of the queue size.      

Required Work in the M/M/1 Queue,with Application in IP Packet Processing

We consider the ordinary M/M/1 queue with the FIFO queueing discipline. It seems that the sum of service times of the customers in the system (or the required work, as we call it briefly) is a random variable that is not considered before. In this paper we derive the equilibrium distribution of this variable. The task is not quite trivial because of the dependencies between the elapsed service time and the number of customers in the system. Our motivation for this problem comes from the performance analysis of a dynamic memory allocation scheme of a packet buffer.     

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

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

Logarithmic Delay for N ×N Packet Switches Under the Crossbar Constraint

We consider the fundamental delay bounds for scheduling packets In an N times N packet switch operating under the crossbar constraint. Algorithms that make scheduling decisions without considering queue backlog are shown to incur an average delay of at least O(N). We then prove that O(log(N)) delay is achievable with a simple frame based algorithm that uses queue backlog information. This is the best known delay bound for packet switches, and is the first analytical proof that sublinear delay is achievable in a packet switch with random inputs.     

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.     

Analysis of mean packet delay for upstream transmissions in passive optical networks with sleep mode

The sleep mode has been introduced to improve the energy efficiency of passive optical networks (PONs) with interleaved polling with adaptive cycle time (IPACT) as a medium access control (MAC) scheme. For energy saving, the sleep mode of each optical network unit (ONU) is activated based on the packet queue length for upstream traffic. We model such a PON as an N-user M/G/1 queue with reservations and vacations. Based on the framework of M/G/1 queueing analysis with some modification made to incorporate the nature of IPACT as well as the sleep mode, we derive a closed form expression of the mean packet delay. A unique challenge in our analysis is that certain quantities such as the residual time of an on-going sleep period for the upstream channel must be considered from the network's viewpoint while the delay due to the sleep mode experienced by a packet must be considered from the ONU's viewpoint. Simulation experiments are conducted to validate the analytical results and to show that the results are relatively insensitive to packet arrival statistics for large sleep periods. Finally, we demonstrate how a sleep period can be chosen given the quality-of-service (QoS) requirement on the mean packet delay.     

The transient solution of time-dependent M/M/1 queues

The transient behavior of time-dependent M/M/1 queues is studied. The boundary probability function π₀(t), which is the probability that the queue is empty at time t, is shown with analyticity arguments to satisfy a Volterra-type integral equation. The boundary integral equation is derived, and a numerical algorithm is used to solve the integral equation and to find the expected queue size from π₀(t). The approach can be applied to many other types of time-dependent queues. Examples are given