Why should I consider a future in research? What sort of opportunities does a PhD open up for me? What makes research in the science of networks such an exciting career choice? How can we ensure that the Internet can grow and adapt to ever-changing needs over the coming decades? What lies beyond the Internet? What inspires network research?

In this paper we design, characterize in closed-form, and evaluate a new index rule for Markovian time-varying channels, which gives rise to a simple opportunistic scheduling rule for flow-level scheduling in wireless downlink systems. For user channels we employ the Gilbert-Elliot model with a flow-level interpretation: the channel condition follows a general two-state Markov chain with distinct probabilities of finishing the flow transmission.

The Madrid Audiovisual Cluster is a member of the steering committee of BROADCAST, the professional forum for audiovisual technology, which this year is adopting a new approach: the event will experience a quantum leap from the traditional exhibition of products to the proposal of emerging solutions and contents. In this manner, BROADCAST aims to adapt to the specificities of the audiovisual technology industry today.

Within the framework of SIMO Network 2011, and in collaboration with Universities and Research Centers in Madrid, Enterprise Europe Network madri+d and Fundación para el Conocimiento madrimasd organize an international transfer technology day to promote the exchange of information amongst possible technological partners

On Sep 26th and 27th we organize a meeting of the EU project TREND. The research conducted in this project is in the field of energy efficient networking. The second day of the project is dedicated to several research talks by members of the project as well as some external speakers. Those interested in attending to these sessions are welcome to do so. The only requirement is to complete the registration form by Thursday, September 22nd

It is notoriously difficult to make distributed systems reliable. This becomes even harder in the case of the widely-deployed systems that are heterogeneous (multiple implementations) and federated (multiple administrative entities). The set of routers in charge of the Internet's inter-domain routing is a prime example of such a system.

Sleep modes are emerging as a promising technique for energy-efficient networking: by adequately putting to sleep and waking up network resources according to traffic demands, a proportionality between energy consumption and network utilization can be approached, with important reductions in energy consumption. Previous studies have investigated and evaluated sleep modes for wireless access networks, computing variable percentages of energy savings.

Wireless networks importance for the Future Internet is raising at a fast pace as mobile devices increasingly become its entry point. However, today's wireless networks are unable to rapidly adapt to evolving contexts and service needs due to their rigid architectural design. We believe that the wireless Internet's ability to keep up with innovation directly stems from its reliance on the traditional layer-based Internet abstraction. Especially, the Link Layer interface appears way too abstracted from the actual wireless access and coordination needs.FLAVIA fosters a paradigm shift towards the Future Wireless Internet: from pre-designed link services to programmable link processors.

BitTorrent is one of the most popular application in the current Internet. However, we still have little knowledge about the topology of real BitTorrent swarms and how the traffic is actually exchanged among peers. This paper addresses fundamental questions regarding the topology of live BitTorrent swarms. For this purpose we have collected the evolution of the graph topology of 250 real torrents from its birth during a period of 15 days. Using this dataset we first demonstrate that real BitTorrent swarms are neither random graphs nor small world networks.

This work, using a game-theoretic approach, considers Internet-based computations, where a master processor assigns, over the Internet, a computational task to a set of untrusted worker processors, and collects their responses. The master must obtain the correct task result, while maximizing its benefit. Building on prior work, we consider a framework where altruistic, malicious, and rational workers co-exist. In addition, we consider the possibility that the communication between the master and the workers is not reliable, and that workers could be unavailable; assumptions that are very realistic for Internet-based master-worker computations.