In this talk, we introduce the OpenVLC, a software-defined open-source research platform for Visible Light Communication (VLC) networks. Built around the embedded Linux platform BeagleBone Black together with simple optoelectronic transceiver front-end, OpenVLC offers a basic physical layer, a set of essential medium access primitives, as well as interoperability with Internet protocols.

 A highly interesting trend in mobile network optimization is to exploit knowledge of future network capacity to allow mobile terminals to prefetch data when signal quality is high and to refrain from communication when signal quality is low. While this approach offers remarkable benefits, it relies on the availability of a reliable forecast of system conditions.

In this work, propagation dynamics on social networks are studied in order to identify the most influential users. For this purpose, diffusion data has been collected during 4 weeks from a microblogging OSN (online social network) called Tumblr.

The Internet is a messy, complex landscape. Middleboxes such as DNS resolvers, UPnP home gateways, and in-path proxies placed in the IP core of the operators' networks can significantly
impair a user's access despite being designed for the contrary.

In this presentation we will explain a new mathematical procedure for the automatic discovery of interesting research questions. We propose to classify research topics according to their relevance (how important is the topic) and nescience (a measure of our current understanding of that topic).

We present a first fully analytical approach to performance evaluation of D2D communication systems, which does not assume transmitters to have always a packet to transmit. In particular, we adopt a Coupled Processors model to describe a cellular scenario with D2D users sharing radio resources with cellular users, i.e., adopting in-band underlay D2D schemes. We derive sufficient conditions for stability of such system, and we characterize the effects of D2D transmissions on cellular user performances.

Our objective is to guarantee that vehicles that coordinate their operations will operate safely with all of the other vehicles, implemented by all of the other manufacturers, on the roadway.

By tweaking the BGP configurations, the network operators are able to express their interdomain routing preferences, designed to accommodate a myriad goals. Given the complex interactions between policies in the Internet, the origin AS by itself cannot ensure that only by configuring a routing policy it can also achieve the anticipated results. Moreover, the definition of routing policies is a complicated process, involving a number of subtle tuning operations prone to errors. In this paper, we propose the BGP Visibility Scanner which allows network operators to validate the correct implementation of their routing policies, by corroborating the BGP routing information from approximately 130 independent observation points in the Internet. We exemplify the use of the proposed methodology and also perform an initial validation for the BGP Visibility Scanner capabilities through various real operational use cases.

Intercell coordination and cooperation techniques are some of the most promising approaches to increase the spectral efficiency of future wireless systems as required by
the forecasted market needs. Among them, intercell coordinated scheduling (ICCS) arises as a near-term feasible solution due to its lower inter-BS communication requirements when compared to full cooperative approaches. In this paper we present our proposed Reservation Information Aware Intercell Coordinated Scheduling (RIA-ICCS) solution which considers application reservation information when constructing an interference graph for ICCS purposes.

We design an adaptive modulation scheme to support opportunistic multicast scheduling in wireless networks. Whereas prior work optimizes capacity, we investigate the finite horizon problem where (once or repeatedly) a fixed number of packets has to be transmitted to a set of wireless receivers in the shortest amount of time -- a common problem, e.g., for software updates or video multicast.