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.

ISPs (Internet Service Providers) typically operate as commercial ASes (Autonomous Systems) and obtain revenue by delivering IP (Internet Protocol) traffic of their customers. In particular, the provider-free ASes – which reach the entire Internet without paying anyone for the traffic delivery – sell IP transit to numerous other ASes. IP prefix deaggregation gives the deaggregator some control over Internet traffic flows but increases the memory requirements of IP routers.

We study the detection of the provider-free AS set (PFS), i.e., the set of those Autonomous Systems (ASes) that reach the entire Internet without paying anyone for the traffic delivery. Using trustworthy but non-verifiable sources for sanity checks, we derive the PFS from public datasets of inter-AS economic relationships. Whereas a straightforward method for extracting the PFS performs poorly because the datasets are noisy, we develop a more sophisticated Temporal Cone (TC) algorithm that relies on topological statistics and exploits the temporal diversity of the datasets. The evaluation shows that our TC algorithm detects the PFS with a high accuracy.

Twitter is one of the most used applications in the current Internet with more than 200M accounts created so far. As other large-scale systems Twitter can obtain benefit by exploiting the Locality effect existing among its users. In this paper we perform the first comprehensive study of the Locality effect of Twitter. For this purpose we have collected the geographical location of around 1M Twitter users and 16M of their followers. Our results demonstrate that language and cultural characteristics determine the level of Locality expected for different countries.

Fake content represents an important portion of those files shared in BitTorrent. In this paper we conduct a large scale measurement study in order to analyse the fake content publishing phenomenon in the BitTorrent Ecosystem. Our results reveal that a few tens of users are responsible for 90% of the fake content. Furthermore, more than 99% of the analysed fake files are linked to either malware or scam websites. This creates a serious thread for the BitTorrent ecosystem. To address this issue, we present a new detection tool named FakeDetector that may prevent the download of almost 10 millions of fake files per year based on our evaluation. This could help to reduce the number of computer infections and scams suffered by BitTorrent users.

Multimedia and information technology are reaching limits in terms of what can be done in multimedia applications with only sight and sound. The next critical step is to bring the sense of “touch” over network connections, which is commonly known as Tele-haptics. Haptics, a term which was derived from the Greek verb “haptesthai” meaning “to touch”, introduces the sense of touch and force into the human-computer interaction. Currently, research on haptics is broadly categorized into human haptics, machine haptics, and computer haptics. Human haptics is mostly conducted by psychologists to study the mechanism of the “touch” modality, while machine haptics refers to the design of haptic devices to reproduce the sense of “touch”.

We consider multi-class single server queueing networks that have a product form stationary distribution. A new limit result proves a sequence of such networks converges weakly to a stochastic flow level model. The stochastic flow level model found is insensitive. A large deviation principle for the stationary distribution of these multi-class queueing networks is also found. Its rate function has a dual form that coincides with proportional fairness. We then give the first rigorous proof that the stationary throughput of a multi-class single server queueing network converges to a proportionally fair allocation.