Group key exchange protocols allow a group of servers communicating over an asynchronous network of point-to-point links to establish a common key, such that an adversary which fu...
Many algorithm visualizations have been created, but little is known about which features are most important to their success. We believe that pedagogically useful visualizations ...
Purvi Saraiya, Clifford A. Shaffer, D. Scott McCri...
The problem of estimating the capacity of an Internet path is one of fundamental importance. Due to the multitude of potential applications, a large number of solutions have been ...
Rohit Kapoor, Ling-Jyh Chen, Alok Nandan, Mario Ge...
Page migration is one of the fundamental subproblems in the framework of data management in networks. It occurs in a distributed network of processors sharing one indivisible memo...
Marcin Bienkowski, Miroslaw Korzeniowski, Friedhel...
Several peer-to-peer networks are based upon randomized graph topologies that permit efficient greedy routing, e.g., randomized hypercubes, randomized Chord, skip-graphs and const...