Communication Paradigms - Connect

More documents

Recommendations

Info

Reliability Guarantees Unreliable multicast Message sent to all members and may or may not arrive Reliable multicast: Protection against faulty network Reasonable efforts are made to ensure delivery in spite of message losses Can be based on positive or negative acknowledgements No guarantees is the sender crashes during multicast Atomic multicast: Protection against faulty participants All members receive message, or none do Main issue: tolerate the sender’s crash Adv. Dist. Systems G. Blair/ F. Taiani 30
Implementing Reliable Multicast 1) Originator sends a message to each member of the group, and awaits acknowledgements (ACK) 2) If some acknowledgements are not received in a given period of time, re-send message; repeat this n times if necessary 3) If all acknowledgements received then report success to caller Works fine if: Network problems are transient (msgs eventually get through) No crash (and no spurious behaviour) Not very scalable: ACK explosion! ack A B msg msg ack C msg ack D Adv. Dist. Systems G. Blair/ F. Taiani 31
Page 1 and 2: Advanced Distributed Systems Commun
Page 3 and 4: A Framework for Understanding Distr
Page 5 and 6: The Problem: A Social Network Syste
Page 7 and 8: Interprocess Communication
Page 9 and 10: Other Approaches Message passing,
Page 11 and 12: Remote Invocation: Remote Procedure
Page 13 and 14: Styles of RPC First class RPC Int
Page 15 and 16: Interface Definition Languages Wha
Page 17 and 18: Remote Invocation: Remote Method In
Page 19 and 20: From RPC to Distributed Objects (Re
Page 21 and 22: Indirect Communication: General
Page 23 and 24: A Closer Look at Coupling Remote i
Page 25 and 26: Indirect Communication: Group Commu
Page 27 and 28: A Typical Group Service interface G
Page 29: Problems Reliability (against loss
Page 33 and 34: Ordering Guarantees Unordered mult
Page 35 and 36: Implementing Total Ordering The s
Page 37 and 38: Publish-Subscribe Systems What is
Page 39 and 40: A Closer Look at the Subscription
Page 41 and 42: Implementing Publish-Subscribe The
Page 43 and 44: Realising Content-based Approaches
Page 45 and 46: The Algorithm upon receive publish(
Page 47 and 48: Indirect Communication: Message Que
Page 49 and 50: Message Queues (continued) Adv. Dis
Page 51 and 52: Distributed Shared Memory What is
Page 53 and 54: Indirect Communication: Tuple Space
Page 55 and 56: Tuple Spaces(continued) Adv. Dist.
Page 57 and 58: Comparison of Approaches Adv. Dist.

Communication Paradigms - Connect

You also want an ePaper? Increase the reach of your titles

Delete template?

Save as template?