多级门限服务轮询系统MAC离散时间控制协议模型分析

 本文提出了一种新的多级门限服务轮询系统MAC控制协议的分析模型.采用嵌入马尔可夫链理论,对离散时间的多级门限服务轮询系统进行了分析,获得了轮询时刻系统队长的概率母函数,精确解析了系统的平均排队队长、平均循环周期、信息分组的平均等待时延.通过对多级门限服务轮询系统的控制机理研究,分析获得了m控制参数的有效控制取值大小和系统的相关特性.多级门限服务轮询系统综合了基本门限服务轮询系统和完全服务轮询系统,在轮询系统的MAC控制协议的应用方面更为有效.     

优先级控制轮询在变电站通信网络中的应用

变电站通信网络是变电站实现综合自动化的前提,变电站内部设备可划分成3个层次,其中第二层的数据和控制信息传送到与远方调度中心通信的站级PC机,该过程属于计算机通信网络的范畴,针对变电站通信网络的这个特点,将两级优先级控制轮询系统用在变电站通信网络中。提出了在站级PC通信接口(主节点)采用完全服务的轮询方式,第二层设备通信接口内部的数据缓冲区(子节点)采用门限服务的轮询方式的新模型。完全服务的优先级比门限服务的高,对新模型进行了仿真和理论计算,得出新系统的平均时延和平均排队队长与负载之间的关系、平均时延和平均排队队长与子节点数之间的关系,这些参数对于提高变电站通信网络的性能至关重要。     

轮询多址通信系统门限服务策略研究

从两方面对离散时间情况下轮询多址通信门限排队服务系统进行了研究。改进了系统服务策略，运用嵌入式马尔可夫链理论和多维概率母函数的方法，得到了改进后系统查询时间点处的平均排队队长和信息分组平均时延理论解析式，仿真结果表明分析方法有效且系统性能较之原系统得到提高；采用一种简化的近似算法，得到了轮询周期内平均队长的理论解析式，理论计算与仿真结果有较好的一致性。     

离散时间闸门式多级门限服务的两级优先级轮询排队系统分析

本文提出了一种基于闸门式多级门限服务的两级优先级轮询系统.论文先构建了系统的排队分析模型,然后把模型中各个站点内的等待顾客数合起来设定为系统状态变量,对系统状态变量的概率母函数求二阶偏导后组成迭代方程组,联立求解后得到了站点的平均排队队长、顾客平均等待时间以及服务器查询周期等关键指标的完整数学解析表达式.最后,对该模型进行了仿真实验分析,实验结果与理论结果相一致.系统性能分析表明该轮询系统满足了周期性系统服务资源分配过程中业务多样性和弹性服务的发展需求,使得轮询控制策略应用方面更为广泛.     

离散时间的完全服务并行优化轮询排队系统特性分析

轮询是一种依次有序服务的系统资源动态调度机制.针对服务器在站点间查询、服务和转移过程中的流水线作业方式导致了系统整体服务效率较低的问题,本文提出了完全服务的并行优化轮询系统.首先,构建了系统的单服务器多队列排队模型和相应的系统状态方程,并精确解析出系统特性参数的完整数学解析表达式.此外,还提出了一种系统状态稳定性的判定方法,对不同负载状态下的系统稳定性进行了定量分析.计算机仿真的统计分析结果与理论计算值相一致.最后,系统性能分析表明,在保持周期性、无冲突服务的基础上,系统的队长、时延特性和稳定状态下负载能力均得到了较大的提高.     

两级优先级控制轮询系统研究

 本文基于区分业务优先级服务的应用需求,提出了两级优先级控制的轮询系统,采用门限服务和完全服务的不同服务策略方式实现了基于优先级的控制.然后,应用马尔可夫链和概率母函数的方法建立了系统模型,并精确解析了系统的平均排队队长和信息分组的平均等待时间关键特性,理论计算和仿真实验的对比分析说明了理论分析与实验的一致性,新的轮询系统实现了优先级的控制并提高了系统性能.     

完全服务和门限服务两级轮询系统E(x)特性分析

本文基于区分业务的优先级和提高系统的公平性,提出了普通站点队列采用完全服务、中心站点采用门限服务策略的完全-门限服务两级轮询系统模型,该模型既能满足区分业务优先级的服务需求,又能兼顾系统的公平性。然后,应用嵌入式马尔科夫链和概率母函数建立了系统的数学模型,并精确解析了系统平均排队队长、平均查询周期等E(x)特性。通过理论计算与仿真实验结果的对比,说明了二者的一致性,新的系统通过始终优先查询中心站点实现了区分优先级的控制,同时普通站点采用完全服务,在服务策略上得到较好的服务,使系统有更好的公平性。     

三种策略轮询系统的FPGA实现及性能分析

无线传感器网络是以数据为中心的任务型自组织网络,在实时通信中常基于点协调功能进行介质访问。轮询系统基于资源分配调度共享理论控制各业务无竞争接入网络,使用全部带宽资源快速传输数据。轮询系统按照服务策略的不同可分为完全、门限、限定三种类型,为研究其系统性能的特点,利用Verilog HDL语言在FPGA上对三种轮询系统进行设计实现,通过设置状态机实现信道控制,并通过QuartusⅡ平台进行功能仿真。系统时序仿真图与预期功能要求相符,系统参数统计值表明三者有不同的服务质量特性,对无线网络中调度策略的选择具有重要意义。     

并行调度两级轮询控制系统分析研究

为了保证系统公平性不受损害,文中提出中心站点采用门限服务,普通站点采用并行调度完全服务的两级优先级轮询控制系统模型。通过马尔科夫链与概率母函数相结合的方法对模型的平均排队队长、平均等待时间等重要参数进行解析。经仿真得出,模拟仿真值与理论值误差较小,近似相等,表明模型理论分析合理正确。数值结果对比表明,模型区分网络业务高低优先级的性能优良,且普通站点工作效率得以提高,从而保证了系统公平性。     

一种基于时延补偿的星上分组调度算法

EDF策略具有有线调度算法中最大调度域和时延保障特性,根据分组时延要求确定服务优先级,是一种动态权重调度策略,通过将IQ-VOQ结构EDF策略引入无线调度并通过加入信道补偿机制和门限丢弃策略,得到一种新的算法IQCEDF,它避开公平排队固有的时延一带宽耦合问题,获得了比EDF更加出色的时延特性,更适于为卫星通信系统分组业务提供服务质量保证。     

Polling systems with server timeouts and their application to tokenpassing networks

Polling systems have long been the subject of study and are of particular interest in the analysis of high-speed communications networks. There are many options for the scheduling policies that can be used at each polling station (exhaustive, gated, customer limited, etc.). In addition, one can impose an upper bound on the total service time delivered to customers at a station per server visit. In the most common case the upper bound is a constant for each polling station, and the resulting system model is not Markovian even when service times and interarrival times are exponential. In the paper, a comprehensive solution is developed for the major scheduling policies with time limits for each polling station. The approach is based on studying the embedded Markov chain defined at the sequence of epochs when the server arrives at each polling station. The computation of transition probabilities for the embedded chain requires transient analysis of the Markov process describing the system evolution between epochs. Uniformization methods are used to develop efficient algorithms for the transition probabilities and for system performance measures. Example problems are solved using the techniques developed to illustrate the utility of the results     

Queue-aware uplink bandwidth allocation and rate control for polling service in IEEE 802.16 broadband wireless networks

IEEE 802.16 standard defines the air interface specifications for broadband access in wireless metropolitan area networks. Although the medium access control signaling has been well-defined in the IEEE 802.16 specifications, resource management and scheduling, which are crucial components to guarantee quality of service performances, still remain as open issues. In this paper, we propose adaptive queue-aware uplink bandwidth allocation and rate control mechanisms in a subscriber station for polling service in IEEE 802.16 broadband wireless networks. While the bandwidth allocation mechanism adaptively allocates bandwidth for polling service in the presence of higher priority unsolicited grant service, the rate control mechanism dynamically limits the transmission rate for the connections under polling service. Both of these schemes exploit the queue status information to guarantee the desired quality of service (QoS) performance for polling service. We present a queuing analytical framework to analyze the proposed resource management model from which various performance measures for polling service in both steady and transient states can be obtained. We also analyze the performance of best-effort service in the presence of unsolicited grant service and polling service. The proposed analytical model would be useful for performance evaluation and engineering of radio resource management alternatives in a subscriber station so that the desired quality of service performances for polling service can be achieved. Analytical results are validated by simulations and typical numerical results are presented.     

Packet Delay Analysis of Symmetric Gated Polling System for DBA Scheme in an EPON

In this paper, we analyze the mean packet delay of a dynamic bandwidth allocation (DBA) scheme in an Ethernet passive optical network (EPON). We propose the interleaved polling system with a gated service discipline and a two-stage queue in order to investigate the delay performance of DBA scheme in an EPON. We assume that input packets arrive at an optical network unit (ONU) according to a Poisson process from several types of users. We use a continuous time queueing model in order to find the mean packet delay and the mean cycle time of an arbitrary packet. We obtain the closed form solution for the mean packet delay of the proposed gated polling system with a two-stage queue. We obtain another result on the mean packet delay by solving a system of linear equations derived from the moments of the queue length distribution. We give some numerical results to investigate the delay performances for the symmetric polling system with statistically identical stations. In addition, we compare numerical results on the closed form solution with numerical results on a system of linear equations.     

Using GI‐G‐1 queuing model for rtPS performance evaluation in 802.16 networks

Among the scheduling services, rtPS (real‐time polling service) is designated for real‐time applications. Among three packet delay intervals, performance effect on polling interval has been widely studied, but less on the intervals of scheduling and delivery. To evaluate the performance of delay‐sensitive rtPS applications, instead of using continuous queueing model, a discrete‐time GI‐G‐1 model, which considers intervals of polling, scheduling, and delivery, is proposed. By taking VoIP as a typical rtPS application, the transmission latency under different QoS settings, polling probability, and traffic load are presented. The latency is also compared among various codec schemes. The results indicate that when the codec rate is either fulfilled or dissatisfied by the promised bandwidth of service levels, the performance is highly dependent upon the polling probability, no matter what the traffic condition is. However, if the codec rate is in between the promised bandwidth of various service levels, the polling probability is a dominant factor in light traffic environment, while the settings on QoS parameters will strongly determine the performance in heavy traffic situation. In addition to the verification using simulation, the bandwidth utilization derived from the GI‐G‐1 model can be applied to improve the serving capacity of base stations. Copyright © 2011 John Wiley & Sons, Ltd.     

Performance Evaluation of the IEEE 802.16 MAC for QoS Support

The IEEE 802.16 is a standard for broadband wireless communication in metropolitan area networks (MAN). To meet the QoS requirements of multimedia applications, the IEEE 802.16 standard provides four different scheduling services: unsolicited grant service (UGS), real-time polling service (rtPS), non-real-time polling service (nrtPS), and Best Effort (BE). The paper is aimed at verifying, via simulation, the effectiveness of rtPS, nrtPS, and BE (but UGS) in managing traffic generated by data and multimedia sources. Performance is assessed for an IEEE 802.16 wireless system working in point-to-multipoint (PMP) mode, with frequency division duplex (FDD), and with full-duplex subscriber stations (SSs). Our results show that the performance of the system, in terms of throughput and delay, depends on several factors. These include the frame duration, the mechanisms for requesting uplink bandwidth, and the offered load partitioning, i.e., the way traffic is distributed among SSs, connections within each SS, and traffic sources within each connection. The results also highlight that the rtPS scheduling service is a very robust scheduling service for meeting the delay requirements of multimedia applications     

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 Distributed DDQ for QoS Router

In a packet switching network, congestion is unavoidable and affects the quality of real‐time traffic with such problems as delay and packet loss. Packet fair queuing (PFQ) algorithms are well‐known solutions for quality‐of‐service (QoS) guarantee by packet scheduling. Our approach is different from previous algorithms in that it uses hardware time achieved by sampling a counter triggered by a periodic clock signal. This clock signal can be provided to all the modules of a routing system to get synchronization. In this architecture, a variant of the PFQ algorithm, called digitized delay queuing (DDQ), can be distributed on many line interface modules. We derive the delay bounds in a single processor system and in a distributed architecture. The definition of traffic contribution improves the simplicity of the mathematical models. The effect of different time between modules in a distributed architecture is the key idea for understanding the delay behavior of a routing system. The number of bins required for the DDQ algorithm is also derived to make the system configuration clear. The analytical models developed in this paper form the basis of improvement and application to a combined input and output queuing (CIOQ) router architecture for a higher speed QoS network.     

分布式队列服务算法在无线网状网包调度中的应用

根据无线网状网的包调度特点,结合已有的差分队列服务算法和分布式贝尔曼-福特算 法,将有线网络中的差分队列服务算法改进为分布式队列服务算法（DQS）,使之实用于无 线网状网中多任务条件下实现系统的吞吐量最大化。仿真实验证明了DQS算法能有效地避免 传统多径传输中的按“类”或 “流”来进行调度的缺陷,有效地减少了数据包的端到端 延时和缓冲区需求,尤其是DQS算法的实际平均吞吐量性能有了很大的提高。