Evaluating the impact of stale link state on quality-of-servicerouting

Quality-of-service (QoS) routing satisfies application performance requirements and optimizes network resource usage by selecting paths based on connection traffic parameters and link load information. However, distributing link state imposes significant bandwidth and processing overhead on the network. This paper investigates the performance tradeoff between protocol overhead and the quality of the routing decisions in the context of the source-directed link state routing protocols proposed for IP and ATM networks. We construct a detailed model of QoS routing that parameterizes the path-selection algorithm, link-cost function, and link state update policy. Through extensive simulation experiments with several network topologies and traffic patterns, we uncover the effects of stale link state information and random fluctuations in traffic load on the routing and setup overheads. We then investigate how inaccuracy of link state information interacts with the size and connectivity of the underlying topology. Finally, we show that tuning the coarseness of the link-cost metric to the inaccuracy of underlying link state information reduces the computational complexity of the path-selection algorithm without significantly degrading performance. This work confirms and extends earlier studies, and offers new insights for designing efficient quality-of-service routing policies in large networks     

ATM网络中服务质量问题的完整视图

文章提出了一种称做服务质量完整视图的方案,该方案由服务质量参数变换和分配两部分组成,总体思路是把用户的需求逐层映射,转换成ＡＴＭ网络各个层闪的服务质量参数,直到ＡＴＭ网络最底层的性能参数,通过性能参数在网络中的适当分配,从而来保证用户的质量需求。     

A framework of prioritized burst segmentation supporting controlled retransmission in OBS networks

In optical burst switching (OBS) networks, burst contentions in OBS core nodes may cause data loss. To reduce data loss, retransmission scheme has been applied. However, uncontrolled retransmission may increase network load significantly and data loss probability defeating the retransmission purpose. In addition, in a priority traffic existing OBS network, OBS nodes may apply different retransmission mechanisms to priorities bursts for quality-of-service (QoS) support. This study has developed a controlled retransmission scheme for prioritized burst segmentation to support QoS in OBS networks. Unlike previous works in the literature, we have set a different value to retransmission probability at each contention and propose a retransmission analytical model for burst segmentation contention resolution scheme. In addition, we have applied the proposed retransmission scheme to the prioritized burst segmentation for QoS support. We have taken into account the load at each link due to both fresh and retransmitted traffic, and have calculated the path blocking probability and byte loss probability (ByLP) for high-priority and low-priority burst to evaluate network performance. An extensive simulation has been proposed to validate our analytical model.     

Performance Analysis of an Adaptive Link Status Update Scheme Based on Link‐Usage Statistics for QoS Routing

In the global Internet, a constraint‐based routing algorithm performs the function of selecting a routing path while satisfying some given constraints rather than selecting the shortest path based on physical topology. It is necessary for constraint‐based routing to disseminate and update link state information. The triggering policy of link state updates significantly affects the volume of update traffic and the quality of services (QoS). In this letter, we propose an adaptive triggering policy based on link‐usage statistics in order to reduce the volume of link state update traffic without deterioration of QoS. Also, we evaluate the performance of the proposed policy via simulations.     

数据链服务质量保障体系

网络中心战的核心支撑是数据链,按照网络中心战的要求,数据链可以分为多层。文中在分析了不同层次数据链对服务质量要求的基础上,结合不同数据链的特点,给出了一个体系化的、多手段的服务质量保证方案。     

QoS routing in networks with inaccurate information: theory andalgorithms

This paper investigates the problem of routing flows with quality-of-service (QoS) requirements through one or more networks, when the information available for making such routing decisions is inaccurate. Inaccuracy in the information used in computing QoS routes, e.g., network state such as link and node metrics, arises naturally in a number of different environments that are reviewed in the paper. The goal is to determine the impact of such inaccuracy on the ability of the path-selection process to successfully identify paths with adequate available resources. In particular, we focus on devising algorithms capable of selecting path(s) that are most likely to successfully accommodate the desired QoS, in the presence of uncertain network state information for the purpose of the analysis, we assume that this uncertainty is expressed through probabilistic models, and we briefly discuss sample cases that can give rise to such models. We establish that the impact of uncertainty is minimal for flows with only bandwidth requirements, but that it makes path selection intractable when end-to-end delay requirements are considered. For this latter case, we provide efficient solutions for special cases of interest and develop useful heuristics     

基于非精确状态信息的QoS组播路由算法

提出了一种在非精确网络状态信息下满足时延和带宽约束的最小代价组播路由算法。基于非精确网络下门限更新策略，提出一种将安全性和组播树代价相结合的路径选择函数。模拟多组播业务的仿真结果表明．该算法所得组播树的代价最优，而且请求接受率较高，反映了该算法同时具有较好的QoS能力和负载均衡能力。     

Wireless Access Method to Ensure Each User's QoS in Unpredictable and Various QoS Requirements

With the fast growth of Internet services, the demand for wireless high speed and advanced multimedia communications is rapidly increasing. Initial multimedia services have already been offered in the second generation systems (2-G). Currently, the third generation systems (3-G) are being deployed and it will support up to 2 Mbps packet oriented data services. But it is expected that the demand for higher data rate and large variety of high quality services will increase further more. Therefore, it is mandatory for the fourth generation systems (4-G) to take each user's quality of service (QoS) control into account.In this paper, we firstly describe an overview on requirements and technical issues for the 4-G systems, and wireless QoS control issues considering End-to-End QoS control in the IP network. Next, we propose broadband wireless access method for the fourth generation mobile communication systems. The proposed method for downlink is based on MC-CDMA (Multi-Carrier Code Division Multiple Access) with Multi-Timeslot, in which total downlink resources are split into three aggregates according to the QoS classes in time domain. It is considered that one of the typical advantages for the MC-CDMA is the effect of frequency diversity. We evaluated the effect by computer simulation using ray-traced propagation model. Simulation results show that short-term fading can be relaxed. Furthermore, we propose Multi-Level (ML) ARQ as one of the link adaptation methods. Simulation results show that the proposed scheme has a good performance with throughput and average retransmission power.     

Non-Cooperative Power Control for Wireless Ad Hoc Networks with Repeated Games

One of the distinctive features in a wireless ad hoc network is lack of any central controller or single point of authority, in which each node/link then makes its own decisions independently. Therefore, fully cooperative behaviors, such as cooperation for increasing system capacity, mitigating interference for each other, or honestly revealing private information, might not be directly applied. It has been shown that power control is an efficient approach to achieve quality of service (QoS) requirement in ad hoc networks. However, the existing work has largely relied on cooperation among different nodes/links or a pricing mechanism that often needs a third-party involvement. In this paper, we aim to design a non-cooperative power control algorithm without pricing mechanism for ad hoc networks. We view the interaction among the users' decision for power level as a repeated game. With the theory of stochastic fictitious play (SFP), we propose a reinforcement learning algorithm to schedule each user's power level. There are three distinctive features in our proposed scheme. First, the user's decision at each stage is self-incentive with myopic best response correspondence. Second, the dynamics arising from our proposed algorithm eventually converges to pure Nash equilibrium (NE). Third, our scheme does not need any information exchange or to observe the opponents' private information. Therefore, this proposed algorithm can safely run in a fully selfish environment without any additional pricing and secure mechanism. Simulation study demonstrates the effectiveness of our proposed scheme.     

Task scheduling algorithm for system-wide information management based on multiple QoS constraints

An ant colony optimization task scheduling algorithm based on multiple quality of service constraint (QoS-ACO) for SWIM was proposed.Focusing on the multiple quality of service (QoS) requirements for task requests completed in system-wide information management (SWIM),considering the task execution time,security and reliability factors,a new evaluate user satisfaction utility function and system task scheduling model were constructed.Using the QoS total utility evaluation function of SWIM service scheduling to update the pheromone of the ant colony algorithm.The simulation results show that under the same conditions,the QoS-ACO algorithm is better than the traditional Min-Min algorithm and particle swarm optimization (PSO) algorithm in terms of task completion time,security,reliability and quality of service total utility evaluation value,and it can ensure that the user's task scheduling quality of service requirements are met,and can better complete the scheduling tasks of the SWIM.     

Delay guaranteed MDP scheduling scheme for HCCA based on 802.11p protocol in V2R environments

In recent years, the vehicular ad hoc network has attracted worldwide attention from academe and industry. Many researches have been executed to improve the quality of services (QoS) of the intelligent transportation system. However, current existing channel access schemes at the medium access control layer specified in 802.11 protocol, including hybrid coordination function control channel access (HCCA) and enhanced distributed channel access, could not efficiently achieve the QoS requirements in some special situations. This paper proposes a delay guaranteed HCCA (DG‐HCCA) scheduling scheme, which works based on a Markov decision process model and the measurement of historic performance, to guarantee the QoS enhanced data transmission for vehicles to roadside unit. Besides, this paper also presents a performance analysis model to systematically evaluate the system performance of the channel utility and the average delay. The performance of the proposed delay guaranteed HCCA scheduling scheme is compared with that of original HCCA scheme specified in 802.11p standard and other 2 HCCA improved schemes by the simulation experiments. The simulation results demonstrate that the proposed solution could highly fulfill the transmission delay requirements with a better channel utility and less loss rates than those by the standard HCCA scheme and other 2 schemes.     

Fuzzy Logic QoS Dynamic Source Routing for Mobile Ad Hoc Networks

Considering the characters of dynamic topology and the imprecise state information in mobile ad hoc network,we propose a Fuzzy Logic QoS Dynamic Source Routing(FLQDSR)algorithm based on Dynamic Source Routing(DSR)protocol while adopting fuzzy logic to select the appropriate QoS routing in multiple paths which are searched in parallel.This scheme considers not only the bandwidth and end-to-end delay of routing,but also the cost of the path.On the otherhand the merit of using fuzzy logic is that it can be implemented by hardware.This makes the realization of the schemeeasier and faster.However our algorithm is based on DSR,the maximal hop count should be less than 10,i.e.,the scaleof mobile ad hoc network should not be very large.Simulation results show that FLQDSR can tolerate a high degree of in-formation imprecision by adding the fuzzy logic module which integrates the QoS requirements of application and the rout-ing QoS parameters to determine the most qualified one in every node.     

Traffic Aided Uplink Opportunistic Scheduling with QoS Support in Multiservice CDMA Networks

In this letter, we address the problem of resource allocation with efficiency and quality of service (QoS) support in uplink for a wireless CDMA network supporting real‐time (RT) and non‐realtime (NRT) communication services. For RT and NRT users, there are different QoS requirements. We introduce and describe a new scheme, namely, traffic aided uplink opportunistic scheduling (TAUOS). While guaranteeing the different QoS requirements, TAUOS exploits the channel condition to improve system throughput. In TAUOS, the cross‐layer information, file size information, is used to improve fairness for NRT users. Extensive simulation results show that our scheme can achieve high system throughput in uplink wireless CDMA systems, while guaranteeing QoS requirements.     

Minimum cost traffic shaping

We propose a minimum-cost method for traffic shaping in the context of quality of service (QoS)-based networks. Given the user's desired QoS and the network's resource availability, our method determines the least cost parameters for a shaper while guaranteeing access to the network and satisfying the QoS requirements     

一种环境感知的无线Mesh网络自适应QoS路径选择算法

本文针对如何改善无线多跳Mesh网络的服务质量,满足无线多媒体业务对数据传输的带宽、时延、抖动的要求等问题,研究了一种基于无线信道状态和链路质量统计的MAC层最大重传次数的自适应调整算法。该算法通过对无线Mesh网络的无线信道环境的动态感知,利用分层判断法区分无线分组丢失的主要原因是无线差错还是网络拥塞导致,实时调整MAC层的最佳重传次数,降低无线网络中的分组冲突概率。基于链路状态信息的统计和最大重传策略,提出了一种启发式的基于环境感知的QoS路由优化机制HEAOR。该算法通过动态感知底层链路状态信息,利用灰色关联分析法自适应选择最优路径,在不增加系统复杂度的基础上,减少链路误判概率,提高传输效率。NS2仿真结果表明,HEAOR算法能有效减少重路由次数,降低链路失效概率,提高网络的平均吞吐率。本文提出的方法不仅能够优化MAC层的重传,而且通过发现跨层设计的优化参数实现对路径的优化选择。      

A dynamic resource allocation scheme for delay-constrained multimedia services in CDMA 1/spl times/EV-DV forward link

CDMA2000 1/spl times/EV-DV has been proposed as one of the global standards of third-generation (3G) networks, which adopts TDM/CDM and adaptive modulation and coding (AMC) techniques to enhance the data rate. The current CDMA2000 1/spl times/EV-DV standard specifies all possible combinations of system parameters, but there is no any further specification in the standard on how to dynamically change the system parameters to support the quality-of-service (QoS) requirements imposed by the upper-layer applications. In the meantime, one of the major deficiencies of previous research work done in this area is that they all are based on the channel models of physical layer such as Rayleigh model, which is unable to capture the link-layer QoS parameters such as queueing delay. Since the dynamic resource allocation usually resides in the data link layer, a wireless channel model at the link layer would be desirable to handle the QoS requirements. In this paper, we develop a dynamic resource allocation scheme using the effective capacity link model to support delay-bounded multimedia services in CDMA2000 1/spl times/EV-DV networks. Extensive simulations have been set up and the simulation results show that the proposed dynamic resource allocation scheme significantly improves the delay and throughput performance for all types of application traffic with various QoS requirements.     

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     

Quality-Driven Capacity-Aware Resources Optimization Design for Ubiquitous Wireless Networks

In this paper, we propose a probability-statistical capacity-prediction scheme to provide probabilistic quality-of-service (QoS) guarantees under the high traffic load of IEEE 802.11 wireless multimedia Mesh networks. The proposed scheme perceives the state of wireless link based on the MAC retransmission statistics and calculates the statistical channel capacity especially under the saturated traffic load. Via a cross-layer design approach, the scheme allocates network resource and forwards data packets by taking the interference among flows and the channel capacity into consideration. Extensive experiments have been carried out on the basis of IEEE 802.11 protocols in order to demonstrate the superiority of the proposed scheme over the existing location-based QoS optimization delivery algorithm in terms of retransmission count, successful delivery rate, and end-to-end delay on the condition of time-varying multi-hop wireless links.     

Quality of Service for Rapidly Deployable Radio Networks

In this paper, we present an end-to-end QoS provisioning mechanism for a Rapidly Deployable Radio Network (RDRN). A flow specification tailored for a highly dynamic mobile networking environment has been proposed. The instability of wireless links and the mobility of the nodes influence the flow specification. A flow establishment scheme that uses in-band signaling to establish the flows has been described. This approach is designed to make efficient use of the features of IP at the network level and ATM at the link level. In the event of non-availability of the requested QoS, the flow establishment scheme constantly attempts to scale up to the maximum requirements of the application, and establishes the flow when the resources become available. A QoS architecture for an RDRN system has also been proposed, which provides the framework for the configuration, prediction and maintenance of the end-to-end QoS.     

Cross-layer resource allocation over wireless relay networks for quality of service provisioning

The authors propose a physical-datalink cross-layer resource allocation scheme over wireless relay networks for quality-of-service (QoS) guarantees. By integrating information theory with the concept of effective capacity, the proposed scheme aims at maximizing the relay network throughput subject to a given delay QoS constraint. This delay constraint is characterized by the so-called QoS exponent thetas, which is the only requested information exchanged between the physical layer and the datalink layer in our cross-layer design based scheme. Over both amplify-and-forwards (AF) and decode-and-forward (DF) relay networks; the authors develop the associated dynamic resource allocation algorithms for wireless multimedia communications. Over DF relay network, the authors also study a fixed power allocation scheme to provide QoS guarantees. The simulations and numerical results verify that our proposed cross-layer resource allocation can efficiently support diverse QoS requirements over wireless relay networks. Both AF and DF relays show significant superiorities over direct transmissions when the delay QoS constraints are stringent. On the other hand, the results demonstrate the importance of deploying the dynamic resource allocation for stringent delay QoS guarantees.