无线Mesh网络流量自相似性研究

近年来,无线Mesh网络已成为一个倍受关注的研究领域.对无线Mesh网络流量特性的研究将有助于网络协议的研究、评估,以及网络结构的规划和建设.本文通过对无线Mesh测试网上采集的数据包进行统计分析,揭示了网络流量具有自相似的特性.同时,解释了无线Mesh网络流量自相似性是由网络中具有重尾分布特性的多个流叠加形成的,并通过仿真进一步分析了节点移动性对流量自相似性的影响.     

MANET中路由算法对通信流自相似特性的影响

着重分析无线多跳移动网络中,不同路由算法对多媒体通信流自相似特性的影响.通过NS2仿真产生基于不同路由算法的通信流数据,运用V-T法和R/S图法分别分析其突发性参数.结果表明,基于表驱动的DSDV自相似参数最大,而分簇路由算法CBRP自相似参数最小,更有利于实时流媒体的传输.研究对提高无线网络路由协议的性能和多媒体服务的质量具有重要意义.     

Study of the Effect of the Wireless Gateway on Incoming Self-Similar Traffic

It has been well established by now that high-speed wireline traffic exhibits self-similar behavior. Due to the important consequences of traffic self-similarity in network design, several studies have assumed that wireless traffic is also self-similar and looked at its effects on network performance. However, due to factors such as power limitations and the wireless channel, it is not straightforward that wireline traffic will remain self-similar as it enters the wireless network. This paper provides an analytical study of the propagation of traffic characteristics as wireline traffic is passed to the wireless network through a gateway. The analysis takes into account buffering and repacking operations performed at the gateway, and models for wireline traffic and the wireless channel. We consider two server models, an instant transfer model, and an energy-conserving one. We show that in most cases, in response to self-similar wireline traffic the gateway will produce self-similar wireless traffic. However, when the gateway operates under an energy-conserving mode and if it has a large buffer, wireline traffic such as non-real-time variable-bit-rate traffic will result in non-self-similar wireless traffic. We also study the delays of packets passing through a gateway that is fed by self-similar traffic and show that their survival function has an asymptotically power-law tail with index smaller than 2.     

Ad hoc wireless network traffic-self-similarity and forecasting

Lots of works have been carried out to discuss the self-similarity of Ethernet and World Wide Web traffic. In this letter, we study the ad hoc wireless network traffic collected in an ad hoc network (AHN) testbed and show that the ad hoc wireless network traffic is self-similar, which validates that AHN traffic is forecastable because self-similar time-series can be forecasted. We apply a fuzzy logic system to ad hoc wireless network traffic forecasting and simulation results show that it performs much better than does an LMS adaptive filter. All these studies are very important for evaluating network capacity and determining the battery power mode based on the forecasted traffic workload     

重尾ON/OFF源模型生成自相似业务流研究

因为传统模型没有考虑网络业务流量各种时间尺度都具有突发性,因此是不完善的,一系列的测量结果表明,网络业务流量显示自相似性,重尾分布ON／OFF模型能比较好地解释自相似业务流的产生原因,可以把LAN上的业务分解为多个活动（active)主机对之间的业务流,本文通过系统的仿真实验研究了重尾ON／OFF源模型生成自相似流的机理,并与理论结果进行了对比,而且补充了理论结果。     

基于多终端协同的高清视频多流并发自适应传输控制方法

摘要：针对高清视频在异构无线网络中以多流并发的方式进行传输,以提高传输速率,从而增强用户体验的问题,以最小化系统传输时延以及各路径间时延差为优化目标,联合考虑了视频发送端和接收端,自适应调整视频发送速率和接收端缓存大小以提高用户体验,建立了异构无线网络中视频多流并发传输的控制模型,并基于Pareto分布和P/P/1排队理论对具有自相似性和长相关性的视频流进行了研究,推导了并发传输系统的时延统计特性,并在此基础上提出了一种异构无线网络视频流自适应分流决策方法。仿真结果表明,与一般的负载均衡分流决策方法相比,提出的异构网络多流并发自适应传输控制方法在时延和分组丢失率方面都有一定的优越性。     

TCP批量业务的自相似特性

通过对简单网络拓扑结构下不同参数TCP批量传输实测流量数据的统计分析,研究了TCP批量稳定流量的自相似特性.分析结果表明,在10BaseT环境下,TCP批量传输的流量比较稳定,没有明显的突发性与自相似特性.而在100BaseTx环境下,TCP批量传输的流量表现出明显的突发性与自相似性,其自相似性强弱程度与通信方式、网卡缓存大小密切相关.同样条件,全双工TCP流自相似强度大于半双工流;而网卡缓存越少,TCP流突发性与自相似性越强.     

Self-similarity through high-variability: statistical analysis ofEthernet LAN traffic at the source level

A number of empirical studies of traffic measurements from a variety of working packet networks have demonstrated that actual network traffic is self-similar or long-range dependent in nature-in sharp contrast to commonly made traffic modeling assumptions. We provide a plausible physical explanation for the occurrence of self-similarity in local-area network (LAN) traffic. Our explanation is based on convergence results for processes that exhibit high variability and is supported by detailed statistical analyzes of real-time traffic measurements from Ethernet LANs at the level of individual sources. This paper is an extended version of Willinger et al. (1995). We develop here the mathematical results concerning the superposition of strictly alternating ON/OFF sources. Our key mathematical result states that the superposition of many ON/OFF sources (also known as packet-trains) with strictly alternating ON- and OFF-periods and whose ON-periods or OFF-periods exhibit the Noah effect produces aggregate network traffic that exhibits the Joseph effect. There is, moreover, a simple relation between the parameters describing the intensities of the Noah effect (high variability) and the Joseph effect (self-similarity). An extensive statistical analysis of high time-resolution Ethernet LAN traffic traces confirms that the data at the level of individual sources or source-destination pairs are consistent with the Noah effect. We also discuss implications of this simple physical explanation for the presence of self-similar traffic patterns in modern high-speed network traffic     

Optimal Routing for Wireless Mesh Networks With Dynamic Traffic Demand

Wireless mesh networks have attracted increasing attention and deployment as a high-performance and low-cost solution to last-mile broadband Internet access. Traffic routing plays a critical role in determining the performance of a wireless mesh network. To investigate the best routing solution, existing work proposes to formulate the mesh network routing problem as an optimization problem. In this problem formulation, traffic demand is usually implicitly assumed as static and known a priori. Contradictorily, recent studies of wireless network traces show that the traffic demand, even being aggregated at access points, is highly dynamic and hard to estimate. Thus, in order to apply the optimization-based routing solution into practice, one must take into account the dynamic and unpredictable nature of wireless traffic demand. This paper presents an integrated framework for wireless mesh network routing under dynamic traffic demand. This framework consists of two important components: traffic estimation and routing optimization. By studying the traces collected at wireless access points, we first present a traffic estimation method which predicts future traffic demand based on its historical data using time-series analysis. This method provides not only the mean value of the future traffic demand estimation but also its statistical distribution. We further investigate the optimal routing strategies for wireless mesh network which take these two forms of traffic demand estimations as inputs. The goal is to balance the traffic load so that minimum congestion will be incurred. This routing objective could be transformed into the throughput optimization problem where the throughput of aggregated flows is maximized subject to fairness constraints that are weighted by the traffic demands. Based on linear programming, we present two routing algorithms which consider the mean value and the statistical distribution of the predicted traffic demands, respectively. The trace-driven simulation study demonstrates that our integrated traffic estimation and routing optimization framework can effectively incorporate the traffic dynamics in mesh network routing.     

Packet-level traffic measurements from the Sprint IP backbone

Network traffic measurements provide essential data for networking research and network management. In this article we describe a passive monitoring system designed to capture GPS synchronized packet-level traffic measurements on OC-3, OC-12, and OC-48 links. Our system is deployed in four POP in the Sprint IP backbone. Measurement data is stored on a 10 Tbyte storage area network and analyzed on a computing cluster. We present a set of results to both demonstrate the strength of the system and identify recent changes in Internet traffic characteristics. The results include traffic workload, analyses of TCP flow round-trip times, out-of-sequence packet rates, and packet delay. We also show that some links no longer carry Web traffic as their dominant component to the benefit of file sharing and media streaming. On most links we monitored, TCP flows exhibit low out-of-sequence packet rates, and backbone delays are dominated by the speed of light.     

A nonstationary traffic train model for fine scale inference from coarse scale counts

The self-similarity of network traffic has been convincingly established based on detailed packet traces. This fundamental result promises the possibility of solving on-line and off-line traffic engineering problems using easily collectible coarse time-scale data, such as simple network management protocol measurements. This paper proposes a statistical model that supports predicting fine time-scale behavior of network traffic from coarse time-scale aggregate measurements. The model generalizes the commonly used fractional Gaussian noise process in two important ways: (1) it accommodates the recurring daily load patterns commonly observed on backbone links and (2) features of long range dependence and self-similarity are modeled only at fine time scales and are progressively damped as the time period increases. Using the data we collected on the Chinese Education and Research Network, we demonstrate that the proposed model fits 5-min data and generates 10-s aggregates that are similar to actual 10-s data.     

Design and implementation of adaptive WLAN mesh networks for video surveillance

This paper presents a novel design and practical experiments of adaptive wireless mesh networks based on 802.11 based Wireless Local Area Networks for supporting public video surveillance. A network of video cameras and sensors can be equipped with wireless communication modules to form wireless surveillance at only a small expense of cost and labor. However, large and redundant multimedia data transmitted through the wireless medium pose challenging problems such as decrease in Quality of Service (QoS) and system reliability. To support seamless transmission of surveillance data through wireless means, we propose a wireless surveillance network design based on the protocols and functions of IEEE 802.11 mesh standard. One of the key functions of our adaptive mesh network is the “Multi-Gateway Routing with Congestion Avoidance”, which provides enhanced QoS support via adaptive congestion control. Network congestion is predicted in a distributed manner and amounts of data traffic transmitted to the congested path are redirected to multiple gateways. Redirection of traffic flows are made in such a way to provide quicker transmission for more time critical packets. Experimental studies via practical testbed implementation and simulation via NS-3 are conducted to prove the superiority of our proposed scheme.     

A novel scheduling scheme to share dropping ratio while guaranteeing a delay bound in a MultiCode-CDMA network

A MultiCode-CDMA network that is capable of providing quality-of-service guarantees will find widespread application in future wireless multimedia networks. However, providing delay guarantees to time-sensitive traffic in such a network is challenging because its transmission capacity is variable even in the absence of any channel impairment. We propose and evaluate the performance of a novel transmission scheduling scheme that is capable of providing such a delay guarantee in a MultiCode-CDMA network. The proposed scheme drops packets to ensure that delays for all transmitted packets are within the guaranteed target bounds, but packets are dropped in a controlled manner such that the average dropping ratios of a set of time-sensitive flows can be proportionally differentiated according to the assigned weighting factors or shares. We provide extensive simulation results to show the effectiveness of the proposed scheme as well as to study the effects of various parameters on its performance. In particular, we show that it can simultaneously guarantee a delay upper bound and a proportionally differentiated dropping ratio in a fading wireless channel for different traffic loads, peak transmission rates, and weighting factors of individual flows.     

基于自相似特性的局域网流量异常评估方法

针对现有的局域网评估模型不能提供局域网系统中数据传输安全的有效信息的缺陷,文中提出了一种通过分析局域网网关流量的自相似性变化,来对局域网系统的数据传输安全进行合理评估的方法.该方法通过选择合适的时间尺度,利用whittle估计器法计算多种测度的自相似系数,判断测度值是否偏离正常值范围来综合分析局域网流量的异常状况.在此基础上,提出了改进的局域网系统安全评估模型.实验证明,此方法能够反映网络攻击等多种原因导致的流量异常变化,提供给管理员直观的数据传输安全态势图.     

面向大规模网络的聚集TCP流量模拟方法研究

为平衡大规模网络骨干网上TCP流量模拟的准确性和复杂度,提出模拟接入网出口处的TCP聚集流量,而不从单台主机或会话的层面进行流量模拟。从网络流量的自相似性出发,提出基于应用层和网络传输层自相似的TCP聚集流量模型:在应用层通过聚集多个服从Pareto分布的ON/OFF源模拟生成自相似流量,在网络传输层根据TCP机制实现对应用层流量的聚集传输控制。模拟结果显示,在流量负载比例、流量自相似性以及骨干节点丢包率等方面,模拟结果与采集自某互联网交换中心的实际数据吻合良好,表明了该模型的有效性。     

CoopMAC: A Cooperative MAC for Wireless LANs

Due to the broadcast nature of wireless signals, a wireless transmission intended for a particular destination station can be overheard by other neighboring stations. A focus of recent research activities in cooperative communications is to achieve spatial diversity gains by requiring these neighboring stations to retransmit the overheard information to the final destination. In this paper we demonstrate that such cooperation among stations in a wireless LAN (WLAN) can achieve both higher throughput and lower interference. We present the design for a medium access control protocol called CoopMAC, in which high data rate stations assist low data rate stations in their transmission by forwarding their traffic. In our proposed protocol, using the overheard transmissions, each low data rate node maintains a table, called a CoopTable, of potential helper nodes that can assist in its transmissions. During transmission, each low data rate node selects either direct transmission or transmission through a helper node in order to minimize the total transmission time. Using analysis, simulation and testbed experimentation, we quantify the increase in the total network throughput, and the reduction in delay, if such cooperative transmissions are utilized. The CoopMAC protocol is simple and backward compatible with the legacy 802.11 system. In this paper, we also demonstrate a reduction in the signal-to-interference ratio in a dense deployment of 802.11 access points, which in some cases is a more important consequence of cooperation     

Performance analysis of slotted ALOHA and network coding for single-relay multi-user wireless networks

Deployment of wireless relay nodes can enhance system capacity, extend wireless service coverage, and reduce energy consumption in wireless networks. Network coding enables us to mix two or more packets into a single coded packet at relay nodes and improve performances in wireless relay networks. In this paper, we succeed in developing analytical models of the throughput and delay on slotted ALOHA (S-ALOHA) and S-ALOHA with network coding (S-ALOHA/NC) for single-relay multi-user wireless networks with bidirectional data flows. The analytical models involve effects of queue saturation and unsaturation at the relay node. The throughput and delay for each user node can be extracted from the total throughput and delay by using the analytical models. One can formulate various optimization problems on traffic control in order to maximize the throughput, minimize the delay, or achieve fairness of the throughput or the delay. In particular, we clarify that the total throughput is enhanced in the S-ALOHA/NC protocol on condition that the transmission probability at the relay node is set at the value on the boundary between queue saturation and unsaturation. Our analysis provides achievable regions in throughput on two directional data flows at the relay node for both the S-ALOHA and S-ALOHA/NC protocols. As a result, we show that the achievable region in throughput can be enhanced by using network coding and traffic control.     

Rate-Diversity and Resource-Aware Broadcast and Multicast in Multi-rate Wireless Mesh Networks

This paper focuses on the problem of increasing the traffic capacity (volume of admissible traffic) of broadcast and multicast flows in a wireless mesh network (WMN). We study and suggest routing strategies where the process of constructing the forwarding tree considers three distinct features: (a) the ability of individual mesh nodes to perform link-layer broadcasts at multiple rates, (b) the wireless broadcast advantage, whereby a single broadcast transmission covers multiple neighboring receivers and (c) the residual transmission capacity at a WMN node, subject to intereference-based constraints from existing traffic flows in its neighborhood. Our metric of interest is the total number of broadcast and multicast flows that can be admitted into the network, without resulting in unacceptable degradation in metrics such as packet loss and dissemination latency. Our discrete event simulations show that the broadcast tree construction heuristic which takes both transmission rate and residual bandwidth into account out-performs those that do not. Building on our work on resource-aware broadcast tree construction, we propose a resource-aware multicast tree construction algorithm which exploits the multiple link-layer rates, the wireless broadcast advantage and the amount of resources available. Simulation results show that this algorithm performs better than heuristics based on pruning a broadcast tree or shortest path trees.     

Delay analysis in practical wireless network coding

Network coding provides a powerful mechanism for improving performance of wireless networks. In this paper, we present an analytical approach for end‐to‐end delay analysis in wireless networks that employs inter‐session network coding. Prior work on performance analysis in wireless network coding mainly focuses on the throughput of the overall network. Our approach aims to analyze the delay of each flow in the network. The theoretical basis of our approach is network calculus. In order to use network calculus to analyze the performance of traffic flows in the network, we have to address three specific problems: identifying traffic flows, characterizing broadcast links, and measuring coding opportunities. We propose solutions for these problems and discuss the practical issues when applying the approach in practice. We make three main contributions. First, we obtain theoretical formulations for computing the queueing delay bounds of traffic flows in wireless networks with network coding. Second, with the formulations, we figure out the factors that affect the queueing delay of a flow and find that first‐in first‐out scheduling cannot fully exploit the benefit of network coding. Third, in order to exploit our findings, we introduce a new scheduling scheme that can improve the performance of current practical wireless network coding. Copyright © 2012 John Wiley & Sons, Ltd.