MIT6_042JF10_rec10_sol

MIT6_042JF10_rec10_sol - 6.042/18.062J Mathematics for...

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

View Full Document Right Arrow Icon

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

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

Unformatted text preview: 6.042/18.062J Mathematics for Computer Science October 13, 2010 Tom Leighton and Marten van Dijk Notes for Recitation 10 Analysis of Two Networks Two communication networks are shown below. Complete the table of properties and be prepared to justify your answers. IN IN IN IN OUT OUT OUT OUT 1 2 2 3 3 1 5-Path 4-Cycle network # switches switch size diameter max congestion 5-path 5 3 3 6 5 4-cycle 4 3 3 4 3 Recall that the diameter of a communication network is the number of edges on the shortest path between the input and output that are farthest apart. The max congestion of a network is the largest number of packets that pass through any switch in the best solution to the hardest permutation routing problem. You might imagine that your enemy picks a permutation and then you pick the path taken by each packet. (Her goal is to cause congestion, and yours is to eliminate it.) Assuming you both do your best, the max congestion is then equal to the largest number of packets passing through a single switch....
View Full Document

This note was uploaded on 01/19/2012 for the course CS 6.042J / 1 taught by Professor Tomleighton,dr.martenvandijk during the Fall '10 term at MIT.

Page1 / 7

MIT6_042JF10_rec10_sol - 6.042/18.062J Mathematics for...

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

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