K. P. Birman. Building Secure and Reliable Network Applications. Manning Publishing Company and Prentice Hall, December 1996. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
First 50 documents Next 50
An Arbitration Scheme for Concurrency Control in - Distributed Groupware Mihail (2000) (Correct)
....or consistent if for any two distinct sites # and # # # the following condition holds: If at any time the system were to become quiescent with no messages in transit between the sites, then their application documents must be the same S # = S # . A more dynamic view of consistency is presented in [3], where the system is considered consistent if the communicating sites never observe contradictions in their states, which are detectable by comparing the contents of messages they exchange (p.337) A key issue is maintaining the correctness of the configuration in the presence of concurrent ....
....to a total ordering. Given a configuration # with each site sending its own events e #11 , e #12 , e #1k , the total ordering exists if every site receives all the events in the same order. The only restriction is that the partial ordering is preserved. A more formal definition is given in [3]. Total ordering is the most general method of maintaining the configuration correctness. However, as demonstrated in [1] total ordering degrades the responsiveness of the system relative to partial ordering. The concurrency control presented here offers a more responsive alternative. DISCIPLE ....
Birman, K. P. Building Secure and Reliable Network Applications. Manning Publications Co., 1996.
Selfish Routing - Roughgarden (2002) (3 citations) (Correct)
.... the network but have no control over how their tra#c is routed (and thus this tra#c qualifies as centrally controlled) Also, Korilis et al. 105] consider networks that allow a large customer to set up a so called virtual private network of guaranteed and preassigned virtual paths for ongoing use [21], and argue that the bandwidth needed for a virtual private network may be viewed as centrally controlled (with the paths chosen by the network manager) while individual users of the network continue to behave in a selfish and independent fashion. We investigate the following question: given a ....
K. P. Birman. Building Secure and Reliable Network Applications. Manning, 1996.
Tolerating Stop Failures in Distributed Maple - Bosa, Schreiner (2002) (Correct)
....task was created and i is an index. The node n thus serves as the rendezvous point between node n 0 computing the result of t and node n 00 requesting this result. 3. Formerly Achieved Fault Tolerance There exist various fundamental mechanisms to achieve fault tolerance in distributed systems [1, 2, 4]. The only mechanism originally available in Distributed Maple for handling faults was a watchdog mechanism on every node that regularly checked whether a message had been recently received from the root. If not, it sent a ping: message that had to be acknowledged. If no acknowledgement arrived ....
Kenneth P. Birman. Building Secure and Reliable Network Applications. Manning, Greenwich, Connecticut, 1996
Improving the Scalability of Fault-Tolerant Database.. - Jimenez-Peris.. (Correct)
....# # . Upon delivery of a transaction # that accesses a compound conflict class # # , each site (local or remote) adds # to the queues of the basic conflict classes contained in # # . 3. 2 Communication Primitives Update transactions are propagated to all sites using group communication primitives [8, 5, 6]. We assume a virtual synchronous system [5] where all group members see membership changes at the same logical instant. Two messages are broadcast per update transaction: a message containing the transaction itself and a commit message with the updates performed. Commit messages are just ....
....a compound conflict class # # , each site (local or remote) adds # to the queues of the basic conflict classes contained in # # . 3. 2 Communication Primitives Update transactions are propagated to all sites using group communication primitives [8, 5, 6] We assume a virtual synchronous system [5], where all group members see membership changes at the same logical instant. Two messages are broadcast per update transaction: a message containing the transaction itself and a commit message with the updates performed. Commit messages are just reliable broadcast, no ordering guarantees are ....
K. Birman. Building Secure and Reliable Network Applications. Prentice Hall, NJ, 1996.
Transparent Fault-Tolerant Java Virtual Machine - Roy Friedman Alon (Correct)
No context found.
K. P. Birman. Building Secure and Reliable Network Applications. Manning Publishing Company and Prentice Hall, December 1996.
Group Membership and Wide-Area Master-Worker Computations - Jacobsen, Zhang, Marzullo (2003) (2 citations) (Correct)
No context found.
K. P. Birman. Building Secure and Reliable Network Applications. Manning, 1996.
A Group Object Adaptor Based Approach to CORBA - Fault-Tolerance Roy Friedman (Correct)
No context found.
K. P. Birman. Building Secure and Reliable Network Applications. Manning Publishing Company and Prentice Hall, December 1996.
FTS: A High-Performance CORBA Fault-Tolerance Service - Roy Friedman Erez (2002) (6 citations) (Correct)
No context found.
K. P. Birman. Building Secure and Reliable Network Applications. Manning Publishing Company and Prentice Hall, December 1996.
Regional Center and Grid Development in Brazil - Geyer, Yamin, Silva, Vargas.. (2002) (Correct)
No context found.
K.P. Birman. Building Secure and Reliable Network Applications. Manning Publications Co., 1996.
High-Performance Secure Group Communication - Nita-Rotaru (2003) (Correct)
No context found.
K. P. Birman, Building Secure and Reliable Network Applications. Manning, 1996.
Transparent Fault-Tolerant Java Virtual Machine - Roy Friedman Alon (2002) (1 citation) (Correct)
No context found.
K. P. Birman. Building Secure and Reliable Network Applications. Manning Publishing Company and Prentice Hall, December 1996.
Software Engineering and Middleware: A Roadmap - Emmerich (2000) (9 citations) (Correct)
No context found.
K.P.Birman. Building Secure and Reliable Network Applications. Manning Publishing, 1997.
Formal Verification of an Intrusion-Tolerant Group.. - Ramasamy, Cukier.. (2003) (Correct)
No context found.
K.P. Birman, Building Secure and Reliable Network Applications, Manning Publications, 1996
A Scalable Scheme for Causal Message Ordering - Yen, Chi, Huang (Correct)
No context found.
K. P. Birman. Building Secure and Reliable Network Applications. Manning Publications Co., 1996.
Fighting Fire With Fire: Using Randomized Gossip To Combat.. - Gupta, Birman (2002) (6 citations) (Correct)
No context found.
Birman KP. Building Secure and Reliable Network Applications. Manning Publications and Prentice-Hall: Greenwich, CT, 1997.
Transparent Fault-Tolerant Java Virtual Machine - Friedman, Kama (2003) (1 citation) (Correct)
No context found.
K. P. Birman. Building Secure and Reliable Network Applications. Manning Publishing Company and Prentice Hall, December 1996.
Δ-Reliable Broadcast - Eugster, Guerraoui, Kouznetsov (Correct)
No context found.
K. Birman. Building Secure and Reliable Network Applications. Manning Publications Co., 1996.
An Adaptive Quality of Service Aware Middleware for.. - Krishnamurthy.. (2002) (2 citations) (Correct)
No context found.
K. Birman. Building Secure and Reliable Network Applications. Manning, 1996.
An Algorithm for Deterministic Scheduling of.. - Jimenez-Peris.. (2002) (Correct)
No context found.
K.P. Birman. Building Secure and Reliable Network Applications. Prentice Hall, NJ, 1996.
Ist-2001-33234 - Peer-To-Peer Implementation And (Correct)
No context found.
K. Birman. Building Secure and Reliable Network Applications. Manning Publications Co., 1996.
An Architecture for Dynamic Scalable Self-Managed Distributed.. - Anceaume, al. (2004) (Correct)
No context found.
K. Birman. Building Secure and Reliable Network Applications. Manning Publishing Company and Prentice Hall, 1996.
Group Communication - Idit Keidar Mit (Correct)
No context found.
K. Birman, Building Secure and Reliable Network Applications, Manning Publishing and Prentice Hall, 1997.
A Client-Server Approach to Virtually Synchronous Group.. - Keidar, Khazan (1999) (10 citations) (Correct)
No context found.
K. Birman. Building Secure and Reliable Network Applications. Manning, 1996.
Reliable Group Communication in an Ad Hoc Network - Lawrence Klos Golden (Correct)
No context found.
K. Birman, "Building Secure and Reliable Network Applications", Manning Publishing Company, Greenwich, CT, and Prentice Hall 1997.
Mobile Agent Security and Reliability Issues in Electronic Commerce - CHAN (2000) (Correct)
No context found.
Kenneth P. Birman. Building Secure and Reliable Network Applications. Manning, 1996.
First 50 documents Next 50
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC