A low latency, loss tolerant architecture and protocol for wide area group communication

Amir, Yair; Danilov, Claudiu; Stanton, Jonathan

doi:10.1109/icdsn.2000.857557

Cited by 92 publications

(66 citation statements)

References 18 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…El Spread Toolkit [19] es además una herramienta adecuada que puede utilizarse en múltiples aplicaciones distribuidas que requieren alta disponibilidad, alto desempeño, escalabilidad y comunicaciones confiables entre los miembros de un grupo [23]. Spread soporta el modelo de membresía de Sincronía Virtual Extendida (EVS) [24].…”

Section: Antecedentes Y Trabajos Relacionadosunclassified

A Fault-Tolerant Algorithm For Distributed Resource Allocation

Pessolani

Jara

Gonnet

et al. 2017

IEEE Latin Am. Trans.

View full text Add to dashboard Cite

Abstract-Resource allocation is a usual problem that must be faced during a distributed system design. Despite the large number of algorithms proposed in literature to solve this problem, most papers lack of detailed descriptions about how to turn these algorithms into real-world reliable protocols. This article presents a fault-tolerant algorithm for distributed resource allocation named SLOTS which is implemented as an executable protocol. It allocates resources among members in a fairly manner using simple heuristics and employing a donation approach. SLOTS supports the dynamic behavior of clusters and provides high availability services. It bases its fault-tolerance properties and membership changes in atomic sets of operations (like transactions) using services provided by an underlying Group Communication System.

show abstract

Section: Antecedentes Y Trabajos Relacionadosunclassified

A Fault-Tolerant Algorithm For Distributed Resource Allocation

Pessolani

Jara

Gonnet

et al. 2017

IEEE Latin Am. Trans.

View full text Add to dashboard Cite

show abstract

“…active replication, load-sharing, etc. based on mechanisms implemented in a generic platform, e.g., [1], [14].…”

Section: A Failure Sources In the Vepcmentioning

confidence: 99%

Service Availability in the NFV Virtualized Evolved Packet Core

Gonzalez

Grønsund

Mahmood

et al. 2014

2015 IEEE Global Communications Conference (GLOBECOM)

View full text Add to dashboard Cite

Abstract-Network Function Virtualization (NFV) promises to transform the way telecom providers design and operate networks and network services. Virtualized Evolved Packet Core vEPC is one of the Network Function Virtualization NFV use cases that has got most of attention, where dependability is a major concern. In the traditional EPC, functions are deployed in proprietary network elements with proven characteristics, e.g., a defined availability, and corresponding guarantees. Hence, network operators have a firm basis for the design of a robust mobile core network. On the other hand, in the vEPC, network operators face a more challenging environment, where functions, subsystems and requirements are interrelated in a more complex manner. Hence, the assessment of the robustness of the network, and the design to meet dependability requirements becomes hard. In order to address this challenge, we provide initial guidelines and modeling tools to assess system availability in vEPC scenarios, and identify the most relevant factors to be considered in this process.

show abstract

“…Notable examples of group communication toolkits are Spread [3], Totem [4], JGroups [30], Isis [12], Isis 2 [11], Transis [31], QuickSilver [59], and Horus [75].…”

Section: Group Communicationmentioning

confidence: 99%

High availability, elasticity, and strong consistency for massively parallel scans over relational data

Unterbrunner¹,

Alonso

Kossmann

2013

The VLDB Journal

View full text Add to dashboard Cite

An elastic and highly available data store is a key component of many cloud applications. Existing data stores with strong consistency guarantees are designed and optimized for small updates, key-value access, and (if supported) small range queries over a predefined key column. This raises performance and availability problems for applications which inherently require large updates, non-key access, and large range queries. This paper presents a solution to these problems: Crescando/RB; a distributed, scan-based, main memory, relational data store (single table) with robust performance and high availability. The system addresses a real, large-scale industry use case: the Amadeus travel management system. This paper focuses on the distribution layer of Crescando/RB, the problem and theory behind it, the rationale underlying key design decisions, and the novel multicast protocol and replication framework it is composed of. Highlighting the key features of the distribution layer, we present experimental results showing that even under permanent node failures and large-scale data repartitioning, Crescando/RB remains fully available and capable of sustaining a heavy query and update load.

show abstract

A low latency, loss tolerant architecture and protocol for wide area group communication

Abstract: Abstract

Cited by 92 publications

References 18 publications

A Fault-Tolerant Algorithm For Distributed Resource Allocation

A Fault-Tolerant Algorithm For Distributed Resource Allocation

Service Availability in the NFV Virtualized Evolved Packet Core

High availability, elasticity, and strong consistency for massively parallel scans over relational data

Contact Info

Product

Resources

About