Today's large scale distributed systems are characterized by strong dynamics caused by the inherent unreliability of their constituting elements (e.g. process and link failures, processes joining or leaving the system). This continuous dynamism has a strong negative impact on distributed algorithms designed to work on such systems. Regular registers [1], Replication [2], in-network aggregation[3], are all examples of such problem. © 2012 Springer-Verlag.
Virtual tree: A robust overlay network for ensuring interval valid queries in dynamic distributed systems / Baldoni, Roberto; Bonomi, Silvia; Cerocchi, Adriano; Querzoni, Leonardo. - 7129 LNCS:(2012), pp. 197-200. (Intervento presentato al convegno 13th International Conference on Distributed Computing and Networking, ICDCN 2012 tenutosi a Hong Kong nel 3 January 2012 through 6 January 2012) [10.1007/978-3-642-25959-3_14].
Virtual tree: A robust overlay network for ensuring interval valid queries in dynamic distributed systems
BALDONI, Roberto;BONOMI, Silvia;CEROCCHI, ADRIANO;QUERZONI, Leonardo
2012
Abstract
Today's large scale distributed systems are characterized by strong dynamics caused by the inherent unreliability of their constituting elements (e.g. process and link failures, processes joining or leaving the system). This continuous dynamism has a strong negative impact on distributed algorithms designed to work on such systems. Regular registers [1], Replication [2], in-network aggregation[3], are all examples of such problem. © 2012 Springer-Verlag.I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
