Pei Cao's home page at Stanford

Pei Cao's Web Page at Stanford

Pei is currently a consulting faculty at the Computer Science Department, Stanford University. Her research interests are distributed systems, networking, storage systems and operating systems.

At Stanford, she can be reached by "the last name followed by at cs.stanford.edu".

Courses:

CS200: Care and Feeding of Large Scale Web Services (Spring 2014)

Publications:

P2P

Peer-Assisted CDN: Challenges and Techniques, invited talk.
Can Self-Organizing P2P File Distribution Provide QoS Guarantees?, to appear in OSR Special Issue on Self-Organizing Systems, 2006. PDF.
Improving Traffic Locality in BitTorrent via Biased Neighbor Selection, ICDCS 2006. PDF. Presentation (Powerpoint slides).
Search and Replication in Unstructured Peer-to-Peer Networks, SuperComputing 2003. (Also appears as extended abstract in SIGMETRICS 2002).

Paper (in Postscript)

Talk (Powerpoint slides)

TCP

Fairness Convergence of Loss-based TCP, in submission.
A Linux TCP implementation for NS2 by David X. Wei. To appear in the The First Workshop on NS-2, 2006. Presentation.
TCP Pacing Revisited

Network Defense

Cookies Along Trust-Boundaries (CAT): Accurate and Deployable Flood Protection, SRUTI 2006.
Flow-Cookies: A Bandwidth Amplification Approach to Defend Against DDoS Flooding Attacks. A shortened version appears in IWQoS 2006. PDF, presentation.
Hash-AV: Fast Virus Signature Scanning by Cache-Resident Filters, GlobeCom 2005. PDF.

Internet Streaming and CDN

Efficient Top-k Query Calculations in Distributed Networks, ACM PODC 2004. PDF.

Stream Engine: A New Kernel Interface for High-Performance Internet Streaming Servers, IWCW 2003.

Streaming Protocol Fairness Issues over Low Bandwidth WAN links, WIAPP 2003 . NS2 simulation code and data can be found here.

Lineage File System

The Hippocratic File System: Protecting Privacy in Networked Storage, Technical Report, August 2005, Computer Science Department, Stanford University. PDF.
Lineage File System, Technical Report, Janurary 2005, Compute Science Deparmtnet, Stanford University. Postscript.

Misc Notes
Determining Device Position in Sensor Networks in the Presence of Faulty Nodes

Is It Possible to Legislate Fair-Share?.

Research at University of Wisconsin-Madison
Older publications, codes and traces can be found at http://www.cs.wisc.edu/~cao/.
Implementation of the GreedyDual-Size cache replacement algortithm is here. The code goes with the web cache simulator package.
Bio