Folgen
Sylvia Ratnasamy
Sylvia Ratnasamy
Professor of Computer Science, UC Berkeley
Bestätigte E-Mail-Adresse bei berkeley.edu - Startseite
Titel
Zitiert von
Zitiert von
Jahr
A scalable content-addressable network
S Ratnasamy, P Francis, M Handley, R Karp, S Shenker
Proceedings of the 2001 conference on Applications, technologies …, 2001
110072001
A scalable content-addressable network
S Ratnasamy, P Francis, M Handley, R Karp, S Shenker
Proceedings of the 2001 conference on Applications, technologies …, 2001
109912001
Making gnutella-like p2p systems scalable
Y Chawathe, S Ratnasamy, L Breslau, N Lanham, S Shenker
Proceedings of the 2003 conference on Applications, technologies …, 2003
16392003
GHT: a geographic hash table for data-centric storage
S Ratnasamy, B Karp, L Yin, F Yu, D Estrin, R Govindan, S Shenker
Proceedings of the 1st ACM international workshop on Wireless sensor …, 2002
12282002
Topologically-aware overlay construction and server selection
S Ratnasamy, M Handley, R Karp, S Shenker
Proceedings. Twenty-First Annual Joint Conference of the IEEE Computer and …, 2002
12232002
Making middleboxes someone else's problem: Network processing as a cloud service
J Sherry, S Hasan, C Scott, A Krishnamurthy, S Ratnasamy, V Sekar
ACM SIGCOMM Computer Communication Review 42 (4), 13-24, 2012
12002012
Geographic routing without location information
A Rao, S Ratnasamy, C Papadimitriou, S Shenker, I Stoica
Proceedings of the 9th annual international conference on Mobile computing …, 2003
10952003
Application-level multicast using content-addressable networks
S Ratnasamy, M Handley, R Karp, S Shenker
International Workshop on Networked Group Communication, 14-29, 2001
9532001
Reducing Network Energy Consumption via Sleeping and Rate-Adaptation.
S Nedevschi, L Popa, G Iannaccone, S Ratnasamy, D Wetherall
NsDI 8, 323-336, 2008
9492008
Reducing Network Energy Consumption via Sleeping and Rate-Adaptation.
S Nedevschi, L Popa, G Iannaccone, S Ratnasamy, D Wetherall
NsDI 8, 323-336, 2008
9492008
The impact of DHT routing geometry on resilience and proximity
K Gummadi, R Gummadi, S Gribble, S Ratnasamy, S Shenker, I Stoica
Proceedings of the 2003 conference on Applications, technologies …, 2003
8432003
RouteBricks: Exploiting parallelism to scale software routers
M Dobrescu, N Egi, K Argyraki, BG Chun, K Fall, G Iannaccone, A Knies, ...
Proceedings of the ACM SIGOPS 22nd symposium on Operating systems principles …, 2009
8282009
Data-centric storage in sensornets with GHT, a geographic hash table
S Ratnasamy, B Karp, S Shenker, D Estrin, R Govindan, L Yin, F Yu
Mobile networks and applications 8, 427-442, 2003
7902003
Design and implementation of a consolidated middlebox architecture
V Sekar, N Egi, S Ratnasamy, MK Reiter, G Shi
9th USENIX Symposium on Networked Systems Design and Implementation (NSDI 12 …, 2012
7412012
OpenDHT: a public DHT service and its uses
S Rhea, B Godfrey, B Karp, J Kubiatowicz, S Ratnasamy, S Shenker, ...
Proceedings of the 2005 conference on Applications, technologies …, 2005
7052005
FairCloud: Sharing the network in cloud computing
L Popa, G Kumar, M Chowdhury, A Krishnamurthy, S Ratnasamy, I Stoica
Proceedings of the ACM SIGCOMM 2012 conference on Applications, technologies …, 2012
6032012
Making sense of performance in data analytics frameworks
K Ousterhout, R Rasti, S Ratnasamy, S Shenker, BG Chun
12th USENIX Symposium on Networked Systems Design and Implementation (NSDI …, 2015
5312015
Routing algorithms for DHTs: Some open questions
S Ratnasamy, I Stoica, S Shenker
Peer-to-Peer Systems: First InternationalWorkshop, IPTPS 2002 Cambridge, MA …, 2002
5312002
Data-centric storage in sensornets
S Shenker, S Ratnasamy, B Karp, R Govindan, D Estrin
ACM SIGCOMM computer communication review 33 (1), 137-142, 2003
4892003
Beacon vector routing: Scalable point-to-point routing in wireless sensornets
R Fonseca, S Ratnasamy, J Zhao, CT Ee, D Culler, S Shenker, I Stoica
Proceedings of the 2nd Conference on Symposium on Networked Systems Design …, 2005
4862005
Das System kann den Vorgang jetzt nicht ausführen. Versuchen Sie es später erneut.
Artikel 1–20