Traffic engineering in ambient networks: challenges and approaches

The focus of this paper is on traffic engineering in ambient networks. We describe and categorize different alternatives for making the routing more adaptive to the current traffic situation and discuss the challenges that ambient networks pose on traffic engineering methods. One of the main objectives of traffic engineering is to avoid congestion by controlling and optimising the routing function, or in short, to put the traffic where the capacity is. The main challenge for traffic engineering in ambient networks is to cope with the dynamics of both topology and traffic demands. Mechanisms are needed that can handle traffic load dynamics in scenarios with sudden changes in traffic demand and dynamically distribute traffic to benefit from available resources. Trade-offs between optimality, stability and signaling overhead that are important for traffic engineering methods in the fixed Internet becomes even more critical in a dynamic ambient environment

End-to-end QoE optimization through overlay network deployment

In this paper an overlay network for end-to-end QoE management is presented. The goal of this infrastructure is QoE optimization by routing around failures in the IP network and optimizing the bandwidth usage on the last mile to the client. The overlay network consists of components that are located both in the core and at the edge of the network. A number of overlay servers perform end-to-end QoS monitoring and maintain an overlay topology, allowing them to route around link failures and congestion. Overlay access components situated at the edge of the network are responsible for determining whether packets are sent to the overlay network, while proxy components manage the bandwidth on the last mile. This paper gives a detailed overview of the end-to-end architecture together with representative experimental results which comprehensively demonstrate the overlay network's ability to optimize the QoE

Resource Management in Diffserv On DemAnd (RODA) PHR

The purpose of this draft is to present the Resource Management in Diffserv (RMD) On DemAnd (RODA) Per Hop Reservation (PHR) protocol. The RODA PHR protocol is used on a per-hop basis in a Differentiated Services (Diffserv) domain and extends the Diffserv Per Hop Behavior (PHB) with resource provisioning and control

A Comprehensive Study of the Enhanced Distributed Control Access (EDCA) Function

This technical report presents a comprehensive study of the Enhanced Distributed Control Access (EDCA) function defined in IEEE 802.11e. All the three factors are considered. They are: contention window size (CW), arbitration inter-frame space (AIFS), and transmission opportunity limit (TXOP). We first propose a discrete Markov chain model to describe the channel activities governed by EDCA. Then we evaluate the individual as well as joint effects of each factor on the throughput and QoS performance. We obtain several insightful observations showing that judiciously using the EDCA service differentiation mechanism is important to achieve maximum bandwidth utilization and user-specified QoS performance. Guided by our theoretical study, we devise a general QoS framework that provides QoS in an optimal way. The means of realizing the framework in a specific network is yet to be studied

Traffic matrix estimation on a large IP backbone: a comparison on real data

This paper considers the problem of estimating the point-to-point traffic matrix in an operational IP backbone. Contrary to previous studies, that have used a partial traffic matrix or demands estimated from aggregated Netflow traces, we use a unique data set of complete traffic matrices from a global IP network measured over five-minute intervals. This allows us to do an accurate data analysis on the time-scale of typical link-load measurements and enables us to make a balanced evaluation of different traffic matrix estimation techniques. We describe the data collection infrastructure, present spatial and temporal demand distributions, investigate the stability of fan-out factors, and analyze the mean-variance relationships between demands. We perform a critical evaluation of existing and novel methods for traffic matrix estimation, including recursive fanout estimation, worst-case bounds, regularized estimation techniques, and methods that rely on mean-variance relationships. We discuss the weaknesses and strengths of the various methods, and highlight differences in the results for the European and American subnetworks

Handling concurrent admission control in multiservice IP networks

Comunicação apresentada na "Consumer Communications & Networkin Conference 2006", Las Vegas, Nevada, USA, 8-10 Janeiro 2006.This paper debates the problem of handling concurrent admission control decisions in multiservice networks, putting forward solutions to mitigate the negative impact that distributed admission of flows might have on the service level guarantees provided to network customers. Keeping in mind that simplicity is a key factor for deployable solutions, we suggest and discuss the use of (i) a service-dependent concurrency index; (ii) a token-based system and (iii) a rate-based credit system, as alternative or complementary proposals to minimize or solve QoS degradation resulting from AC false acceptance