This preview shows pages 1–2. Sign up to view the full content.
This preview has intentionally blurred sections. Sign up to view the full version.View Full Document
Unformatted text preview: CS 118 Spring 2008 : Homework 7 Problem 1 Figure 1: Binary tree Problem 1 Lets start with 2 ways of doing network-wide broadcasting: unicasting each message to each destination, and network-layer assisted (i.e. routers help). Suppose a spanning-tree broadcast is used to achieve network-layer broadcast. Lets suppose that there is a single sender and 32 receivers. Suppose the sender is connected to the receivers through a binary tree of routers as shown in Figure 1. What is the cost of sending a broadcast packet, in the cases of unicasting and network-layer broadcasting for this topology? Here, each time a packet (or copy of a packet) is sent over a single link, it incurs a unit of cost. What topology for interconnecting the sender, receivers, and routers will bring the cost of unicast emulation and true network-layer broadcast as far apart as possible? You can choose as many routers as you like....
View Full Document
This note was uploaded on 04/28/2010 for the course CS 118 taught by Professor Chu during the Spring '08 term at UCLA.
- Spring '08