yair amir | University of Haifa (original) (raw)

Papers by yair amir

Research paper thumbnail of A highly available application in the transis environment

Lecture Notes in Computer Science

Research paper thumbnail of Reliable communication in overlay networks

2003 International Conference on Dependable Systems and Networks, 2003. Proceedings.

Research paper thumbnail of Robust and Efficient Replication Using Group Communication

Research paper thumbnail of Membership Algorithms in Broadcast Domains

Abstract This paper describes a membership protocol that maintains a consistent membership view w... more Abstract This paper describes a membership protocol that maintains a consistent membership view within a set of connected machines. The protocol operates within an asynchronous environment with arbitrary crash faults. It is well known that solving the ...

Research paper thumbnail of Scaling Byzantine Fault-Tolerant Replication toWide Area Networks

International Conference on Dependable Systems and Networks (DSN'06)

Research paper thumbnail of Secure group communication in asynchronous networks with failures: integration and experiments

Proceedings 20th IEEE International Conference on Distributed Computing Systems, 2000

Research paper thumbnail of Scaling secure group communication systems: beyond peer-to-peer

Proceedings DARPA Information Survivability Conference and Exposition

Research paper thumbnail of Transis: a communication subsystem for high availability

[1992] Digest of Papers. FTCS-22: The Twenty-Second International Symposium on Fault-Tolerant Computing

Research paper thumbnail of Membership algorithms for multicast communication groups

Lecture Notes in Computer Science, 1992

Research paper thumbnail of 1-800-OVERLAYS

Proceedings of the international workshop on Network and operating systems support for digital audio and video, 2005

Research paper thumbnail of Customizable Fault Tolerance forWide-Area Replication

2007 26th IEEE International Symposium on Reliable Distributed Systems (SRDS 2007), 2007

Research paper thumbnail of in Asynchronous Networks with Failures: Integration and Experiments

Increasing popularity and diversity of collaborative applications prompts the need for highly sec... more Increasing popularity and diversity of collaborative applications prompts the need for highly secure and reliable communication platforms for dynamic peer groups. Security mechanisms for such groups tend to be both expensive and complex and their integration with reliable group communication services presents a formidable challenge. This paper discusses some important integration issues, reports on the implementation experience and provides experimental

Research paper thumbnail of An Opportunity Cost Approach for Job Assignment and Reassignment in a Scalable

Research paper thumbnail of An Opportunity Cost Approach for Job Assignment and Reassignment in a Scalable Computing Cluster

Parallel and Distributed Computing Systems, 2000

A new method is presented for job assignment to and reassignment between machines in a computing ... more A new method is presented for job assignment to and reassignment between machines in a computing cluster. Our method is based on a theoretical framework that has been experimentally tested and shown to b e useful in practice. This "opportunity cost" method converts the usage of several heterogeneous resources in a machine to a single homogeneous "cost." Assignment and reassignment

Research paper thumbnail of Seamlessly selecting the best copy from internet-wide replicated web servers

Lecture Notes in Computer Science, 1998

Research paper thumbnail of Fast handoff for seamless wireless mesh networks

Proceedings of the 4th international conference on Mobile systems, applications and services - MobiSys 2006, 2006

Research paper thumbnail of Exploring robustness in group key agreement

Proceedings 21st International Conference on Distributed Computing Systems

Research paper thumbnail of Practical Wide-Area Database Replication1

This paper explores the architecture, implementation and performance of a wide and local area dat... more This paper explores the architecture, implementation and performance of a wide and local area database replication system. The architecture provides peer replication, supporting diverse application semantics, based on a group communication paradigm. Network partitions and merges, computer crashes and recoveries, and message omissions are all handled. Using a generic replication engine and the Spread group communication toolkit, we provide replication

Research paper thumbnail of On the Path from Total Order to Database Replication

The date of receipt and acceptance will be inserted by the editor Summary. We introduce ZBCast, a... more The date of receipt and acceptance will be inserted by the editor Summary. We introduce ZBCast, a primitive that provides Persistent Global Total Order for messages delivered to a group of participants that can crash and subsequently recover and that can become temporarily partitioned and then remerge due to network conditions. The paper presents in detail and proves the correctness of an efficient algorithm that implements ZB - Cast on top of existing group communication infrastructure. The algorithm minimizes the amount of required forced disk writes and avoids the need for application level (end-to-en d) acknowledgments per message. We also present an extension of the algorithm that allows dynamic addition or removal of participants. We indicate how ZBCast can be employed to build a generic data replication engine that can be used to provide consistent synchronous database replication. We provide experimental results that indicate the efficiency of the approach.

Research paper thumbnail of Efficient state transfer in partitionable environments

Institute of Computer …, 1997

Object replication is one of the most useful techniques in distributed computing because it facil... more Object replication is one of the most useful techniques in distributed computing because it facilitates fault-tolerance and increases the availability of distributed services. Consistent replication is the focus of traditional distributed database applications as well ...

Research paper thumbnail of A highly available application in the transis environment

Lecture Notes in Computer Science

Research paper thumbnail of Reliable communication in overlay networks

2003 International Conference on Dependable Systems and Networks, 2003. Proceedings.

Research paper thumbnail of Robust and Efficient Replication Using Group Communication

Research paper thumbnail of Membership Algorithms in Broadcast Domains

Abstract This paper describes a membership protocol that maintains a consistent membership view w... more Abstract This paper describes a membership protocol that maintains a consistent membership view within a set of connected machines. The protocol operates within an asynchronous environment with arbitrary crash faults. It is well known that solving the ...

Research paper thumbnail of Scaling Byzantine Fault-Tolerant Replication toWide Area Networks

International Conference on Dependable Systems and Networks (DSN'06)

Research paper thumbnail of Secure group communication in asynchronous networks with failures: integration and experiments

Proceedings 20th IEEE International Conference on Distributed Computing Systems, 2000

Research paper thumbnail of Scaling secure group communication systems: beyond peer-to-peer

Proceedings DARPA Information Survivability Conference and Exposition

Research paper thumbnail of Transis: a communication subsystem for high availability

[1992] Digest of Papers. FTCS-22: The Twenty-Second International Symposium on Fault-Tolerant Computing

Research paper thumbnail of Membership algorithms for multicast communication groups

Lecture Notes in Computer Science, 1992

Research paper thumbnail of 1-800-OVERLAYS

Proceedings of the international workshop on Network and operating systems support for digital audio and video, 2005

Research paper thumbnail of Customizable Fault Tolerance forWide-Area Replication

2007 26th IEEE International Symposium on Reliable Distributed Systems (SRDS 2007), 2007

Research paper thumbnail of in Asynchronous Networks with Failures: Integration and Experiments

Increasing popularity and diversity of collaborative applications prompts the need for highly sec... more Increasing popularity and diversity of collaborative applications prompts the need for highly secure and reliable communication platforms for dynamic peer groups. Security mechanisms for such groups tend to be both expensive and complex and their integration with reliable group communication services presents a formidable challenge. This paper discusses some important integration issues, reports on the implementation experience and provides experimental

Research paper thumbnail of An Opportunity Cost Approach for Job Assignment and Reassignment in a Scalable

Research paper thumbnail of An Opportunity Cost Approach for Job Assignment and Reassignment in a Scalable Computing Cluster

Parallel and Distributed Computing Systems, 2000

A new method is presented for job assignment to and reassignment between machines in a computing ... more A new method is presented for job assignment to and reassignment between machines in a computing cluster. Our method is based on a theoretical framework that has been experimentally tested and shown to b e useful in practice. This "opportunity cost" method converts the usage of several heterogeneous resources in a machine to a single homogeneous "cost." Assignment and reassignment

Research paper thumbnail of Seamlessly selecting the best copy from internet-wide replicated web servers

Lecture Notes in Computer Science, 1998

Research paper thumbnail of Fast handoff for seamless wireless mesh networks

Proceedings of the 4th international conference on Mobile systems, applications and services - MobiSys 2006, 2006

Research paper thumbnail of Exploring robustness in group key agreement

Proceedings 21st International Conference on Distributed Computing Systems

Research paper thumbnail of Practical Wide-Area Database Replication1

This paper explores the architecture, implementation and performance of a wide and local area dat... more This paper explores the architecture, implementation and performance of a wide and local area database replication system. The architecture provides peer replication, supporting diverse application semantics, based on a group communication paradigm. Network partitions and merges, computer crashes and recoveries, and message omissions are all handled. Using a generic replication engine and the Spread group communication toolkit, we provide replication

Research paper thumbnail of On the Path from Total Order to Database Replication

The date of receipt and acceptance will be inserted by the editor Summary. We introduce ZBCast, a... more The date of receipt and acceptance will be inserted by the editor Summary. We introduce ZBCast, a primitive that provides Persistent Global Total Order for messages delivered to a group of participants that can crash and subsequently recover and that can become temporarily partitioned and then remerge due to network conditions. The paper presents in detail and proves the correctness of an efficient algorithm that implements ZB - Cast on top of existing group communication infrastructure. The algorithm minimizes the amount of required forced disk writes and avoids the need for application level (end-to-en d) acknowledgments per message. We also present an extension of the algorithm that allows dynamic addition or removal of participants. We indicate how ZBCast can be employed to build a generic data replication engine that can be used to provide consistent synchronous database replication. We provide experimental results that indicate the efficiency of the approach.

Research paper thumbnail of Efficient state transfer in partitionable environments

Institute of Computer …, 1997

Object replication is one of the most useful techniques in distributed computing because it facil... more Object replication is one of the most useful techniques in distributed computing because it facilitates fault-tolerance and increases the availability of distributed services. Consistent replication is the focus of traditional distributed database applications as well ...