Marcelo Yannuzzi

An overview of quality of experience measurement challenges for video applications in IP networks

The increase in multimedia content on the Internet has created a renewed interest in quality assessment. There is however a main difference from the traditional quality assessment approaches, as now, the focus relies on the user perceived quality, opposed to the network centered approach classically proposed. In this paper we overview the most relevant challenges to perform Quality of Experience (QoE) assessment in IP networks and highlight the particular considerations necessary when compared to alternative mechanisms, already deployed, such as Quality of Service (QoS). To assist on the handling of such challenges we first discuss the different approaches to Quality of Experience assessment along with the most relevant QoE metrics, and then we discuss how they are used to provide objective results about user satisfaction.

Open issues in interdomain routing: a survey

This article surveys several research challenges in interdomain routing. We introduce and describe these challenges in a comprehensible manner, along with a review of the most compelling contributions and ongoing research efforts addressing each of the exposed issues. During this analysis we identify the relation between these research challenges and now they influence each other. We also present our perspectives on why these issues remain largely unsolved, and point out why some of the proposals made so far have not yet been adopted. We hope this can provide some insight on future directions in this complex research area.

Key ingredients in an IoT recipe: Fog Computing, Cloud computing, and more Fog Computing

This paper examines some of the most promising and challenging scenarios in IoT, and shows why current compute and storage models confined to data centers will not be able to meet the requirements of many of the applications foreseen for those scenarios. Our analysis is particularly centered on three interrelated requirements: 1) mobility; 2) reliable control and actuation; and 3) scalability, especially, in IoT scenarios that span large geographical areas and require real-time decisions based on data analytics. Based on our analysis, we expose the reasons why Fog Computing is the natural platform for IoT, and discuss the unavoidable interplay of the Fog and the Cloud in the coming years. In the process, we review some of the technologies that will require considerable advances in order to support the applications that the IoT market will demand.

Reliable Routing with QoS Guarantees for Multi-Domain IP/MPLS Networks

We present a distributed routing algorithm for finding two disjoint (primary and backup) QoS paths that run across multiple domains. Our work is inspired by the recent interest in establishing communication paths with QoS constrains spanning multiple IP/MPLS domains. In such settings, the routing decisions in each domain are made by the path computation element (PCE). We assume that the PCEs run a joint distributed routing protocol, decoupled from the BGP, which enables them to establish efficient paths across multiple domains. This study makes the following contributions. First, we present an aggregated representation of a multi-domain network that is small enough to minimize the link-state overhead, and, at the same time, is sufficiently accurate, so that the PCEs can find optimal disjoint QoS paths across multiple domains. Second, we present a distributed routing algorithm that uses the proposed representation to find disjoint paths in an efficient manner. Finally, we consider the problem of finding two disjoint paths subject to the export policy limitations, imposed by customer-provider and peer relationships between routing domains. We show that this problem can be efficiently solved by employing the concept of line graphs. To the best of our knowledge, this is the first scheme fully decoupled from BGP that enables to establish disjoint QoS IP/MPLS paths in a multi-domain environment with provable performance guarantees.

Toward a new route control model for multidomain optical networks

The design of the control plane model for multidomain optical networks poses complex challenges and introduces many open problems. Some initiatives have proposed optical BGP (OBGP), which is an extension of BGP supporting the advertisement and signaling of optical information between routing domains. We argue, however, that future optical networks offer the opportunity to avoid inheriting the limitations of BGP, especially in terms of routing and traffic engineering control. In this article we present a route control model replacing BGP/OBGP. Extensive simulations confirm that our route control model is able to drastically reduce the blocking experienced with OBGP, and this can be accomplished without increasing the number or frequency of routing updates exchanged between domains.

A survey and taxonomy of ID/Locator Split Architectures

The IP-based addressing scheme currently supporting the whole routing architecture embeds some well-known limitations that may significantly hinder the deployment of new applications and services on the Internet. Indeed, it is widely accepted that the unstoppable growth of Internet users is producing two well-known problems: (1) depletion of addresses, motivated by a design limitation of the currently deployed addressing scheme, and (2) the semantic overload of addresses. The main negative consequences of these problems may be summarized as: (i) exacerbating the geometrical growth of the routing tables, and (ii) affecting other network features, such as traffic engineering and mobility, in terms of resilience and disruption tolerant communications. The relevant consequences that addressing brings to the overall network operation is pushing the networking community to study and propose new addressing architectures that may limit or even remove the negative effects (affecting network performance) stemmed from the currently deployed addressing architecture. To this end, researchers working on this area must have a perfect understanding of the weaknesses and limitations coming up from the nowadays architecture as well as a comprehensive knowledge of the alternatives proposed so far along with the most appealing research trends. Aligned to this scenario, this paper comes up with the aim of assisting the reader to both: (i) get insights about the most prominent limitations of the currently deployed addressing architecture, and (ii) survey the existing proposals based on ID/Locator Split Architectures (ILSAs) including an analysis of pros and cons, as well as a taxonomy aiming at formulating a design space for evaluating and designing existing and future ILSAs.

A combined intra-domain and inter-domain QoS routing model for optical networks

� Abstract—Inter-Domain Quality of Service (QoS) Routing has become a strong requirement in the present Internet, and this requirement will also be present in the Next Generation Optical based worldwide network. At present end-to-end QoS Routing (QoSR) represents a complex problem mainly because the de-facto standard Inter-domain routing protocol, namely the Border Gateway Protocol (BGP) has not inbuilt QoSR capabilities. Moreover, BGP entirely obscures the availability of Intra-Domain resources in any transit domain within an end-to-end Inter-Domain path, which shifts any tentative proposal to cope with the issue of Inter-Domain QoSR even farther from optimality. Given that Inter-Domain routing in Optical Networks is an active research area in this moment, it seems wise to address the issue of QoSR provisioning from its very foundations. Thus, in this paper we introduce a Combined Intra-Domain and Inter-Domain QoSR Model for Optical Networks. Our goal is to provide a highly efficient coupling between both routing schemes with the aim that the combined QoSR model could be able to supply multiconstrained end-to-end optical paths closer to optimality.

A Proposal for Inter-domain QoS Routing Based on Distributed Overlay Entities and QBGP

This paper proposes a novel and incremental approach to Inter-Domain QoS Routing. Our approach is to provide a completely distributed Overlay Architecture and a routing layer for dynamic QoS provisioning, and to use QoS extensions and Traffic Engineering capabilities of the underlying BGP layer for static QoS provisioning. Our focus is mainly on influencing how traffic is exchanged among non-directly connected multi-homed Autonomous Systems based on specific QoS parameters. We provide evidence supporting the feasibility of our approach by means of simulation.

Reducing the effects of routing inaccuracy by means of prediction and an innovative link-state cost

The routing inaccuracy problem is one of the major issues impeding the evolution and deployment of Constraint-Based Routing (CBR) techniques. This paper proposes a promising CBR strategy that combines the strengths of prediction with an innovative link-state cost. The latter explicitly integrates a two-bit counter predictor, with a novel metric that stands for the degree of inaccuracy (seen by the source node) of the state information associated with the links along a path. In our routing model, Link-State Advertisements (LSAs) are only distributed upon topological changes in the network, i.e., the state and availability of network resources along a path are predicted from the source rather than updated through conventional LSAs. As a proof-of-concept, we apply our routing strategy in the context of circuit-switched networks. We show that our approach considerably reduces the impact of routing inaccuracy on the blocking probability, while eliminating the typical LSAs caused by the traffic dynamics in CBR protocols.

OPN08-01: Interdomain RWA Based on Stochastic Estimation Methods and Adaptive Filtering for Optical Networks

This paper presents a RWA strategy based on the stochastic estimation of the effective number of available wavelengths (ENAW) along interdomain paths. We propose an approximate model to roughly estimate the ENAW on the paths across multiple domains, and then refine this estimation by means of observations and an adaptive prediction-correction Kalman filtering process. Unlike traditional Kalman filters, which use noisy measurements as their observations, we use the information contained in the routing updates as noisy measurements of the existent wavelength occupancy along the paths. Based on these observations, we estimate the ENAW on the candidate paths, and use this information to influence the RWA decision when the number of available wavelengths makes a lightpath request prone to be blocked. The approximate model we are proposing in this paper is based on a noisy extension of a simplified model derived for two domains. Our results validate the usefulness of the model, and confirm that by estimating the wavelength occupancy prior to the RWA decision the blocking ratio can be considerably reduced.