Now showing items 10-21 of 21

    • Optimized Group Rekey for Group Communications Systems 

      Rodeh, Ohad; Birman, Ken; Dolev, Danny (Cornell University, 1999-08)
      In this paper we describe an efficient algorithm for the management of group keys. Our algorithm is based on a protocol for secure IP-multicast and is used to manage group-keys in group-communications systems. Unlike prior ...
    • Optimizing Buffer Management for Reliable Multicast 

      Xiao, Zhen; Birman, Ken (Cornell University, 2000-10-02)
      Reliable multicast delivery requires that a multicast message be received by all members in a group. Hence certain or all members need to buffer messages for possible retransmissions. Designing an efficient buffer ...
    • The Power of Indirection: Achieving Multicast Scalability by Mapping Groups to Regional Underlays 

      Ostrowski, Krzysztof; Birman, Ken; Phanishayee, Amar (Cornell University, 2006-12-13)
      Reliable multicast is a powerful primitive, useful for data replication, event notification (publish-subscribe), fault tolerance and other purposes. Yet many of the most interesting applications give rise to huge numbers ...
    • Programming Live Distributed Objects with Distributed Data Flows 

      Ostrowski, Krzysztof; Birman, Ken; Dolev, Danny (2009-05-20)
      This paper presents a new object-oriented approach to modeling the semantics of distributed multi-party protocols such as leader election, distributed locking, or reliable multicast, and a programming language that supports ...
    • Properties Framework and Typed Endpoints for Scalable Group Communication 

      Ostrowski, Krzysztof; Birman, Ken; Dolev, Danny (Cornell University, 2006-12-13)
      Group communication is a powerful tool that simplifies the development of dependable systems, but widespread adoption of the paradigm has been limited. The main problem is that existing systems lack important forms of ...
    • QuickSilver Scalable Multicast 

      Ostrowski, Krzysztof; Birman, Ken; Phanishayee, Amar (Cornell University, 2006-12-13)
      Reliable multicast is useful for replication and in support of publish-subscribe notification. However, many of the most interesting applications give rise to huge numbers of multicast groups with heavily overlapping sets ...
    • QuickSilver Scalable Multicast 

      Ostrowski, Krzysztof; Birman, Ken; Dolev, Danny (2007-12-24)
      Our work is motivated by a platform we are building to support a new style of distributed programming, in which users drag and drop live components into live documents, often without needing to write new code. The capability ...
    • A Randomized Error Recovery Algorithm for Reliable Multicast 

      Xiao, Zhen; Birman, Ken (Cornell University, 2000-10-02)
      An efficient error recovery algorithm is essential for reliable multicast in large groups. Tree-based protocols (RMTP, TMTP, LBRRM) group receivers into local regions and select a repair server for performing error recovery ...
    • Scalable Publish-Subscribe in a Managed Framework 

      Ostrowski, Krzysztof; Birman, Ken (Cornell University, 2007-07-10)
      Reliable multicast, publish-subscribe and group communication are highly effective in support of replication and event notification, and could serve as the enabling technologies for new types of applications that are both ...
    • Trading Consistency for Availability in Distributed Systems 

      Friedman, Roy; Birman, Ken (Cornell University, 1996-04)
      This paper shows that two important classes of actions, {\em non left commuting}\/ and {\em strongly non commuting}, cannot be executed by concurrent partitions in a system that provides serializable services. This result ...
    • A Transparent Light-Weight Group Service 

      Rodrigues, Lu\'{\i}s; Guo, Katherine; Sargento, Antonio; van Renesse, Robbert; Glade, Brad; Ver\'{\i}ssimo, Paulo; Birman, Ken (Cornell University, 1996-05)
      Virtual synchrony, also known as view synchrony, has proven to be a powerful paradigm to build distributed applications. Informally, virtual synchrony provides to each process group membership information in the form ...
    • Using Group Communication Technology to Implement a Reliable andScalable Distributed IN Coprocessor 

      Friedman, Roy; Birman, Ken (Cornell University, 1996-08)
      In this paper we explore the use of group communication technology, developed in the Horus project to implement a reliable and scalable distributed IN coprocessor. The proposed implementation can handle up to 20,000 calls ...