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.

La importancia de las redes inalámbricas para la Futura Internet crece a un ritmo acelerado a medida que los dispositivos móviles se convierten cada vez más en su punto de acceso. No obstante, y como consecuencia de su diseño arquitectónico rígido, las redes inalámbricas actuales no son capaces de adaptarse rápidamente a contextos y necesidades de servicio evolutivos. Creemos que la capacidad de Internet para mantenerse al día con la innovación procede directamente de su dependencia de la abstracción tradicional de una Internet basada en capas.

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.

In this brief announcement we propose B-Neck, a max-min fair distributed algorithm that is also quiescent. As far as we know, B-Neck is the first max-min fair distributed algorithm that does not require a continuous injection of control traffic to compute the rates. When changes occur, affected sessions are asynchronously informed, so they can start the process of computing their new rate (i.e., sessions do not need to poll the network for changes). The correctness of B-Neck is formally proved, and extensive simulations are conducted. In them it is shown that B-Neck converges relatively fast and behaves nicely in presence of sessions arriving and de- parting.

Vehicular ad hoc networks have proven to be quite useful for broadcast alike communications between nearby cars, but can also be used to provide Internet connectivity from vehicles. In order to do so, vehicle-to-Internet routing and IP address autoconfiguration are two critical pieces. TREBOL is a tree-based and configurable protocol which benefits from the inherent tree-shaped nature of vehicle to Internet traffic to reduce the signaling overhead while dealing efficiently with the vehicular dynamics.

Access networks include modems, home gateways, and DSL Access Multiplexers (DSLAMs), and are responsible for 70-80% of total network-based energyconsumption. In this paper I'll take an in-depth look at the problem of greeningaccess networks, identify three root problems, and propose practical solutionsfor their user- and ISP-parts. On the user side, the combination of  continuous light traffic and lack of alternative paths condemnsgateways to being powered most of the time despite having Sleep-on-Idle (SoI) capabilities. To address this problem, we introduce Broadband Hitch-Hiking(BH2), that takes advantage of the overlap of wireless networks to aggregate user traffic in as few gateways as possible. In current urban settings BH2can power off 65-90% of gateways.

Sampling a large network with a given distribution has been identified as a useful operation to build network overlays. For example, constructing small world network topologies can be done by sampling with a probability that depends on the distance to a given node. In this talk we describe algorithms that can be used by a source node to randomly select a node in a network with probability distributions that depend on their distance.