Zobrazeno 1 - 7
of 7
pro vyhledávání: '"Michael Vrable"'
Autor:
Stefan Savage, Geoffrey M. Voelker, Sangmin Lee, George Varghese, Alex C. Snoeren, Michael Vrable, Diwaker Gupta, Amin Vahdat
Publikováno v:
Communications of the ACM. 53:85-93
Virtual machine monitors (VMMs) are a popular platform for Internet hosting centers and cloud-based compute services. By multiplexing hardware resources among virtual machines (VMs) running commodity operating systems, VMMs decrease both the capital
Autor:
Geoffrey M. Voelker, Alex C. Snoeren, Stefan Savage, Justin Ma, Michael Vrable, Nabil Schear, Amin Vahdat, John C. McCullough, Qing Zhang
Publikováno v:
VEE
Modern organizations face increasingly complex information management requirements. A combination of commercial needs, legal liability and regulatory imperatives has created a patchwork of mandated policies. Among these, personally identifying custom
Publikováno v:
FAST
Cumulus is a system for efficiently implementing filesystem backups over the Internet, specifically designed under a thin cloud assumption—that the remote datacenter storing the backups does not provide any special backup services, but only a least
Autor:
Arnar Birgisson, Úlfar Erlingsson, Michael Vrable, Joe Gibbs Politz, Ankur Taly, Mark Lentczner
Publikováno v:
NDSS
Controlled sharing is fundamental to distributed systems; yet, on the Web, and in the Cloud, sharing is still based on rudimentary mechanisms. More flexible, decentralized cryptographic authorization credentials have not been adopted, largely because
Autor:
Geoffrey M. Voelker, David Moore, Stefan Savage, Jay Chen, Alex C. Snoeren, Justin Ma, Michael Vrable, Erik Vandekieft
Publikováno v:
SOSP
The rapid evolution of large-scale worms, viruses and bot-nets have made Internet malware a pressing concern. Such infections are at the root of modern scourges including DDoS extortion, on-line identity theft, SPAM, phishing, and piracy. However, th
Publikováno v:
PODC
Many overlay multicast protocols have been designed and deployed across the Internet to support content distribution. To our knowledge, however, none have provided a rigorous analysis of the problem or the effectiveness of their proposed solutions. W
Publikováno v:
Mathematics Magazine. 85:44
We introduce a generalization of Euler's totient function that, when applied to an integer n ≥ 2, can be written as a polynomial in the prime factors of n. We then show how cyclotomic and complete ...