Định tuyến Multicast routing

40 477 2
Định tuyến Multicast routing

Đang tải... (xem toàn văn)

Tài liệu hạn chế xem trước, để xem đầy đủ mời bạn chọn Tải xuống

Thông tin tài liệu

Định tuyến multicast routing

Multicast Routing Wed. 28 MAY. 2003 Introduction based on number of receivers of the packet or massage: “A technique for the efficient distribution of identical packet streams to groups of selected workstations on one or more LANs.” (Penn State network and systems administrators) Implementation » Multiple unicast Wast Network bandwidth, Registering mechanism. » Multiple addresses in a packet Can be only one instance(why Can?), Limited size of packet limits the max number of recipient Much more processing in a router(List of Addresses) Only partially help in the bandwidth wasting problem of the previous method » Multicast address The sender does not need to know the recipients, Must use connectionless UDP on top of IP Implementation (Cont’s) • Saving the network link bandwidth is left to the routers, • the group does not have any physical or geographical boundaries. • Hosts that are interested in receiving data flowing to a particular group must join the group using IGMP. Unicast/Multicast Host Router Unicast Host Router Multicast CISCO Systems Internet Group Management Protocol • IGMP provides the means for a host to inform its attached router • Given that, the scope of IGMP interaction is limited to a host and its attached router • Another protocol is clearly required to coordinate the multicast- router throughout the internet, that accomplished by the network- layered multicast routing algorithms such as PIM, DVMRP and MOSPT. • Router queries the local hosts for m-cast group membership info • Hosts respond with membership reports: actually, the first host which responds, speaks for all IGMP protocol • IGMPv1, there are just two different type of IGMP message: Membership QUERY and Membership REPORT When there is no reply to three consecutive IGMP membership queries, the router times out group an stops forwarding traffic directed toward group. • IGMPv2, there are four types.basically the same as version 1. the main difference: 1) The hosts communicate to the local multicast router when intention to leave the group. 2) The router then sends out a group-specific query and determines whether there are any remaining host. IP Multicast Addresses • Multicast addresses specify an arbitrary group of IP hosts that have joined the group and want to receive traffic sent to this group. • The Internet Assigned Numbers Authority (IANA) controls the assignment of IP multicast addresses. • all IP multicast group addresses will fall in the range of 224.0.0.0 to 239.255.255.255.(IPv4 D-classful) 224.0.0.0 - 244.0.0.255 link local scope 224.0.1.0 - 238.255.255.255 global scope 239.0.0.0 - 239.255.255.255 Reserved for local scope 239.192.0.0 - 239.194.255.255 organization local scope 239.253.0.0 - 239.255.255.255 site local scope Routing protocol Multicast • Problem: find the best (e.g., min cost) tree which interconnects all the members Multicast Tree Option • GROUP SHARED TREE: single tree for all senders(entire multicast group); bidirectional links • SOURCE BASED TREE: each source is the root of its own tree connecting to all members; thus separate trees for different senders [...]... RPF makes use of the existing unicast routing table • A router forwards a multicast packet only if it is received on the up stream interface Multicast Routing Algorithms and Protocols • Flooding a router that receives a packet with multicast destination address, simply sends to all interfaces, expect the interface where the packet came to the router Challenge: Routing Loops News: uses a article path... group Routing protocol Multicast • Intra domain - MOSPF - DVMRP (Flood & Prune) - PIM - Sparse mode - Dense mode • Inter domain - MBGP + MSDP Currently used - BGMP + MASC Protocol Independent Multicast( PIM) Why independent? Independent of the underlying unicast routing protocol EIGRP, OSPF, BGP, or static routes • Dense mode many or most of routers in the area need to be involved in routing multicast. .. delivery, not concentrate the traffic on some network links Do not really use the group membership information, so waste bandwidth Multicast Routing Alg.s and Prot.s (Cont’s) • RPF and Prunes When the first packet in a multicast transmission reaches the end leaves in the routing tree, the leaf router sends a pruning message upstream if it does not have any group members attached to it Likewise, if a... in the whole network Multicast Routing Alg.s and Prot.s (Cont’s) • Steiner trees The idea of steiner trees is to build an overlay network that connects all nodes in a group with minimum total number of links It is not usually suitable in real networks The computing of the tree is hard and it must be done again each time a node joins or leaves a group • Core-based trees Each multicast group has a core,... of the multicast tree and whose branches form a spanning tree through the network to the receivers • Also known as Short Path Tree(SPT) because tree uses the shortest path through the network • SPT creating the optimal path between the source and receivers This guarantees the minimum amount of network latency • Routers must maintain the state of each link (link-state) • A simpler multicasting routing. .. TTL is usually the best way to take care of this problem TTL local host…………… 0 local network segment 1 site…………………… 15 region………………… 31 country……………… 48 continent(Europe)…… 63 world ……………… 127 Multicast Routing Alg.s and Prot.s (Cont’s) • Spanning tree Building a logical network on top of the real network by creating a loopless graph between all nodes resolves the looping problem in flooding bandwidth . router forwards a multicast packet only if it is received on the up stream interface. Multicast Routing Algorithms and Protocols • Flooding a router that receives a packet with multicast destination. so waste bandwidth. Multicast Routing Alg.s and Prot.s (Cont’s) • RPF and Prunes When the first packet in a multicast transmission reaches the end leaves in the routing tree, the leaf router. 239.253.0.0 - 239.255.255.255 site local scope Routing protocol Multicast • Problem: find the best (e.g., min cost) tree which interconnects all the members Multicast Tree Option • GROUP SHARED TREE:

Ngày đăng: 23/05/2014, 09:08

Từ khóa liên quan

Mục lục

  • Multicast Routing

  • Introduction

  • Implementation

  • Implementation (Cont’s)

  • Unicast/Multicast

  • Internet Group Management Protocol

  • IGMP protocol

  • IP Multicast Addresses

  • Routing protocol Multicast

  • Multicast Tree Option

  • Group Shared Tree

  • Source-based Tree

  • Reverse Path forwarding

  • Multicast Routing Algorithms and Protocols

  • TTL

  • Multicast Routing Alg.s and Prot.s (Cont’s)

  • Slide 17

  • Slide 18

  • Slide 19

  • Protocol Independent Multicast(PIM)

Tài liệu cùng người dùng

  • Đang cập nhật ...

Tài liệu liên quan