# Register now to access 7 million high quality study materials (What's Course Hero?) Course Hero is the premier provider of high quality online educational resources. With millions of study documents, online tutors, digital flashcards and free courseware, Course Hero is helping students learn more efficiently and effectively. Whether you're interested in exploring new subjects or mastering key topics for your next exam, Course Hero has the tools you need to achieve your goals.

1 Page

### CS438-HW5

Course: CS 438, Spring 2008
School: University of Illinois,...
Rating:

Word Count: 445

#### Document Preview

438: CS/ECE Communication Networks Problem Set 5 1. Slow Start Fall 2007 Due Wednesday, Dec 5 Assume a connection with RTT=50ms, MSS=1000 bytes. Ignoring overhead spent on headers, calculate the transfer time and the eective throughput for transferring a 1 MB le. Assume there are no losses and that both the connection bandwidth and the receiver window are innite (and in particular, not limited to 64K). (a)...

Register Now

#### Unformatted Document Excerpt

Coursehero >> Illinois >> University of Illinois, Urbana Champaign >> CS 438

Course Hero has millions of student submitted documents similar to the one
below including study guides, practice problems, reference materials, practice exams, textbook help and tutor support.

Course Hero has millions of student submitted documents similar to the one below including study guides, practice problems, reference materials, practice exams, textbook help and tutor support.
438: CS/ECE Communication Networks Problem Set 5 1. Slow Start Fall 2007 Due Wednesday, Dec 5 Assume a connection with RTT=50ms, MSS=1000 bytes. Ignoring overhead spent on headers, calculate the transfer time and the eective throughput for transferring a 1 MB le. Assume there are no losses and that both the connection bandwidth and the receiver window are innite (and in particular, not limited to 64K). (a) Calculate the transfer time and eective throughput for TCP using slow start. (b) Calculate the transfer time and eective throughput supposing TCP used additive increase, starting with a window size of 1 MSS and increasing it by 1 MSS every RTT. 2. TCP Fairness Suppose there are two connections, A and B, sharing a 14 Kbit link. Let us simplify the TCP congestion control protocol to include the following assumptions: 1 MSS = 1000 bits the two connections increase their window sizes by 1 MSS per RTT, in lock-step, whenever their aggregate bandwidth is less than or equal to 14 Kbits when the aggregate bandwidth is greater than 14 Kbits, both connections simultaneously decrease their window size to 1/2 of the previous size. The window is rounded up to the next MSS size. (a) Suppose As window is currently 13000 bits and Bs window is 1000 bits, and both their RTTs are 1s. Show how the window sizes change after 20s Suppose (b) A and B both have a window of 1000 bits, A has RTT of 1s and B has RTT of 2s. Show how the window sizes change after 20s. (Assume that whenever the aggregate bandwidth exceeds 14 Kbit, the next window of each of the connection will be cut in half.) 3. Fair Queueing Consider the following packet arrivals: Flow 1 A:4, B:6, C:7, D:1, E:4 Flow 2 F:7, G:5, H:3, I:4, J:1 Flow 3 K:4, L:5, M:1, N:2, O:7, P:3 Flow 4 Q:4, R:1, S:2, T:3, U:5, V:2, W:6 Assume that at the current time, all the packets have arrived and are now sitting in the per-ow queues. The number after the colon is the size of the packet, so packet A is 5 units in size. (a) List the order of departure of these packets under the packetized weighted fair queuing scheme, with equal weights for each ow. Break ties by going...

Find millions of documents on Course Hero - Study Guides, Lecture Notes, Reference Materials, Practice Exams and more. Course Hero has millions of course specific materials providing students with the best way to expand their education.

Below is a small sample set of documents:

University of Illinois, Urbana Champaign - CS - 411
CS411 Database SystemsFall 2007HW#1Due: 3:00pm CST, 09/26/07Note: Print your name and NetID in the upper right corner of every page of your submission. Handin your stapled homework to Donna Coleman in 2120 SC. In case Donna is not in oce, slide
University of Illinois, Urbana Champaign - CS - 425
CS 425 Distributed Systems, Fall 2007, University of Illinois at Urbana-ChampaignMachine Problem 0 - TutorialDue Date - NoneOverviewThe machine programming (MP) part of the course this semester involves building a peer to peer application. We w
University of Illinois, Urbana Champaign - CS - 473
CS 473U: Algorithms, Fall 2007 Review and Practice Problems for Finals1. Recurrences and growth of functions. Review the problems in the homeworks and in midterm 1 and see if you can solve them now (without looking at the solutions!). 2. Problems 4.
University of Illinois, Urbana Champaign - CS - 373
CS 373: Theory of ComputationAssigned: October 16, 2008 Due on: October 23, 2008Problem Set 6Instructions: This homework has two parts. The rst part has practice problems from the textbook many of whose solutions can be found in the textbook its
University of Illinois, Urbana Champaign - CS - 373
Problem Set 2CS 373: Theory of ComputationAssigned: September 11, 2008 Due on: September 18, 2008Instructions: This homework has two parts. The rst part has practice problems from the textbook many of whose solutions can be found in the textbook
University of Illinois, Urbana Champaign - CS - 373
CS 373: Theory of ComputationAssigned: October 23, 2008 Due on: October 30, 2008Problem Set 6Instructions: This homework has two parts. The rst part has practice problems from the textbook many of whose solutions can be found in the textbook its
University of Illinois, Urbana Champaign - CS - 373
Problem Set 7CS 373: Theory of ComputationAssigned: October 23, 2008 Due on: October 30, 2008Instructions: This homework has two parts. The rst part has practice problems from the textbook many of whose solutions can be found in the textbook itse
University of Illinois, Urbana Champaign - CS - 440
Searching as Problem SolvingExample of Analytic Models(slightly more standard than textbook) N.B.: Lectures supercede textbook! World State Operators Preconditions Effects Goal Initial Stateattributes mechanism of change of operators of o
University of Illinois, Urbana Champaign - CS - 440
Issues The role of search What if we guess wrong about resolvents? Are there heuristics? Input / Unit Resolution Horn Clauses - PROLOG Completeness and refutational inferenceFrom Unsatisfiability to Returning AnswersSuppose that instead of
University of Illinois, Urbana Champaign - CS - 440
Admissibility of A*Some authors use A if not met 1) n n nodes, o operators with o(n)n h(n) cost(n,o,n) + h(n) Montonicity or Consistency (triangle inequality)Admissibility of A* (cont)2) n nodes h(n) h*(n) Informally: be optimistic (Why? Cou
University of Illinois, Urbana Champaign - CS - 440
CS 440: Introduction to AIHomework 2 Due: Tuesday, September 30th, 2008Your answers must be concise and clear. Explain suciently that we can easily determine what you understand. We will give more points for a brief interesting discussion with no a
University of Illinois, Urbana Champaign - CS - 440
The Infamous Dr. Bayes(or is logical inference really so bad?) Dr. Bayes has a statistics degree (not an MD) He makes diagnoses using his rule and other notions from statistics A plague has descended; there are two treatments: A and B He has tr
University of Illinois, Urbana Champaign - CS - 440
CS440: Introduction to AIHomework 4 Due: Thursday, November 13th, 2008Your answers must be concise and clear. Explain suciently that we can easily determine what you understand. We will give more points for a brief interesting discussion with no an
University of Illinois, Urbana Champaign - CS - 440
Midterm Exam October 7, in class A week from today! Search, Logic, Planning Unofficial sample midterms on web site Start reading Markov decision process &amp; reinforcement learning Chapters 17 &amp; 21Situation CalculusFOPC with some additional
University of Illinois, Urbana Champaign - CS - 440
Next: Appling Hybrid Models Beyond Planning Read Chapters 13 and 14 Uncertainty, Statistics, Probabilistic Reasoning Todays office hours 2-3 (not 3:30)Value Iterationsometimes TD for Temporal DifferencingUpdate:U ( s ) U ( s ) + rs +
University of Illinois, Urbana Champaign - CS - 440
Notation W, C, D, A, B are random variables C (binary presence of cavity) ranges over values Cs values might be Yes or No; 1 or 0; c1 or c2 Probability distribution: P(C) Probability value: P(C=c1) or P(c1) or P(c) P(A,B,C,W,D) full joint prob
University of Illinois, Urbana Champaign - CS - 440
CS 440: Introduction to AIHomework 1 Due: Tuesday September 9thYour answers must be concise and clear. Explain suciently that we can easily determine what you understand. We will give more points for a brief interesting discussion with no answer th
University of Illinois, Urbana Champaign - CS - 440
CS440 is my favorite classThere is some amount that I like CS440 and I like all other classes lessz w [Class(w) Name(w,CS440) Likes(Me,w,z) x y {[Class(x) Likes(Me,x,y) Different(x,w)] Greater(z,y)}] Likes(a,b,c) means a likes b by amount c G
University of Illinois, Urbana Champaign - CS - 440
Relevant TalkCoordinated Management of Multiple Interacting Resources on Chip Multiprocessors Jos Martnez, Cornell University November 17 (Monday), 4:00 p.m., 1404 Siebel Ph.D. Here w/ Torrellas, seen the light &amp; now uses machine learning: Artificia
University of Illinois, Urbana Champaign - CS - 440
Announcements Homework 2: logic, representation, inference Became available over the weekend Due Sept. 30 (one week from today) Its a bit long dont wait! You are reading Chapters 11 &amp; 12 (planning &amp; action) I know of a few projects (but not m
University of Illinois, Urbana Champaign - CS - 440
Announcements Final 7-8:15 PM, 12/16 here Projects (for 4th unit) due today Thursday 12:30, Q/A session 1105 SC (not here) Previous final exams on web siteAgnostic Learning Same thing but no guarantee h*H Possibly, no h is consistent over S
University of Illinois, Urbana Champaign - CS - 440
CS 440: Introduction to AIHomework 1 Due: Tuesday September 9thYour answers must be concise and clear. Explain suciently that we can easily determine what you understand. We will give more points for a brief interesting discussion with no answer th
University of Illinois, Urbana Champaign - CS - 440
CS440: Introduction to AIHomework 4 Due: Thursday, November 13th, 2008Your answers must be concise and clear. Explain suciently that we can easily determine what you understand. We will give more points for a brief interesting discussion with no an
University of Illinois, Urbana Champaign - CS - 440
Machine Problem 1* Group work (4-5 members) Start immediately; hard (but easy programming) Email ta440@cs.uiuc.edu for Help forming groups An EWS account (no Eng major in group) 2 Parts, due 10/28 and 11/4 (election day!)* FINE PRINT: Althoug
University of Illinois, Urbana Champaign - CS - 440
Search Useful by themselves they re-emerge often in AI Mostly (for us) a first illustration of World Model Pedagogical Intractable for Hard problems (Hard = ?) Two paradigms (can be combined) Satisfiability OptimizationCould we add an empir
University of Illinois, Urbana Champaign - CS - 440
Announcements Projects (for 4th unit) due class time Tuesday Code Sample runs Paper (what you did, what you learned) Possibility of extension to Friday (ask) HW5 available, practice only Final 7-8:15 PM, 12/16 hereWhy No? Thres
University of Illinois, Urbana Champaign - CS - 373
CS 373: Theory of ComputationAssigned: September 18, 2008 Due on: September 25, 2008Problem Set 3Instructions: This homework has two parts. The rst part has practice problems from the textbook many of whose solutions can be found in the textbook
University of Illinois, Urbana Champaign - CS - 373
CS 373: Theory of ComputationAssigned: November 13, 2008 Problem 1. 3.9 Solution A k-PDA is a pushdown automata with k independent stacks. Each transition in state will push and pop a character from each of the stacks, but otherwise behaves like and
University of Illinois, Urbana Champaign - CS - 241
This lecture Classical Synchronization ProblemsIndranil Gupta (Indy) Goals:Introduce classical synchronization problemsTopicsProducer-Consumer Problem Reader-Writer Problem Dining Philosophers Problem Sleeping Barbers ProblemCopyright : Nahrst
University of Illinois, Urbana Champaign - CS - 373
Midterm 1CS 373: Theory of ComputationDate: Thursday, October 2, 2008. Instructions: This is a closed book exam. No notes, cheat sheets, textbook, or printed material allowed. You have 120 minutes to solve this exam. There are 6 problems in this
University of Illinois, Urbana Champaign - CS - 373
CS 373: Theory of ComputationManoj Prabhakaran Mahesh Viswanathan Fall 2008111.1UndecidabilityRecapDecision Problems and Languages A decision problem requires checking if an input (string) has some property. Thus, a decision problem is a
University of Illinois, Urbana Champaign - CS - 425
Homework 3 (Election, Consensus Problem, Failure Detectors, P2P) - 100 Points SolutionsCS425 Distributed Systems, Fall 2008, Instructor: Klara Nahrstedt 1. (30 Points) Let us assume 8 processes, P1, P2, P3, P4, P5, P6, P7, P8. Let us assume that pro
University of Illinois, Urbana Champaign - CS - 373
CS 273, Fall 2008 Exam 1 SolutionsProblem 1: Short Answer (8 points)The answers to these problems should be short and not complicated. (a) If an NFA M accepts the empty string (i.e., ), does M s start state have to be an accepting state? Why or why
University of Illinois, Urbana Champaign - CS - 498
CS 498 JH: Introduction to NLP (Fall 08)Lecture 12: Discriminative Parsing ModelsThe problem with generative modelsJulia Hockenmaierjuliahmr@illinois.edu 3324 Siebel Center Ofce Hours: Tue, 2:00-3:30pm http:/www.cs.uiuc.edu/class/fa08/cs498jh
University of Illinois, Urbana Champaign - ECE - 428
CS 425 / ECE 428 / CSE 424: Distributed Systems Homework 1 - Due on February 10th , 2009Spring 2009The following problems are assigned from the 4th edition of CDK. 3rd edition users please check with your classmates for corresponding problem numb
University of Illinois, Urbana Champaign - ECE - 428
CS 425 / ECE 428 / CSE 424: Distributed Systems Homework 2 - Due on February 24th , 2009Spring 2009You are encouraged to exchange ideas taught in the course; however, should you discuss any homework problems with others, you should independently
University of Illinois, Urbana Champaign - ECE - 534
ECE 534 RANDOM PROCESSES PROBLEM SET 6FALL 2008 Due Wednesday, November 196. Basic Calculus of Random Processes Assigned Reading: Chapter 7 and Sections 11.3-11.5 of the notes. Reminder: Exam 2, covering lectures, reading, and homework for proble
University of Illinois, Urbana Champaign - ECE - 534
ECE 534 RANDOM PROCESSES PROBLEM SET 2FALL 2008 Due Friday, September 262. Convergence of a Sequence of Random Variables Assigned Reading: Chapter 2 and Sections 11.1-11.2 of the course notes. Additional material on limits for deterministic seque
University of Illinois, Urbana Champaign - ECE - 534
ECE 434 RANDOM PROCESSES PROBLEM SET 2SPRING 2003 Due Wednesday, February 19Sequences of Random Variables Assigned Reading: Chapter 2 and Sections 8.1-8.3 of the course notes. Additional material on limits for deterministic sequences can be found
University of Illinois, Urbana Champaign - ECE - 534
ECE 534 RANDOM PROCESSES PROBLEM SET 6SPRING 2005 Due Wednesday, November 16Random Processes in Linear Systems and Spectral Analysis Assigned Reading: Chapter 6 of the course notes. Reminder: Exam 2 will be given Monday, November 7, 7-8:15 p.m. i
University of Illinois, Urbana Champaign - ECE - 534
ECE 534 RANDOM PROCESSES PROBLEM SET 2 Sequences of Random VariablesFALL 2005 Due September 21Assigned Reading: Chapter 2 and Sections 8.1-8.3 of the course notes. Additional material on limits for deterministic sequences can be found in Kenneth
University of Illinois, Urbana Champaign - ECE - 534
ECE 434 RANDOM PROCESSES PROBLEM SET 3SPRING 2003 Due Wednesday, March 5Random Vectors and Minimum Mean Squared Error Estimation Assigned Reading: Chapter 3 and the section on matrices in the Appendix, in the course notes. Problems to be handed i
University of Illinois, Urbana Champaign - ECE - 534
ECE 434 RANDOM PROCESSES PROBLEM SET 7 Wiener Filtering of Random Processes Assigned Reading: Chapter 7 of the notes.SPRING 2003 Due Wednesday, May 71. Short answer (a) Prove or disprove: If H is a positive-type function then so is H 2 . (b) Prov
University of Illinois, Urbana Champaign - ECE - 534
ECE 534 RANDOM PROCESSES PROBLEM SET 3FALL 2007 Due Wednesday, October 3rdPlease visit the course website: http:/courses.ece.uiuc.edu/ece534/fall07/index.html 3. Random Vectors and Minimum Mean Squared Error EstimationAssigned reading: Chapter
University of Illinois, Urbana Champaign - ECE - 534
ECE 534 RANDOM PROCESSES PROBLEM SET 2FALL 2007 Due Wednesday, September 19thPlease visit the course website: http:/courses.ece.uiuc.edu/ece534/fall07/index.html 2.Convergence of a Sequence of Random VariablesAssigned reading: Chapter 2 and Sec
University of Illinois, Urbana Champaign - ECE - 559
ECE 559BH Distributed Network Algorithms PROBLEM SET 2 Martingales, function computation in simple broadcast networks Reading: See website. Problems to be handed in:SPRING 2006 Due 2/2/161. Two martingales associated with a simple branching proce
University of Illinois, Urbana Champaign - ECE - 559
ECE 559BH Distributed Network Algorithms PROBLEM SET 1SPRING 2006 Due 2/2/6Balls in bins, Chord peer-to-peer lookup service , and BitTorrent le distribution system Reading: Section 3.6 of Motwani and Raghavan, Randomized Algorithms and Chapter 5
University of Illinois, Urbana Champaign - ECE - 559
ECE 559BH Distributed Network Algorithms SOLUTIONS TO PROBLEM SET 1SPRING 20063. Large deviations for the coupon collectors problem Let M be a Possion distributed random variable with mean (1 )n ln n. Then using problem 2, and the fact that the
University of Illinois, Urbana Champaign - ECE - 559
University of Illinois at Urbana-Champaign ECE 559BH: Topics in Communications: Distributed Network AlgorithmsSpring 2006 Final Exam Friday, May 5, 1:30-3:30 p.m.Name: You have 120 minutes for this exam. The exam is open notes and open book. Wri
University of Illinois, Urbana Champaign - ECE - 559
ECE459 Spring 2002Solutions to Homework 11. (a) Since in this case y1 y2 = s one would expect the optimal receiver to have this particular form, with a corresponding probability of error P [E] = 0. Indeed, since the a priori probabilities of the
University of Illinois, Urbana Champaign - ECE - 313
University of IllinoisSpring 2009ECE 313: Problem Set 2 Sets, Events, Axioms of Probability and Their ConsequencesDue: Reading: Noncredit Exercises: Wednesday February 4 at 4 p.m. Ross Chapter 1, Sections 1-4; Chapter 2, Sections 1-5 Powerpoint
University of Illinois, Urbana Champaign - ECE - 313
University of IllinoisSpring 2008ECE 313: Problem Set 3 Axioms of ProbabilityThis Problem Set contains six problems Due: Wednesday February 6 at the beginning of class. Reading: Ross, Chapter 2, Sections 1-5, and Chapter 4 Noncredit Exercises: D
University of Illinois, Urbana Champaign - ECE - 313
University of IllinoisSpring 2005ECE 413: Problem Set 14Due: Wednesday May 4 at the beginning of class. Reading: Ross, Chapter 7, Sections 1-5, Chapter 8, Sections 1-4 Noncredit exercises: Ross Chapter 7: Problems 1, 16, 26, 30 33, 34, 38; Theor
University of Illinois, Urbana Champaign - ECE - 313
University of IllinoisSpring 2005ECE 413: Problem Set 6Due: Wednesday March 9 at the beginning of class. Reading: Ross, Chapters 3, 4, 5, and the notes on decision-making on the class web page This Problem Set contains ve problems 1. In Problem
University of Illinois, Urbana Champaign - ECE - 313
University Problem Set #2 ECE 313 of Illinois Page 1 of 3 Summer 2003 Assigned: Thursday, June 19 Due: Thursday, June 26 Reading: Ross Chapters 2.1-2.5, 4.1-4.6 Noncredit Exercises: (Do not turn these in) Ross Chapter 1: Problems 1-5,7,9; Theoretical
University of Illinois, Urbana Champaign - ECE - 313
University Problem Set #8 ECE 313 of Illinois Page 1 of 2 Spring 2002 Assigned: Wednesday, March 6 Due: Wednesday, March 13 Reading: Ross, Chapter 4, Section 9; and Chapter 5 Noncredit Exercises: Chapter 5: Problems 1-8; Theoretical Exercises: 1, 8 N
University of Illinois, Urbana Champaign - ECE - 313
University Problem Set #14 ECE 313 of Illinois Page 1 of 2 Spring 2002 Assigned: Wednesday, April 24, 2002 Due: Wednesday, May 1, 2002 Reading: Ross, Chapter 7, Sections 1-5; Chapter 8 Sections 1-4 Noncredit Exercises: Chapter 7: Problems 1, 16, 26,
University of Illinois, Urbana Champaign - ECE - 313
University of IllinoisSpring 2005ECE 413: Problem Set 5Due: Reminder: Reading: Noncredit Exercises: Wednesday February 23 at the beginning of class. Hour Exam I is on Monday February 28, 7 p.m. in 269 Everitt Lab. Ross, Chapter 4, Chapter 3 DO N
University of Illinois, Urbana Champaign - ECE - 313
University of IllinoisProblem Set #2 Page 1 of 2ECE 313 Spring 1999Assigned: Wednesday, January 27, 1999 Due: Wednesday, February 3, 1999 Reading: Ross, Chapter 2.1-2.5 and 2.7, Chapter 3 Noncredit Exercises: (Do not turn these in) Ross pp. 54-
University of Illinois, Urbana Champaign - ECE - 313
University Problem Set #8 ECE 313 of Illinois Page 1 of 2 Summer 2003 Assigned: Thursday, July 31 Due: Wednesday, August 6 Reading: Ross Chapters 6.5, 7.1-7.5 Problems: 1. The number of hours R that a student spends reading about probability in prepa
University of Illinois, Urbana Champaign - ECE - 313
University of IllinoisFall 2006ECE 413: Problem Set 6Due: Reading: Reminder: Wednesday October 11 at the beginning of class. Ross, Chapters 3 and 4 HOUR EXAM I: Monday October 9 7:00 p.m. 8:00 p.m., 119 MSB 1 One 8 2 11 sheet of notes permitt