Research
Optimal Network Locality in Distributed Services
Working Connection Computer and Network Security - SSL, IPsec, Firewalls – (Chapter 17, 18, 19, and 23)
The k-server Problem Study Group: Randomized Algorithm Presented by Ray Lam August 16, 2003.
Distributed Hash Tables
1 Concurrency : Deadlock and Starvation Principles of deadlock –Deadlock is the permanent blocking of a set of processes that either compete for system.
P2P Systems and Distributed Hash Tables Section 9.4.2
Hashing in Networked Systems COS 461: Computer Networks Spring 2011 Mike Freedman LB Server.
The DHCP Failover Protocol A Formal Perspective Rui FanMIT Ralph Droms Cisco Systems Nancy GriffethCUNY Nancy LynchMIT.
Embedding and Sketching Sketching for streaming
