Home > What's New? > Events > Events 2011

Events 2011

Displaying 11 - 20 of 49
Dejan Kostic
Dejan Kostic, Tenure Track Assistant Professor at the Networked Systems Laboratory, EPFL
19 Sep 2011 - 11:00 (Madrid Time)
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... +
Energy Savings in Cellular Access
Balaji Rengarajan, Institute IMDEA Networks; Gianluca Rizzo, Institute IMDEA Networks; Marco Ajmone Marsan, Institute IMDEA Networks...
06 Sep 2011 - 09:30 to 09 Sep 2011 - 18:30 (Madrid Time)
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... +
Flavia
05 Sep 2011 - 09:00 to 06 Sep 2011 - 18:00 (Madrid Time)
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... +
BitTorrent Swarms
Michal Kryczka, Institute IMDEA Networks; Rubén Cuevas, Universidad Carlos III de Madrid; Carmen Guerrero, Universidad Carlos III de...
31 Aug 2011 - 09:00 to 02 Sep 2011 - 18:00 (Madrid Time)
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... +
Algorithmic Mechanisms for Internet Supercomputing
Evgenia Christoforou, University of Cyprus; Antonio Fernández Anta, Institute IMDEA Networks; Chryssis Georgiou, University of Cyprus;...
25 Aug 2011 - 09:00 to 27 Aug 2011 - 09:00 (Madrid Time)
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... +
Maxmin Fair Algorithm
Alberto Mozo, Universidad Politécnica de Madrid; José Luis López-Presa, Universidad Politécnica de Madrid; Antonio Fernández Anta,...
25 Aug 2011 - 09:00 to 27 Aug 2011 - 09:00 (Madrid Time)
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... +
Tree_based_routing
Marco Gramaglia, Institute IMDEA Networks; Carlos J. Bernardos, Universidad Carlos III de Madrid; María Calderón, Universidad Carlos...
23 Aug 2011 - 09:00 to 25 Aug 2011 - 09:00 (Madrid Time)
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-... +
Imsonia_Access
Eduard Goma, Telefónica Research; Marco Canini, EPFL; Alberto Lopez Toledo, Telefonica Research; Nikolaos Laoutaris, Telefonica...
15 Aug 2011 - 09:00 to 19 Aug 2011 - 09:00 (Madrid Time)
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... +
BitTorrent
Michal Kryczka, Research Assistant at Institute IMDEA Networks
20 Jul 2011 - 13:00 (Madrid Time)
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... +
distance networks
Antonio Fernández Anta, Senior Researcher, Institute IMDEA Networks
18 Jul 2011 - 12:00 (Madrid Time)
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... +

Pages