Now showing items 26-45 of 50

    • Low Cost Management of Replicated Data in Fault-Tolerant Distributed Systems 

      Birman, Kenneth P.; Joseph, Thomas A. (Cornell University, 1984-10)
      Many distributed systems replicate data for fault tolerance or availability. In such systems, a logical update on a data item results in a physical update on a number of copies. The synchronization and communication ...
    • Maintaining Consistency in Distributed Systems 

      Birman, Kenneth P. (Cornell University, 1991-11)
      How should distributed systems preserve consistency in the presence of concurrency and failures? For systems designed as assemblies of independently developed components, concurrent access to data or data structures would ...
    • The Next Generation Internet: Unsafe at Any Speed? 

      Birman, Kenneth P. (Cornell University, 1999-11)
      Will the Next Generation Internet provide an appropriate infrastructure for critical applications, such as are emerging in such settings as health care, electric power grid control, air traffic control, banking, and military ...
    • An Overview of the Isis Project 

      Birman, Kenneth P.; Abbadi, Amr El; Dietrich, Wally; Joseph, Thomas A.; Raeuchle, Thomas (Cornell University, 1984-10)
      The goal of the ISIS projest is to provide a high-level support for fault-tolerant distributed computing by automatically replicating data and code. The extent to which information is replicated and the physical location ...
    • Performance of the ISIS Distributed Computing Toolkit 

      Birman, Kenneth P.; Clark, Timothy (Cornell University, 1994-06)
      The ISIS Toolkit is a programming environment for building process-group structured distributed software. The system is widely used in settings requiring high reliability, strong distributed consistency guarantees, and ...
    • Preserving Privacy in a Network of Mobile Computers 

      Cooper, David A.; Birman, Kenneth P. (Cornell University, 1995-03)
      Even as wireless networks create the potential for access to information from mobile platforms, they pose a problem for privacy. In order to retrieve messages, users must periodically poll the network. The information that ...
    • Preserving Privacy in a Network of Mobile Computers 

      Cooper, David A.; Birman, Kenneth P. (Cornell University, 1994-10)
      Even as wireless networks create the potential for access to information from mobile platforms, they pose a problem for privacy. In order to retrieve messages, users must periodically poll the network. The information that ...
    • A Probabilistically Correct Leader Election Protocol for Large Groups 

      Gupta, Indranil; van Renesse, Robbert; Birman, Kenneth P. (Cornell University, 2000-04-17)
      This paper presents a scalable leader election protocol for large process groups with a weak membership requirement. The underlying network is assumed to be unreliable but characterized by probabilistic failure rates of ...
    • Process Membership in Asynchronous Environments 

      Ricciardi, Aleta M.; Birman, Kenneth P. (Cornell University, 1993-02)
      The development of reliable distributed software is simplified by the ability to assume a fail-stop failure model. We discuss the emulation of such a model in an asynchronous distributed environment. The solution we ...
    • Programming with Process Groups: Group and Multicast Semantics 

      Birman, Kenneth P.; Cooper, Robert; Gleeson, Barry (Cornell University, 1991-01-29)
      Process groups are a natural tool for distributed programming, and are increasingly important in distributed computing environments. However, there is little agreement on the most appropriate semantics for process group ...
    • Programming with Shared Bulletin Boards in Asynchronus Distributed Systems 

      Birman, Kenneth P.; Joseph, Thomas A.; Schmuck, Frank B.; Stephenson, Patrick (Cornell University, 1986-08)
      We consider loosely coupled distributed computing systems in which processes interact through shared resources, which are modeled as bulletin boards. The first part of the paper formalizes the notion of consistent behavior ...
    • Protocol Composition in Horus 

      Van Renesse, Robbert; Birman, Kenneth P. (Cornell University, 1995-03)
      Horus is a communication architecture that treats a protocol as an abstract data type. Protocol layers can be stacked on top of each other in a variety of ways, at run-time. This paper starts out with describing the many ...
    • Reliable Broadcast Protocols 

      oseph, Thomas A.; Birman, Kenneth P. (Cornell University, 1988-06)
      NO ABSTRACT AVAILABLE
    • Reliable Communication in the Presence of Failures 

      Birman, Kenneth P.; Joseph, Thomas A. (Cornell University, 1985-07)
      We report on the design and correctness of a communication facility for a distributed computer system. The facility provides support for fault tolerant process groups in the form of a family of reliable multicast protocols ...
    • Replication and Fault-Tolerance in the ISIS System 

      Birman, Kenneth P. (Cornell University, 1985-03)
      The ISIS system transforms abstract type specifications into fault-tolerant distributed implementations while insulating users from the mechanisms used to achieve fault-tolerance. This paper discusses techniques for ...
    • A Response to Cheriton and Skeen's Criticism of Causal and Totally Ordered Communication 

      Birman, Kenneth P. (Cornell University, 1993-10)
      No abstract supplied.
    • The Role of Order in Distributed Programs 

      Marzullo, Keith; Birman, Kenneth P. (Cornell University, 1989-05)
      We discuss the role of order in building distributed systems. It is our belief that a "principle of event ordering" underlies the wide range of operating systems mechanisms that have been put forward for building robust ...
    • Scalability of Two Reliable Multicast Protocols 

      Ozkasap, Oznur; Xiao, Zhen; Birman, Kenneth P. (Cornell University, 1999-05)
      Growing demand for multicast commun-ication in large network settings has focused attention on the scalability of reliable multicast protocols. Our paper uses both simulation tools and experiments to compare two scalable ...
    • A Security Architecture for Fault-Tolerant Systems 

      Reiter, Michael K.; Birman, Kenneth P.; Van Renesse, Robbert (Cornell University, 1993-06)
      Process groups are a common abstraction for fault-tolerant computing in distributed systems. We present a security architecture that extends the process group into a security abstraction. Integral parts of this architecture ...
    • A Study of Group Rekeying 

      Rodeh, Ohad; Birman, Kenneth P.; Dolev, Danny (Cornell University, 2000-03-20)
      In this paper we study the key management problem, in the context of Group Communication Systems (GCS). GCSs are mid-sized systems scaling up to 100 members. We present a side-by-side comparison of three ways of managing ...