Network aware dynamic context subscription management

Context-awareness is a key requirement in many of today’s networks, services and applications. Context management systems are used to provide access to distributed, dynamic context information. The reliability of remotely accessed dynamic context information is impacted by network delay, packet drop probability, its information dynamics and the access strategy used. Due to the characteristics of the different access strategies, different levels of reliability of context information can be ensured, but at the same time, these strategies lead to different access traffic which impacts also the network performance, and hence feeds back to the reliability of the information. Furthermore, different levels of QoS may be available and used in order to mitigate the impact of network performance degradation on the reliability of the dynamic context information. In this paper we describe a system and algorithms that are capable of configuring effectively context access strategies in order to maximize reliability of all accessed dynamic context information. The framework utilizes and extends existing information reliability models, and it can utilize different network performance models. Simulation results of scenarios in which the framework uses finite-buffer bottleneck performance models demonstrate the effectiveness of our algorithm to increase reliability. Furthermore, the framework is applied to a scenario with QoS classes that allows to trade off delay and loss via different buffer-size configurations.     

Energy efficiency with QoS control in dynamic optical networks with SDN enabled integrated control plane

The paper presents energy efficient routing algorithms based on a novel integrated control plane platform. The centralized control plane structure enables the use of flexible heuristic algorithms for route selection in optical networks. Differentiated routing for various traffic types is used in our previous work. The work presented in this paper further optimizes the energy performance in the whole network by utilizing a multi-objective evolutionary algorithm for route selection. The trade-off between energy optimization and QoS for high priority traffic is examined and results show an overall improvement in energy performance whilst maintaining satisfactory QoS. Energy savings are obtained on the low priority traffic whilst the QoS for the high priority traffic is not degraded.     

Differentiation, QoS guarantee, and optimization for real-time traffic over one-hop ad hoc networks

Nodes having a self-centrically broadcasting nature of communication form a wireless ad hoc network. Many issues are involved to provide quality of service (QoS) for ad hoc networks, including routing, medium access, resource reservation, mobility management, etc. Previous work mostly focuses on QoS routing with an assumption that the medium access control (MAC) layer can support QoS very well. However, contention-based MAC protocols are adopted in most ad hoc networks since there is no centralized control. QoS support in contention-based MAC layer is a very challenging issue. Carefully designed distributed medium access techniques must be used as foundations for most ad hoc networks. In this paper, we study and enhance distributed medium access techniques for real-time transmissions in the IEEE 802.11 single-hop ad hoc wireless networks. In the IEEE 802.11 MAC, error control adopts positive acknowledgement and retransmission to improve transmission reliability in the wireless medium (WM). However, for real-time multimedia traffic with sensitive delay requirements, retransmitted frames may be too late to be useful due to the fact that the delay of competing the WM is unpredictable. In this paper, we address several MAC issues and QoS issues for delay-sensitive real-time traffic. First, a priority scheme is proposed to differentiate the delay sensitive real-time traffic from the best-effort traffic. In the proposed priority scheme, retransmission is not used for the real-time traffic, and a smaller backoff window size is adopted. Second, we propose several schemes to guarantee QoS requirements. The first scheme is to guarantee frame-dropping probability for the real-time traffic. The second scheme is to guarantee throughput and delay. The last scheme is to guarantee throughput, delay, and frame-dropping probability simultaneously. Finally, we propose adaptive window backoff schemes to optimize throughput with and without QoS constraints.     

Design and performance analysis of an inductive QoS routing algorithm

Routing mechanism is key to the success of large-scale, distributed communication and heterogeneous networks. Consequently, computing constrained shortest paths is fundamental to some important network functions such as QoS routing and traffic engineering. The problem of QoS routing with multiple additive constraints is known to be NP-complete but researchers have been designing heuristics and approximation algorithms for multi-constrained paths algorithms to propose pseudo-polynomial time algorithms. This paper introduces a polynomial time approximation quality of service (QoS) routing algorithm and constructs dynamic state-dependent routing policies. The proposed algorithm uses an inductive approach based on trial/error paradigm combined with swarm adaptive approaches to optimize lexicographically various QoS criteria. The originality of our approach is based on the fact that our system is capable to take into account the dynamics of the network where no model of the network dynamics is assumed initially. Our approach samples, estimates, and builds the model of pertinent aspects of the environment which is very important in heterogeneous networks. The algorithm uses a model that combines both a stochastic planned pre-navigation for the exploration phase and a deterministic approach for the backward phase. Multiple paths are searched in parallel to find the K best qualified ones. To improve the overall network performance, a load adaptive balancing policy is defined and depends on a dynamic traffic path probability distribution function. We conducted a performance analysis of the proposed QoS routing algorithm using OPNET based on a platform simulated network. The obtained results demonstrate substantial performance improvements as well as the benefits of learning approaches over networks with dynamically changing traffic.     

Estimation of backlog and delay in OFDM/TDMA systems with traffic policing using Network Calculus

Achieving quality of service (QoS) in OFDM based networks depends, among other factors, on mechanisms for traffic policing or control. Aggregate traffic in high speed networks can present multifractal characteristics such as bursts over a wide range of time scales, heavy tailed inter-arrival time densities, self-similarity and long-range dependence. These properties are followed by a degradation of quality of service for the traffic flows. In this paper, we firstly propose a policing algorithm based on multifractal traffic modeling, evaluating its performance in comparison to other algorithms. We present a more precise in general envelope modeling process in order to efficiently police the input traffic to the system. Further, we present an approach based on Network Calculus for estimating quality of service parameters, such as mean queue length (backlog) and delay. We analyze these two parameters for an OFDM/TDMA based simplified WiMAX system with and without the application of traffic modeling based policing algorithms. In other words, we propose an approach for evaluating some QoS parameters of an OFDM/TDMA system where the traffic is policed. We also evaluate the performance of the proposed algorithm in policing the traffic in an OFDM/TDMA system.     

Integration of admission,congestion, and peak power control in QoS-aware clusters

Admission, congestion, and peak power control mechanisms are essential parts of a cluster network design for supporting integrated traffic. While an admission control algorithm helps in delivering the assured performance, a congestion control algorithm regulates traffic injection to avoid network saturation. Peak power control forces to meet pre-specified power constraints while maintaining the service quality by regulating the injection of packets. In this paper, we propose these control algorithms for clusters, which are increasingly being used in a diverse set of applications that require QoS guarantees. The uniqueness of our approach is that we develop these algorithms for wormhole-switched networks, which have been used in designing clusters. We use QoS-capable wormhole routers and QoS-capable network interface cards (NICs), referred to as Host Channel Adapters (HCAs) in InfiniBand™ Architecture (IBA), to evaluate the effectiveness of these algorithms. The admission control is applied at the HCAs and the routers, while the congestion control and the peak power control are deployed only at the HCAs. A mixed workload consisting of best-effort, real-time, and control traffic is used to investigate the effectiveness of the proposed schemes.     

Service Adaptability in Multimedia Wireless Networks

Next-generation wireless communication systems aim at supporting wireless multimedia services with different quality-of-service (QoS) and bandwidth requirements. Therefore, effective management of the limited radio resources is important to enhance the network performance. In this paper, we propose a QoS adaptive multimedia service framework for controlling the traffic in multimedia wireless networks (MWN) that enhances the current methods used in cellular environments. The proposed framework is designed to take advantage of the adaptive bandwidth allocation (ABA) algorithm with new calls in order to enhance the system utilization and blocking probability of new calls. The performance of our framework is compared to existing framework in the literature. Simulation results show that our QoS adaptive multimedia service framework outperforms the existing framework in terms of new call blocking probability, handoff call dropping probability, and bandwidth utilization.      

区分服务网络中主动队列管理算法

现有区分服务网络的保证转发服务可提供稳定的带宽保证,但缺乏保证时延和分组丢失性能的有效方案.基于对RIO队列的稳态性能分析,提出两种自适应调整控制策略的主动队列管理算法(ARIO-D和ARIO-L).仿真结果表明,这两种算法在保持RIO算法带宽保证能力的同时,还可以提供稳定的和可区分的时延和分组丢失性能.采用ARIO-D和ARIO-L的保证转发服务可以为多媒体流量提供多种服务质量的定量保证.     

Performance modelling of pipelined circuit switching in hypercubes with hot spot traffic

Pipelined Circuit Switching (PCS) has been suggested as an efficient switching method for supporting interprocessor communication in multicomputer networks due to its ability to preserve both communication performance and fault-tolerant demands in these networks. A number of studies have demonstrated that PCS can exhibit superior performance characteristics over Wormhole Switching (WS) under uniform traffic. However, the performance properties of PCS have not yet been thoroughly investigated in the presence of non-uniform traffic. Analytical model of PCS for common networks (e.g., hypercube) under the uniform traffic pattern has been reported in the literature. A non-uniform traffic model that has attracted much attention is the hot spot model which leads to extreme network congestion resulting in serious performance degradation due to the tree saturation phenomenon in the network. An analytical model for WS with hot spot traffic has been reported in the literature. However, to the best of our knowledge, there has not been reported any analytical model for PCS augmented with virtual channels in the presence of hot spot traffic. This paper proposes a model for this switching mechanism using new methods to calculate the probability of message header blocking and hot spot rates on channels. The model makes latency predictions that are in good agreement with those obtained through simulation experiments. An extensive performance comparison using the new analytical model reveals that PCS performs the same or in some occasions worse than WS in the presence of hot spot traffic.     

Rate adaptive shaping for the efficient transport of data traffic in diffserv networks

In this paper, we introduce the need for traffic shaping for the efficient transport of aggregate Internetworking traffic over Differentiated Services (DiffServ) networks. We propose a family of rate adaptive shapers (RASs) that aim at reducing the traffic burstiness. Although RASs can be used in either pure Best-Effort or any QoS enabled networks, our study is focused on their use in DiffServ networks where the traffic is subject to traffic control consisting of marking the packets according to a pre-negotiated traffic conditioning specification. RASs aim to increase the ratio of packets that are assigned the highest level of forwarding treatment by buffering and appropriate scheduling of packets before applying traffic control functions. The key ideas that motivate RASs design are introduced and evaluated by means of extensive simulations. Some additional enhancements are also discussed.     

The probability relationship between video’s instantaneous and average aggregate rates

The growing demand for video applications and services has contributed substantially to the increase of video traffic on the Internet. Measurement-based admission control was proposed with the primary aim of eliminating or reducing the need of flow state information; also to control overhead for admission decision and maximize utilization at the potential cost of QoS degradation. Some of the admission algorithms depend on the instantaneous rate for its operation. On the other hand, the average aggregate rate has been proposed to better suit variable rate such as video traffic. In this paper, we investigate the probability relationship between the instantaneous and average aggregate rates for video traffic. A mathematical model has been developed to quantify the probability relationship between both rates and validated through extensive simulations using real video sequences. The average rate was found to be lower than instantaneous for a small number of flows, however there was no pronounced difference for a large number of flows. Furthermore, the difference between both rates increases for fast moving content such as sport or longer measurement time window.     

分组交换网络中分布式调度控制算法研究

文章首先对目前分组交换网络中支持QoS的队列调度算法进行了比较研究,分析了其性能指标和技术特点。然后以Internet核心路由器中线卡级和交换级的队列调度设计为例,从控制论的角度提出了一种支持QoS的分布式加权轮询调度控制算法,同时对交换网络进行了仿真实验,吞吐率达到96％的仿真实验结果表明所提出的算法是有效的,最后,文章认为在实际应用中,应针对不同情况设计不同的调度控制算法,以便在复杂性、公平性、快速性及有效性等特性方面取得了一个折衷方案,以使分组交换网络的整体性能更好。     

Fast setup of end-to-end paths for bandwidth constrained applications in an IP/MPLS–ATM integrated environment

Transport networks are currently being moved towards a model of high performance Internet Protocol/Multiprotocol Label Switching (IP/MPLS) routers interconnected through intelligent core networks. Currently, Asynchronous Transfer Mode (ATM) technology has been widely deployed in several network backbones along with the Private Network-to-Network Interface (PNNI) protocols as the control plane. In order to cope with the increasing Internet traffic demands in the current context, fast setup of end-to-end paths with the required Quality of Service (QoS) is necessary.This paper analyzes the case of two IP/MPLS networks interconnected through an ATM core network, assuming MPLS as the mechanism to provide Traffic Engineering in the IP networks, and a PNNI-based control plane in the core network. This paper aims to define a mechanism needed to set up a fast end-to-end QoS Label Switched Path (LSP) between two Label Switched Routers (LSRs) belonging to different IP/MPLS domains. First, the fast end-to-end setup is achieved by modifying the network backbone control plane. Second, two different aggregation schemes are proposed to summarize the QoS network state information to be transported through the ATM core network. Therefore, both the efficient aggregation schemes and the fast mechanism allow source routing to set up a path faster than the existing methods and to reduce the blocking probability using a summary of the available resource information.     

Optimization for adaptive bandwidth reservation in wireless multimedia networks

In future wireless multimedia networks, user mobility management for seamless connection regarding realtime multimedia applications is one of the most important problems. In this paper we propose an opportunity-cost concept-based approach for adaptive bandwidth reservation with admission control for handover calls utilizing network traffic information. Excessive reservation guarantees low blocking probability of handover calls at the cost of high blocking probability of new calls. According to our survey, however, it may degrade bandwidth utilization while no prioritization for handover admissions degrades quality of service (QoS) for ongoing calls. We consider both QoS assurance and bandwidth utilization in order to optimize the amount of bandwidth to reserve for handover admissions. We believe that our scheme could be utilized as a guideline for cost-effective radio resource allocation in mobile multimedia networks.     

Ant-based routing for wireless multimedia sensor networks using multiple QoS metrics

In wireless sensor networks, most routing protocols consider energy savings as the main objective and assume data traffic with unconstrained delivery requirements to be a given. However, the introduction of video and imaging sensors unveils additional challenges. The transmission of video and imaging data requires both energy efficiency and QoS assurance (end-to-end delay and packet loss requirements), in order to ensure the efficient use of sensor resources as well as the integrity of the information collected. This paper presents a QoS routing model for Wireless Multimedia Sensor Networks (WMSN). Moreover, based on the traditional ant-based algorithm, an ant-based multi-QoS routing metric (AntSensNet) is proposed. The AntSensNet protocol builds a hierarchical structure on the network before choosing suitable paths to meet various QoS requirements from different kinds of traffic, thus maximizing network utilization, while improving its performance. In addition, AntSensNet is able to use a efficient multi-path video packet scheduling in order to get minimum video distortion transmission. Finally, extensive simulations are conducted to assess the effectiveness of this novel solution and a detailed discussion regarding the effects of different system parameters is provided. Compared to typical routing algorithms in sensor networks and the traditional ant-based algorithm, this new algorithm has better convergence and provides significantly better QoS for multiple types of services in wireless multimedia sensor networks.     

Stable Queue Management in communication networks

Since Active Queue Management (AQM) was recommended by the Internet Engineering Task Force (IETF) as an efficient way to overcome performance limitations of Transmission Control Protocol (TCP), several studies have proven control theory to be a promising field for the design and analysis of congestion control in homogenous communication networks. AQM is gaining increased importance due to reports of buffer-induced latencies throughout the Internet. The increasing volume and diversity of traffic types (i.e., data, voice, and video) suggests that traffic management mechanisms, in general, and AQM schemes, specifically, must not only focus on the critical issue of congestion control but must also consider the QoS demands of heterogeneous traffic. However, to combine quality-of-service provisioning with congestion control, AQM design needs to be reconsidered. In this paper, we propose a state feedback controller design scheme for heterogeneous networks preserving the closed-loop system stability. Delay dependant stability conditions of the closed loop system are derived based on the Lyapunov-Krasovskii method. The proposed approach offers flexible choice of control parameters allowing the network administrator to control fairness and response time for each individual source node in a network of multiple links with different delay properties. The performance and robustness of the proposed controller were illustrated and analyzed using event-based computer simulations.     

Enhanced packet routing queuing model in optical burst switching network using queue-based dynamic optical route scheduling

Optical Burst Switching (OBS) for all future optical network technology signatures. In OBS, the IP packet is known as a large explosion of data that is assembled in the input packets. The pre-assembly burst is sent to its intended location for offset time. It has shown that there are some security issues, but they do not resolve the node's ability to separate them. When they have suffered great losses to ensure that they are indispensable. If they are not safe, it may not waste resources on the optimal path.Current communication paradigms such as broadcast and multicast. Therefore, in optical networks, it is necessary to support these paradigms. Implementation of IP QoS policies does not apply to Optical Burst Switching (OBS) networks. These QoS requirements include controversy, optical signal quality, reliability, and delay.This work recommends the use of shared encryption for secure message traffic on OBS networks. The information is divided into as many strands as possible, and then it transmits at different times between pair of nodes and the different paths or routes. The proposed method to analyze the three strategies likely traffic analysis and route scheduling, packet header analysis,and authentication key verification.This proposed method,Queue-Based Dynamic Optical Route Scheduling (QDORS), provides flexible and efficient integrated packet-based traffic in OBS functions and Internet-based networks. It considered exploding a valid huge amount of data plans to reduce better channel usage, higher efficiency, and blocking probability.     

An efficient joint channel assignment and QoS routing protocol for IEEE 802.11 multi-radio multi-channel wireless mesh networks

With the emerging of video, voice over IP (VoIP) and other real-time multimedia services, more and more people pay attention to quality of service (QoS) issues in terms of the bandwidth, delay and jitter, etc. As one effective way of broadband wireless access, it has become imperative for wireless mesh networks (WMNs) to provide QoS guarantee. Existing works mostly modify QoS architecture dedicated for ad hoc or sensor networks, and focus on single radio and single channel case. Meanwhile, they study the QoS routing or MAC protocol from view of isolated layer. In this paper, we propose a novel cross-layer QoS-aware routing protocol on OLSR (CLQ-OLSR) to support real-time multimedia communication by efficiently exploiting multi-radio and multi-channel method. By constructing multi-layer virtual logical mapping over physical topology, we implement two sets of routing mechanisms, physical modified OLSR protocol (M-OLSR) and logical routing, to accommodate network traffic. The proposed CLQ-OLSR is based on a distributed bandwidth estimation scheme, implemented at each node for estimating the available bandwidth on each associated channel. By piggybacking the bandwidth information in HELLO and topology control (TC) messages, each node disseminates information of topology and available bandwidth to other nodes in the whole network in an efficient way. From topology and bandwidth information, the optimized path can be identified. Finally, we conduct extensive simulation to verify the performance of CLQ-OLSR in different scenarios on QualNet platform. The results demonstrate that our proposed CLQ-OLSR outperforms single radio OLSR, multi-radio OLSR and OLSR with differentiated services (DiffServ) in terms of network aggregate throughput, end-to-end packet delivery ratio, delay and delay jitter with reasonable message overheads and hardware costs. In particular, the network aggregate throughput for CLQ-OLSR can almost be improved by 300% compared with the single radio case.     

A calculus for stochastic QoS analysis

The issue of Quality of Service (QoS) performance analysis in packet-switched networks has drawn a lot of attention in the networking community. There is a lot of work including an elegant theory under the name of network calculus, which focuses on analysis of deterministic worst case QoS performance bounds. In the meantime, researchers have studied stochastic QoS performance for specific schedulers. However, most previous works on deterministic QoS analysis or stochastic QoS analysis have only considered a server that provides deterministic service, i.e. deterministically bounded rate service. Few have considered the behavior of a stochastic server that provides input flows with variable rate service, for example wireless links. In this paper, we propose a stochastic network calculus to analyze the end-to-end stochastic QoS performance of a system with stochastically bounded input traffic over a series of deterministic and stochastic servers. We also prove that a server serving an aggregate of flows can be regarded as a stochastic server for individual flows within the aggregate. Based on this, the proposed framework is further applied to analyze per-flow stochastic QoS performance under aggregate scheduling.     

An Admission Control Scheme Based on Online Measurement for VBR Video Streams Over Wireless Home Networks

This paper presents an online measurement-based admission control scheme on the basis that the aggregate VBR video traffic is lognormally distributed. The proposed scheme consists of two components: measurement process and admission decision. The measurement process applies a linear Kalman filter to estimate statistical parameters of aggregate VBR video traffic. The estimated statistical parameters are used to calculate the effective bandwidth for admission decision. Variable bit rate (VBR) video traffic with high data rate is expected to occupy a dominant proportion of bandwidth for future wireless broadband home networks. To guarantee quality-of-service (QoS) of such VBR video streams, while achieving a high level of channel utilization, an efficient admission control scheme is urgently required, especially for emerging wireless multimedia indoor services, such as HDTV, online video game, etc. The proposed scheme is computationally efficient and accurate without much prior traffic information. Simulation results verify its effectiveness and show that it performs well for both a small number of connections and a large number of connections.