hw7 - as far apart as possible You can choose as many...

Info iconThis preview shows page 1. Sign up to view the full content.

View Full Document Right Arrow Icon
CS 118 Spring 2008 : Homework 7 Problem 1 Figure 1: Binary tree Problem 1 Let’s 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. Let’s 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
Background image of page 1
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: as far apart as possible? You can choose as many routers as you like. Problem 2 If you have a generator 4-bit: G = 1001 and a message: M(x) = 10101010, what is the value of R? What will a sender send over the wire? Problem 3 If a packet has the the bit pattern: 1010101010101011 and even parity is used. What is the value of the checksum eld when a 2-dimensional parity scheme is used? Your answer should be such that the minimum-length checksum eld is used. Problem 4 With CSMA/CD protocol, the adapter waits k 512 bit times after a collision, here K is drawn randomly. For K = 100, how long does the adapter wait until returning to Step 2 for a 10 Mbps Ethernet? For a 100 Mbps Ethernet? Page 1 of 1...
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.

Ask a homework question - tutors are online