A Decentralized Algorithm for Coordinating Independent Peers: An Initial Examination

Authors:
Girish Suryanarayana;Richard Taylor
Affiliations:
-;-
Venue:
On the Move to Meaningful Internet Systems, 2002 - DOA/CoopIS/ODBASE 2002 Confederated International Conferences DOA, CoopIS and ODBASE 2002
Year:
2002

Citing 13
Cited 0

Competitive algorithms for on-line problems

STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
The harmonic online K-server algorithm is competitive

STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
An optimal on-line algorithm for metrical task system

Journal of the ACM (JACM)
Highly dynamic Destination-Sequenced Distance-Vector routing (DSDV) for mobile computers

SIGCOMM '94 Proceedings of the conference on Communications architectures, protocols and applications
On the k-server conjecture

Journal of the ACM (JACM)
The distributed k-server problem—a competitive distributed translator for k-server algorithms

Journal of Algorithms
Fundamental control algorithms in mobile networks

Proceedings of the eleventh annual ACM symposium on Parallel algorithms and architectures
Leader election algorithms for mobile ad hoc networks

DIALM '00 Proceedings of the 4th international workshop on Discrete algorithms and methods for mobile computing and communications
Magi: An Architecture for Mobile and Disconnected Workflow

IEEE Internet Computing
A Highly Adaptive Distributed Routing Algorithm for Mobile Wireless Networks

INFOCOM '97 Proceedings of the INFOCOM '97. Sixteenth Annual Joint Conference of the IEEE Computer and Communications Societies. Driving the Information Revolution
Competitive k-server algorithms

SFCS '90 Proceedings of the 31st Annual Symposium on Foundations of Computer Science
Routing in Ad Hoc Networks of Mobile Hosts

WMCSA '94 Proceedings of the 1994 First Workshop on Mobile Computing Systems and Applications
The core-assisted mesh protocol

IEEE Journal on Selected Areas in Communications

Quantified Score

Hi-index	0.00

Visualization

Abstract

Peer-to-peer (P2P) applications are composed of a distributed collection of peers that cooperate in order to perform some common task. Though P2P applications have attracted the attention of researchers, there has been little exploration of the deep issues; rather initial attention has been on widely known but technically shallow applications such as found in Napster and Gnutella. One particularly rich domain for examining the utility of P2P applications is distributed, decentralized crisis response. This paper studies the applicability of a peer-to-peer approach in such an emergency response situation. We have developed a prototype peer-to-peer infrastructure that models a group of firefighters who communicate with each other while fighting fires. Each firefighter (peer) runs a novel distributed "k-server" algorithm that makes local autonomous decisions based on the information received from other firefighters. While this study was limited in that it used a simulation to study the algorithm, the emergent behavior observed suggests that further, more detailed investigations are warranted.