output
20022011
most citedOn Using Matching Theory to Understand P2P Network Design

32 citations

Showing cs.NIShow all

7 papers · 1 filter

cs.NI2011

On Using Seeders for P2P Live Streaming

Fabien Mathieu

Seeders (peers that do not request anything but contribute to the system) are a powerful concept in peer-to-peer (P2P). They allow to leverage the capacities of a P2P system. While…

cs.NI20105 cited

Upstream traffic capacity of a WDM EPON under online GATE-driven scheduling

Nelson Antunes, Christine Fricker, Philippe Robert +1

Passive optical networks are increasingly used for access to the Internet and it is important to understand the performance of future long-reach, multi-channel variants. In this pa…

cs.NI20092 cited

Adaptive algorithms for identifying large flows in IP traffic

Youssef Azzana, Yousra Chabchoub, Christine Fricker +2

We propose in this paper an on-line algorithm based on Bloom filters for identifying large flows in IP traffic (a.k.a. elephants). Because of the large number of small flows, hash…

cs.NI20084 cited

Monotony in Service Orchestrations

Anne Bouillard, Sidney Rosario, Albert Benveniste +1

Web Service orchestrations are compositions of different Web Services to form a new service. The services called during the orchestration guarantee a given performance to the orche…

cs.NI20081 cited

Scalable Distributed Video-on-Demand: Theoretical Bounds and Practical Algorithms

Laurent Viennot, Yacine Boufkhad, Fabien Mathieu +2

We analyze a distributed system where n nodes called boxes store a large set of videos and collaborate to serve simultaneously n videos or less. We explore under which conditions s…

cs.NI2007

Tournament MAC with Constant Size Congestion Window for WLAN

Jerome Galtier

In the context of radio distributed networks, we present a generalized approach for the Medium Access Control (MAC) with fixed congestion window. Our protocol is quite simple to an…