Documents Found!
As seen in
Less Work, Better Grades
Join
Course Hero
Access
best resources
Ace
your classes
Ace your courses with Course Hero!

Submit your homework question or assignment here:
352 Tutors are online
 
We are so confident that you will love our service, we will answer your first homework question for FREE!
*  Attach Assignment (optional):
 
Our current time in (CST) is
 
Study Smarter, Score Higher
View This Document For FREE!
 
Document Content (unformatted)
Course Hero has millions of student submitted documents similar to the one below including study guides, homework solutions, papers, exam answer keys and textbook solutions.
What 25 a UDP/IP Packet Looks Like UDP/IP Packet on Ethernet, no frag: frag: UDP/IP Packet on Ethernet, frag : d: d 26 Why Use UDP? Downsides: no error correction no flow control no congestion control app picks packet size Upsides: no connection establishment or state broadcast/multicast more straightforward app picks packet size 27 Intro to Reliability So, with UDP we basically have IP with port numbers and error detection Would like a way to provide reliable delivery to applications Must deal with: packet drops, duplicates, and damage flow control (overrun at receiver) congestion control (overrun in network) 28 Repairing Errors 8 We have already seen error correcting codes. These are rarely use to repair whole-packet errors (drops) Instead, strategy typical is to re-send data which was lost during transit (lost includes damaged beyond repair) Example of ARQ (Automatic Repeat Request) 29 Simple ARQ: Stop & Wait Agree that a receiver will send an acknowledgement (ACK) to the sender for every packet it receives correctly (e.g. validating checksum) When sender sends packet, also sets a timer If no ACK received before timer expires, sender retransmits the packet 30 31 Stop and Wait Event Plot Stop and Wait Performance Stop and Wait doesn perform very well t How much work is done? one packet every send/ACK cycle so, about 1 packet every round-trip time (RTT) overall throughput is ~ to (1/RTT) degrades significantly as RTT goes up (distance from sender to receiver grows) Next time, will see how to improve this... 9
Find millions of documents here - Study Guides, Homework Solutions, Papers, Exam Answer Keys and more. Course Hero has millions of course related materials that will enable you to learn better, faster and get an A in all your courses.
Below is a small sample set of documents:

Berkeley >> CS >> 122 (Fall, 2008)
EECS 122, Lecture 19 Today Topics: s More on Reliable Delivery Round-Trip Timing Flow Control Intro to Congestion Control Kevin Fall, kfall@cs. berkeley.edu kfall@cs. berkeley. Reliable Delivery Stop and Wait simple ARQ scheme, bad performance de...
Berkeley >> CS >> 19 (Fall, 2008)
EECS 122, Lecture 19 Today Topics: s More on Reliable Delivery Round-Trip Timing Flow Control Intro to Congestion Control Kevin Fall, kfall@cs. berkeley.edu kfall@cs. berkeley. Reliable Delivery Stop and Wait simple ARQ scheme, bad performance de...
Berkeley >> CS >> 122 (Fall, 2008)
1 EECS 122, Lecture 19 Today Topics: s More on Reliable Delivery Round-Trip Timing Flow Control Intro to Congestion Control Kevin Fall, kfall@cs.berkeley.edu kfall@cs.berkeley. 2 Reliable Delivery Stop and Wait simple ARQ scheme, bad performance...
Berkeley >> CS >> 19 (Fall, 2008)
1 EECS 122, Lecture 19 Today Topics: s More on Reliable Delivery Round-Trip Timing Flow Control Intro to Congestion Control Kevin Fall, kfall@cs.berkeley.edu kfall@cs.berkeley. 2 Reliable Delivery Stop and Wait simple ARQ scheme, bad performance...
Berkeley >> CS >> 122 (Fall, 2008)
EECS 122, Lecture 20 Today Topics: s Packet Scheduling Buffer Management Congestion Control Congestion Control Model Reduced model includes: data source(s) data sink the router in front of the slowest link (bottleneck router), its queue and queu...
Berkeley >> CS >> 20 (Fall, 2008)
EECS 122, Lecture 20 Today Topics: s Packet Scheduling Buffer Management Congestion Control Congestion Control Model Reduced model includes: data source(s) data sink the router in front of the slowest link (bottleneck router), its queue and queu...
Berkeley >> CS >> 122 (Fall, 2008)
1 EECS 122, Lecture 20 Today Topics: s Packet Scheduling Buffer Management Congestion Control Kevin Fall, kfall@cs.berkeley.edu kfall@cs.berkeley. 2 Congestion Control Model Reduced model includes: data source(s) data sink the router in front ...
Berkeley >> CS >> 20 (Fall, 2008)
1 EECS 122, Lecture 20 Today Topics: s Packet Scheduling Buffer Management Congestion Control Kevin Fall, kfall@cs.berkeley.edu kfall@cs.berkeley. 2 Congestion Control Model Reduced model includes: data source(s) data sink the router in front ...
Berkeley >> CS >> 122 (Fall, 2008)
EECS 122, Lecture 21 Today Topics: s Congestion Control Metrics TCP Congestion Control Evaluation Criteria - Effectiveness - want to fully utilize links in network, but filling all queues increases end-to-end delay - how to measure throughput/delay ...
Berkeley >> CS >> 21 (Fall, 2008)
EECS 122, Lecture 21 Today Topics: s Congestion Control Metrics TCP Congestion Control Evaluation Criteria - Effectiveness - want to fully utilize links in network, but filling all queues increases end-to-end delay - how to measure throughput/delay ...
Berkeley >> CS >> 122 (Fall, 2008)
1 EECS 122, Lecture 21 Today Topics: s Congestion Control Metrics TCP Congestion Control Kevin Fall, kfall@cs.berkeley.edu kfall@cs.berkeley. 2 Evaluation Criteria - Effectiveness - want to fully utilize links in network, but filling all queues in...
Berkeley >> CS >> 21 (Fall, 2008)
1 EECS 122, Lecture 21 Today Topics: s Congestion Control Metrics TCP Congestion Control Kevin Fall, kfall@cs.berkeley.edu kfall@cs.berkeley. 2 Evaluation Criteria - Effectiveness - want to fully utilize links in network, but filling all queues in...
Berkeley >> CS >> 122 (Fall, 2008)
EECS 122, Lecture 22 Today Topics: s TCP Congestion Control Fast Retransmit Round-Trip Estimation & Time-out Silly Window Syndrome Kevin Fall, kfall@cs. berkeley.edu kfall@cs. berkeley. TCP Slow Start Slow-start is a TCP behavior used to get to pac...
Berkeley >> CS >> 22 (Fall, 2008)
EECS 122, Lecture 22 Today Topics: s TCP Congestion Control Fast Retransmit Round-Trip Estimation & Time-out Silly Window Syndrome Kevin Fall, kfall@cs. berkeley.edu kfall@cs. berkeley. TCP Slow Start Slow-start is a TCP behavior used to get to pac...
Berkeley >> CS >> 122 (Fall, 2008)
1 EECS 122, Lecture 22 Today Topics: s TCP Congestion Control Fast Retransmit Round-Trip Estimation & Time-out Silly Window Syndrome Kevin Fall, kfall@cs.berkeley.edu kfall@cs.berkeley. 2 TCP Slow Start Slow-start is a TCP behavior used to get to...
Berkeley >> CS >> 22 (Fall, 2008)
1 EECS 122, Lecture 22 Today Topics: s TCP Congestion Control Fast Retransmit Round-Trip Estimation & Time-out Silly Window Syndrome Kevin Fall, kfall@cs.berkeley.edu kfall@cs.berkeley. 2 TCP Slow Start Slow-start is a TCP behavior used to get to...
Berkeley >> CS >> 122 (Fall, 2008)
EECS 122, Lecture 23 Today Topics: s TCP Connection Management Implementation Issues TCP Connections TCP is a connection-oriented transport protocol which runs on top of a connectionless datagram network layer TCP connections are bi-directional bi...
Berkeley >> CS >> 23 (Fall, 2008)
EECS 122, Lecture 23 Today Topics: s TCP Connection Management Implementation Issues TCP Connections TCP is a connection-oriented transport protocol which runs on top of a connectionless datagram network layer TCP connections are bi-directional bi...
Berkeley >> CS >> 122 (Fall, 2008)
1 EECS 122, Lecture 23 Today Topics: s TCP Connection Management Implementation Issues Kevin Fall, kfall@cs.berkeley.edu kfall@cs.berkeley. 2 TCP Connections TCP is a connection-oriented transport protocol which runs on top of a connectionless da...
Berkeley >> CS >> 23 (Fall, 2008)
1 EECS 122, Lecture 23 Today Topics: s TCP Connection Management Implementation Issues Kevin Fall, kfall@cs.berkeley.edu kfall@cs.berkeley. 2 TCP Connections TCP is a connection-oriented transport protocol which runs on top of a connectionless da...
Berkeley >> CS >> 122 (Fall, 2008)
EECS 122, Lecture 24 Today Topics: s Intro to the Telephone Network Problem Set 4 Read: text 4.3 Problems (chp. 4): (chp. 2, 8, 9, 10, 11 due April 27 Kevin Fall, kfall@cs. berkeley.edu kfall@cs. berkeley. Telephone Net Concepts > 1 billion t...
Berkeley >> CS >> 24 (Fall, 2008)
EECS 122, Lecture 24 Today Topics: s Intro to the Telephone Network Problem Set 4 Read: text 4.3 Problems (chp. 4): (chp. 2, 8, 9, 10, 11 due April 27 Kevin Fall, kfall@cs. berkeley.edu kfall@cs. berkeley. Telephone Net Concepts > 1 billion t...
Berkeley >> CS >> 122 (Fall, 2008)
1 EECS 122, Lecture 24 Today Topics: s Intro to the Telephone Network Kevin Fall, kfall@cs.berkeley.edu kfall@cs.berkeley. 2 Problem Set 4 Read: text 4.3 Problems (chp. 4): (chp. 2, 8, 9, 10, 11 due April 27 3 Telephone Net Concepts > 1 bil...
Berkeley >> CS >> 24 (Fall, 2008)
1 EECS 122, Lecture 24 Today Topics: s Intro to the Telephone Network Kevin Fall, kfall@cs.berkeley.edu kfall@cs.berkeley. 2 Problem Set 4 Read: text 4.3 Problems (chp. 4): (chp. 2, 8, 9, 10, 11 due April 27 3 Telephone Net Concepts > 1 bil...
Berkeley >> CS >> 122 (Fall, 2008)
EECS 122, Lecture 25 Today Topics: s Introduction to ATM Asynchronous Transfer Mode (ATM) Concepts Motivations: flexibility of the Internet per-connection QoS facilities of telephone network Basic architecture: virtual circuits small fixed-si...
Berkeley >> CS >> 25 (Fall, 2008)
EECS 122, Lecture 25 Today Topics: s Introduction to ATM Asynchronous Transfer Mode (ATM) Concepts Motivations: flexibility of the Internet per-connection QoS facilities of telephone network Basic architecture: virtual circuits small fixed-si...
Berkeley >> CS >> 122 (Fall, 2008)
1 EECS 122, Lecture 25 Today Topics: s Introduction to ATM Kevin Fall, kfall@cs.berkeley.edu kfall@cs.berkeley. 2 Asynchronous Transfer Mode (ATM) Concepts Motivations: flexibility of the Internet per-connection QoS facilities of telephone netw...
Berkeley >> CS >> 25 (Fall, 2008)
1 EECS 122, Lecture 25 Today Topics: s Introduction to ATM Kevin Fall, kfall@cs.berkeley.edu kfall@cs.berkeley. 2 Asynchronous Transfer Mode (ATM) Concepts Motivations: flexibility of the Internet per-connection QoS facilities of telephone netw...
Berkeley >> CS >> 122 (Fall, 2008)
EECS 122, Lecture 26 Today Topics: s Introduction to Quality of Service Traffic Regulation and Scheduling Another Look at Sharing Computer network are shared resources, leading to contention By specific allocation of resources to entities (individ...
Berkeley >> CS >> 26 (Fall, 2008)
EECS 122, Lecture 26 Today Topics: s Introduction to Quality of Service Traffic Regulation and Scheduling Another Look at Sharing Computer network are shared resources, leading to contention By specific allocation of resources to entities (individ...
Berkeley >> CS >> 122 (Fall, 2008)
1 EECS 122, Lecture 26 Today Topics: s Introduction to Quality of Service Traffic Regulation and Scheduling Kevin Fall, kfall@cs.berkeley.edu kfall@cs.berkeley. 2 Another Look at Sharing Computer network are shared resources, leading to contentio...
Berkeley >> CS >> 26 (Fall, 2008)
1 EECS 122, Lecture 26 Today Topics: s Introduction to Quality of Service Traffic Regulation and Scheduling Kevin Fall, kfall@cs.berkeley.edu kfall@cs.berkeley. 2 Another Look at Sharing Computer network are shared resources, leading to contentio...
Berkeley >> CS >> 122 (Fall, 2008)
EECS 122, Lecture 27 Today Topics: s Scheduling Best-Effort and Guaranteed Connections QoS in ATM Where we are The motivation for QoS a desire to provide a better than best effort service motivation by ISPs to charge for new services Need sched...
Berkeley >> CS >> 27 (Fall, 2008)
EECS 122, Lecture 27 Today Topics: s Scheduling Best-Effort and Guaranteed Connections QoS in ATM Where we are The motivation for QoS a desire to provide a better than best effort service motivation by ISPs to charge for new services Need sched...
Berkeley >> CS >> 122 (Fall, 2008)
1 EECS 122, Lecture 27 Today Topics: s Scheduling Best-Effort and Guaranteed Connections QoS in ATM Kevin Fall, kfall@cs.berkeley.edu kfall@cs.berkeley. 2 Where we are The motivation for QoS a desire to provide a better than best effort service ...
Berkeley >> CS >> 27 (Fall, 2008)
1 EECS 122, Lecture 27 Today Topics: s Scheduling Best-Effort and Guaranteed Connections QoS in ATM Kevin Fall, kfall@cs.berkeley.edu kfall@cs.berkeley. 2 Where we are The motivation for QoS a desire to provide a better than best effort service ...
Berkeley >> CS >> 122 (Fall, 2008)
EECS 122, Lecture 28 Today Topic: s Internet QoS: QoS: IntServ and DiffServ QoS/CoS in the Internet QoS/ Provide differential traffic handling within the Internet (all at layer 3) Started as IntServ, focusing on per-flow IntServ, QoS support, but ...
Berkeley >> CS >> 28 (Fall, 2008)
EECS 122, Lecture 28 Today Topic: s Internet QoS: QoS: IntServ and DiffServ QoS/CoS in the Internet QoS/ Provide differential traffic handling within the Internet (all at layer 3) Started as IntServ, focusing on per-flow IntServ, QoS support, but ...
Berkeley >> CS >> 122 (Fall, 2008)
1 EECS 122, Lecture 28 Today Topic: s Internet QoS: QoS: IntServ and DiffServ Kevin Fall, kfall@cs.berkeley.edu kfall@cs.berkeley. 2 QoS/CoS in the Internet Provide differential traffic handling within the Internet (all at layer 3) Started as I...
Berkeley >> CS >> 28 (Fall, 2008)
1 EECS 122, Lecture 28 Today Topic: s Internet QoS: QoS: IntServ and DiffServ Kevin Fall, kfall@cs.berkeley.edu kfall@cs.berkeley. 2 QoS/CoS in the Internet Provide differential traffic handling within the Internet (all at layer 3) Started as I...
Berkeley >> CS >> 122 (Fall, 2008)
EECS 122, Lecture 29 Today Topics: s Brief Intro to Security Comprehensive Review Network Security You would somehow like to have your data (or that of others) be secure. This often means you want to: know who really sent it know nobody else read...
Berkeley >> CS >> 29 (Fall, 2008)
EECS 122, Lecture 29 Today Topics: s Brief Intro to Security Comprehensive Review Network Security You would somehow like to have your data (or that of others) be secure. This often means you want to: know who really sent it know nobody else read...
Berkeley >> CS >> 122 (Fall, 2008)
1 EECS 122, Lecture 29 Today Topics: s Brief Intro to Security Comprehensive Review Kevin Fall, kfall@cs.berkeley.edu kfall@cs.berkeley. 2 Network Security You would somehow like to have your data (or that of others) be secure. This often means y...
Berkeley >> CS >> 29 (Fall, 2008)
1 EECS 122, Lecture 29 Today Topics: s Brief Intro to Security Comprehensive Review Kevin Fall, kfall@cs.berkeley.edu kfall@cs.berkeley. 2 Network Security You would somehow like to have your data (or that of others) be secure. This often means y...
Berkeley >> CS >> 122 (Fall, 2008)
EECS 122 Supplementary Notes on WFQ Weighted Fair Queuing (WFQ) Textbook is not quite precise on its description of WFQ, so these notes will attempt to clarify what is going on Recall WFQ is equivalent to PGPS (packet-by-packet GPS), but was disco...
Berkeley >> CS >> 122 (Fall, 2008)
Homework problem for problem set 3 A 128.32.17.1 128.32.17.3 DEFAULT C 128.32.16.1 128.32.17.2 128.32.17.4 128.32.16.129 B 128.32.17.129 D 128.32.17.130 E to 18.0.0.0/8 Figure 1: A Sample internet Entry Number Mask Destination Next-hop 1 2 3...
Berkeley >> COE >> 0404 (Fall, 2008)
2 K E L E Y C OM P U T E R S C IE NC C ON T E N T S 30 YEARS OF INNOVATION 19 7 3 2 0 0 3 30 INTRODUCTION CITRIS AND MOTES GENE MYERS Q&A INTELLIGENT SYSTEMS RESEARCH DEPARTMENT STATISTICS ROC-SOLID SYSTEMS USER INTERFACE DESIGN AND DEVELOPMENT I...
Berkeley >> IB >> 160 (Fall, 2008)
...
Berkeley >> IB >> 160 (Fall, 2008)
...
Berkeley >> IB >> 160 (Fall, 2008)
PERSPECTIVES insinuate that such behavior is adaptive. Adaptationists regard the consistency of the trait with the hypothesis that it is an adaptation shaped by natural selection as good evidence for the conclusion that it is. Arguments such as Dawki...
Berkeley >> IB >> 160 (Fall, 2008)
...
Berkeley >> IB >> 160 (Fall, 2008)
...
Berkeley >> IB >> 160 (Fall, 2008)
...
Berkeley >> IB >> 160 (Fall, 2008)
...
Berkeley >> IB >> 160 (Fall, 2008)
...
Berkeley >> IB >> 160 (Fall, 2008)
...
Berkeley >> IB >> 160 (Fall, 2008)
320 Review TRENDS in Ecology & Evolution Vol.17 No.7 July 2002 45 Rondeau, A. and Sainte-Marie, B. (2001) Variable mate-guarding time and sperm allocation by male snow crabs (Chionoecetes opilio) in response to sexual competition, and their impact...
Berkeley >> IB >> 160 (Fall, 2008)
The evolutionary genetics of speciation Jerry A. Coyne1 and H. Allen Orr2 1 2 Department of Ecology and Evolution, University of Chicago, 1101 E. 57th Street, Chicago, IL 60637, USA Department of Biology, University of Rochester, Rochester, NY 11794...
Berkeley >> IB >> 160 (Fall, 2008)
vol. 159, supplement the american naturalist march 2002 The Ecological Genetics of Speciation Sara Via* Department of Biology and Department of Entomology, University of Maryland, College Park, Maryland 20742 abstract: Ecological interactions a...
Berkeley >> IB >> 160 (Fall, 2008)
...
Berkeley >> IB >> 160 (Fall, 2008)
Syst. Biol. 50(4):465467, 2001 The Troubled Growth of Statistical Phylogenetics JOSEPH FELSENSTEIN Department of Genetics, University of Washington, Seattle, Washington 98919 USA; E-mail: joe@genetics.washington.edu Statistical inference of phyloge...
Berkeley >> IB >> 160 (Fall, 2008)
...
Berkeley >> IB >> 160 (Fall, 2008)
A test of alternative models of diversification in tropical rainforests: Ecological gradients vs. rainforest refugia Christopher J. Schneider*, Thomas B. Smith, Brenda Larison, and Craig Moritz* *Cooperative Research Centre for Tropical Rainforest Ec...
Berkeley >> IB >> 160 (Fall, 2008)
Syst. Biol. 51(2):238254, 2002 Strategies to Protect Biological Diversity and the Evolutionary Processes That Sustain It CRAIG MORITZ Museum of Vertebrate Zoology, University of California, Berkeley, California 94720, USA; E-mail: cmoritz@socrates.b...
Berkeley >> IB >> 160 (Fall, 2008)
...
Berkeley >> IB >> 160 (Fall, 2008)
articles Hsp90 as a capacitor of phenotypic variation Christine Queitsch*, Todd A. Sangster & Susan Lindquist* * Department of Molecular Genetics and Cell Biology, and Committee on Genetics, Howard Hughes Medical Institute, University of Chicago, C...
Berkeley >> E >> 237 (Fall, 2008)
Coarse Thinking and Persuasion Sendhil Mullainathan and Andrei Shleifer1 Revised, September 2006 1. Introduction In most societies, a tremendous amount of resources is devoted to persuasion (McCloskey and Klamer 1995). Selling, advertising, politica...
Berkeley >> E >> 237 (Fall, 2008)
Correspondent Clearing and the Collapse of the Banking System, 1930 to 1933 Abstract Between the founding of the Federal Reserve System in 1913 and the depression of the 1930s, three check-clearing systems operated in the United States. The Federal ...
Berkeley >> E >> 237 (Fall, 2008)
Preliminary Draft Does Cash-in-Hand Matter? New Evidence from the Labor Market September 2006 David Card UC-Berkeley and NBER Raj Chetty UC-Berkeley and NBER Andrea Weber IAS-Vienna and UC-Berkeley ABSTRACT This paper provides new evidence on the ...
Berkeley >> E >> 237 (Fall, 2008)
S-shaped Transition and Catapult Eects Hyeok Jeong and Yong Kim July 10, 2006 Abstract Among the rich economies of the world today, per capita output levels had diverged before converging to the per capita output level of the frontier economy. Since...
What are you waiting for?
View This Document For FREE!