DOC PREVIEW
Berkeley ELENG 122 - Multicast

This preview shows page 1-2-3 out of 8 pages.

Save
View full document
View full document
Premium Document
Do you want full access? Go Premium and unlock all 8 pages.
Access to all documents
Download any document
Ad free experience
View full document
Premium Document
Do you want full access? Go Premium and unlock all 8 pages.
Access to all documents
Download any document
Ad free experience
View full document
Premium Document
Do you want full access? Go Premium and unlock all 8 pages.
Access to all documents
Download any document
Ad free experience
Premium Document
Do you want full access? Go Premium and unlock all 8 pages.
Access to all documents
Download any document
Ad free experience

Unformatted text preview:

1EE122: MulticastKevin LaiOctober 7, [email protected] 2Internet Radiowww.digitallyimported.com (techno station)- sends out 128Kb/s MP3 music streams- peak usage ~9000 simultaneous streams• only 5 unique streams (trance, hard trance, hard house, eurodance, classical)- consumes ~1.1Gb/s• bandwidth costs are large fraction of their expenditures (maybe 50%?)- if 1000 people are getting their groove on in Berkeley, 1000 unicast streams are sent from NYC to [email protected] 3Multicast Service Model 1receivers join a multicast group which is identified by a multicast address (e.g. G)sender(s) send data to address Gnetwork routes data to each of the receiversSR0R1...R0joins GR1joins GRn-1joins G[R0, data][R1, data][Rn-1, data][R0, data][R1, data][Rn-1, data]UnicastRn-1NetSR0R1...[G, data][G, data][G, data][G, data][email protected] 4Motivation Conserve bandwidth- use same bandwidth/link to send to n receivers as 1 receiver• internet radio example: reduce bandwidth consumed by 9000/5=1800- deals with flash crowds- e.g., video/audio conferencing, streaming, news dissemination, file updates Separate identifier from address (logical addressing)- receiver can change location-dependent addresses without notifying sender- sender doesn’t need to know about receivers- e.g., service location, mobility, anonymity, [email protected] 5Multicast Service Model 2Membership access control- open group: anyone can join- closed group: restrictions on joiningSender access control- anyone can send to group- anyone in group can send to group- only one host can send to groupPacket delivery is best [email protected] 6Multicast and LayeringMulticast can be implemented at different layers- data link layer• e.g. Ethernet multicast- network layer• e.g. IP multicast- application layer• e.g. as an overlay network like KazaaWhich layer is [email protected] 7Multicast Implementation IssuesHow are multicast packets addressed?How is join implemented?How is send implemented?How much state is kept and who keeps [email protected] 8Ethernet MulticastReserve some Ethernet MAC addresses for multicast join group G- network interface card (NIC) normally only listens for packets sent to unicast address A and broadcast address B- to join group G, NIC also listens for packets sent to multicast address G (NIC limits number of groups joined)- implemented in hardware, so efficient send to group G- packet is flooded on all LAN segments, like broadcast- can waste bandwidth, but LANs should not be very largeonly host NICs keep state about who has joined → scalable to large number of receivers, [email protected] 9Problems with Data Link Layer Multicastsingle data link technologysingle LAN- limited to small number of hosts- limited to low diameter latency- essentially all the limitations of LANs compared to internetworksbroadcast doesn’t cut it in larger [email protected] 10IP MulticastOvercomes limitations of data link layer multicastPerforms inter-network multicast routing- relies on data link layer multicast for intra-network routingPortion of IP address space defined as multicast addresses-228addresses for entire InternetOpen group membershipAnyone can send to group- flexible, but leads to [email protected] 11IP Multicast RoutingIntra-domain- Distance-vector multicast (DVM)- Link-state multicast (LSM) Inter-domain- Protocol Independent Multicast (PIM)- Single Source Multicast (SSM)[email protected] 12Distance Vector Multicast Extension to DV unicast routing Routers compute shortest path to each host- necessary for unicast delivery No join required- every link receives a copy, even if no interested hostsPacket forwarding- iff incoming link is shortest path to source- out all links except incoming- Reverse Path Flooding (RPF)- packets always take shortest path• assuming delay is symmetric- link may have duplicatess:2s:2sss:1s:1s:3s:3s:2s:2s:3s:[email protected] 13Reverse Path Broadcasting (RPB) Extend DV to eliminate duplicate packets Combine DV and spanning tree Choose parent router for each link- router with shortest path to source- lowest address breaks ties- each router can compute independently from already known information- each router keeps a bitmap with one bit for each of its links Only parent forwards onto links:2s:2sss:1s:1s:3s:3s:2s:2s:3s:[email protected] 14Truncated Reverse Path Broadcasting (TRPB) Extend DV/RPB to eliminate unneeded forwarding Identify leaves- routers announce that a link is their next link to source S- parent router can determine that it is not a leaf Explicit group joining- members periodically (with random offset) multicast report locally- hear an report, then suppress ownPacket forwarding- iff not a leaf router or have members- out all links except [email protected] 15Problems with IP Multicast ModelFew groups have many senders- difficult to construct optimal tree for many sendersHard to implement sender control Æ any node can send to the group - open group membershipMulticast address scarcity-228addresses may not be enough for entire Internet- how prevent [email protected] 16Internet Radio using IP Multicast ModelOne sender- does not use multiple sender capability of modelSomeone other than Digitally Imported can send to group- clog 9000 clients’ links with useless data (Denial-of-Service attack)How can Digitally Imported get and keep a multicast address?- central organization to manage addresses adds [email protected] 17Single Source Multicast (SSM)Network layer multicastSSM service model- only one sender can send to a group- any number of receiversAddressing- SSM address = (S, G) S: IP address of source, G: 24-bit group address- each sender has its own [email protected] 18SSM Joinreceiver sends join to sourcerouters on the path read the join packetthey note a receiver on the incoming [email protected] 19SSM Sendrouter checks that packet is coming from direction of Sif so, forward it down links that have [email protected] 20SSM v.s. IP MulticastRestricted to one sender per group- for multiple senders, make multiple groupsCan prevent denial-of-service attacks on groupSenders can


View Full Document

Berkeley ELENG 122 - Multicast

Documents in this Course
Lecture 6

Lecture 6

22 pages

Wireless

Wireless

16 pages

Links

Links

21 pages

Ethernet

Ethernet

10 pages

routing

routing

11 pages

Links

Links

7 pages

Switches

Switches

30 pages

Multicast

Multicast

36 pages

Switches

Switches

18 pages

Security

Security

16 pages

Switches

Switches

18 pages

Lecture 1

Lecture 1

56 pages

OPNET

OPNET

5 pages

Lecture 4

Lecture 4

16 pages

Ethernet

Ethernet

65 pages

Models

Models

30 pages

TCP

TCP

16 pages

Wireless

Wireless

48 pages

Load more
Download Multicast
Our administrator received your request to download this document. We will send you the file to your email shortly.
Loading Unlocking...
Login

Join to view Multicast and access 3M+ class-specific study document.

or
We will never post anything without your permission.
Don't have an account?
Sign Up

Join to view Multicast 2 2 and access 3M+ class-specific study document.

or

By creating an account you agree to our Privacy Policy and Terms Of Use

Already a member?