Marcelo Dias de Amorim

Data Offloading Techniques in Cellular Networks: A Survey

One of the most engaging challenges for mobile operators today is how to manage the exponential data traffic increase. Mobile data offloading stands out as a promising and low-cost solution to reduce the burden on the cellular network. To make this possible, we need a new hybrid network paradigm that leverages the existence of multiple alternative communication channels. This entails significant modifications in the way data are handled, affecting also the behavior of network protocols. In this paper, we present a comprehensive survey of data offloading techniques in cellular networks and extract the main requirements needed to integrate data offloading capabilities into todays mobile networks. We classify existing strategies into two main categories, according to their requirements in terms of content delivery guarantees: delayed and nondelayed offloading. We overview the technical aspects and discuss the state of the art in each category. Finally, we describe in detail the novel functionalities needed to implement mobile data offloading in the access network, as well as current and future research challenges in the field, with an eye toward the design of hybrid architectures.

Relieving the wireless infrastructure: When opportunistic networks meet guaranteed delays

Major wireless operators are nowadays facing network capacity issues in striving to meet the growing demands of mobile users. At the same time, 3G-enabled devices increasingly benefit from ad hoc radio connectivity (e.g., Wi-Fi). In this context of hybrid connectivity, we propose Push-and-track, a content dissemination framework that harnesses ad hoc communication opportunities to minimize the load on the wireless infrastructure while guaranteeing tight delivery delays. It achieves this through a control loop that collects user-sent acknowledgements to determine if new copies need to be reinjected into the network through the 3G interface. Push-and-Track includes multiple strategies to determine how many copies of the content should be injected, when, and to whom. The short delay-tolerance of common content, such as news or road traffic updates, make them suitable for such a system. Based on a realistic large-scale vehicular dataset from the city of Bologna composed of more than 10,000 vehicles, we demonstrate that Push-and-Track consistently meets its delivery objectives while reducing the use of the 3G network by over 90%.

A survey on predicting the popularity of web content

Social media platforms have democratized the process of web content creation allowing mere consumers to become creators and distributors of content. But this has also contributed to an explosive growth of information and has intensified the online competition for users attention, since only a small number of items become popular while the rest remain unknown. Understanding what makes one item more popular than another, observing its popularity dynamics, and being able to predict its popularity has thus attracted a lot of interest in the past few years. Predicting the popularity of web content is useful in many areas such as network dimensioning (e.g., caching and replication), online marketing (e.g., recommendation systems and media advertising), or real-world outcome prediction (e.g., economical trends). In this survey, we review the current findings on web content popularity prediction. We describe the different popularity prediction models, present the features that have shown good predictive capabilities, and reveal factors known to influence web content popularity.

Fast track article: Push-and-track: Saving infrastructure bandwidth through opportunistic forwarding

Major wireless operators are nowadays facing network capacity issues in striving to meet the growing demands of mobile users. At the same time, 3G-enabled devices increasingly benefit from ad hoc radio connectivity (e.g., WiFi). In this context of hybrid connectivity, we propose Push-and-track, a content dissemination framework that harnesses ad hoc communication opportunities to minimize the load on the wireless infrastructure while guaranteeing tight delivery delays. It achieves this through a control loop that collects user-sent acknowledgements to determine if new copies need to be re-injected into the network through the 3G interface. Push-and-Track is flexible and can be applied to a variety of scenarios, including periodic message flooding and floating data. For the former, this paper examines multiple strategies to determine how many copies of the content should be injected, when, and to whom; for the latter, it examines the achievable offload ratio depending on the freshness constraints. The short delay-tolerance of common content, such as news or road traffic updates, make them suitable for such a system. Use cases with a long delay-tolerance, such as software updates, are an even better fit. Based on a realistic large-scale vehicular dataset from the city of Bologna composed of more than 10,000 vehicles, we demonstrate that Push-and-Track consistently meets its delivery objectives while reducing the use of the 3G network by about 90%.

Temporal reachability graphs

While a natural fit for modeling and understanding mobile networks, time-varying graphs remain poorly understood. Indeed, many of the usual concepts of static graphs have no obvious counterpart in time-varying ones. In this paper, we introduce the notion of temporal reachability graphs. A (tau,delta)-reachability graph is a time-varying directed graph derived from an existing connectivity graph. An edge exists from one node to another in the reachability graph at time t if there exists a journey (i.e., a spatiotemporal path) in the connectivity graph from the first node to the second, leaving after t, with a positive edge traversal time tau, and arriving within a maximum delay delta. We make three contributions. First, we develop the theoretical framework around temporal reachability graphs. Second, we harness our theoretical findings to propose an algorithm for their efficient computation. Finally, we demonstrate the analytic power of the temporal reachability graph concept by applying it to synthetic and real-life datasets. On top of defining clear upper bounds on communication capabilities, reachability graphs highlight asymmetric communication opportunities and offloading potential.

VIP delegation: Enabling VIPs to offload data in wireless social mobile networks

We propose the use of opportunistic delegation as a data traffic offload solution to the recent boost up of mobile data consumption in metropolitan areas, by investigating two main questions: (i) “How to gain insights into social mobile networking scenarios?” and (ii) “How to utilize such insights to design solutions to alleviate overloaded 3G networks?”. The purpose of our solution is to leverage usage of mobile applications requiring large data transfers by channeling the traffic to a few, socially selected important users in the network called VIP delegates. The proposed VIP selection strategies are based on social network properties and are compared to the optimal solution (that covers 100% of users with minimum number of VIPs). Our extensive experiments with real and synthetic traces show the effectiveness of VIP delegation both in terms of coverage and required number of VIPs — down to 7% in average of VIPs are needed in campuslike scenarios to offload about 90% of the traffic.

Performance of Opportunistic Epidemic Routing on Edge-Markovian Dynamic Graphs

Connectivity patterns in intermittently-connected mobile networks (ICMN) can be modeled as edge-Markovian dynamic graphs. We propose a new model for epidemic propagation on such graphs and calculate a closed-form expression that links the best achievable delivery ratio to common ICMN parameters such as message size, maximum tolerated delay, and link lifetime. These theoretical results are compared to those obtained by replaying a real-life contact trace.

From popularity prediction to ranking online news

News articles are an engaging type of online content that captures the attention of a significant amount of Internet users. They are particularly enjoyed by mobile users and massively spread through online social platforms. As a result, there is an increased interest in discovering the articles that will become popular among users. This objective falls under the broad scope of content popularity prediction and has direct implications in the development of new services for online advertisement and content distribution. In this paper, we address the problem of predicting the popularity of news articles based on user comments. We formulate the prediction task as a ranking problem, where the goal is not to infer the precise attention that a content will receive but to accurately rank articles based on their predicted popularity. Using data obtained from two important news sites in France and Netherlands, we analyze the ranking effectiveness of two prediction models. Our results indicate that popularity prediction methods are adequate solutions for this ranking task and could be considered as a valuable alternative for automatic online news ranking.

Reducing latency and overhead of route repair with controlled flooding

Ad hoc routing protocols that use broadcast for route discovery may be inefficient if the path between any source–destination pair is frequently broken. We propose and evaluate a simple mechanism that allows fast route repair in on demand ad hoc routing protocols. We apply our proposal to the Ad hoc On-demand Distance Vector (AODV) routing protocol. The proposed system is based on the Controlled Flooding (CF) framework, where alternative routes are established around the main original path between source–destination pairs. With alternative routing, data packets are forwarded through a secondary path without requiring the source to re-flood the whole network, as may be the case in AODV. We are interested in one-level alternative routing. We show that our proposal reduces the connection disruption probability as well as the frequency of broadcasts.

FITS: A flexible virtual network testbed architecture

In this paper, we present the design and implementation of FITS (Future Internet Testbed with Security), an open, shared, and general-purpose testbed for the Future Internet. FITS defines an innovative architecture that allows users running experiments with new mechanisms and protocols using both Xen and OpenFlow on the same network infrastructure. FITS integrates several recognized state-of-the-art features such as plane separation, zero-loss network migration, and smartcard-driven security access, to cite a few. The current physical testbed is composed of nodes placed at several Brazilian and European institutions interconnected by encrypted tunnels. Besides presenting the FITS architecture and its features, we also discuss deployment challenges and how we have overcome them.