Sylvia Ratnasamy Explained

Nationality:Belgian
Field:Computer Science
Work Institution:UC Berkeley, Intel Labs, International Computer Science Institute, Nefeli Networks
Alma Mater:UC Berkeley, University of Pune
Thesis Title:A Scalable Content-Addressable Network
Thesis Year:2002
Thesis Url:https://www.eecs.berkeley.edu/~sylvia/papers/thesis.pdf
Known For:Distributed hash tables, software routing
Prizes:Grace Murray Hopper Award Sloan Fellowship

Sylvia Ratnasamy (born 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

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.

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

Her father is noted chemist Paul Ratnasamy.

Awards

Notes and References

  1. Web site: ACM Grace Murray Hopper Award. 2014. ACM. 2019-11-26.
  2. Web site: New Faculty - EECS at UC Berkeley. eecs.berkeley.edu. 10 April 2018.
  3. Web site: A Scalable Content Addressable Network. Sylvia Ratnasamy. eecs.berkeley.edu. 10 April 2018.
  4. Ratnasamy. etal. 2001. A Scalable Content-Addressable Network. In Proceedings of ACM SIGCOMM 2001. 2013-05-20.
  5. Web site: Section 8.6: Bibliographic Notes and Homework Problems. Hwang. Kai. Fox. Geoffrey C.. October 31, 2011. Distributed and Cloud Computing: From Parallel Processing to the Internet of Things, 1st Edition. Morgan Kaufmann. 2019-12-03. CAN was proposed by Ratnasamy, et al.. Dongarra. Jack.
  6. Web site: People. span.cs.berkeley.edu. 10 April 2018.
  7. News: NFV needs to lose a few pounds of complexity: introducing 'Lean NFV'. Scales. Ian. 2019-04-05. Telecom TV. 2019-11-29.
  8. News: Startup Cuts Network Clutter With 'Lean NFV'. Wagner. Mitch. 2019-05-30. Light Reading. 2019-11-29.
  9. Web site: ACM SIGCOMM Test of Time Paper Award. ACM SIGCOMM. 2019-12-04.
  10. Web site: SIGCOMM Rising Star Award Winners. ACM SIGCOMM. 2019-12-03.