Rate allocation strategies for energy-efficient multipath routing in Ad-hoc networks towards B3G

Wireless mobile Ad-hoc network is a special network that all nodes can self-organize and work together. It is flexible to form a network and extend the coverage area dynamically without infrastructure, so Ad-hoc network is envisioned as cornerstones of future generation networking technologies (B3G or 4G). However, the dynamic network topology makes the communication cost not only the energy of source/destination nodes, but also the relay nodes. Another problem of the Ad-hoc network is it is hard to provide a stable and persistent quality of service (QoS), which is strongly required by the beyond 3rd generation (B3G) system. In this article, the authors establish a scenario that contains B3G cellular base station and Ad-hoc mobile nodes, and propose two algorithms minimum incremental rate algorithm and power feed-back rate allocation algorithm in multipath routing. The algorithms can maintain a constant total transmission rate and bit error ratio (BER) to provide the QoS guarantee and reach the minimum power consumption of the relay nodes by adjusting the rate of each path in the multipath routing.     

A localized adaptive proportioning approach to QoS routing

In QoS routing, paths for flows are selected based on knowledge of resource availability at network nodes and the QoS requirements of flows. Several QoS routing schemes have been proposed that differ in the way they gather information about the network state and select paths based on this information. We broadly categorize these schemes into best path routing and proportional routing. The best path routing schemes gather global network state information and always select the best path for an incoming I-low,based on this global view. It has been shown that best path routing schemes require frequent exchange of network state, imposing both communication overhead on the network and processing overheads on the core routers. On the other hand, proportional routing schemes proportion incoming flows among a set of candidate paths. We have shown that it is possible to compute near-optimal proportions using only locally collected information. Furthermore, a few good candidate paths can be selected using infrequently exchanged global information and thus with minimal communication overhead. We describe these schemes in detail and demonstrate that proportional routing schemes can achieve higher throughput with lower overhead than best path routing schemes     

QoS-Friendly Wavelength Assignment in Dynamic Wavelength-Routed Optical Networks

In-band crosstalk has been widely considered as a major transmission impairment that significantly impacts the bit error rate (BER) performance of lightpaths in circuit-switched all-optical wavelength-routed networks. Such crosstalk usually occurs when multiple wavelengths pass through an optical crossconnect node, and the magnitude of the crosstalk is largely dependent on the wavelengths assigned to the lightpaths. Traditional wavelength assignment (WA) schemes pay little regard to the physical layer quality of service (QoS), and hence cannot provide optimized network performance in practical networks with imperfect physical transmission media. In this paper, we first present our categorization of in-band crosstalk based on the location of crosstalk generation, then we propose two QoS-friendly WA approaches, one of which selects the wavelength based on the estimated BERs, and the other based on the weighted crosstalk number counting. The two approaches have different computation complexities. Numerical results show that both approaches can significantly improve the BER blocking rate by suppressing the created in-band crosstalk, but the BER-based approach generally gives the better performance at the price of more extensive computation.This work was supported in part by DARPA Grants #N66001-00-1-8949 and #66001-01-1-8932 (co-funded by NSA).     

OBS网络中基于扩展Benes矩阵的节点串扰分析

光突发交换(OBS)的提出,一定程度上满足了对高速业务的需求,但由于交换结构中光路器件自身的特性以及信号的相互作用,其内部存在严重的串扰问题,阻碍了通信的进行,极大地限制了光突发交换的性能。为了进一步研究OBS光网络节点结构中的串扰问题,仿真模拟了OBS网络中基于扩展Benes光交换矩阵的节点串扰情况,证明了OBS网络节点结构中,光交换矩阵本身、输入输出光纤数和每根光纤中的复用波长数都会不同程度的引起串扰的变化,从而影响整个光通信网络的质量。     

A QoS-aware routing mechanism for multi-channel multi-interface ad-hoc networks

To accommodate real-time multimedia application while satisfying application QoS requirements in a wireless ad-hoc network, we need QoS control mechanisms. In this paper, we propose a new routing mechanism to support real-time multimedia communication by efficiently utilize the limited wireless network capacity. Our mechanism considers a wireless ad-hoc network composed of nodes equipped with multiple network interfaces to each of which a different wireless channel can be assigned. By embedding information about channel usage in control messages of OLSRv2, each node obtains a view of topology and bandwidth information of the whole network. Based on the obtained information, a source node determines a logical path with the maximum available bandwidth to satisfy application QoS requirements. Through simulation experiments, we confirmed that our proposal effectively routed multimedia packets over a logical path avoiding congested links. As a result, the load on a network is well distributed and the network can accommodate more sessions than QOLSR. We also conducted practical experiments using wireless ad-hoc relay nodes with four network interfaces and verified the practicality of our proposal.     

Distributed quality-of-service routing in ad hoc networks

In an ad hoc network, all communication is done over wireless media, typically by radio through the air, without the help of wired base stations. Since direct communication is allowed only between adjacent nodes, distant nodes communicate over multiple hops. The quality-of-service (QoS) routing in an ad hoc network is difficult because the network topology may change constantly, and the available state information for routing is inherently imprecise. In this paper, we propose a distributed QoS routing scheme that selects a network path with sufficient resources to satisfy a certain delay (or bandwidth) requirement in a dynamic multihop mobile environment. The proposed algorithms work with imprecise state information. Multiple paths are searched in parallel to find the most qualified one. Fault-tolerance techniques are brought in for the maintenance of the routing paths when the nodes move, join, or leave the network. Our algorithms consider not only the QoS requirement, but also the cost optimality of the routing path to improve the overall network performance. Extensive simulations show that high call admission ratio and low-cost paths are achieved with modest routing overhead. The algorithms can tolerate a high degree of information imprecision     

A novel Qos-aware MAC scheme using optimal retransmission for wireless networks

This paper proposes a novel Medium Access Control scheme for low cost, single-hop wireless networks where the source nodes have a transmitter module but no receiver module and hence they can only transmit data to a sink but cannot receive any control signals, like an ACK or NAK, from any other node. The goal of the proposed scheme is to provide QoS (in terms of packet delivery probability) to the nodes in such a network, where the existing schemes like polling or scheduled transmissions, CSMA and ARQ will be ineffective because of the unavailability of a receiver module at the nodes. The proposed scheme uses distributed control and allows the nodes to transmit each packet an optimal number of times at random instants in time within the packet generation interval. We define two optimization problems based on minimizing total network traffic and maximizing the delivery probability of the class of nodes requiring the highest QoS, respectively, and develop mathematical formulae and efficient algorithms to solve them. Numerical analysis and simulation results show that our scheme can provide high QoS to networks of different sizes.     

INQIRE: a software approach to monitoring QoS in ATM networks

Unlike traditional best-effort packet networks, ATM networks support a wide range of services by providing a specified QoS on each ATM connection. Currently, QoS can be measured with specialized high-speed testing equipment but their complexity and cost prevent them from wide field use. This article describes the INQIRE project approach based on software for enabling common personal computers (with an ATM network interface card) to function as QoS monitoring stations at the edges of an ATM network. The main objective is to develop a low-cost, off-the-shelf alternative to broadband testing equipment. An INQIRE station, consisting of a PC running the INQIRE application, can actively probe any selected connection and collect sample measurements of the QoS. The monitoring approach is intended to be non-intrusive and work with any ATM network without requiring any modifications to existing ATM switch equipment or interruptions to active services     

Ring Mesh Based Multicast Routing Scheme in MANET Using Bandwidth Delay Product

Quality of Service (QoS) support in Mobile Ad Hoc Networks (MANETs) for group communication necessitates design of reliable networks with multicast support mechanisms. Reliable network connectivity among MANET nodes require high quality links that have much less packet drops and reliable nodes considering node mobility and failures. Reliability of a network can be enhanced by designing an end-to-end network pipe that satisfies the required QoS in terms of in-flight packets from source to a destination as well as by using a path comprising of reliable nodes. In-flight packets may be computed by using bandwidth delay product (BDP) of a network pipe. To meet the QoS requirements of an application, BDP should be maintained stable irrespective of vibrant network conditions. In this paper, we propose a BDP based multicast routing scheme in MANET using reliable ring mesh backbone. The scheme operates in the following sequence. (1) Reliable node pairs are computed based on mobility, remaining battery power and differential signal strength. The node pairs also compute BDP between them. BDP of a reliability pair is assessed using available bandwidth and delay experienced by a packet between them. (2) Backbone ring mesh is constructed using reliable pair nodes and convex hull algorithm. Reliable ring mesh is constructed at an arbitrary distance from the centroid of the MANET area. (3) Multicast paths are found by discovering a path from source to each destination of the group with concatenated set of reliability pairs that satisfy the BDP requirement. (4) The ring mesh maintains high BDP on ring links and can recover in case of node mobility and failures. Results show that there is an improvement in terms of end-to-end delay, packet delivery ratio, control overhead, memory overhead and application rejection ratio as compared to the Enhanced On Demand Multicast Routing Protocol.     

Gateway load balancing using multiple QoS parameters in a hybrid MANET

A Mobile ad hoc network (MANET) is a self configurable wireless network in which mobile nodes communicate with each other in a multihop fashion without any pre-installed infrastructure. A MANET can be considered to be a standalone network. To enhance the connectivity of a MANET it can be connected to the fixed network, thus forming a heterogeneous network. The integration of MANET and the Internet is called a hybrid MANET which is facilitated by special nodes called Internet gateway nodes. Load balancing among gateways is a challenging task when a MANET is connected to Internet. Gateway nodes with higher loads will lead to disconnected networks and depletes the node’s resources which include their batteries, memory and bandwidth quickly. Gateway selection based on the shortest path may increase traffic concentration on one particular gateway which leads to congestion and increases delay in the network. In this paper a QoS based load balancing mechanism has been proposed among multiple gateway nodes that provide communication between mobile nodes and fixed nodes in the Internet to select lightly loaded gateways so that more packets will be delivered to the fixed host in the Internet. The proposed QoS based scheme selects four QoS parameters that are (1) connecting degree, (2) interface queue length, (3) routing table entries and (4) hop count. A weight based method is used to select the gateway which combines all four QoS metrics. Simulation results demonstrate that when compared with individual parameter, the average ETE delay, queue size and traffic load of gateway generated by proposed algorithm is decreased by 17, 25 and 15 % respectively and when compared with existing schemes, the average ETE delay, queue size and traffic load of gateway is decreased by 25, 25 and 16 % respectively.     

Scalable diagnosis in IP networks using path-based measurement and inference: A learning framework

In this paper, we investigate scalability and performance of measurement-based network monitoring, focusing on failure and congestion diagnosis in IP networks for network-based multimedia applications. Path-based measurements using unicast probe-packets are obtained at end-hosts, and diagnosis is performed by exploiting the spatial dependence among those measurements. We formulate network monitoring in a machine learning framework using probabilistic graphical models which perform inference of the network states (on/off) using unicast measurements. We provide fundamental limits on the relationship between the number of probe packets, the size of a network and the ability to diagnose either failed links or congested network components. Specifically, the diagnosis problem is dealt in a two-fold manner. Initially for fault diagnosis, we construct a graphical model using a Bayesian belief network for path-based measurements. We then provide a lower bound on the average number of probes per edge for link failure diagnosis using variational inference under “noisy” probe measurements. Variational inference provides a feasible approximation to address the number of spatially dependent measurements needed for diagnosis in large networks. We then develop an entropy lower (EL) bound by drawing similarities between coding over a binary symmetric channel (BSC) and link failure diagnosis. Both bounds show that the number of measurements needed for diagnosis grows linearly with respect to the number of links. The analytical results are validated by simulation. On the other hand, for congestion diagnosis, we propose a solution based on decoding of linear error control codes on a BSC. In this scenario, we consider path-based probing experiments under both noiseless and “noisy” measurements and compare its performance against the fundamental limits. To identify the congested nodes we construct a factor graph, and congestion is inferred using belief-propagation algorithm. Simulation results demonstrate the ability of our approach to perfectly localize congested nodes using a scalable number of measurements and a computationally efficient algorithm. We believe that this study can ease the problem arising due to lack of QoS support and provide good-quality broadband multimedia services.     

Analysis of signal distortion and crosstalk penalties induced by optical filters in optical networks

The design of optical communication networks with network switching elements operating in the optical domain requires careful system analysis and potentially stringent component requirements. We consider here network elements such as transparent optical cross-connects that demultiplex WDM signals, optically switch individual channels, and then multiplex the wavelengths together again before transmission into the next span. Network element optical impairments that can significantly degrade signal quality are in-band (same wavelength) crosstalk and signal distortion from filter concatenation effects. We examine tradeoffs between accumulated crosstalk and filter distortion in the context of the optical filters used in the network elements and demonstrate the balance that must be struck in the design of the filters and network system. As an example, we study a 10-Gb/s network with 50-GHz channel spacing, examining both nonreturn-to-zero (NRZ) and return-to-zero (RZ) modulation formats. In both cases, we find optimal filter bandwidths that minimize the total signal degradation measured in terms of Q penalty, including filter misalignment statistics and signal laser frequency offset. A model is developed to treat the statistical nature of filter misalignment and its effect on filter-generated in-band crosstalk. The optical node penalties suffered by RZ signals can be significantly higher than that of NRZ signals and must be considered when estimating overall system reach.     

基于复合量度的电力光纤多电路配置可靠性

能源互联网的一个本质特征是通过先进的通信网络实现能源供给与消费间的双向互动。以光纤通信为基础的高可靠通信网络优化配置以满足多业务的服务质量(QoS)需求成为亟需解决的关键问题。从电力光纤传输网络的可靠性入手,并考虑电力通信业务的多QoS传输需求,设计一种基于复合量度的电路配置优化方法。有别于传统最短路配置算法,新方法在一次配置过程中同时规划m条可行配置方案,并且通过分析路径集的带宽、时延、丢包率、衰耗和成本等不同量度和光路全程可靠性,最终获得满足可靠性和传输QoS需求的光路配置方案,并给出优先选择序列。多电路优化配置将有效提升电力通信的可靠性,也可为未来多路流量分摊提供电路配置保证。通过某城区35～500 kV电力通信站网实例仿真计算,新配置方法能够一次获取4条同时满足业务多QoS需求的传输电路,实现主备电路保护。对电力光纤传输网络的规划和运行优化,提高电力通信网的资源调配能力和可靠性提供参考。     

Passive equalization of semiconductor diode laser frequencymodulation

Optical heterodyne communication systems using direct-frequency-modulated (FM) semiconductor diode lasers often exhibit system degradation because of the nonuniform injection-current-to-FM transfer function present in most semiconductor diode lasers. In a FSK system, a nonuniform FM transfer function causes tone drift which results in increased crosstalk between time slots and a corresponding degradation in system bit-error rate (BER). Using simple passive electrical networks it is possible to equalize the nonuniform FM response and substantially reduce this transfer-function-induced BER degradation. The theory, computer optimation, construction, and test of various equalization networks and their use in realizing an FM-equalized transmitter for a 100-Mb/s binary FSK communication system is described     

A hop‐by‐hop delay‐constrained routing algorithm with explicit loop avoidance and backup routing information

QoS Routing is crucial for QoS provisioning in high‐speed networks. In general, QoS routing can be classified into two paradigms: source routing and hop‐by‐hop routing. In source routing, the entire path to the destination node of a communication request is locally computed at the source node based on the global state that it maintains, which does not scale well to large networks. In hop‐by‐hop routing, a path‐selecting process is shared among intermediate nodes between the source node and the destination node, which can largely improve the protocol scalability. In this paper, we present the design of hop‐by‐hop routing with backup route information such that each intermediate node can recursively update the best known feasible path, if possible, by collectively utilizing the routing information gathered thus far and the information that it locally stores. Such a route is kept as a backup route and its path cost is used as a reference to guide the subsequent routing process to search for a lower‐cost constrained path and avoid performance degradation. In this way, the information gathered is maximally utilized for improved performance. We prove the correctness of our presented algorithm and deduce its worst message complexity to be O(∣V∣²), where ∣V∣ is the number of network nodes. Simulation results indicate that, however, the designed algorithm requires much fewer messages on average. Therefore it scales well with respect to the network size. Moreover, simulation results demonstrate that the cost performance of our algorithm is near‐optimal. Copyright © 2004 John Wiley & Sons, Ltd.     

基于多项服务质量的域间路由方案

针对广域网中节点数量多,范围广的特点,提出了一种将节点划分成域,并以带宽、时延作为服务质量（ＱｏＳ）指标在域间寻找可行路径的路由方案。该方案由两个算法组成,它们在把真实网络映射成为具有分级结构图的同时给出了满足服务质量要求的可行路径。     

A Cooperative MAC Protocol for QoS Enhancement in Wireless USB Networks

Wireless USB (WUSB) is the USB technology merged with WiMedia PHY/MAC based on success of wired USB, and it can be applied to various mobile applications such as laptop, cellular phone, etc. Also, WUSB can provide the better user convenience than wired USB applications as well as be applied to the legacy USB application, since it provides high speed connection between host and devices for the compatibility with USB 2.0 specification and removes the cable among devices using the USB protocol. However the current WUSB protocol can’t prevent the QoS degradation occurred by mobile nodes with low data rate. This problem causes the critical problems in QoS provisioning to isochronous streams and mobile applications. Therefore, we propose a new cooperative MAC protocol for WUSB network with virtual MIMO (multi input multi output) link. Based on instantaneous channel state information among WUSB devices, our proposed protocol can intelligently select the transmission path with higher data rate between WUSB host and WUSB device as well as between WUSB device and WUSB device. Thus our proposed protocol can provide advanced QoS with minimum delay for real-time multimedia services.     

Application of the saddle point method for the evaluation of crosstalk implications in an arrayed-waveguide grating interconnection

The effect of in-band crosstalk can pose severe limitations in an optical network. In this paper, the implications of in-band crosstalk induced by an arrayed-waveguide grating (AWG) router in a passive N/spl times/N optical interconnection are analyzed with non-Gaussian statistics using a numerical model. The model is based on the saddle point approximation and takes into account fluctuations of the transfer function's sidelobes induced by the phase errors in the grating arms, phase noise, polarization variations, bit misalignment, and shot and thermal noise. The influence of these effects on the interconnection's bit error rate (BER) is analyzed. The validity of the Gaussian assumption for the crosstalk noise statistics is discussed. Finally, the model is used to examine the mean crosstalk requirements for various numbers of network nodes.     

非理想载波同步物理层网络编码误比特性能分析

采用相干检测的物理层网络编码系统的误比特性能与载波同步精度密切相关,收发双方的载波同步误差将引起系统性能恶化。本文研究了残余载波同步误差对采用相同星座和正交星座BPSK信号的两种物理层网络编码双向中继系统误比特性能的影响。首先基于最大似然准则推导了存在残余载波同步误差时中继节点及源节点处接收信号的判决区域,然后运用Craig极坐标法分析了系统多址接入、广播阶段及总的端到端误比特性能,得出了精确的误比特率表达式,文中的分析方法可推广到采用其他调制方式的物理层网络编码系统。计算机仿真表明:文中的理论分析与仿真结果完全吻合,所推导的理论公式可以效地评估BPSK调制物理层网络编码系统的误比特性能;正交星座系统对载波同步误差更为敏感,相同的同步误差对正交星座系统的性能恶化更为严重。      

RSVP and integrated services in the Internet: a tutorial

The growing use of multimedia communication applications, with specific bandwidth and real-time delivery requirements has created the need for an integrated services Internet in which traditional best-effort datagram delivery can coexist with additional enhanced quality of service (QoS) delivery classes. Such classes provide data flows with QoS commitments with regard to bandwidth, packet loss, and delay through the reservation of network resources along the data path, which can be done using the Resource Reservation Protocol (RSVP). This article is a tutorial on how RSVP can be used by end applications to ensure that they receive the end-to-end QoS that they require