A routing mechanism for unstructured peer-to-peer systems based on hop-limited shortest-path trees

Full Text: PDFPDF Buy this ArticleBuy this Article
Authors: Phouvieng Hieungmany Chiba University, Inage, Chiba, Japan
Shigeo Shioda Chiba University, Inage, Chiba, Japan
Published in:
Cover Image
 
· Proceeding
AINTEC '09 Asian Internet Engineering Conference
Pages 34-41
ACM New York, NY, USA ©2009
table of contents ISBN: 978-1-60558-614-4 doi>10.1145/1711113.1711120
A routing mechanism for unstructured peer-to-peer systems based on hop-limited shortest-path trees Published by ACM 2009 Article
Bibliometrics Data  Bibliometrics
· Downloads (6 Weeks): 3
· Downloads (12 Months): 25
· Downloads (cumulative): 65
· Citation Count: 0


Tools and Resources

Share:

|
feedback Feedback | Switch to single page view (no tabs)

Powered by The ACM Guide to Computing Literature


The ACM Digital Library is published by the Association for Computing Machinery. Copyright © 2013 ACM, Inc.
Terms of Usage   Privacy Policy   Code of Ethics   Contact Us

Useful downloads: Adobe Acrobat    QuickTime    Windows Media Player    Real Player
The ACM Guide to Computing Literature
All Tags
Export Formats
 
 
Save to Binder