1 / 13

Multicast Routing on the Internet

Multicast Routing on the Internet. Jason Chu Svetlana Kotchenova Can Le. What is multicast?. Individual hosts are configured as members of different multicast groups. Point-to-multipoint transmission. Multicasting is not connection oriented.

tarak
Download Presentation

Multicast Routing on the Internet

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. Multicast Routing on the Internet Jason Chu Svetlana Kotchenova Can Le SC546 Computer Communications and Networks, Boston University, Spring, 2001

  2. What is multicast? • Individual hosts are configured as members of different multicast groups • Point-to-multipoint transmission • Multicasting is not connection oriented • An IP multicast group is identified by a Class D address SC546 Computer Communications and Networks, Boston University, Spring, 2001

  3. Multicast IP Delivery Service • The Internet Management Protocol runs between host and their immediately neighboring multicast routers • A Multicast Routing Protocol is responsible for the construction of multicast delivery trees and forwarding of multicast datagrams across an internetwork SC546 Computer Communications and Networks, Boston University, Spring, 2001

  4. Internet Group Management Protocol (IGMP) • A multicast router periodically transmits Host Membership Query messages • When a host wants to join a group, it immediately transmits a Host Membership Report for the group • Election of the querier (The router with the lowest IP address) • A Group-Specific Query Message • A Leave Group message SC546 Computer Communications and Networks, Boston University, Spring, 2001

  5. Multicast forwarding algorithms • Flooding • Spanning Trees • Reverse Path Broadcasting • Truncated Reverse Path Broadcasting • Reverse Path Multicasting • Core-Based Trees Multicast Routing Protocols • Distance Vector Multicast Routing protocol • Multicast OSPF • Protocol Independent Multicast (Dense and Sparse modes) SC546 Computer Communications and Networks, Boston University, Spring, 2001

  6. yes no Discard the packet Forward the packet to all “downstream” neighbors “Poison reverse” the route Reverse Path Multicasting S • Every time a router receives a packet on one of its links, it checks whether this link belongs to the shortest path towards the source A 2 1 C B 3 4 5 D 8 E • The “parent” link – the interface over which a router expects to receive multicast packets from a particular source • The “child” links – the outgoing links over which a router forwards multicast packets (RPB) SC546 Computer Communications and Networks, Boston University, Spring, 2001

  7. Reverse Path Multicasting • Multicast Group Membership should be taken into account -> use of the IGMP (TRPB) • A router can transmit a “prune” message on its parent link (RPM) • Prune messages are sent only one hop back toward the source Result: a source-rooted, shortest-path tree for each (source-group) pair SC546 Computer Communications and Networks, Boston University, Spring, 2001

  8. Drawbacks of RPM • The prune information in routers must be removed periodically and the next packet for a (source, group) is forwarded to all leaf routers Relatively big memory space is required for maintaining state information for all (source, group) pairs -> it makes the algorithm not scalable SC546 Computer Communications and Networks, Boston University, Spring, 2001

  9. Project goals • Simulation of unicast forwarding since in real life both unicast and multicast communication pattern are used in the same network • Simulation of Reverse Path Multicasting using a special data structure to store the information • Evaluation of the algorithm efficiency in the case of the large internetworks (up to 10000 nodes) • Comparison with another multicast forwarding algorithm, Core-Based Trees, which was preliminary created to overcome the limitations of Reverse Path Multicasting SC546 Computer Communications and Networks, Boston University, Spring, 2001

  10. Core-Based Trees • A single router or a set of routers acts as the core • A host that wishes to receive traffic for a multicast group is required to send a “join” message to one of the group’s core routers. Result: a single delivery tree that is shared by all members of a group SC546 Computer Communications and Networks, Boston University, Spring, 2001

  11. Benefits Efficient use of router resources (maintenance of information for each group, not for each (source, group) pair) Conserves network bandwidth Limitations Traffic concentration near core routers Possible delays Core-Based Trees SC546 Computer Communications and Networks, Boston University, Spring, 2001

  12. Where can multicast be used? • Sharing audio and video (multiparty video-conferencing) • Web caching (the temporary storage of web objects for later retrieval) • Web clustering SC546 Computer Communications and Networks, Boston University, Spring, 2001

  13. Thank you! Any questions?.. SC546 Computer Communications and Networks, Boston University, Spring, 2001

More Related