Consider k particles, 1 red and k −1 white, chasing each other on the nodes of a graph G. If the red one catches one of the white, it “infects” it with its color. The newly ...
Tassos Dimitriou, Sotiris E. Nikoletseas, Paul G. ...
Despite many years of research, fair queuing still faces a number of implementation challenges in high speed routers. In particular, in spite of proposals such as DiffServ, the st...
The focus of access control in client/server environments is on protecting sensitive server resources by determining whether or not a client is authorized to access those resource...
We consider several distributed collaborative key agreement protocols for dynamic peer groups. This problem has several important characteristics which make it different from trad...
Patrick P. C. Lee, John C. S. Lui, David K. Y. Yau
— Recently, a class of solutions including Core-Stateless Fair Queueing (CSFQ), Rainbow Fair Queueing, and Diffserv have been proposed to address the scalability concerns that ha...