HW1F11 - Homework Assignment #1 Due 9/19 at 5:00pm EE122...

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

View Full Document Right Arrow Icon
1 Homework Assignment #1 Due 9/19 at 5:00pm EE122 Fall 2011 Please submit your solutions using BSpace ( https://bspace.berkeley.edu/ ). Log in to BSpace with your CalNet ID, click on the EL ENG 122 Fa11 tab, and click on Assignments under Course Tools. Assignments should be submitted in one of the following formats: .txt, .pdf, or .ps. Note: this first homework assignment is more about teaching than testing. You should be able to work out the answers without knowing very much a priori, but in so doing I hope you learn something about the material. We will be generous with help on this assignment, so please make full use of office hours (particularly Scott’s, since he’s the one responsible for any mistakes in the assignment). Good Luck! 1) General Information [5 points] You are expected to look these answers up online! For each of the following acronyms (all of which relate to the governance to the Internet), please provide an expansion of the acronym and a one sentence description of what role it plays in the Internet. (a) IETF: expansion, description (b) ICANN: expansion, description (c) IRTF: expansion, description (d) IAB: expansion, description (e) RFC: expansion, description Bonus Question: From what room, at what time, and typed by whom were the first keystrokes carried over the ARPANET. 2) Statistical Multiplexing [15 points] Consider a system where time is divided into “frames”, and each frame is divided into “slots”. These slots are allocated to flows (i.e., flow A might get the third slot in each frame). We consider the case where these allocations are done either individually (slots are given to specific flows) or in groups (slots are assigned to a group of flows, and a packet from any flow in the group can use one of the assigned slots).
Background image of page 1

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

View Full DocumentRight Arrow Icon
2 When the flows are each given one slot per frame, any frame in which a flow sends more than one packet results in the excess packet(s) being dropped. When n flows share their slots, any frame in which the flows collectively send more than n packets in a frame results in the excess packet(s) being dropped. We consider a set of flows that all have the following identical probabilistic sending behavior: in each frame, a flow sends, with equal probability, either zero, one, or two packets. That is, with probability 1/3 rd it sends zero packets, with probability 1/3 rd it sends one packet, and with probability 1/3 rd it sends two packets. We now consider the following four cases: i) n=1: consider the case where each flow gets a single slot per frame. What fraction of its packets is dropped?
Background image of page 2
Image of page 3
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 01/09/2012 for the course ELECTRICAL 122 taught by Professor Shenker during the Spring '11 term at University of California, Berkeley.

Page1 / 6

HW1F11 - Homework Assignment #1 Due 9/19 at 5:00pm EE122...

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

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