Randy Baden
Randy Baden

homepage
randy.badenatgmail.com

  Affiliation history
Bibliometrics: publication history
Average citations per article18.78
Citation Count169
Publication count9
Publication years2008-2012
Available for download6
Average downloads per article900.33
Downloads (cumulative)5,402
Downloads (12 Months)218
Downloads (6 Weeks)26
SEARCH
ROLE
Arrow RightAuthor only


AUTHOR'S COLLEAGUES
See all colleagues of this author

SUBJECT AREAS
See all subject areas




BOOKMARK & SHARE


9 results found Export Results: bibtexendnoteacmrefcsv

Result 1 – 9 of 9
Sort by:

1
January 2012
Bibliometrics:
Citation Count: 0

Users share their sensitive personal data with each other through public services and applications provided by third parties. Users trust application providers with their private data since they want access to provided services. However, trusting third parties with private data can be risky: providers profit by sharing that data with ...

2 published by ACM
August 2011 SIGCOMM '11: Proceedings of the ACM SIGCOMM 2011 conference
Publisher: ACM
Bibliometrics:
Citation Count: 0
Downloads (6 Weeks): 3,   Downloads (12 Months): 12,   Downloads (Overall): 300

Full text available: PDFPDF
Decentralized online social networks (OSNs) typically rely on the existence of a public key infrastructure (PKI), but certificate authorities (CAs) cannot scalably identify all of the members of an OSN. Our system, LoKI, uses the ubiquity of mobile devices to exchange secrets during real-world meetings that can be used for ...
Keywords: location, mobility, online social networks, public key infrastructure
Also published in:
October 2011  ACM SIGCOMM Computer Communication Review - SIGCOMM '11: Volume 41 Issue 4, August 2011

3 published by ACM
June 2011 ACM SIGMETRICS Performance Evaluation Review - Performance evaluation review: Volume 39 Issue 1, June 2011
Publisher: ACM
Bibliometrics:
Citation Count: 0
Downloads (6 Weeks): 0,   Downloads (12 Months): 10,   Downloads (Overall): 102

Full text available: PDFPDF
Current IP geoloation techniques can geolocate an IP address to a region approximately 700 square miles, roughly the size of a metropolitan area. We model geolocation as a pattern-recognition problem, and introduce techniques that geolocate addresses to within 5 miles inside a metropolitan area. We propose two complementary algorithms: The ...
Keywords: geolocation, pattern recognition, perturbation

4 published by ACM
June 2011 SIGMETRICS '11: Proceedings of the ACM SIGMETRICS joint international conference on Measurement and modeling of computer systems
Publisher: ACM
Bibliometrics:
Citation Count: 0
Downloads (6 Weeks): 0,   Downloads (12 Months): 9,   Downloads (Overall): 152

Full text available: PDFPDF
Current IP geoloation techniques can geolocate an IP address to a region approximately 700 square miles, roughly the size of a metropolitan area. We model geolocation as a pattern-recognition problem, and introduce techniques that geolocate addresses to within 5 miles inside a metropolitan area. We propose two complementary algorithms: The ...
Keywords: geolocation, pattern recognition, perturbation

5 published by ACM
November 2009 IMC '09: Proceedings of the 9th ACM SIGCOMM conference on Internet measurement
Publisher: ACM
Bibliometrics:
Citation Count: 16
Downloads (6 Weeks): 1,   Downloads (12 Months): 10,   Downloads (Overall): 321

Full text available: PDFPDF
Triangle inequality violations (TIVs) are important for latency sensitive distributed applications. On one hand, they can expose opportunities to improve network routing by finding shorter paths between nodes. On the other hand, TIVs can frustrate network embedding or positioning systems that treat the Internet as a metric space where the ...
Keywords: latency, triangle inequality violation, tiv, variation

6 published by ACM
August 2009 SIGCOMM '09: Proceedings of the ACM SIGCOMM 2009 conference on Data communication
Publisher: ACM
Bibliometrics:
Citation Count: 118
Downloads (6 Weeks): 24,   Downloads (12 Months): 173,   Downloads (Overall): 4,382

Full text available: PDFPDF
Online social networks (OSNs) are immensely popular, with some claiming over 200 million users. Users share private content, such as personal information or photographs, using OSN applications. Users must trust the OSN service to protect personal information even as the OSN provider benefits from examining and sharing that information. We ...
Keywords: facebook, privacy, ABE, persona, OSN, social networks
Also published in:
August 2009  ACM SIGCOMM Computer Communication Review - SIGCOMM '09: Volume 39 Issue 4, October 2009

7
April 2009 NSDI'09: Proceedings of the 6th USENIX symposium on Networked systems design and implementation
Publisher: USENIX Association
Bibliometrics:
Citation Count: 16

We propose to construct routing overlay networks using the following principle: that overlay edges should be based on mutual advantage between pairs of hosts. Upon this principle, we design, implement, and evaluate Peer-Wise, a latency-reducing overlay network. To show the feasibility of PeerWise, we must show first that mutual advantage ...

8
March 2009 PAM '09: Proceedings of the 10th International Conference on Passive and Active Network Measurement
Publisher: Springer-Verlag
Bibliometrics:
Citation Count: 14

Triangle inequality violations (TIVs) are the effect of packets between two nodes being routed on the longer direct path between them when a shorter detour path through an intermediary is available. TIVs are a natural, widespread and persistent consequence of Internet routing policies. By exposing opportunities to improve the delay ...

9 published by ACM
August 2008 NetEcon '08: Proceedings of the 3rd international workshop on Economics of networked systems
Publisher: ACM
Bibliometrics:
Citation Count: 2
Downloads (6 Weeks): 1,   Downloads (12 Months): 3,   Downloads (Overall): 123

Full text available: PDFPDF
PeerWise is an Internet routing overlay that reduces end-to-end latencies by allowing peers to forward through a relay instead of connecting directly to their destinations. Fundamental to PeerWise is the notion of peering agreements between two peers, wherein they agree to forward for one another. In this paper, we consider ...
Keywords: incentives, internet routing overlays, service-level agreements



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