ITEC4610 Network Switching and Routing

Info

rmatio

n a

nd

C

om

munica

tion e

ng

ineerin

g

(ICE)

MUT

ITEC4610Network Switching and Routing

ดร . ประวิ�ทย์ ชุ�มชุ�หั�วิหัน้�าสาขาวิ�ชุาวิ�ศวิกรรมสารสน้เทศและการส��อสาร(ICE)MUTEmail: [email protected]หั�องท�างาน้: F402เบอรโทรศ�พทท#�ท�างาน้: (02)9883655 ต่%อ 220เบอรโทรศ�พทเคล��อน้ท#�: 065343850

Info

rmatio

n a

nd

C

om

munica

tion e

ng

ineerin

g

(ICE)

MUT

Class IX Multicasting

ดร . ประวิ�ทย์ ชุ�มชุ�หั�วิหัน้�าสาขาวิ�ชุาวิ�ศวิกรรมสารสน้เทศและการส��อสาร(ICE)MUTEmail: [email protected]หั�องท�างาน้: F402เบอรโทรศ�พทท#�ท�างาน้: (02)9883655 ต่%อ 220เบอรโทรศ�พทเคล��อน้ท#�: 065343850

Info

rmatio

n a

nd

C

om

munica

tion e

ng

ineerin

g

(ICE)

MUT

Multicasting

Multicast Applications• Group Management ProtocolsGroup Management Protocols• Multicast Routing Algorithm• Multicast Routing Protocols

Info

rmatio

n a

nd

C

om

munica

tion e

ng

ineerin

g

(ICE)

MUT

Multicast Applications

• Software Distribution• Replicated database update• Command and control systems• Audio/video conferencing • Distributed games• Distributed interactive simulation

(DIS)• Distribution of news• Distance Learning

Info

rmatio

n a

nd

C

om

munica

tion e

ng

ineerin

g

(ICE)

MUT

Fundamental issues in multicast

Joining and leaving a group Multicast sessions learning Group members discovery Dynamic group membership

Efficient transmission of multicast traffic Resource optimization Delivery tree maintenance

- Time sensitive delivery of multicast traffic Data sequence maintenanceSynchronization

Info

rmatio

n a

nd

C

om

munica

tion e

ng

ineerin

g

(ICE)

MUT

Fundamental issues in multicast (Cont.)

Guaranteed arrival of multicast trafficRTPRMP

Scalability Feedback implosions The use of groups

Security The exchange of cryptographic keys - UDP based multicasting protocols

Info

rmatio

n a

nd

C

om

munica

tion e

ng

ineerin

g

(ICE)

MUT

Multicasting

• Multicast Applications Group Management ProtocolsGroup Management Protocols• Multicast Routing Algorithm• Multicast Routing Protocols

Info

rmatio

n a

nd

C

om

munica

tion e

ng

ineerin

g

(ICE)

MUT

Group Management Group Management ProtocolsProtocols

• IGMPv1• IGMPv2• IGMPv3

Info

rmatio

n a

nd

C

om

munica

tion e

ng

ineerin

g

(ICE)

MUT

IGMPv1(RFC1054)

Multicast router: periodically sends a query m - essage to the all hosts address (2 2 4 .0 .0

1. ) Ahost sends a r epor t i n r epl y on a per gr ou

basis, t her eby r ef r eshi ng t he t ent at i ve st at es IGMP v1 supports suppression for periodical

rrrrrr rrrrrrrrr. 1IGMP v hosts send unsolicited reports upon

joining a group, but leaves the group silently

Info

rmatio

n a

nd

C

om

munica

tion e

ng

ineerin

g

(ICE)

MUT

IGMPv2(RFC2236)

IGMP v2 maintains two types of quer - y: general query and group specific q

uery; Periodical refresh report suppression i

s s upported as well. The approach to lower leave latency

Info

rmatio

n a

nd

C

om

munica

tion e

ng

ineerin

g

(ICE)

MUT

IGMPv3(RFC 3376)

3IGMP v maintains three types of quer rrrrr -rrrrrrrr rrrrrr rrr : ,, -gr oup arr-rrrrrr rrrrrrrr rrrrr

3IGMP v maintains four reports: join, le , st at e change rrr rrrrrrr,

rr rrrrrrrrrr rrrrrrr rrrrrr rrrrrrrrrrr rr rrrrrrrrr

rrrrrr rrrrrrrrrr rrrrrr-rrr rrrrrr rrrrr r:(,, ourcel i st )

Info

rmatio

n a

nd

C

om

munica

tion e

ng

ineerin

g

(ICE)

MUT

Position of IGMP in the network layer

Info

rmatio

n a

nd

C

om

munica

tion e

ng

ineerin

g

(ICE)

MUT

IGMP is a protocol that manages group membership. The IGMP IGMP is a protocol that manages group membership. The IGMP protocol gives the multicast routers information about the membership protocol gives the multicast routers information about the membership status of hosts (routers) connected to the network. .status of hosts (routers) connected to the network. .

GROUP MANAGEMENT

Info

rmatio

n a

nd

C

om

munica

tion e

ng

ineerin

g

(ICE)

MUT

IGMP is a group management protocol. It helps a multicast router

create and update a list of loyal members related to each router

interface.

Note:Note:

Info

rmatio

n a

nd

C

om

munica

tion e

ng

ineerin

g

(ICE)

MUT

IGMP has three types of messages: the query, the membership report, IGMP has three types of messages: the query, the membership report, and the leave report. There are two types of query messages, general and and the leave report. There are two types of query messages, general and special. special.

The topics discussed in this section include:The topics discussed in this section include:

Message FormatMessage Format

IGMP MESSAGES

Info

rmatio

n a

nd

C

om

munica

tion e

ng

ineerin

g

(ICE)

MUT

IGMP message types

Info

rmatio

n a

nd

C

om

munica

tion e

ng

ineerin

g

(ICE)

MUT

IGMP message format

Info

rmatio

n a

nd

C

om

munica

tion e

ng

ineerin

g

(ICE)

MUT

IGMP type fieldIGMP type field

Info

rmatio

n a

nd

C

om

munica

tion e

ng

ineerin

g

(ICE)

MUT

A multicast router connected to a network has a list of multicast A multicast router connected to a network has a list of multicast addresses of the groups with at least one loyal member in that network. addresses of the groups with at least one loyal member in that network. For each group, there is one router that has the duty of distributing the For each group, there is one router that has the duty of distributing the multicast packets destined for that group. multicast packets destined for that group.


Joining a GroupJoining a GroupLeaving a GroupLeaving a GroupMonitoring MembershipMonitoring Membership

IGMP OPERATION

Info

rmatio

n a

nd

C

om

munica

tion e

ng

ineerin

g

(ICE)

MUT

IGMP operation

Info

rmatio

n a

nd

C

om

munica

tion e

ng

ineerin

g

(ICE)

MUT

Membership report

Info

rmatio

n a

nd

C

om

munica

tion e

ng

ineerin

g

(ICE)

MUT

In IGMP, a membership report is sent twice, one after the other.

Note:Note:

Info

rmatio

n a

nd

C

om

munica

tion e

ng

ineerin

g

(ICE)

MUT

Leave report

Info

rmatio

n a

nd

C

om

munica

tion e

ng

ineerin

g

(ICE)

MUT

The general query message does not define a particular group.

Note:Note:

Info

rmatio

n a

nd

C

om

munica

tion e

ng

ineerin

g

(ICE)

MUT

General query message

Info

rmatio

n a

nd

C

om

munica

tion e

ng

ineerin

g

(ICE)

MUT

Imagine there are three hosts in a network as shown in the following Figure

See Next Slide

A query message was received at time 0; the random delay time (in tenths of seconds) for each group is shown next to the group address. Show the sequence of report messages.

Example 1

Info

rmatio

n a

nd

C

om

munica

tion e

ng

ineerin

g

(ICE)

MUT

Example 1

Info

rmatio

n a

nd

C

om

munica

tion e

ng

ineerin

g

(ICE)

MUT

SolutionThe events occur in this sequence:

a. Time 12: The timer for 228.42.0.0 in host A expires and a membership report is sent, which is received by the router and every host including host B which cancels its timer for 228.42.0.0.

b. Time 30: The timer for 225.14.0.0 in host A expires and a membership report is sent, which is received by the router and every host including host C which cancels its timer for 225.14.0.0.

c. Time 50: The timer for 238.71.0.0 in host B expires and a membership report is sent, which is received by the router and every host.

See Next Slide

Example 1 (Continued)

Info

rmatio

n a

nd

C

om

munica

tion e

ng

ineerin

g

(ICE)

MUT

d. Time 70: The timer for 230.43.0.0 in host C expires and a membership report is sent, which is received by the router and every host including host A which cancels its timerfor 230.43.0.0.

Note that if each host had sent a report for every group in its list, there would have been seven reports; with this strategy only four reports are sent.

Example 1 (Continued)

Info

rmatio

n a

nd

C

om

munica

tion e

ng

ineerin

g

(ICE)

MUT

The IGMP message is encapsulated in an IP datagram, which is itself The IGMP message is encapsulated in an IP datagram, which is itself encapsulated in a frame. encapsulated in a frame.


IP LayerIP LayerData Link LayerData Link LayerNetstat UtilityNetstat Utility

ENCAPSULATION

Info

rmatio

n a

nd

C

om

munica

tion e

ng

ineerin

g

(ICE)

MUT

Encapsulation of IGMP packet

Info

rmatio

n a

nd

C

om

munica

tion e

ng

ineerin

g

(ICE)

MUT

The IP packet that carries an IGMP packet has a value of 2 in its

protocol field.

Note:Note:

Info

rmatio

n a

nd

C

om

munica

tion e

ng

ineerin

g

(ICE)

MUT

The IP packet that carries an IGMP packet has a value of 1 in its

TTL field.

Note:Note:

Info

rmatio

n a

nd

C

om

munica

tion e

ng

ineerin

g

(ICE)

MUT

Destination IP addressesDestination IP addresses

Info

rmatio

n a

nd

C

om

munica

tion e

ng

ineerin

g

(ICE)

MUT

Mapping class D to Ethernet physical

address0Class A

10Class B

110Class C

1110Class D

1111Class E

0 to 127Class A

128 to 191Class B

192 to 223Class C

224 to 239Class D

240 to 255Class E

First Byte Second Byte Third Byte Fourth Byte

Multicast IP Address

Multicast IP Address

Info

rmatio

n a

nd

C

om

munica

tion e

ng

ineerin

g

(ICE)

MUT

An Ethernet multicast physical address is in the range

01:00:5E:00:00:00 to

01:00:5E:7F:FF:FF.

Note:Note:

Info

rmatio

n a

nd

C

om

munica

tion e

ng

ineerin

g

(ICE)

MUT

Change the multicast IP address 230.43.14.7 to an Ethernet multicast physical

SolutionWe can do this in two steps:a. We write the rightmost 23 bits of the IP address in hexadecimal. This can be done by changing the rightmost 3 bytes to hexadecimal and then subtracting 8 from the leftmost digit if it is greater than or equal to 8. In our example, the result is 2B:0E:07.

b. We add the result of part a to the starting Ethernet multicast address, which is (01:00:5E:00:00:00). The result is

01:00:5E:2B:0E:07

Example 2

Info

rmatio

n a

nd

C

om

munica

tion e

ng

ineerin

g

(ICE)

MUT

Change the multicast IP address 238.212.24.9 to an Ethernet multicast address.

Solution

a. The right-most three bytes in hexadecimal are D4:18:09. We need to subtract 8 from the leftmost digit, resulting in 54:18:09..

b. We add the result of part a to the Ethernet multicast starting address. The result is

01:00:5E:54:18:09

Example 3

Info

rmatio

n a

nd

C

om

munica

tion e

ng

ineerin

g

(ICE)

MUT

Tunneling

For WAN, there is no physical multicast support

Info

rmatio

n a

nd

C

om

munica

tion e

ng

ineerin

g

(ICE)

MUT

We use netstat with three options, -n, -r, and -a. The -n option gives the numeric versions of IP addresses, the -r option gives the routing table, and the -a option gives all addresses (unicast and multicast). Note that we show only the fields relative to our discussion.

$ netstat -nraKernel IP routing tableDestination Gateway Mask Flags Iface153.18.16.0 0.0.0.0 255.255.240.0 U eth0169.254.0.0 0.0.0.0 255.255.0.0 U eth0127.0.0.0 0.0.0.0 255.0.0.0 U lo224.0.0.0 0.0.0.0 224.0.0.0 U eth00.0.0.0 153.18.31.254 0.0.0.0 UG eth0

Any packet with a multicast address from 224.0.0.0 to 239.255.255.255 is masked and delivered to the Ethernet interface.

Example 4

Info

rmatio

n a

nd

C

om

munica

tion e

ng

ineerin

g

(ICE)

MUT

We can show how IGMP can handle the sending and receiving of IGMP We can show how IGMP can handle the sending and receiving of IGMP packets through our simplified version of an IGMP package. In our packets through our simplified version of an IGMP package. In our design an IGMP package involves a group table, a set of timers, and design an IGMP package involves a group table, a set of timers, and four software modules.four software modules.


Group TableGroup TableTimersTimersGroup-Joining ModuleGroup-Joining ModuleGroup-Leaving ModuleGroup-Leaving ModuleInput ModuleInput ModuleOutput ModuleOutput Module

IGMP PACKAGE

Info

rmatio

n a

nd

C

om

munica

tion e

ng

ineerin

g

(ICE)

MUT

IGMP package

Info

rmatio

n a

nd

C

om

munica

tion e

ng

ineerin

g

(ICE)

MUT

Group table

States:

Free: There are no process left in the group

Delaying: There is timer for for sending a report

Idle: There is no timer

Reference count: The number of process still interested in the group

Info

rmatio

n a

nd

C

om

munica

tion e

ng

ineerin

g

(ICE)

MUT

Group-Joining Module

• Receive: a request from a process to join a group

1. Look for the corresponding entry in the table2. If (found)

1. Increment the reference count

3. If (not found)1. Create an entry with reference count set one2. Add the entry to the table3. Request a membership report from the output module4. Inform the data link layer to update its configuration

table

4. Return

Info

rmatio

n a

nd

C

om

munica

tion e

ng

ineerin

g

(ICE)

MUT

Group-Leaving Module

• Receive: a request from a process to leave a group

1. Look for the corresponding entry in the table2. If (found)

1. Decrease the reference count 2. If (reference count is zero)

1. If(any timer for this entry)1. Cancel the timer

2. Change state to free3. Request a leave report from the output module

3. Return

Info

rmatio

n a

nd

C

om

munica

tion e

ng

ineerin

g

(ICE)

MUT

Input Module

• Receive: an IGMP message1. Check the message type2. If (query)

1. Start a timer for each entry in the table with the state IDLE

2. Change each IDLE state to Delaying3. Return

3. If (membership report)1. Look for the corresponding entry in the table2. If (found any state is Delaying)

1. Cancel the timer for the entry2. Change the state to IDLE

4. Return

Info

rmatio

n a

nd

C

om

munica

tion e

ng

ineerin

g

(ICE)

MUT

Output Module• Receive: a signal from a timer or a request from

joining or leaving module1. If the message comes from a timer

1. If (found and state is DELAYING)1. Create a member ship report. 2. Reset the state to IDLE

2. If the message comes from the group-joining module

1. Create a membership report3. If the message comes from the group-leaving

module1. Create a leave report

4. Send the message5. Return

Info

rmatio

n a

nd

C

om

munica

tion e

ng

ineerin

g

(ICE)

MUT

Multicasting

• Multicast Applications• Group Management ProtocolsGroup Management ProtocolsMulticast Routing Algorithms• Multicast Routing Protocols

Info

rmatio

n a

nd

C

om

munica

tion e

ng

ineerin

g

(ICE)

MUT

Multicast Routing algorithms

• Source-based tree– Multicast link state routing– Multicast Distance Vector routing

• Group-based tree

Info

rmatio

n a

nd

C

om

munica

tion e

ng

ineerin

g

(ICE)

MUT

Unicasting

Info

rmatio

n a

nd

C

om

munica

tion e

ng

ineerin

g

(ICE)

MUT

In unicasting, the router forwards the received packet through only

one of its interfaces.

Note:Note:

Info

rmatio

n a

nd

C

om

munica

tion e

ng

ineerin

g

(ICE)

MUT

Multicasting

Info

rmatio

n a

nd

C

om

munica

tion e

ng

ineerin

g

(ICE)

MUT

In multicasting, the router may forward the received packet

through several of its interfaces.

Note:Note:

Info

rmatio

n a

nd

C

om

munica

tion e

ng

ineerin

g

(ICE)

MUT

Multicasting versus multiple unicasting

Info

rmatio

n a

nd

C

om

munica

tion e

ng

ineerin

g

(ICE)

MUT

Emulation of multicasting through multiple unicasting is not efficient and

may create long delays, particularly with a large group.

Note:Note:

Info

rmatio

n a

nd

C

om

munica

tion e

ng

ineerin

g

(ICE)

MUT

Multicasting has many applications today such as access to distributed Multicasting has many applications today such as access to distributed databases, information dissemination, teleconferencing, and distance databases, information dissemination, teleconferencing, and distance learning.learning.


Access to Distributed Databases Access to Distributed Databases Information Dissemination Information Dissemination Dissemination of News Dissemination of News Teleconferencing Teleconferencing Distance Learning Distance Learning

Multicasting versus multiple unicasting

Info

rmatio

n a

nd

C

om

munica

tion e

ng

ineerin

g

(ICE)

MUT

In this section, we first discuss the idea of optimal routing, common in In this section, we first discuss the idea of optimal routing, common in all multicast protocols. We then give an overview of multicast routing all multicast protocols. We then give an overview of multicast routing protocols. protocols.


Optimal Routing: Shortest Path Trees Optimal Routing: Shortest Path Trees Routing Protocols Routing Protocols

MULTICAST ROUTING

Info

rmatio

n a

nd

C

om

munica

tion e

ng

ineerin

g

(ICE)

MUT

In unicast routing, each router in the domain has a table that defines a

shortest path tree to possible destinations.

Note:Note:

Info

rmatio

n a

nd

C

om

munica

tion e

ng

ineerin

g

(ICE)

MUT

Shortest path tree in unicast routing

Info

rmatio

n a

nd

C

om

munica

tion e

ng

ineerin

g

(ICE)

MUT

In multicast routing, each involved router needs to construct a shortest

path tree for each group.

Note:Note:

Info

rmatio

n a

nd

C

om

munica

tion e

ng

ineerin

g

(ICE)

MUT

In the source-based tree approach, each router needs to have one shortest

path tree for each group.

Note:Note:

Info

rmatio

n a

nd

C

om

munica

tion e

ng

ineerin

g

(ICE)

MUT

Source-based tree approach

Info

rmatio

n a

nd

C

om

munica

tion e

ng

ineerin

g

(ICE)

MUT

Group-shared tree approach

Info

rmatio

n a

nd

C

om

munica

tion e

ng

ineerin

g

(ICE)

MUT

In the group-shared tree approach, only the core router, which has a

shortest path tree for each group, is involved in multicasting.

Note:Note:

Info

rmatio

n a

nd

C

om

munica

tion e

ng

ineerin

g

(ICE)

MUT

Multicasting

• Multicast Applications• Group Management ProtocolsGroup Management Protocols• Multicast Routing AlgorithmMulticast Routing Protocols

Info

rmatio

n a

nd

C

om

munica

tion e

ng

ineerin

g

(ICE)

MUT

Taxonomy of common multicast protocols

Info

rmatio

n a

nd

C

om

munica

tion e

ng

ineerin

g

(ICE)

MUT

In this section, we briefly discuss multicast link state routing and its In this section, we briefly discuss multicast link state routing and its implementation in the Internet, MOSPF. implementation in the Internet, MOSPF.


Multicast Link State Routing Multicast Link State Routing MOSPF MOSPF

MULTICAST LINK STATE ROUTING: MOSPF

Info

rmatio

n a

nd

C

om

munica

tion e

ng

ineerin

g

(ICE)

MUT

Multicast link state routing uses the source-based tree approach.

Note:Note:

Info

rmatio

n a

nd

C

om

munica

tion e

ng

ineerin

g

(ICE)

MUT

In this section, we briefly discuss multicast distance vector routing and In this section, we briefly discuss multicast distance vector routing and its implementation in the Internet, DVMRP. its implementation in the Internet, DVMRP.


Multicast Distance Vector Routing Multicast Distance Vector Routing DVMRPDVMRP

MULTICAST DISTANCE VECTOR: DVMRP

Info

rmatio

n a

nd

C

om

munica

tion e

ng

ineerin

g

(ICE)

MUT

Flooding broadcasts packets, but creates loops in the systems.

Note:Note:

Info

rmatio

n a

nd

C

om

munica

tion e

ng

ineerin

g

(ICE)

MUT

RPF eliminates the loop in the flooding process.

Note:Note:

Info

rmatio

n a

nd

C

om

munica

tion e

ng

ineerin

g

(ICE)

MUT

RPF

Info

rmatio

n a

nd

C

om

munica

tion e

ng

ineerin

g

(ICE)

MUT

Problem with RPF

Info

rmatio

n a

nd

C

om

munica

tion e

ng

ineerin

g

(ICE)

MUT

RPF versus RPB

Info

rmatio

n a

nd

C

om

munica

tion e

ng

ineerin

g

(ICE)

MUT

RPB creates a shortest path broadcast tree from the source to each destination.

It guarantees that each destination receives one and only one

copy of the packet.

Note:Note:

Info

rmatio

n a

nd

C

om

munica

tion e

ng

ineerin

g

(ICE)

MUT

RPF, RPB, and RPM

Info

rmatio

n a

nd

C

om

munica

tion e

ng

ineerin

g

(ICE)

MUT

RPM adds pruning and grafting to RPB to create a multicast shortest path

tree that supports dynamic membership changes.

Note:Note:

Info

rmatio

n a

nd

C

om

munica

tion e

ng

ineerin

g

(ICE)

MUT

The Core-Based Tree (CBT) protocol is a group-shared protocol that The Core-Based Tree (CBT) protocol is a group-shared protocol that uses a core as the root of the tree. The autonomous system is divided into uses a core as the root of the tree. The autonomous system is divided into regions and a core (center router or rendezvous router) is chosen for regions and a core (center router or rendezvous router) is chosen for each region. each region.


Formation of the Tree Formation of the Tree Sending Multicast Packets Sending Multicast Packets Selecting the Rendezvous Router Selecting the Rendezvous Router

CBT

Info

rmatio

n a

nd

C

om

munica

tion e

ng

ineerin

g

(ICE)

MUT

Group-shared tree with rendezvous router

Info

rmatio

n a

nd

C

om

munica

tion e

ng

ineerin

g

(ICE)

MUT

Sending a multicast packet to the rendezvous

router

Info

rmatio

n a

nd

C

om

munica

tion e

ng

ineerin

g

(ICE)

MUT

In CBT, the source sends the multicast packet (encapsulated in a unicast packet)

to the core router.

The core router decapsulates the packet and forwards it to all interested

interfaces.

Note:Note:

Info

rmatio

n a

nd

C

om

munica

tion e

ng

ineerin

g

(ICE)

MUT

Protocol Independent Multicast (PIM) is the name given to two Protocol Independent Multicast (PIM) is the name given to two independent multicast routing protocols: Protocol Independent independent multicast routing protocols: Protocol Independent Multicast, Dense Mode (PIM-DM) and Protocol Independent Multicast, Multicast, Dense Mode (PIM-DM) and Protocol Independent Multicast, Sparse Mode (PIM-SM). Sparse Mode (PIM-SM).


PIM-DM PIM-DM PIM-SM PIM-SM

PIM

Info

rmatio

n a

nd

C

om

munica

tion e

ng

ineerin

g

(ICE)

MUT

PIM-DM is used in a dense multicast environment, such as a LAN.

Note:Note:

Info

rmatio

n a

nd

C

om

munica

tion e

ng

ineerin

g

(ICE)

MUT

PIM-DM uses RPF and pruning/grafting strategies to handle

multicasting.

However, it is independent from the underlying unicast protocol.

Note:Note:

Info

rmatio

n a

nd

C

om

munica

tion e

ng

ineerin

g

(ICE)

MUT

PIM-SM is used in a sparse multicast environment such as a WAN.

Note:Note:

Info

rmatio

n a

nd

C

om

munica

tion e

ng

ineerin

g

(ICE)

MUT

PIM-SM is similar to CBT but uses a simpler procedure.

Note:Note:

Info

rmatio

n a

nd

C

om

munica

tion e

ng

ineerin

g

(ICE)

MUT

A multicast router may not find another multicast router in the A multicast router may not find another multicast router in the neighborhood to forward the multicast packet. A solution for this neighborhood to forward the multicast packet. A solution for this problem is tunneling. We make a multicast backbone (MBONE) out of problem is tunneling. We make a multicast backbone (MBONE) out of these isolated routers using the concept of tunneling.these isolated routers using the concept of tunneling.

MBONE

Info

rmatio

n a

nd

C

om

munica

tion e

ng

ineerin

g

(ICE)

MUT

Logical tunneling

Info

rmatio

n a

nd

C

om

munica

tion e

ng

ineerin

g

(ICE)

MUT

MBONE

Info

rmatio

n a

nd

C

om

munica

tion e

ng

ineerin

g

(ICE)

MUT

Multicast Routing between Domains

• Multicast Source Discovery Protocol (MSDP)

• Border Gateway Multicast Protocol (BGMP)

Info

rmatio

n a

nd

C

om

munica

tion e

ng

ineerin

g

(ICE)

MUT

Summary

• Group Management• Multicast Routing Algorithms• Multicast Routing Protocols

Info

rmatio

n a

nd

C

om

munica

tion e

ng

ineerin

g

(ICE)

MUT

One more test

• LAN (Local Area Networks) ( Student Presentation, 26/08/2549)– Ethernet, Fast Ethernet, Gigabit Ethernet

• PPP (Point-to-Point) WANs( Student Presentation, 26/08/2549)– DSL, ADSL, VDSL, HDSL, SDSL– DATA Link layers (PPP, PPPoE)

• Switching and VLAN( Lecture X, 2/09/2549)

Documents

ITEC4610 Network Switching and Routing