Qixiang Sun

Using Ad-hoc Inter-Vehicle Network for Regional Alerts
with Hector Garcia-Molina
Technical Report, 2005

duration of time

region

Adlib: A Self-Tuning Index for Dynamic Peer-to-Peer Systems
with Prasanna Ganesan and Hector Garcia-Molina
Poster in 21st International Conference on Data Engineering (ICDE) 2005
Technical Report, 2004

We give a P2P design that explicitly trades off query cost versus maintenance/update cost. We show our design also maps efficiently onto the underlying physical network and demonstrate its effectiveness on real workloads.

Apocrypha: Making P2P Overlays Network-aware
with Prasanna Ganesan and Hector Garcia-Molina
Submitted to IEEE/ACM Transactions on Networking

long circuit

SLIC: A Selfish Link-based Incentive Mechanism for Unstructured Peer-to-Peer Networks
with Hector Garcia-Molina
24th International Conference on Distributed Computing Systems (ICDCS 2004)

We propose an alternative and simpler solution to combat free-riding and abuses in peer-to-peer to systems. Instead of using reputation or micro-payment, we simply allow each peer to rate its incoming links according to their "usefulness" over time. Each peer, in turn, gives preferential treatment to links with higher rating.

[Extended TR (ps)]

[Extended TR (pdf)]

Maximizing Remote Work in Flooding-based Peer-to-Peer Systems
with Neil Daswani and Hector Garcia-Molina
17th International Symposium on Distributed Computing (DISC 2003)
Journal version to appear in Computer Networks

We study how to maximize the amount of query processed in a flooding-based peer-to-peer system by determining the optimal rate of query injection at individual peers. We give a simple procedure and prove its optimal. We also show that prefering queries with high TTL when a peer is overloaded is indeed optimal in maximizing work.

[Journal version (ps)]

[Journal versoin (pdf)]

YAPPERS: A Peer-to-Peer Lookup Service Over Arbitrary Topology
with Prasanna Ganesan and Hector Garcia-Molina
IEEE INFOCOM 2003

We introduce a hybrid p2p design where each node form a small DHT around its neighborhood and use intelligent flooding reach other nodes that might have the desired results. This design respects the overlay topology, thus suitable for systems where the overlay topology are not in the control of the p2p system.

Partial Lookup Services
with Hector Garcia-Molina
23rd International Conference on Distributed Computing Systems (ICDCS 2003)

We explore the scenario of a cluster of servers implementing a lookup service where each key lookup only requires a small subset of values associated with the key. We examine various metrics on several simple schemes.

Statistical Identification of Encrypted Web Browsing Traffic
with Daniel Simon, Yi-Min Wang, Wilf Russell, Venkata Padmanabhan, and Lili Qiu
2002 IEEE Symposium on Security and Privacy (S&P 2002)

Although Web browsing can be encrypted and routed through a chain of servers to achieve anonymity, by merely examining the number of objects and the sizes of the objects we can determine which Web page a user is browsing. Thus if we know who the user is, i.e., by sniffing at ISP routers, we can break the anonymity.