Summary
Sylvia Ratnasamy (born c. 1976) is a Belgian–Indian computer scientist. She is best known as one of the inventors of the distributed hash table (DHT). Her doctoral dissertation proposed the content-addressable networks, one of the original DHTs, and she received the ACM Grace Murray Hopper Award in 2014 for this work.[1] She is currently a professor at the University of California, Berkeley.
Sylvia Ratnasamy | |
|---|---|
| Nationality | Belgian |
| Alma mater | UC Berkeley, University of Pune |
| Known for | Distributed hash tables, software routing |
| Awards | Grace Murray Hopper Award Sloan Fellowship |
| Scientific career | |
| Fields | Computer Science |
| Institutions | UC Berkeley, Intel Labs, International Computer Science Institute, Nefeli Networks |
| Thesis | A Scalable Content-Addressable Network (2002) |
| Doctoral advisor | |
Life and career edit
Ratnasamy received her Bachelor of Engineering from the University of Pune in 1997.[2] She began doctoral work at UC Berkeley advised by Scott Shenker[3] during which time she worked at the International Computer Science Institute[2] in Berkeley, CA. She graduated from UC Berkeley with her doctoral degree in 2002.[3]
For her doctoral thesis, she designed and implemented what would eventually become known as one of the four original Distributed Hash Tables, the Content addressable network (CAN).[4][5]
Ratnasamy was a lead researcher at Intel Labs until 2011, when she began as an assistant professor at UC Berkeley.[6] In recent years, Ratnasamy has focused her research on programmable networks including the RouteBricks software router and pioneering work in Network Functions Virtualization (NFV).[7] In 2016, she co-founded Nefeli Networks to commercialize NFV technologies.[8]
Personal edit
Her father is noted chemist Paul Ratnasamy.[citation needed]
Awards edit
- Grace Murray Hopper Award[1]
- Sloan Fellowship
- ACM SIGCOMM Test-of-Time Award (2011)[9]
- ACM SIGCOMM Rising Star Award (2017)[10]
References edit
- ^ a b "ACM Grace Murray Hopper Award". ACM. 2014. Retrieved 2019-11-26.
- ^ a b "New Faculty - EECS at UC Berkeley". eecs.berkeley.edu. Retrieved 10 April 2018.
- ^ a b Sylvia Ratnasamy. "A Scalable Content Addressable Network" (PDF). eecs.berkeley.edu. Retrieved 10 April 2018.
- ^ Ratnasamy; et al. (2001). "A Scalable Content-Addressable Network" (PDF). In Proceedings of ACM SIGCOMM 2001. Retrieved 2013-05-20.
{{cite journal}}: Cite journal requires|journal=(help) - ^ Hwang, Kai; Fox, Geoffrey C.; Dongarra, Jack (October 31, 2011). "Section 8.6: Bibliographic Notes and Homework Problems" (PDF). Distributed and Cloud Computing: From Parallel Processing to the Internet of Things, 1st Edition. Morgan Kaufmann. Retrieved 2019-12-03.
CAN was proposed by Ratnasamy, et al.
- ^ "People". span.cs.berkeley.edu. Retrieved 10 April 2018.
- ^ Scales, Ian (2019-04-05). "NFV needs to lose a few pounds of complexity: introducing 'Lean NFV'". Telecom TV. Retrieved 2019-11-29.
- ^ Wagner, Mitch (2019-05-30). "Startup Cuts Network Clutter With 'Lean NFV'". Light Reading. Retrieved 2019-11-29.
- ^ "ACM SIGCOMM Test of Time Paper Award". ACM SIGCOMM. Retrieved 2019-12-04.
- ^ "SIGCOMM Rising Star Award Winners". ACM SIGCOMM. Retrieved 2019-12-03.