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
Improving the Robustness of Epidemic Communication in Scale-Free Networks
Book Series
Lecture Notes in Computer Science
Publisher
Springer Berlin / Heidelberg
ISSN
0302-9743 (Print) 1611-3349 (Online)
Volume
Volume 3853/2006
Book
Biologically Inspired Approaches to Advanced Information Technology
DOI
10.1007/11613022
Copyright
2006
ISBN
978-3-540-31253-6
Category
Networking II
DOI
10.1007/11613022_24
Pages
294-305
Subject Collection
Computer Science
SpringerLink Date
Saturday, December 17, 2005
Add to marked items
Add to shopping cart
Add to saved items
Permissions & Reprints
Recommend this chapter
PDF (440.3 KB)
Free Preview
Networking II
Improving the Robustness of Epidemic Communication in Scale-Free Networks
Takuya Okuyama
1
, Tatsuhiro Tsuchiya
1
and Tohru Kikuno
1
(1)
Graduate School of Information Science and Technology, Osaka University, Osaka 567-0851, Japan
Abstract
As the name suggests, epidemic protocols mimic spread of virus to implement broadcasting with high reliability and low communication cost in peer-to-peer (P2P) overlay networks. In this paper, we study the reliability of epidemic protocols in scale-free networks, an important class of P2P overlay network topologies. In order to improve the robustness of epidemic protocols, we optimize the basic epidemic protocol in the following two ways. One optimization is to introduce an adaptive mechanism that allows each node to retransmit a broadcast message adaptively to the environment. The other optimization is to modify the protocol such that nodes will forward broadcast messages preferentially to neighbor nodes of small degree. The usefulness of these optimizations is demonstrated through simulation results.
Takuya
Okuyama
Email:
t-okuyama@ist.osaka-u.ac.jp
Tatsuhiro
Tsuchiya
Email:
t-tutiya@ist.osaka-u.ac.jp
Tohru
Kikuno
Email:
kikuno@ist.osaka-u.ac.jp
Fulltext Preview (Small,
Large
)
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.113 • Server: mpweb08
HTTP User Agent: CCBot/1.0 (+http://www.commoncrawl.org/bot.html)