Institutional Login
Welcome!
To use the personalized features of this site, please
log in
or
register
.
If you have forgotten your username or password, we can
help
.
My Menu
Marked Items
Alerts
Order History
Saved Items
All
Favorites
Content Types
All
Publications
Journals
Book Series
Books
Reference Works
Protocols
Subject Collections
Architecture and Design
Behavioral Science
Biomedical and Life Sciences
Business and Economics
Chemistry and Materials Science
Computer Science
Earth and Environmental Science
Engineering
Humanities, Social Sciences and Law
Mathematics and Statistics
Medicine
Physics and Astronomy
Professional and Applied Computing
中文(简体)
中文(繁體)
English
Deutsch
한국어
日本語
Français
Español
العربية
Русский
Book Chapter
A Decentralized Algorithm for Coordinating Independent Peers: An Initial Examination
Book Series
Lecture Notes in Computer Science
Publisher
Springer Berlin / Heidelberg
ISSN
0302-9743 (Print) 1611-3349 (Online)
Volume
Volume 2519/2010
Book
On the Move to Meaningful Internet Systems 2002: CoopIS, DOA, and ODBASE
DOI
10.1007/3-540-36124-3
Copyright
2010
ISBN
978-3-540-00106-5
DOI
10.1007/3-540-36124-3_13
Pages
213-229
Subject Collection
Computer Science
SpringerLink Date
Tuesday, January 01, 2002
Add to marked items
Add to shopping cart
Add to saved items
Permissions & Reprints
Recommend this chapter
PDF (107.9 KB)
Free Preview
A Decentralized Algorithm for Coordinating Independent Peers: An Initial Examination
Girish Suryanarayana
6
and Richard Taylor
6
(6)
Institute of Software Research, University of California, Irvine
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.
Girish
Suryanarayana
Email:
sgirish@ics.uci.edu
Richard
Taylor
Email:
taylor@ics.uci.edu
Fulltext Preview (Small,
Large
)
References secured to subscribers.
more options
Find
Query Builder
Close
|
Clear
Title (ti)
Summary (su)
Author (au)
ISSN (issn)
ISBN (isbn)
DOI (doi)
And
Or
Not
(
)
* (wildcard)
"" (exact)
Within all content
Within this book series
Within this book
Export this chapter
Export this chapter as
RIS
|
Text
Frequently asked questions
|
General information on journals and books
|
Send us your feedback
|
Impressum
|
Contact
© Springer.
Part of Springer Science+Business Media
Privacy, Disclaimer, Terms and Conditions, © Copyright Information
MetaPress Privacy Policy
Remote Address: 38.107.191.106 • Server: mpweb08
HTTP User Agent: CCBot/1.0 (+http://www.commoncrawl.org/bot.html)