SMAQ: a measurement-based tool for traffic modeling and queuinganalysis. I. Design methodologies and software architecture

SMAQ is a measurement-based tool for integration of traffic modeling and queuing analysis. There are three basic components in SMAQ. In the design of the first component, statistic measurement, the most critical issues are to identify the important traffic statistics for queuing analysis in a finite buffer system and then to build a measurement structure to collect them. Our study indicates that both first- and second-order traffic statistics, measured within a given frequency-window, have a very significant impact on the queue length and loss rate performance. In the design of the second component, matched modeling, the focal point is to construct a stochastic model that can match a wide range of important statistics collected in various applications. New methodologies and fast algorithms are developed for such construction on the basis of a circulant modulated Poisson process (CMPP). For the third component, queuing solutions, the basic requirement is to provide numerical solutions of the queue length and loss rate for transport of given traffic in a finite buffer system. A fast and stable computation method, called a Folding algorithm, is applied to provide both steady-state and transient solutions of various kinds, including congestion control performance where arriving traffic are selectively discarded based on queue thresholds. We provide both design methodologies and software architectures of these three components, with discussion of practical engineering issues for the use of the SMAQ tool     

基于分形点过程自相似流的队列性能分析

通过对交换机排队系统进行仿真,分析了以分形点过程( FPP )自相似业务流为输入的排队系统的性能.仿真结果显示,自相似业务流量模型下队列的性能与传统指数流量模型下的队列性能大不相同.文中所获得的仿真结果可用于网络流量模型、网络设计、网络拥塞控制和流量工程等.     

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.     

多信道无线通信网混合业务接入控制的离散排队分析

基于无线通信网的运行机制、实时性和非实时性混合业务对无线通信网络不同服务质量(QoS)要求,设计了实时性业务优先接入控制策略,建立了无线通信网络的混合业务带有优先接入控制的多服务台离散时间排队模型Geo1 Geo2/Geo1,Geo2/s,s(PP)。并且应用矩阵几何解方法,对该排队模型进行精确分析,得到了系统的主要性能指标:实时性业务和非实时性业务的平均队长、实时性业务的阻塞概率、系统信道利用率等结果。     

数据业务自相似特性研究

合适的业务源模型能够在建立理论分析模型或进行系统性能仿真时,使网络系统性能评价更加准确。自相似特性是数据业务的重要特征。本文分析了自相似业务源的建模现状,深入讨论了如何将自相似模型应用于GPRS业务源建模。通过时间序列自相似特性分析工具SELFIS,对中国移动GPRS网络中从一个网关支持节点GGSN处采集的在单位时间内收到的字节数进行分析,得出GPRS数据业务具有较强自相似性的结论。     

Distributed and Energy-Aware MAC for Differentiated Services Wireless Packet Networks: A General Queuing Analytical Framework

We present a novel queuing analytical framework for the performance evaluation of a distributed and energy-aware medium access control (MAC) protocol for wireless packet data networks with service differentiation. Specifically, we consider a node (both buffer-limited and energy-limited) in the network with two different types of traffic, namely, high-priority and low-priority traffic, and model the node as a MAP (Markovian arrival process)/PH (phase-type)/1/K nonpreemptive priority queue. The MAC layer in the node is modeled as a server and a vacation queuing model is used to model the sleep and wakeup mechanism of the server. We study standard exhaustive and number-limited exhaustive vacation models both in multiple vacation case. A setup time for the head-of-line packet in the queue is considered, which abstracts the contention and the back-off mechanism of the MAC protocol in the node. A nonideal wireless channel model is also considered, which enables us to investigate the effects of packet transmission errors on the performance behavior of the system. After obtaining the stationary distribution of the system using the matrix-geometric method, we study the performance indices, such as packet dropping probability, access delay, and queue length distribution, for high-priority packets as well as the energy saving factor at the node. Taking into account the bursty traffic arrival (modeled as MAP) and, therefore, the nonsaturation case for the queuing analysis of the MAC protocol, using phase-type distribution for both the service and the vacation processes, and combining the priority queuing model with the vacation queuing model make the analysis very general and comprehensive. Typical numerical results obtained from the analytical model are presented and validated by extensive simulations. Also, we show how the optimal MAC parameters can be obtained by using numerical optimization     

SMAQ: a measurement-based tool for traffic modeling and queuinganalysis. II. Network applications

For pt. I see ibid. p.56-65 (1998). SMAQ is a measurement-based tool for integration of traffic modeling and queuing analysis. It can be used in a variety of network design areas. For instance, it can be used as a traffic generator to generate various traces for network testing. It also provides numerical solutions of the queue length and loss rate performance for transport of multimedia traffic. Several application modules are built into the tool for the evaluation of statistical multiplexing, buffer dimensioning, and link bandwidth allocation. Other examples include the evaluation of traffic shaping, local-congestion control, and the modeling of wireless channel dynamics. As one will find, the SMAQ tool indeed provides a solution technique for network engineers to solve many of the current design issues     

一种基于瑞利分布的VBR视频流的小波模型

本文提出了一种新型的视频业务流模型,以Haar小波的多分辨率分析为基础,在尺度空间和小波空间分别建模,然后通过小波反变换得出仿真业务流.在最"粗"的尺度空间里,我们根据视频流的概率分布特点,采用基于瑞利(Rayleigh)分布的AR模型对尺度系数建模;在各个小波空间里,采用一般的高斯不相关小波模型(WIG,Wavelet Independent Guassian)建模.由于在尺度空间和小波空间针对各自的特点作了不同的处理,本文模型不但能较好拟合复杂业务流在各个时间尺度的概率分布特性,也能拟合其长时相关的特性.另外,在多尺度排队分析(MSQ,MultiScale Queue)的框架下,我们还推导出了基于本文模型的排队分析的理论结果.最后,通过对实际视频业务流数据仿真实验与排队分析验证了本文模型的有效性.     

TCP/IP在GPRS/EGPRS网络中的应用及影响

通用分组无线业务/增强型数据速率演进技术（GPRS/EGPRS）服务扩展了当前世界上最流行的第二代移动系统——基于语音的GSM,使其能够收发基于分组的数据。随着移动通信技术的发展和业务的多样化,人们对数据业务的需求不断增加,GPRS/EGPRS网络优化也成为了重中之重。除传统的无线网络及核心网络优化外,将其以端到端的思路分析,看为无线＋IP网络技术,成为了新的优化思路。因此传输控制协议/因特网互联协议（TCP/IP）作为互联网固有的最为广泛的传输协议在无线分组数据业务网络中同样得到广泛应用。主要就TCP/IP协议在GPRS/EGPRS中的应用其影响进行了分析。     

SHRiNK: a method for enabling scaleable performance prediction and efficient network simulation

As the Internet grows, it is becoming increasingly difficult to collect performance measurements, to monitor its state, and to perform simulations efficiently. This is because the size and the heterogeneity of the Internet makes it time-consuming and difficult to devise traffic models and analytic tools which would allow us to work with summary statistics. We explore a method to side step these problems by combining sampling, modeling, and simulation. Our hypothesis is this: if we take a sample of the input traffic and feed it into a suitably scaled version of the system, we can extrapolate from the performance of the scaled system to that of the original. Our main findings are as follows. When we scale an IP network which is shared by short- and long-lived TCP-like and UDP flows and which is controlled by a variety of active queue management schemes, then performance measures such as queueing delay and drop probability are left virtually unchanged. We show this in theory and in simulations. This makes it possible to capture the performance of large networks quite faithfully using smaller scale replicas.     

EGPRS和cdma 1x无线数据业务性能对比研究

EGPRS是一种基于GSM/GPRS网络的数据增强型通用分组无线业务,它充分利用了现有的GSM/GPRS网络资源,保护运营商的投资,在第三代移动网络商业化之前提前为用户提供个人多媒体通信业务。cdma1x是基于CDMAIS95网络的升级,是通往cdma2000的过渡阶段,同样也提供较大容量的数据业务支持。本文主要针对EGPRS和cdma1x技术的无线性能和特点在理论上进行了对比分析,之后通过对某城市的两种网络进行了实地测试,重点从用户体验的角度考察和对比了两种网络提供数据业务的能力。     

Performance analysis of data packet discarding in ATM networks

Data performance in ATM networks should be measured on the packet level instead of the cell level, since one or more cell losses within each packet is equivalent to the loss of the packet itself. Two packet-level control schemes, packet tail discarding and early packet discarding, were proposed to improve data performance. In this paper, a new stochastic modeling technique is developed for performance evaluation of two existing packet-discarding schemes at a single bottleneck node. We assume that the data arrival process is independent of the nodal congestion, which may represent the unspecified bit-rate traffic class in ATM networks, where no end-to-end feedback control mechanism is implemented. Through numerical study, we explore the effects of buffer capacity, control threshold, packet size, source access rate, underlying high-priority real-time traffic, and loading factor on data performance, and discuss their design tradeoffs. Our study shows that a network system can he entirely shut down in an overload period if no packet-discarding control scheme is implemented, under the assumption that there are no higher layer congestion avoidance schemes. Further, unless with sufficiently large buffer capacity, early packet discarding (EPD) always outperforms packet tail discarding (PTD) significantly under most renditions. Especially under the overload condition, EPD can always achieve about 100% goodput and 0% badput, whereas the PTD performance deteriorates rapidly. Among all the factors, the packet size has a dominant impact on EPD performance. The optimal selection of the EPD queue control threshold to achieve the maximum goodput is found to be relatively insensitive to traffic statistics     

GPRS／EGPRS网络的多维优化

以江苏无锡地区爱立信设备为例，从GPRS／EGPRS网络的功能开通条件、基础网络优化、面向终端的优化以及面向业务的优化等多个方面，全方位探讨了GPRS/EGPRS网络的建设和优化工作。     

Handoff priority scheme with preemptive, finite queueing and reneging in mobile multiservice networks

A scheme supporting voice and data calls with some grade of service (GoS)¹ guarantee in mobile multiservice networks is proposed. In this system, voice calls have preemptive priority over data calls. Preempted data calls can wait in a queue for a random patience time after which they leave the queue. A data call can be preempted only if there is space left in the finite size queue. To assess the performance of this system, an analytical model is given and performance metrics such as call blocking, call dropping and call non‐completion probabilities are investigated. Although this scheme is a generic model, it can be easily adapted to take into account the specific definitions of practical and commercial data service standards in wireless mobile networks such as GPRS or DECT. This revised version was published online in June 2006 with corrections to the Cover Date.     

Quality of service for voice over IP in networks with congestion avoidance

This paper assesses the impact of active queue management schemes on the quality of service of voice over Internet protocol applications. A new analytical method based on a fixed point approach to estimate the end-user satisfaction is proposed. The results obtained were validated using discrete event simulation techniques. In all the studied cases, it was observed a great deal of agreement between the analytical results and the results obtained through simulation. The theoretical predictions, as well as the presented empirical evidences confirm, as demonstrated in previous works, that the use of active queue management offers better quality of service than the traditional queue control mechanisms used in Internet. From these results, we may reasonably conclude that the presented method can be used for network design in the presence of voice traffic.     

BOUNDS FOR MULTIPLEXING LEAKY-BUCKET ENFORCED SOURCES IN ATM NETWORKS

Leaky-bucket (LB) based traffic parameters are widely used for traffic declaration and monitoring (enforcing) in asynchronous transfer mode (ATM) networks. For such a system, every traffic source is policed by an LB enforcer before entering the access node at the edge of the network. In this article, we investigate the characteristics of the model that such traffic sources are multiplexed together by a multiplexer in the edge node. Based on the worst case performance, we derive the upper bound and the lower bound of queue length at the multiplexer as functions of the LB parameters and number of connections. In particular, we also take the peak cell rate, which is an important parameter, into consideration. We also modify the well-known Little’s formula which is derived based on long-term average, to be suitable for a complete busy period. It helps us to derive bounds on average waiting time by way of average queue length.     

有限负载下802.11 DCF的性能分析及优化

利用三维马尔可夫链和M/G/1/K队列建立了有限负载下DCF机制的性能模型,分析了终端数量、传输负载、二进制指数回退机制及MAC层有限队列对系统性能的影响.基于该模型,推导了有限负载下最大化吞吐量的最优最小竞争窗口的闭式解.仿真结果表明,模型能够有效地预测有限负载下DCF的性能,根据传输负载调整最小竞争窗口大小能够获得最大化吞吐量.     

All‐IPv6 service interworking gateway

Improvements of inter‐operability, interface IP and dual mobility function must be investigated to move toward full IP and seamless multimedia applications. An All‐IPv6 service architecture that consists of cellular systems and Wireless LAN networks has been constructed. A GPRS/WLAN interworking gateway with an IPv6 facility has been designed and its performance examined in terms of queue length, system throughput, loss rate and delay. The results of the simulation of a 1 Mbps WLAN and 144 kbps GPRS interworking system show that: (1) the queue length is directly proportional to the traffic load (the length increases to 100 packets in 61 seconds at a rate of increase of around 50% per 30 seconds); (2) if the size of the queue is increased to 100 packets, then the loss rate declines to 0.017, (a longer queue corresponds to a lower loss rate); (3) the size of the queue only weakly influences the system throughput when the queue length is increased; and (4) the average delay is approximately 0.83 second/bit, when the queue size is 100 packets. The delay doubles as the queue size doubles. Copyright © 2005 John Wiley & Sons, Ltd.     

有限负载下802.11 DCF的性能分析及优化

利用三维马尔可夫链和M/G/1/K队列建立了有限负载下DCF机制的性能模型,分析了终端数量、传输负载、二进制指数回退机制及MAC层有限队列对系统性能的影响.基于该模型,推导了有限负载下最大化吞吐量的最优最小竞争窗口的闭式解.仿真结果表明,模型能够有效地预测有限负载下DCF的性能,根据传输负载调整最小竞争窗口大小能够获得最大化吞吐量.     

Admission control and buffer management of wireless communication systems with mobile stations and integrated voice and data services

This study presents models for management of voice and data traffic and new algorithms, which use call admission control as well as buffer management to optimise the performance of single channel systems such as wireless local area networks in the presence of mobile stations. Unlike existing studies, the new approach queues incoming voice packets as well as data packets, and uses a new pre-emption algorithm in order to keep the response time of voice requests at certain levels while the blocking of data requests is minimised. A new performance metric is introduced to provide uncorrelated handling of integrated services. Queueing related issues such as overall queue capacity, individual capacities for voice and data requests, the probability of blocking, and effects of waiting time on overall quality of service are considered in detail. Analytical models are presented and the results obtained from the analytical models were validated using discrete event simulations.