Lecture19

Lecture19 - Lecture 19 Broadcast routing Eytan Modiano...

Info iconThis preview shows pages 1–8. Sign up to view the full content.

View Full Document Right Arrow Icon
Lecture 19 Broadcast routing Eytan Modiano Eytan Modiano Slide 1
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Broadcast Routing Route a packet from a source to all nodes in the network Possible solutions: Flooding: Each node sends packet on all outgoing links Discard packets received a second time Spanning Tree Routing: Send packet along a tree that includes all of the nodes in the network Eytan Modiano Slide 2
Background image of page 2
Graphs A graph G = (N,A) is a finite nonempty set of nodes and a set of node pairs A called arcs (or links or edges) 1 2 3 1 2 3 4 N = {1,2,3} N = {1,2,3,4} A = {(1,2),(2,3),(1,4),(2,4)} A = {(1,2)} Eytan Modiano Slide 3
Background image of page 3

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Walks and paths A walk is a sequence of nodes (n1, n2, . ..,nk) in which each adjacent node pair is an arc. A path is a walk with no repeated nodes. 1 2 4 3 1 2 4 3 Walk (1,2,3,4,2) Path (1,2,3,4) Eytan Modiano Slide 4
Background image of page 4
Cycles A cycle is a walk (n1, n2,. ..,nk) with n1 = nk, k>3, and with no repeated nodes except n1 = nk Cycle (1,2,4,3,1) 1 2 4 3 Eytan Modiano Slide 5
Background image of page 5

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Connected graph A graph is connected if a path exists between each pair of nodes. 1 2 4 3 1 2 3 Connected Unconnected An unconnected graph can be separated into two or more connected components. Eytan Modiano Slide 6
Background image of page 6
Acyclic graphs and trees An acyclic graph is a graph with no cycles. A tree is an acyclic connected graph. 1 2 4 3 1 2 3 1 2 3 Acyclic, unconnected Cyclic, connected not tree not tree The number of arcs in a tree is always one less than the number of nodes Proof: start with arbitrary node and each time you add an arc you add a node
Background image of page 7

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Image of page 8
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 11/07/2011 for the course AERO 16.26 taught by Professor Dimitribertsekas during the Fall '02 term at MIT.

Page1 / 17

Lecture19 - Lecture 19 Broadcast routing Eytan Modiano...

This preview shows document pages 1 - 8. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online