Université de Neuchâtel

Load management in peer-to-peer systems : structures and algorithms

Serbu, Sabina ; Kropf, Peter (Dir.)

Thèse de doctorat : Université de Neuchâtel, 2010 ; Th. 2138.

Dans cette thèse, nous présentons plusieurs techniques inédites pour la gestion de charge dans les systèmes pair-à-pair. Nous abordons deux types de systèmes pair-à-pair: les systèmes de recherche d’information (en particulier DHTs), où nous définissons de nouvelles solutions pour l’équilibrage de charge, et les systèmes de diffusion d’information, où nous définissons de...

Université de Neuchâtel

A Model for Error Avoidance and Error Correction in Peer-to-Peer Networks

Spielvogel, Christian ; Serbu, Sabina ; Kropf, Peter ; Felber, Pascal

In: 3rd International Workshop on Semantic Media Adaptation and Personalization, 2008, p. 100-105

Video streaming over best effort networks remains a challenging task. Video quality decreases with the number of frames that are corrupted, lost or received after the playback time. In order to deliver videos in high quality, a model for selecting the proper network-error treatment in a peer-to-peer overlay is presented. Based on the model, the selection is between error avoidance, error...

Université de Neuchâtel

Fault-Tolerant P2P Networks: How Dependable is Greedy Routing

Serbu, Sabina ; Kropf, Peter ; Felber, Pascal

In: Workshop on Dependable Application Support in Self-Organising Networks (DASSON'07), 2007, p. 1

Under churn, the problem of preserving accessibility is addressed by maintaining valid entries in the routing tables towards live nodes. However, if the system fails to replace the entries of dead nodes with entries of live nodes soon enough, requests may fail. In such cases, mechanisms to route around failures are required to increase the tolerance to node failures. Existing DHTs include...

Université de Neuchâtel

Dynamic Load Sharing in Peer-to-Peer Systems: When Some Peers Are More Equal than Others

Serbu, Sabina ; Bianchi, Silvia ; Kropf, Peter ; Felber, Pascal

In: IEEE Internet Computing, 2007, vol. 11, no. 4, p. 53-61

In the past few years, several DHT-based abstractions for peer-to-peer systems have been proposed. The main characteristic is to associate nodes (peers) with keys (objects) and to construct distributed routing structures to support an efficient location. These approaches address the load problem, and load balancing is achieved by moving the keys. However, the problem is still not properly...

Université de Neuchâtel

Adaptive Load Balancing for DHT Lookups

Bianchi, Silvia ; Serbu, Sabina ; Felber, Pascal ; Kropf, Peter

In: 15th International Conference on Computer Communications and Networks (ICCCN'06), 2006, p. 411-418

In the past few years, several DHT-based abstractions for peer-to-peer systems have been proposed. The main characteristic is to associate nodes (peers) with objects (keys) and to construct distributed routing structures to support efficient location. These approaches partially consider the load problem by balancing storage of objects without, however, considering lookup traffic. In this paper we...

Université de Neuchâtel

Improving the Dependability of Prefix-Based Routing in DHTs

Serbu, Sabina ; Kropf, Peter ; Felber, Pascal

In: Lecture notes in computer science (LNCS), 2007, vol. 4803, p. 206-225

Under frequent node arrival and departure (churn) in an overlay network structure, the problem of preserving accessibility is addressed by maintaining valid entries in the routing tables towards nodes that are alive. However, if the system fails to replace the entries of dead nodes with entries of live nodes in the routing tables soon enough, requests may fail. In such cases, mechanisms to route...