Dynamic load balancing in Peer-to-Peer networks

by Miroslaw KorzeniowskiPaderborn, Univ., Diss., 200

Balance content allocation scheme for peer-service area CDN architecture for IPTV services

One of the main problems in IPTV technology is how to manage the huge amount of multimedia contents efficiently to meet the demands of users especially for Video on Demand (VoD) services.Content Distribution Networks (CDN) are used to solve this problem but the problem of load imbalance among servers still exists due to the dynamic changes in contents and user interests in an IPTV environment.In the VoD context, many content storage management architecture models are proposed: single point, hierarchal, distributed, and service peer area architectures.In the this paper we choose peer-service area architecture for CDN to study the load imbalance problem and try to handle it by modifying peer-service area architecture and proposing a balanced content allocation scheme that solves the load imbalance problem by replicating the contents based on their popularity.Experimental results show that this proposed allocation scheme can maintain the load balancing among servers and avoid over/under utilization of servers

LUNES: Agent-based Simulation of P2P Systems (Extended Version)

We present LUNES, an agent-based Large Unstructured NEtwork Simulator, which allows to simulate complex networks composed of a high number of nodes. LUNES is modular, since it splits the three phases of network topology creation, protocol simulation and performance evaluation. This permits to easily integrate external software tools into the main software architecture. The simulation of the interaction protocols among network nodes is performed via a simulation middleware that supports both the sequential and the parallel/distributed simulation approaches. In the latter case, a specific mechanism for the communication overhead-reduction is used; this guarantees high levels of performance and scalability. To demonstrate the efficiency of LUNES, we test the simulator with gossip protocols executed on top of networks (representing peer-to-peer overlays), generated with different topologies. Results demonstrate the effectiveness of the proposed approach.Comment: Proceedings of the International Workshop on Modeling and Simulation of Peer-to-Peer Architectures and Systems (MOSPAS 2011). As part of the 2011 International Conference on High Performance Computing and Simulation (HPCS 2011

GCP: Gossip-based Code Propagation for Large-scale Mobile Wireless Sensor Networks

Wireless sensor networks (WSN) have recently received an increasing interest. They are now expected to be deployed for long periods of time, thus requiring software updates. Updating the software code automatically on a huge number of sensors is a tremendous task, as ''by hand'' updates can obviously not be considered, especially when all participating sensors are embedded on mobile entities. In this paper, we investigate an approach to automatically update software in mobile sensor-based application when no localization mechanism is available. We leverage the peer-to-peer cooperation paradigm to achieve a good trade-off between reliability and scalability of code propagation. More specifically, we present the design and evaluation of GCP ({\emph Gossip-based Code Propagation}), a distributed software update algorithm for mobile wireless sensor networks. GCP relies on two different mechanisms (piggy-backing and forwarding control) to improve significantly the load balance without sacrificing on the propagation speed. We compare GCP against traditional dissemination approaches. Simulation results based on both synthetic and realistic workloads show that GCP achieves a good convergence speed while balancing the load evenly between sensors