{"id":3983,"date":"2013-01-08T16:26:37","date_gmt":"2013-01-08T21:26:37","guid":{"rendered":"https:\/\/www.bu.edu\/cs\/?page_id=3983"},"modified":"2024-08-07T12:02:04","modified_gmt":"2024-08-07T16:02:04","slug":"people","status":"publish","type":"page","link":"https:\/\/www.bu.edu\/cs\/research-groups\/networks\/nrg\/people\/","title":{"rendered":"NRG People"},"content":{"rendered":"
\n

Faculty<\/h2>\n<\/div>\n
\n\n\n\n\n\n\n
\n


\n\"Azer<\/a>
\nAzer Bestavros<\/a><\/p>\n<\/td>\n

 <\/p>\n

Azer joined CS @ BU in 1991 after completing his Ph.D. at Harvard University. He performed research at the nexus of networking and distributed systems, focusing on issues of efficiency, scalability, safety, and security, as they apply to applications ranging from content distribution networks and peer-to-peer systems to cyber-physical and real-time embedded systems. His projects have focused on mechanism design for resource management in cloud computing markets; on efficient algorithms for content placement in information, navigation, and social networks; and on languages and tools for the design of certifiably safe and secure systems and software-defined networks.<\/p>\n<\/td>\n<\/tr>\n

\n


\n\"John<\/a>
\nJohn Byers<\/a><\/p>\n<\/td>\n

 <\/p>\n

John joined the BU Department of Computer Science in 1999 after completing his Ph.D. at UC Berkeley. His research interests have broadly focused on algorithmic and economic aspects of e-commerce, networking, and large-scale data management, striking a balance between theoretical foundations and rigorous data-driven experimentation. In his spare time (and while on sabbatical in AY 2013-2014), he serves as Chief Scientist at Cogo Labs<\/a>.<\/p>\n<\/td>\n<\/tr>\n

\n


\n\"Mark<\/a>
\nMark Crovella<\/a><\/p>\n<\/td>\n

 <\/p>\n

Mark has worked in areas spanning systems, networking, large scale\u00a0data analysis,\u00a0data mining, and statistics. \u00a0 His work generally\u00a0sought to apply data analysis to solve networking and systems\u00a0problems such as network discovery and characterization, server design, efficient network measurement, and inference\u00a0of hidden network\u00a0properties.<\/p>\n<\/td>\n<\/tr>\n

\n


\n\"matta-headshot-promotion\"<\/a>
\nAbraham Matta<\/a><\/p>\n<\/td>\n

 <\/p>\n

Abraham completed his Ph.D. in computer science at the University of Maryland at College Park in 1995. He works on the design of network protocols and architectures based on a range of computer science principles (e.g., inter-process communication, decomposition, recursion), mathematical techniques (e.g., probabilistic analysis, queuing theory, optimization,\u00a0 control theory),\u00a0 and performance evaluation tools (e.g., simulation, emulation). Application domains include the Internet, wireless, mobile and sensor networks, disruption-tolerant networks, cloud and distributed systems.<\/p>\n<\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n<\/div>\n

\n

Current Students \/ Researchers<\/h2>\n