N-way fail-over infrastructure for reliable servers and routers

Amir, Yair; Caudy, R.; Munjal, Amit; Schlossnagle, Theo; Tutu, Ciprian

doi:10.1109/dsn.2003.1209951

Cited by 7 publications

(5 citation statements)

References 11 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…Otro algoritmo en funcionamiento en sistemas en producción que podría resolver el problema de asignación de slots es el utilizado por Wackamole [1]. Este algoritmo es completamente distribuido y se utiliza para la asignación dinámica de un conjunto de direcciones IP entre los miembros de un grupo de servidores ante la detección de fallos o la incorporación de nuevos miembros.…”

Section: Antecedentes Y Trabajos Relacionadosunclassified

“…Algunos ejemplos de problemas de este tipo se presentan en la asignación de ranuras de tiempo/frecuencia en un enlace compartido, en la asignación de canales de un medio de comunicación, en la asignación de un conjunto de bloques de disco en un sistema de archivos distribuidos, en asignación de rangos de puertos de protocolos TCP/UDP de un servidor distribuido, o en la asignación del rango de direcciones IP entre servidores [1]. Los algoritmos que resuelven estos problemas deben satisfacer la propiedad de exclusión mutua y evitar la inanición de los procesos por falta de asignación de recursos.…”

Section: Introduccionunclassified

See 1 more Smart Citation

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

Section: Introduccionunclassified

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

“…Several techniques for load balancing appear in the domain of networking (e.g., [2,3,10]). In these solutions, packets or network flows are assigned to a pool of resources to avoid overloading any particular resource, increasing the reliability and throughput.…”

Section: Related Workmentioning

confidence: 99%

Receipt-mode trust negotiation

Adams

Lee

Mossé

2011

Proceedings of the 6th ACM Symposium on Information, Computer and Communications Security

View full text Add to dashboard Cite

In trust negotiation approaches to authorization, previously unacquainted entities establish trust in one another gradually via the bilateral and iterative exchange of policies and digital credentials. Although this affords resource providers with an expressive means of access control for open systems, the trust negotiation process incurs non-trivial computational and communications costs. In this paper, we propose Receipt-Mode Trust Negotiation (RMTN) as a means of mitigating the performance penalties on servers that use trust negotiation. RMTN provides a means of off-loading the majority of the trust negotiation process to delegated receipt-generating helper servers. RMTN ensures that helpers produce correct trust negotiation protocol receipts, and that the helpers are incapable of impersonating the resource server outside of the RMTN protocol. We describe an initial implementation of our RMTN protocol on a Linux testbed, discuss the security of this protocol, and present experimental results indicating that the receipt-mode protocol does indeed enhance the performance of resource servers that rely on trust negotiation approaches to authorization.

show abstract

“…Replication of COTS components has become a widespread way for addressing these requirements [1][2][3][4][5]. By placing replicas of the same object on different nodes and by using suitable replication algorithms, significant improvements in availability and reliability can be achieved.…”

Section: Introductionmentioning

confidence: 99%

On-line self-checking of replication consistency for autonomic computing

Bartoli

Masarin

2006

Cluster Comput

View full text Add to dashboard Cite

In this paper we are concerned with the live verification of the consistency of a replicated system, an issue that has not been addressed by the research community so far. We consider the problem of how to enable the system to detect automatically and in production whether the invariants defining the correctness of object replication are violated. This feature could greatly improve the dependability of distributed applications and is necessary for constructing self-managing and self-healing replicated systems. We focus on systems that enforce strongly consistent replication: all replicas of each object must be kept "continuously" in-sync. This replication strategy is appropriate for application domains where correctness guarantees in spite of failures are more important than performance and scalability. We present the design and implementation of a replicated web service capable of self-checking whether all replicas are indeed kept in sync. This check occurs on-line, transparently to clients. We also discuss the performance cost of self-checking in our prototype.

show abstract

N-way fail-over infrastructure for reliable servers and routers

Cited by 7 publications

References 11 publications

A Fault-Tolerant Algorithm For Distributed Resource Allocation

A Fault-Tolerant Algorithm For Distributed Resource Allocation

Receipt-mode trust negotiation

On-line self-checking of replication consistency for autonomic computing

Contact Info

Product

Resources

About