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 peertopeer 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.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Napster http://www.napster.com
Gnutella.com http://www.gnutella.com
Groove Networks, Inc., Platform for inter-enterprise communication and collaboration http://www.groove.net
Bolcer, G., Gorlick, M., Hitomi, A., Kammer, P., Morrow, B., Oreizy, P., Taylor, R. Peer-to-Peer Architectures and the Magi Open-Source Infrastructure. Endeavors Technology, Inc. (Dec 2000) http://www.endtech.com/papers.html
Bolcer, G. (Endeavors Technology, Inc.) Magi: An Architecture for Mobile and Disconnected Workflow. IEEE Internet Computing special edition on Internet-Based Workflow, (May/June 2000) 46–54.
Shirky, C. Listening to Napster in Andy Oram, ed. Peer-to-Peer: Harnessing the Benefits of a Disruptive Technology. O’Reilly & Associates, March 2001, 21–37.
Kan, G. Gnutella in Andy Oram, ed. Peer-to-Peer: Harnessing the Benefits of a Disruptive Technology. Andy Oram O’Reilly & Associates, March 2001, 94–122.
Udell, J., Asthagiri, N., Tuvell, W. Security in Peer-to-Peer: Harnessing the Benefits of a Disruptive Technology. Andy Oram O’Reilly & Associates, March 2001, 354–380.
Johnson, D. Routing in Ad Hoc Networks of Mobile Hosts. Proceedings of the IEEE Workshop on Mobile Computing Systems and Applications (Dec 1994)
Perkins, C., Bhagwat, P. Highly dynamic Destination-Sequenced Distance Vector Routing (DSDV) for Mobile Computers. Proceedings of the SIGCOMM’ 94 Conference on Communications, Architectures, Protocols and Applications (Aug 1994), 234–244.
Johnson, D. Dynamic Source Routing in Ad Hoc Wireless Networks, Mobile Computing, Kluwer Academic Publishers, 1996.
Park, V., Corson, S. A Highly Adaptive Distributed Routing Algorithm for Mobile Wireless Networks. Proceedings of IEEE INFOCOM (April 1997).
Garcia-Luna-Aceves, J.J., Madruga, E.L. The Core Assisted Mesh Protocol. IEEE Journal on Selected Areas in Communications, Special Issue on Ad-Hoc Networks, Vol. 17, No. 8, (Aug 1999) 1380–1394.
Royer, E., Toh, C-K. A Review of Current Routing Protocols for Ad-Hoc Mobile Wireless Networks. IEEE Personal Communications Magazine (Apr 1999) 46–55.
Basagni, S., Chlamtac, I. Broadcast in Peer-to-Peer Networks. Proceedings of the Second IASTED International Conference European Parallel and Distributed Systems (Vienna, Austria July 1998) 117–122.
Malpani, N., Welch, J., Vaidya, N. Leader Election Algorithms for Mobile Ad Hoc Networks. Proceedings of the 4th International Workshop on Discrete Algorithms and Methods for Mobile Computing and Communications (DIAL M for Mobility) (Aug 2000) 96–103.
Hatzis, K., Pentaris, G., Spirakis, P., Tampakas, V., Tan, R. Fundamental Control Algorithms in Mobile Networks. Proceedings of the Eleventh Annual ACM Symposium on Parallel Algorithms and Architectures (Saint-Malo, France June 1999) 251–260.
Borodin, A., Linial, N., Saks, M. An optimal online algorithm for metrical task system. Journal of the Association for Computing Machinery, vol. 39, (no.4) (Oct 1992), 745–763.
Koutsoupias, E., Papadimitriou, C. On the k-server conjecture. Journal of the Association for Computing Machinery, vol.42, (no.5) ACM (Sep 1995), 971–983.
Manasse, M., McGeoch, L., Sleator, D. Competitive algorithms for on-line problems Proceedings of the Twentieth Annual ACM Symposium on Theory of Computing (Chicago IL, May 1988) 322–333
Fiat, A., Rabani, Y., Ravid, Y. Competitive k-Server Algorithms. Proceedings of the 31st Ann. IEEE Symposium on Foundations of Computer Science, (October 1990), 454–463.
Grove, E. The Harmonic k-Server Algorithm is Competitive. Proceedings of the 23rd Annual ACM Symposium on Theory of Computing, (May 1991), 260–266.
Bartal, Y., and Rosen, A. The Distributed k-Server Problem-A Competitive Distributed Translator for k-Server Algorithms. Journal of Algorithms, vol.23, (no.2), Academic Press (May 1997), 241–264.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Suryanarayana, G., Taylor, R. (2002). A Decentralized Algorithm for Coordinating Independent Peers: An Initial Examination. In: Meersman, R., Tari, Z. (eds) On the Move to Meaningful Internet Systems 2002: CoopIS, DOA, and ODBASE. OTM 2002. Lecture Notes in Computer Science, vol 2519. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-36124-3_13
Download citation
DOI: https://doi.org/10.1007/3-540-36124-3_13
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-00106-5
Online ISBN: 978-3-540-36124-4
eBook Packages: Springer Book Archive