180 Park Ave - Building 103 - Room A119
Florham Park, NJ
Subject matter expert in distributed computing, computer security, and network traffic analysis.
Michael Merritt is Executive Director of the Network Design and Analysis Research Department, responsible for fundamental and applied research in efficient algorithms and their applications to communication networks. Michael has published over thirty-five research articles, co-authored a book on database concurrency control, holds four patents, and is an area editor for Distributed Computing. He is a recognized expert in distributed computing, computer security, and network traffic analysis. He was an area editor for many years for the Journal of the ACM, and has taught at Georgia Tech, MIT, Stevens Institute of Technology, and Columbia University.
Network-Friendly Peer-to-Peer Services
Michael Merritt, Doug Pasko, Popkin Laird
The AT&T Labs Fellowship Program - 35 Years of Mentoring Women and Underrepresented Minorities-An Update
Michael Merritt, Elizabeth Loia, Elaine . Laws
Tight bounds for shared memory systems accessed by Byzantine processes
Michael Merritt, Omer Reingold, Rebecca Wright, Gadi Taubenfeld
Appraising two decades of distributed computing theory research
Michael Merritt, Michael Fischer
Objects shared by Byzantine processes
Michael Merritt, Dahlia Malkhi, Michael Reiter, Gadi Taubenfeld
Computing with infinitely many processes
Michael Merritt, Gadi Taubenfeld
Interdomain Network Aware Peer-to-Peer Protocol,
July 10, 2012
A method includes receiving network distance information, receiving a request from a client for an identity of a peer providing content, and identifying a first peer and a second peer providing the content. The network distance information includes a compilation of network distance information provided by a plurality of service providers. The method further includes determining that a network distance between the first peer and the client is less than a network distance between the second peer and the client based on the network distance information, and providing the identity of the first peer to the client.