1 / 34

Multicasting Seminar By: Professor A. Hanna Department of Computer Science,

Multicasting Seminar By: Professor A. Hanna Department of Computer Science, Concordia University, Montreal Canada. Multicasting - A Proposal for a General Architecture. Aiman Hanna J. William Atwood

whitby
Download Presentation

Multicasting Seminar By: Professor A. Hanna Department of Computer Science,

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Multicasting Seminar By: Professor A. Hanna Department of Computer Science, Concordia University, Montreal Canada.

  2. Multicasting - A Proposal for a General Architecture Aiman Hanna J. William Atwood Department of Computer Science Department of Computer Science Concordia University Concordia University IEEE International Conference for Telecommunication (ICT-2001) Bucharest, Romania - June 2001

  3. OurWorld small Large-scale communication over very high-speed networks. • Defense & Intelligence • Medical Imaging • Education • ……. • Protocol: A set of rules for guiding communication among a set of participants Slide 3

  4. Multicasting Unicasting Unicasting Unicasting Slide 4

  5. Different Features of Multicasting • Reliability • Scalability • Ordering • M-to-N Multicast • Late-join and Early-leave Receivers • Atomicity Slide

  6. Reliable Multicasting • Delivery time • Delivery atomicity • Guaranteed delivery to a member or group of members • Delivery order • Sender/Receivers perspective What is Reliability? Slide

  7. Hierarchical Structure Flat Structure Sender Sender CA CA CA Receiver Receiver Receiver Receiver Receiver Receiver Receiver Receiver Receiver Receiver Receiver Receiver Receiver Receiver Receiver CA - Controlling Agent Architecture of Multicast Protocols Multicast Data Flow Bi-directional Control Flow Slide

  8. Structure Impact on the Protocol • Flat-Structured Protocols • Ideally, they should be capable of supporting: • M-to-N multicast, • Ordering • Sender-based reliability • However, they are incapable of being: • Scalable Slide

  9. Structure Impact on the Protocol • Hierarchically-Structured Protocols • Ideally, they should be capable of supporting: • Scalability • Receiver-based reliability • However, it is significantly difficult for these protocols to support: • Ordering • Sender-based reliability • M-to-N Multicast Slide

  10. Reliable Multicast Protocols Major Reliable Multicast Protocols: • The Tree-Based Multicast Transport Protocol (TMTP) • The Scalable Reliable Multicast Protocol (SRM) • The Reliable Multicast Transport Protocol (RMTP) • The Reliable Adaptive Multicast Protocol (RAMP) • The Reliable Multicast Protocol (RMP) • The Multicast Transport Protocol (MTP-2) • The Local Group Based Multicast Protocol (LGMP) • The Xpress Transport Protocol (XTP) Slide

  11. Too Many Protocols, No Standard! The Reality • M-to-N Multicast • Supported only by: • SRM • RMTP • MTP-2 • Scalability • Supported only by: • TMTP • LGMP • RMTP • Ordering • Supported only by: • RMP • MTP-2 • GuaranteedReliability • Supported only by: • TMTP • RAMP • XTP Slide

  12. New Architecture for Reliable Multicast Protocols Goal:Achieving a standard reliable multicast protocol • The architecture must provide, and without incurring much overhead on the protocol, nor on the network: • Proper Reliability • Scalability • M-to-N Multicast • Ordering • Ability for: • atomicity, • late-join and early-leave receivers, • …….. Slide

  13. Proper Reliability: • When sender-initiated must be used, and • when receiver-initiated must be used • Scalability: • Support as many receivers as the application wishes • M-to-N Multicast: • Must be achieved with minimal resource consumption • Practical Consideration: How many senders should a session have? • Ordering: • Must be achieved with a full separation between policies and mechanisms Slide

  14. MasterSender A FIRST FIRST B F FIRST FIRST FIRST C E D The Significant Set SignificantSet Multicast Address Multicast Transmission Slide

  15. MasterSender A JOIN-REQUEST JOIN-REQUEST B F JOIN-REQUEST JOIN-REQUEST JOIN-REQUEST C E D The Significant Set Unicast Transmission Slide

  16. MasterSender A JOIN-CONFIRM JOIN-CONFIRM B F JOIN-CONFIRM JOIN-CONFIRM JOIN-CONFIRM C E D The Significant Set Unicast Transmission Slide

  17. MasterSender A B F FIRST FIRST FIRST FIRST C E FIRST D The Significant Set SignificantSet Multicast Address Multicast Transmission Slide

  18. MasterSender A JOIN-REQUEST B F JOIN-REQUEST JOIN-REQUEST JOIN-REQUEST C E JOIN-REQUEST D The Significant Set Unicast Transmission Unicast Transmission, Already existing paths Slide

  19. MasterSender A JOIN-CONFIRM B F JOIN-CONFIRM JOIN-CONFIRM JOIN-CONFIRM C E JOIN-CONFIRM D The Significant Set Unicast Transmission Unicast Transmission, Already existing paths Slide

  20. MasterSender A B F C E D SignificantSet Multicast Address The Significant Set Slide

  21. Controlling Agent CA FIRST W FIRST FIRST FIRST Receiver Receiver X Z Y Receiver Receiver The Simple Receivers Set Local Group Multicast Address Multicast Transmission Slide

  22. Controlling Agent CA JOIN-REQUEST JOIN-REQUEST W JOIN-REQUEST Receiver Receiver JOIN-REQUEST X Z Y Receiver Receiver The Simple Receivers Set Unicast Transmission Slide

  23. Controlling Agent CA JOIN-CONFIRM JOIN-CONFIRM W JOIN-CONFIRM Receiver JOIN-CONFIRM Receiver X Z Y Receiver Receiver The Simple Receivers Set Unicast Transmission Slide

  24. Controlling Agent CA W Receiver Receiver X Z Y Receiver Receiver Local Group Multicast Address The Simple Receivers Set Slide

  25. The Global Multicast Address • One single multicast address • All data is sent to this multicast address • All senders and receivers listen to that multicast address Slide

  26. Architecture for Reliable Multicast Protocols New Slide

  27. Architecture Achievements • Absolute Reliability: • Both sender-initiated and receiver-initiated • M-to-N Multicasting: • Achieved using: • only one multicast address when the number of simple receivers is zero • two or multiple multicast addresses when the number of simple receivers is > zero Slide

  28. Architecture Achievements • Scalability: • High-level of scalability as a result of using a hierarchical structure and local error recovery • Ordering: • Flexibility from Total Ordering to no ordering • Complete separation between policies and mechanisms Slide

  29. Disadvantages !! • Utilizing One multicast address per local group However, that is not a real weakness! • Local error recovery is highly supported • Network traffic is significantly reduced • Number of local groups is relative to the number of receivers within a session In other words: • Achieving high scalability, with more efficient error recovery and reduced network traffic is more advantageous than saving a small number of multicast addresses Slide

  30. Mapping to Existing Protocols • Mapping to Hierarchically-Structured Protocols • Relatively easy • Significant Set is an add-on to protocol design and implementation • Many parts of current protocol design/ implementation need not to be changed Slide

  31. Mapping to Existing Protocols Mapping to Flat-Structured Protocols • More complex as a result of structure conversion from flat to hierarchical one • However, many parts of current design/implementation can be used for the significant set • Example: An existing proposal for multi-sender communication for XTP Slide

  32. Questions? Slide

  33. Questions? Slide

  34. Questions? Slide

More Related