SIGN IN
SIGN UP
On static and dynamic partitioning behavior of large-scale P2P networks
Full Text:
Pdf
Buy this Article
Authors:
Derek Leonard
Department of Computer Science, Texas A&M University, College Station, TX
Zhongmei Yao
Department of Computer Science, Texas A&M University, College Station, TX
Xiaoming Wang
Department of Computer Science, Texas A&M University, College Station, TX
Dmitri Loguinov
Department of Computer Science, Texas A&M University, College Station, TX
2008 Article
Bibliometrics
· Downloads (6 Weeks): 2
· Downloads (12 Months): 16
· Citation Count: 1
Published in:
· Journal
IEEE/ACM Transactions on Networking (TON)
archive
Volume 16 Issue 6, December 2008
IEEE Press
Piscataway, NJ
, USA
table of contents
doi>
10.1109/TNET.2007.911433
Tools and Resources
Buy this Article
Request Permissions
TOC Service:
Email
RSS
Save to Binder
Export Formats:
BibTeX
EndNote
ACM Ref
Share:
|
Tags:
algorithms
churn
design
dynamic resilience
graph algorithms
graph disconnection
network problems
network topology
p2p
performance
Feedback
|
Switch to
single page view
(no tabs)
**Javascript is not enabled and is required for the "tabbed view" or switch to the
single page view
**
Powered by
The ACM Guide to Computing Literature
All Tags
Export Formats
Save to Binder