PlanetSim: A New Overlay Network Simulation Framework

Abstract-The Distributed Tree Construction (DTC) algorithm is designed for optimally efficient multicast tree construction over structured peer-to-peer networks. It achieves this by creating a spanning tree over the peers in the multicast group, using only information available locally on each peer. Furthermore, we show that the tree depth has the same upper bound as a regular DHT lookup which in turn guarantees fast and responsive runtime behavior. Our DTC algorithm is DHT-agnostic and works with most existing DHTs. We evaluate the performance of DTC over several DHTs by comparing the performance to existing application-level multicast solutions, we show that DTC sends 30-250% fewer messages than common solutions.

show abstract

“…We used the PlanetSim P2P simulator [11]. Jones et al [12] report some issues in CAN implementations, which we took into account.…”

Section: Discussionmentioning

confidence: 99%

Optimally Efficient Multicast in Structured Peer-to-Peer Networks

Bradler

Kangasharju

Mühlhäuser

2009

2009 6th IEEE Consumer Communications and Networking Conference

View full text Add to dashboard Cite

show abstract

“…Our simulation infrastructure is created by combining two discrete event simulators namely GridSim [4], and PlanetSim [8]. GridSim offers a concrete base framework for simulation of different kinds of heterogeneous resources, services and application types.…”

Section: Simulation Setupmentioning

confidence: 99%

Dependable workflow scheduling in global Grids

Rahman

Ranjan

Buyya

2009

2009 10th IEEE/ACM International Conference on Grid Computing

View full text Add to dashboard Cite

In this paper, a reputation-based Grid workflow scheduling algorithm is proposed to counter the effect of inherent unreliability and temporal characteristics of computing resources in large scale, decentralized Grid overlays. The proposed approach builds upon structured peer-to-peer indexing and overlay networking techniques to create a scalable wide-area networking of Grid sites for supporting dependable scheduling of applications. The scheduling algorithm considers reliability of a Grid resource as a statistical property, which is globally computed in the decentralized Grid overlay based on dynamic feedbacks or reputation scores assigned by individual service consumers (Grid Resource Brokers). The proposed algorithm can dynamically adapt to changing resource conditions and offer significant performance gains as compared to traditional approaches in the event of unsuccessful job execution or resource failure. We evaluate and demonstrate the feasibility of our approach through an extensive trace driven simulation. The results show that our scheduling technique can reduce the makespan up to 50% and successfully isolate the failure-prone resources from the system.

show abstract

“…We realize the simulation infrastructure by combining two discrete-event simulators: GridSim [31] and PlanetSim [32]. GridSim offers a concrete base framework for simulation of different kinds of heterogeneous resources, services, and application types.…”

Section: Performance Evaluationmentioning

confidence: 99%