Maintaining Connectivity in a Scalable and Robust Distributed Environment

Authors:
Mark Jelasity;Mike PreusB;Maarten Van Steen;Ben Paechter
Affiliations:
-;-;-;-
Venue:
CCGRID '02 Proceedings of the 2nd IEEE/ACM International Symposium on Cluster Computing and the Grid
Year:
2002

Citing 0
Cited 8

Operator Learning for a Problem Class in a Distributed Peer-to-Peer Environment

PPSN VII Proceedings of the 7th International Conference on Parallel Problem Solving from Nature
A Framework for Distributed Evolutionary Algorithms

PPSN VII Proceedings of the 7th International Conference on Parallel Problem Solving from Nature
On Obtaining Global Information in a Peer-to-Peer Fully Distributed Environment (Research Note)

Euro-Par '02 Proceedings of the 8th International Euro-Par Conference on Parallel Processing
An Efficient Decentralized Grid Service Discovery Approach based on Service Ontology

WI '04 Proceedings of the 2004 IEEE/WIC/ACM International Conference on Web Intelligence
Is the island model fault tolerant?

Proceedings of the 9th annual conference companion on Genetic and evolutionary computation
Characterizing fault tolerance in genetic programming

Future Generation Computer Systems
A fault recovery scheme for p2p metacomputers

HiPC'05 Proceedings of the 12th international conference on High Performance Computing
Introducing artificial evolution into peer-to-peer networks with the distributed remodeling framework

Genetic Programming and Evolvable Machines

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper describes a novel peer-to-peer (P2P) environmentfor running distributed Java applications on the Internet.The possible application areas include simple load balancing, parallel evolutionary computation, agent-based simulation and artificial life. Our environment is based on cutting-edge P2P technology. We introduce and analyze the concept of long term memory which provides protection against partitioning of the network.We demonstrate the potentials of our approach by analyzing a simple distributed application. We present theoretical and empirical evidence that our approach is scalable, effective and robust.