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.     

非确定环境下的QoS网络路由问题

该文探讨非确定环境下的QoS路由问题,包括最大可能性路径,最优路径分解以及最优分解路径问题。本文分析了当链路延迟为连续变量时最大可能性路径问题的求解,给出了链路延迟为正态分布时的相关算法。对于最优路径分解以及最优分解路径问题,本文给出了两种QoS分解方式:方式Ⅰ优化路径各链路满足QoS需求的可能性的乘积,方式Ⅱ优化路径各链路满足QoS需求的可能性的最小值。该文对其分别进行分析并给出具体算法。     

地域通信网中基于业务量的动态路由研究

本文从地域通信网的特点出发，分析了以前所使用的路由选择方法的优缺点，提出了网控支持的基于业务量的动态中币管理方法，并描述了该路由管理方法的分层结构和在地域网网络管理系统中的具体实现。     

Waveband Switching for Dynamic Traffic Demands in Multigranular Optical Networks

Waveband switching (WBS) in conjunction with multigranular optical cross-connect (MG-OXC) architectures can reduce the cost and complexity of OXCs. In this paper, we study the performance of different MG-OXC architectures under dynamic traffic. In the case with online incremental traffic, we compare two MG-OXC architectures in terms of the blocking probability of new lightpath requests and study the impact of port counts and traffic loads. We develop an online integer linear programming model (On-ILP), which minimizes the number of used ports and the request blocking probability, given a fixed number of wavelengths and MG-OXC architecture. The On-ILP optimizes the routing of new lightpaths so as to maximize lightpath grouping and reduce the port count given that existing traffic cannot be rearranged. We also propose a new efficient heuristic algorithm, called maximum overlap ratio (MOR) to satisfy incremental traffic and compare it with the On-ILP, first-fit, and random-fit algorithms. Our results and analysis indicate that using WBS with MG-OXCs can reduce the size (and, hence, the cost) of switching fabrics compared to using ordinary OXCs. Based on the results and observations in the incremental traffic case, we further study the performance of a particular MG-OXC architecture under fully dynamic or fluctuating traffic. Our simulations show that the proposed heuristic algorithm waveband assignment with path graph, which groups wavelengths to bands and uses wavelength converters efficiently under fluctuating traffic, significantly outperforms other heuristic algorithms.     

Energy-Efficient Routing for Connection-Oriented Traffic in Wireless Ad-Hoc Networks

We address the problem of routing connection-oriented traffic in wireless ad-hoc networks with energy efficiency. We outline the trade-offs that arise by the flexibility of wireless nodes to transmit at different power levels and define a framework for formulating the problem of session routing from the perspective of energy expenditure. A set of heuristics are developed for determining end-to-end unicast paths with sufficient bandwidth and transceiver resources, in which nodes use local information in order to select their transmission power and bandwidth allocation. We propose a set of metrics that associate each link transmission with a cost and consider both the cases of plentiful and limited bandwidth resources, the latter jointly with a set of channel allocation algorithms. Performance is measured through call blocking probability and average energy consumption and our detailed simulation model is used to evaluate the algorithms for a variety of networks.     

Making Routing Robust to Changing Traffic Demands: Algorithms and Evaluation

Intra-domain traffic engineering can significantly enhance the performance of large IP backbone networks. Two important components of traffic engineering are understanding the traffic demands and configuring the routing protocols. These two components are inter-linked, as it is widely believed that an accurate view of traffic is important for optimizing the configuration of routing protocols, and through that, the utilization of the network. This basic premise, however, seems never to have been quantified. How important is accurate knowledge of traffic demands for obtaining good utilization of the network? Since traffic demand values are dynamic and illusive, is it possible to obtain a routing that is "robust" to variations in demands? We develop novel algorithms for constructing optimal robust routings and for evaluating the performance of any given routing on loosely constrained rich sets of traffic demands. Armed with these algorithms we explore these questions on a diverse collection of ISP networks. We arrive at a surprising conclusion: it is possible to obtain a robust routing that guarantees a nearly optimal utilization with a fairly limited knowledge of the applicable traffic demands     

Energy-efficient Routing of Multimedia Traffic in Frequency-Hop Packet Radio Networks

Conservation of energy is important in a packet radio network, but reliance on energy-efficient routes for all types of traffic leads to large delays and low success probabilities in many situations. We describe and evaluate protocols that select routes according to the service priorities of the traffic. Energy conservation is emphasized for delay-tolerant traffic but sacrificed for delay-intolerant traffic, which gives good performance for both types of traffic.This paper was presented in part at the IEEE Wireless Communications and Networking Conference, Atlanta, March 2004.     

IP Routing and Traffic Analysis in Coherent Optical CDMA Networks

This paper proposes a novel IP routing schemes over coherent optical code-division multiple-access (OCDMA) network. As spreading code, flexible in length double-padded modified prime code (DPMPC) has been deployed. The performance has been analyzed in terms of the users' channel utilization factor in the network. The results are comparable with previous schemes and indicate that the architecture is power efficient and capable of accommodating greater number of active users with advantage of shorter code length (i.e., higher bit rate). It is shown that for a maximum bit rate the network performance can be improved by reducing the channel utilization. However, when each user in the network has a fixed bit rate, optimal channel utilization can be set for the overall network performance. Additionally, each IP packet is buffered only at the edge of this network, thus the buffer delay is significantly reduced compared with traditional routing schemes. Since the optical encoder is adjusted for number of packets rather than individually, the encoder adjusting time is also significantly reduced. Analytical results clearly indicate that coherent OCDMA technique can be a fine candidate for the future ultra fast optical IP networks.     

Comparison of Routing Procedures for Circuit-Switched Traffic in Nonhierarchical Networks

In this paper, we compare the use of different types of routing procedures for circuit-switched traffic in nonhierarchical networks. The main performance criterion used is the end-to-end blocking probability. The results show that if the network traffic is light, alternate routing performs better than nonalternate routing, but if the network traffic is heavy, the situation is reversed. To improve the performance of networks using alternate routing, different types of strategies varying from fixed control to dynamic control are introduced. A comparison based on numerical examples shows the improvement in performance attained by using a dynamic control strategy compared to fixed control. Good control techniques result in nonalternate routing under heavy traffic loads; nonalternate routing is the most viable alternative in nonhierarchical networks under heavy traffic conditions.     

组播路由调度的神经网络方法

本文探讨了在高速包交换计算机网络中，具有端到端时延及时延抖动限制的组播路由问题。首先给出了此类问题的网络模型及其数学描述，然后提出了基于Ｈｏｐｆｉｅｌｄ神经网络的组播路由优化算法。实验表明，本算法能根据组播应用对时延的要求，快速、有效地构造最优组播树，有较强的实时性。     

基于无线Mesh网络的交通信息系统

本文提出了一种基于无线Mesh网络的交通信息系统,系统由探测汽车采集实时交通信息,依托无线Mesh网络将采集得到的信息发送到信息处理中心.该系统能够提供准确实时的路况信息,无需大量固定基础设施支持,具有建设成本低、周期短、维护费用低的特点,特别适合我国交通事业发展的现状.     

Blocking in Wavelength-Routed Optical Networks With Heterogeneous Traffic

In this paper, we present a new analytical model that can give an accurate estimation of the blocking probabilities in wavelength-routed optical networks with heterogeneous traffic. By heterogeneous, we mean that each session offered to the network has its own traffic intensity and burstiness. In such cases, the blocking probability of a session is determined by the busy-wavelength distributions of the links seen at the arrival points of its calls. Thus, we first present two single-link models to estimate the arrival-point busy-wavelength distribution of a link with heterogeneous traffic: the full-population (FP) model and the reduced-population (RP) model. Both models are based on the BPP/M/W/W model, where the first two moments of an arbitrary session are matched by those of a birth–death process whose arrival rate linearly varies with the average number of busy wavelengths occupied by its own calls. We show that different sessions have different arrival-point busy-wavelength distributions depending on the burstiness of their traffic, i.e., a bursty session observes the link more congested than a smooth session. Next, we provide two extensions of the single-link models, the FP-full-load link-correlation model and the RP-reduced-load link-correlation model, to estimate the blocking probabilities of optical networks with heterogeneous traffic and sparse wavelength conversion. Both models employ the existing link-correlation models to take into account the occupied-wavelength-index correlation between two adjacent links. By comparing the results from the models with simulation results, we demonstrate that both models well approximate the blocking probabilities of individual sessions, as well as the network-wide blocking probability, for a wide range of traffic intensity, burstiness, and heterogeneity.     

城域网流量域的规划及路由设计

介绍了在城域网内建设流量域的方式,达到对大量采用三层交换机作为核心汇聚设备的城域网进行优化的目的。     

基于拓扑优化和链路感知的无线体域网路由协议

为解决无线体域网(Wireless Body Area Networks,WBAN)在人体运动过程中网络拓扑结构频繁变化导致链路质量和WBAN性能下降等问题,首先根据人体结构对WBAN网络拓扑进行优化,通过添加中继节点建立WBAN主干网,提供节点和hub之间相对稳定的链接,然后提出了适用于WBAN拓扑优化后的路由策略(Routing Protocol Based on Topology Optimization and Link Awareness,R-TOLA)。R-TOLA综合了链路质量感知和代价函数,通过调整主干网中继和节点中继获得最优化路径。仿真实验表明,基于拓扑结构优化和链路感知的R-TOLA协议和其他路由协议相比,在人体拓扑网络结构频繁变化的环境下具有网络生存时间更长、吞吐量更大等优势。     

Impairment-Constraint-Based Routing in Ultralong-Haul Optical Networks With 2R Regeneration

This letter presents a novel impairment-constraint-based routing scheme in a network with 2R regeneration. A wide variety of physical layer impairments, linear and nonlinear, have been considered and appropriate modeling has been developed to reflect their interplay with the 2R functionality and to assess the overall system performance. Using this approach, the optimum routing paths are identified and the network blocking probability is evaluated as a function of regeneration efficiency and transmission performance engineering     

Routing Connections With Differentiated Reliability Requirements in WDM Mesh Networks

Reliability has been well recognized as an important design objective in the design of modern high-speed networks. While traditional approaches offer either 100% protection in the presence of single link failure or no protection at all, connections in real networks may have multiple reliability requirements. The concept of differentiated reliability (DiR) has been introduced in the literature to provide multiple reliability requirements in protection schemes that provision spare resources.      

Traffic Aware Congestion Control Priority Based Efficient Adaptive Multipath Routing in Wired Networks with New Queuing Technique

Wireless Personal Communications - This paper proposes a novel technique for data transmission from source to destination by using adaptive multipath routing with route adaptability. In this...     

不确定流量条件下多跳无线网络的信道分配与链路调度研究

本文以网络吞吐量最大化为目标,提出了传输流约束、信道资源约束以及干扰约束条件下的资源分配联合优化模型,以及基于不确定流量条件下资源分配最优解的链路调度策略.仿真实验结果证明：本文提出的信道分配及链路调度方案能够更好地适应网络流量需求的变化.