%0 Conference Proceedings
%T DynaSoRe: Efficient In-Memory Store for Social Applications
%+ Yahoo! Research [Barcelona]
%+ As Scalable As Possible: foundations of large scale dynamic distributed systems (ASAP)
%+ Microsoft Research [Cambridge] (Microsoft)
%+ Heterogeneous and Adaptive distributed DAta management Systems (HADAS)
%A Bai, Xiao
%A Jégou, Arnaud
%A Junqueira, Flavio, P.
%A Leroy, Vincent
%Z Part 5: Social Networks
%< avec comité de lecture
%( Lecture Notes in Computer Science
%B 14th International Middleware Conference (Middleware)
%C Beijing, China
%Y David Hutchison
%Y Takeo Kanade
%Y Jon M. Kleinberg
%Y Friedemann Mattern
%Y John C. Mitchell
%Y Moni Naor
%Y Oscar Nierstrasz
%Y C. Pandu Rangan
%Y Bernhard Steffen
%Y Madhu Sudan
%Y Demetri Terzopoulos
%Y Doug Tygar
%Y Moshe Y. Vardi
%Y Gerhard Weikum
%Y David Eyers
%Y Karsten Schwan
%Y Josef Kittler
%I Springer
%3 Middleware 2013
%V LNCS-8275
%P 425-444
%8 2013-12-09
%D 2013
%R 10.1007/978-3-642-45065-5_22
%Z Computer Science [cs]/Social and Information Networks [cs.SI]
%Z Computer Science [cs]/Databases [cs.DB]Conference papers
%X Social network applications are inherently interactive, creating a requirement for processing user requests fast. To enable fast responses to user requests, social network applications typically rely on large banks of cache servers to hold and serve most of their content from the cache. In this work, we present DynaSoRe: a memory cache system for social network applications that optimizes data locality while placing user views across the system. DynaSoRe storage servers monitor access traffic and bring data frequently accessed together closer in the system to reduce the processing load across cache servers and network devices. Our simulation results considering realistic data center topologies show that DynaSoRe is able to adapt to traffic changes, increase data locality, and balance the load across the system. The traffic handled by the top tier of the network connecting servers drops by 94% compared to a static assignment of views to cache servers while requiring only 30% additional memory capacity compared to the whole volume of cached data.
%G English
%Z TC 6
%Z WG 6.1
%2 https://hal.science/hal-00932468/document
%2 https://hal.science/hal-00932468/file/camera-ready.pdf
%L hal-00932468
%U https://hal.science/hal-00932468
%~ INSTITUT-TELECOM
%~ EC-PARIS
%~ UNIV-RENNES1
%~ UGA
%~ CNRS
%~ INRIA
%~ UNIV-GRENOBLE1
%~ UNIV-PMF_GRENOBLE
%~ UNIV-UBS
%~ INSA-RENNES
%~ INPG
%~ INRIA-RENNES
%~ IRISA
%~ LIG
%~ IRISA_SET
%~ INRIA_TEST
%~ LIG_TDCGE
%~ LIG_TDCGE_HADAS
%~ TESTALAIN1
%~ IFIP-LNCS
%~ IFIP
%~ IRISA-D1
%~ INRIA2
%~ IFIP-TC
%~ IFIP-WG
%~ IFIP-TC6
%~ IFIP-WG6-1
%~ UR1-HAL
%~ UR1-MATH-STIC
%~ UR1-UFR-ISTIC
%~ IFIP-LNCS-8275
%~ IFIP-MIDDLEWARE
%~ IFIP-2010
%~ TEST-UNIV-RENNES
%~ TEST-UR-CSS
%~ UNIV-RENNES
%~ INRIA-RENGRE
%~ INSTITUTS-TELECOM
%~ UR1-MATH-NUM
%~ LIG_SIDCH
%~ INRIA-ETATSUNIS
%~ INRIA-ROYAUMEUNI