Sylvia Ratnasamy

From Wikipedia, the free encyclopedia
Jump to navigation Jump to search
Sylvia Ratnasamy
Alma materUC Berkeley, University of Pune
Known forDistributed hash tables, software routing
AwardsGrace Murray Hopper Award Sloan Fellowship
Scientific career
FieldsComputer Science
InstitutionsUC Berkeley, Intel Labs, International Computer Science Institute, Nefeli Networks
ThesisA Scalable Content-Addressable Network (2002)
Doctoral advisor

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.

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]


Her father is noted chemist Paul Ratnasamy.[citation needed]



  1. ^ a b "ACM Grace Murray Hopper Award". ACM. 2014. Retrieved 2019-11-26.{{cite web}}: CS1 maint: url-status (link)
  2. ^ a b "New Faculty - EECS at UC Berkeley". Retrieved 10 April 2018.{{cite web}}: CS1 maint: url-status (link)
  3. ^ a b Sylvia Ratnasamy. "A Scalable Content Addressable Network" (PDF). Retrieved 10 April 2018.{{cite web}}: CS1 maint: url-status (link)
  4. ^ 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)
  5. ^ 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.{{cite web}}: CS1 maint: url-status (link)
  6. ^ "People". Retrieved 10 April 2018.{{cite web}}: CS1 maint: url-status (link)
  7. ^ Scales, Ian (2019-04-05). "NFV needs to lose a few pounds of complexity: introducing 'Lean NFV'". Telecom TV. Retrieved 2019-11-29.
  8. ^ Wagner, Mitch (2019-05-30). "Startup Cuts Network Clutter With 'Lean NFV'". Light Reading. Retrieved 2019-11-29.
  9. ^ "ACM SIGCOMM Test of Time Paper Award". ACM SIGCOMM. Retrieved 2019-12-04.{{cite web}}: CS1 maint: url-status (link)
  10. ^ "SIGCOMM Rising Star Award Winners". ACM SIGCOMM. Retrieved 2019-12-03.{{cite web}}: CS1 maint: url-status (link)