Distributed computing systems implement redundancy to reduce the job completion time and variability. Despite a large body of work about redundancy, analytical performance evaluation techniques in queuing is still an open problem. In this work, we take one step forward analyze scheduling policies with redundancy. particular, study pattern shared servers among replicas different jobs. To end, em...

Low-latency anonymous communication protocols in general, and the popular onion-routing protocol in particular, are broken against simple timing attacks. While there have been few proposed solutions to this problem when the adversary is active, several padding schemes have been proposed to defend against a passive adversary that just observes timing patterns. Unfortunately active adversaries ca...