Dual proximity neighbour selection method for peer-to-peer-based discovery service

Full Text: PDFPDF Buy this ArticleBuy this Article
Authors: Piotr Karwaczyński Wroclaw University of Technology, Wroclaw, Poland
Dariusz Konieczny Wroclaw University of Technology, Wroclaw, Poland
Jaka Moçnik XLab d.o.o., Ljubljana, Slovenia
Marko Novak XLab d.o.o., Ljubljana, Slovenia
Dual proximity neighbour selection method for peer-to-peer-based discovery service Published by ACM 2007 Article
Bibliometrics Data  Bibliometrics
· Downloads (6 Weeks): 1
· Downloads (12 Months): 12
· Downloads (cumulative): 155
· Citation Count: 0

Published in:
Cover Image
 
· Proceeding
SAC '07 Proceedings of the 2007 ACM symposium on Applied computing
Pages 590-591
ACM New York, NY, USA ©2007
table of contents ISBN:1-59593-480-4 doi>10.1145/1244002.1244137

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