基于分形漏桶的长程相关业务端到端延迟上界模型

为了求解以长程相关业务作为输入的网络端到端延迟上界,提出了基于分形漏桶和GPS系统的端到端网络模型,利用网络演算理论证明了分形漏桶的引入不增加网络端到端延迟上界,建立了端到端延迟理想及其近似确定上界模型.数值结果表明,分形漏桶有效改善了长程相关特性对端到端延迟上界所造成的影响,与简单漏桶相比,基于分形漏桶的长程相关业务端到端延迟上界具有更好的紧致性.     

基于分形漏桶整形器的通用处理器共享系统性能分析

为了分析自相似业务流对通用处理器共享（GPS）系统性能的影响,研究了GPS系统性能与业务流自相似参数等因素之间的关系.通过使用分形漏桶的包络曲线对进入GPS系统的自相似业务流进行整形,推导了利用自相似业务流作为输入的GPS系统的队列长度和时延统计上界.数值结果与分析显示,基于分形漏桶的GPS系统性能模型对自相似业务流具有较好的性能.     

自相似混合业务流的网络性能研究

针对传统业务流量模型的网络性能结论不能完全适用于多路自相似业务混合流量的智能电力通信网络,首先介绍基于分形布朗运动的单一自相似业务流模型,接着分析多路输入自相似业务的合成流量模型,然后研究多路输入自相似流的网络性能,最后给出智能电力通信网中4类通信业务的QoS要求,其中通信业务的QoS要求和多路输入自相似混合流的网络性能计算,可为智能电力通信网的进一步研究提供参考。     

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

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

基于自相似业务模型的WCDMA接入性能分析

随机接入技术对WCDMA网络数据业务性能优化具有较大影响,文提出基于自相似业务模型的WCDMA接入技术并进行性能分析。仿真结果表明基于自相似业务模型的WCDMA网络数据业务接入性能与分形系数H值、网络负载G等参数有关。文章还提出了基于WCDMA的业务接入自相似均衡协议(TASEP),能明显改善WCDMA网络数据业务的接入性能。     

基于统计网络演算的端到端时延上界研究

为分析融合网络端到端统计时延性能,根据最小加代数理论中的统计网络演算相关知识,提出了一种改进的统计服务曲线并应用GPS调度系统模型,然后利用网络演算理论求解串型网络节点统计时延上界。数值分析结果表明,改进的调度模型有效改善了自相关特性对时延上界所造成的影响,比未改进的模型相比统计时延上界更具有良好的紧致性,为在融合网络环境中对端到端节点延迟上界研究提供有效控制、调度和管理具有一定的参考价值。     

ATM网络中自相似业务下复接器性能的研究

近期对大量实际网络的测量表明,现代网络的业务流特性和部分信源的特性,更适于采用具有长期相关性的自相似或分形模型来描述。已有研究表明长期相关业务的排队特性与基于短期相关模型的有很大不同。但对于自相似业务下ATM网络中复接器性能的研究尚未深入进行。本文在提出一种准自相似(QSSP)的长期相关业务流模型的基础上,求得了N路同参数QSSP输入时复接器的信元丢失率和复接增益,并对非同参数输入的情况提出了一种快速的数值求解方法,用于得到复接器的信元丢失率上限。计算机仿真表明了分析的准确性。     

ATM网络中自相似业务下复接器性能的研究

近期对大量实际网络的测量表明,现代网络的业务流特性和部分信源的特性,更适于采用具有长期相关性的自相似或分形模型来描述。已有研究表明长期相关业务的排队特性与基于短期相关模型的有很大不同。但对于自相似业务下ＡＴＭ网络中复接器性能的研究尚未深入进行。本文在提出一种准自似（ＱＳＳＰ）的长期相关业务流模型的基础上,求得了Ｎ路同参数ＱＳＳＰ输入时复接器的信元丢失率和复接增益,并对非同参数输入的情况提出了一种快     

基于网络演算的无线自组网QoS性能确定上界研究

为保证无线自组网的服务质量(QoS),需精确求解其性能确定上界.对进入无线自组网节点的数据流进行漏桶管制,节点为数据流提供基于速率-延迟(rate-latency)模型的服务保障,在已有无线自组网链路吞吐量模型的基础上利用网络演算理论推导了无线自组网节点的积压数据上界、端到端数据流的延迟上界以及端到端数据流的延迟抖动上界模型.对网格形式拓扑的无线自组网,不同数据流的仿真结果都在数值计算的上界范围之内,表明基于网络演算理论的无线自组网的QoS性能上界模型具有较好的性能.     

自相似业务下共享通道保护WDM网络性能分析

该文利用随机中点置换-分形高斯噪声(RMD-FGN)方法生成自相似业务,并且利用分层图方法来记录WDM网络状态,提出了一种链路状态描述模型。对自相似业务下55 Mesh_Torus共享通道保护WDM网络性能进行了仿真。结果表明:当业务的自相似系数或方差变大时,也就是说业务的突发程度变大时,阻塞率变大,网络的性能下降。增加单纤波长数,可以降低阻塞率,提高网络性能。     

基于自相似业务流的Hurst加权随机早检测算法

Floyd提出的随机早丢弃（RED，random carly detection）是基于传统的泊松（Possion）模型，不适应网络流量普遍呈现自相似性的特点。基于此目的，提出了一种新的RED算法——Hurst加权随机早检测算法（HWRED，Hurst weighted random early detection）。新算法能够根据输入流量的自相似系数Hurst，调整RED算法参数。仿真结果表明，新算法提高了队列长度的稳定性，减少了丢包率、排队时延和排队抖动，提高了网络的链路利用率。     

Performance modelling of generalized processor sharing systems with multiple self-similar traffic flows

The Generalized Processor Sharing (GPS) is an important service differentiation scheme in telecommunication systems and has attracted great research interests due to the desirable properties of fairness, traffic isolation, and work conservation. The major limitation of the existing analytical performance models of GPS systems subject to self-similar traffic is that these models have been restricted to a simplified scenario with only two traffic flows. To overcome such a limitation, this study proposes a new flow-decomposition approach to modelling GPS systems subject to multiple self-similar traffic flows. We present and prove the existence of a feasible ordering of GPS systems based on the required and guaranteed service rates of traffic flows. With the aid of the feasible ordering, we decompose the GPS system into a group of single-queue systems and then derive the queue length distributions and loss probabilities of individual self-similar traffic flows in the original GPS system. Extensive simulation experiments are conducted to validate the accuracy of the developed analytical model.     

Queue Analysis and Multiplexing of Heavy-tailed Traffic in Wireless Packet Data Networks

Recent research based on traffic measurements shows that Internet traffic flows have a fractal nature (i.e., self-similarity property), which causes an underestimation of network engineering parameters when using the conventional Poisson model. Preliminary field measurements demonstrate that packet data traffic in wireless communications also exhibits self-similarity. In this paper, we investigate the queuing behavior of self-similar traffic flows for data applications in a packet-switching single-server wireless network. The traffic is generated by an on–off source with heavy-tailed on periods and exponentially distributed off periods. We extend previous analysis of a relation among the asymptotic distribution of loss probability, traffic specifications, and transmission rate for a wireline system to a wireless system, taking into account wireless propagation channel characteristics. We also investigate the multiplexing of heavy-tailed traffic flows with a finite buffer for the downlink transmission of a wireless network. Computer simulation results demonstrate that assumptions made in the theoretical analysis are reasonable and the derived relationships are accurate.     

Edge node buffer usage in optical burst switching networks

Optical Burst Switching (OBS) combines the benefits of Optical Packet Switching and Optical Circuit Switching technologies to provide an efficient, yet cost effective, method for data transmission in an all-optical, bufferless, core network. While most studies on OBS has concentrated on the core OBS network, we contribute new studies for the buffer requirement of an OBS edge node. The buffer usage for OBS systems only arises in the edge nodes since they contain an array of assemblers which combines electronic data with a common destination into an OBS burst stream for transmission in an all-optical bufferless core network. Specifically, we present two analytical results for buffer usage in an OBS edge node: one for Poisson traffic and the other for self-similar traffic input. The results show that the aggregated traffic from many assemblers inherits the characteristics of the source input traffic. This means that the output traffic approaches Poisson if the input traffic is Poisson, and the output traffic remains self-similar if the input is self-similar. These results lead to the following important design issues when dimensioning buffer requirements in an OBS edge node: if the traffic input is Poisson, the M/G/m model is the model to use for obtaining the upper bound on buffer usage in an OBS edge node; and for the case of self-similar traffic, Brichet’s method can be used to provide the upper and lower bound.     

Analysis of leaky bucket mechanism based on burstiness characterization

In high-speed networks, a congestion control strategy has to manage bandwidth allocation based on the characteristics of input traffic sources. Accordingly, the definition of traffic characterization becomes significant in all aspects concerning network performance. In this paper, the burstiness characterization of a traffic stream is based on a virtual queue principle. We study the leaky bucket mechanism as a regulator element that controls input traffic before access to a newwork, as well as inside a network. To protect an input traffic stream, we investigate the optimal parameter settings of a leaky bucket. In addition, we analyse the worst case performance, and obtain upper bounds on loss probability and packet delay. We also determine the characteristics of an output stream in the worst case. Such performance bounds reveal the effectiveness of a leaky bucket, and provide enough information for the QOS satisfaction of the network users.     

Towards the formation of comprehensive SLAs between heterogeneous wireless DiffServ domains

Traffic patterns generated by multimedia services are different from traditional Poisson traffic. It has been shown in numerous studies that multimedia network traffic exhibits self-similarity and burstiness over a large range of time-scales. The area of wireless IP traffic modeling for the purpose of providing assured QoS to the end-user is still immature and the majority of existing work is based on characterization of wireless IP traffic without any coupling of the behaviour of queueing systems under such traffic conditions. Work in this area has either been limited to simplified models of FIFO queueing systems which do not accurately reflect likely queueing system implementations or the results have been limited to simplified numerical analysis studies. In this paper, we advance the knowledge of queueing systems by example of traffic engineering of different UMTS service classes. Specifically, we examine QoS mapping using three common queueing disciplines; Priority Queuing (PQ), Low Latency Queuing (LLQ) and Custom Queueing (CQ), which are likely to be used in future all-IP based packet transport networks. The present study is based on a long-range dependent traffic model, which is second order self-similar. We consider three different classes of self-similar traffic fed into a G/M/1 queueing system and construct analytical models on the basis of non-preemptive priority, low-latency queueing and custom queueing respectively. In each case, expressions are derived for the expected waiting times and packet loss rates of different traffic classes. We have developed a comprehensive discrete-event simulator for a G/M/1 queueing system in order to understand and evaluate the QoS behaviour of self-similar traffic and carried out performance evaluations of multiple classes of input traffic in terms of expected queue length, packet delay and packet loss rate. Furthermore, we have developed a traffic generator based on the self-similar traffic model and fed the generated traffic through a CISCO router-based test bed. The results obtained from the three different queueing schemes (PQ, CQ and LLQ) are then compared with the simulation results in order to validate our analytical models.     

一种基于小波的网络流量发生器设计

网络流量发生器在网络性能分析和协议实现中具有重要的作用。文章基于多分形小波模型，设计了一种自相似网络流量发生器。其中对随机数的生成、序列的截断、自相似序列的生成以及自相似流量的生成等主要设计部分进行了论述。与常用的基于分形布朗运动的模型的流量发生器相比，该发生器生成的流量具有更准确的自相似流量特性。