TY - GEN
T1 - Moara
T2 - ACM/IFIP/USENIX 9th International Middleware Conference, Middleware 2008
AU - Ko, Steven Y.
AU - Yalagandula, Praveen
AU - Gupta, Indranil
AU - Talwar, Vanish
AU - Milojicic, Dejan
AU - Iyer, Subu
PY - 2008
Y1 - 2008
N2 - Users and administrators of large-scale infrastructures (e.g., datacenters and PlanetLab) are frequently in need of monitoring groups of machines in the infrastructure. Though there exist several distributed querying systems for this monitoring purpose, they are not group-based; they mostly focus on querying the entire system. In this paper, we present Moara, a new querying system that makes two novel contributions. First, Moara builds aggregation trees for different groups and adaptively maintains the trees to optimize the total message cost. Second, Moara supports a query language allowing groups to be specified implicitly via predicates consisting of arbitrarily nested unions and intersections. Our evaluations on Emulab, on PlanetLab, and with large-scale simulations, demonstrate Moara's ability to answer complex queries within a fraction of a second, to deal with high levels of dynamism in groups, and to incur a low bandwidth overhead per host per query in comparison to existing centralized and distributed aggregation systems.
AB - Users and administrators of large-scale infrastructures (e.g., datacenters and PlanetLab) are frequently in need of monitoring groups of machines in the infrastructure. Though there exist several distributed querying systems for this monitoring purpose, they are not group-based; they mostly focus on querying the entire system. In this paper, we present Moara, a new querying system that makes two novel contributions. First, Moara builds aggregation trees for different groups and adaptively maintains the trees to optimize the total message cost. Second, Moara supports a query language allowing groups to be specified implicitly via predicates consisting of arbitrarily nested unions and intersections. Our evaluations on Emulab, on PlanetLab, and with large-scale simulations, demonstrate Moara's ability to answer complex queries within a fraction of a second, to deal with high levels of dynamism in groups, and to incur a low bandwidth overhead per host per query in comparison to existing centralized and distributed aggregation systems.
UR - http://www.scopus.com/inward/record.url?scp=58049115892&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=58049115892&partnerID=8YFLogxK
U2 - 10.1007/978-3-540-89856-6_21
DO - 10.1007/978-3-540-89856-6_21
M3 - Conference contribution
AN - SCOPUS:58049115892
SN - 3540898557
SN - 9783540898559
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 408
EP - 428
BT - Middleware 2008 - ACM/IFIP/USENIX 9th International Middleware Conference, Proceedings
Y2 - 1 December 2008 through 5 December 2008
ER -