DOC PREVIEW
Berkeley ELENG 122 - EE 122 Final Review

This preview shows page 1-2-3-4-26-27-28-54-55-56-57 out of 57 pages.

Save
View full document
View full document
Premium Document
Do you want full access? Go Premium and unlock all 57 pages.
Access to all documents
Download any document
Ad free experience
View full document
Premium Document
Do you want full access? Go Premium and unlock all 57 pages.
Access to all documents
Download any document
Ad free experience
View full document
Premium Document
Do you want full access? Go Premium and unlock all 57 pages.
Access to all documents
Download any document
Ad free experience
View full document
Premium Document
Do you want full access? Go Premium and unlock all 57 pages.
Access to all documents
Download any document
Ad free experience
View full document
Premium Document
Do you want full access? Go Premium and unlock all 57 pages.
Access to all documents
Download any document
Ad free experience
View full document
Premium Document
Do you want full access? Go Premium and unlock all 57 pages.
Access to all documents
Download any document
Ad free experience
View full document
Premium Document
Do you want full access? Go Premium and unlock all 57 pages.
Access to all documents
Download any document
Ad free experience
View full document
Premium Document
Do you want full access? Go Premium and unlock all 57 pages.
Access to all documents
Download any document
Ad free experience
View full document
Premium Document
Do you want full access? Go Premium and unlock all 57 pages.
Access to all documents
Download any document
Ad free experience
View full document
Premium Document
Do you want full access? Go Premium and unlock all 57 pages.
Access to all documents
Download any document
Ad free experience
View full document
Premium Document
Do you want full access? Go Premium and unlock all 57 pages.
Access to all documents
Download any document
Ad free experience
Premium Document
Do you want full access? Go Premium and unlock all 57 pages.
Access to all documents
Download any document
Ad free experience

Unformatted text preview:

Slide 1AnnouncementsFinal ExamOutlineRouting: Persistent OscillationsRouting: Persistent OscillationsRouting: Persistent OscillationsRouting: Persistent OscillationsOutlineTCP Congestion ControlThe big picture (with timeouts)The big picture (with timeouts)The big picture (with timeouts)The big picture (with timeouts)The big picture (with timeouts)The big picture (with timeouts)The big picture (with timeouts)The big picture (with timeouts)Congestion Detection RevisitedFast RetransmitsFast Retransmit and Fast RecoveryFast Recovery: After a Fast RetransmitOutlineDistance Vector Multicast Routing Protocol (DVRMP)Reverse Path FloodingReverse Path FloodingReverse Path BroadcastingTruncated Reverse BroadcastingTruncated Reverse BroadcastingPruning DetailsOutlineToken Bucket and Arrival CurveTraffic Enforcement: ExampleSource Traffic Characterization: Arrival CurveArrival Curve: ExamplePer-hop ReservationOutlineIntegrated ServicesControl Plane: Resource ReservationControl Plane: Resource ReservationControl Plane: Resource ReservationControl Plane: Resource ReservationControl Plane: Admission ControlControl Plane: Admission ControlData PlaneData PlaneData PlaneDifferentiated Services (DiffServ)Diffserv ArchitectureDifferentiated ServicesComparison to Best-Effort & IntservOutlineRouting in CANRouting in Chord using FingersRouting in Chord using FingersRecursive vs. Iterative RoutingFinal Exam1EE 122: Final ReviewIon StoicaTAs: Junda Liu, DK Moon, David Zatshttp://inst.eecs.berkeley.edu/~ee122/fa09 (Materials with thanks to Vern Paxson, Jennifer Rexford,and colleagues at UC Berkeley)AnnouncementsProject 2 due Friday, Dec 11, 11:59pmFinal exam: Dec 17, 8-11am, 10 Evans HallMy office hours next weekMy office hours: MW 10-11:30amThe office hours of everyone else unchangedFinal ExamOpen book, open notes!Crib sheets ok if you likeComprehensive, but greater focus on material since midtermQuestions similar in format to the first midtermProblem set-up descriptions + multipart fill-insAll answers on the exam sheets we hand outBring PENCIL, ERASER, no calculators neededOutlinePersistent OscillationsTCPMulticast: DVRMPToken BucketIntegrated & Differentiated ServicesRouting in Chord5Routing: Persistent OscillationsAssume link cost = amount of carried traffic ADCB000000No trafficADCB110000B to A: 1 unit of trafficD to A: 1 unit of traffic1 1ADCB11+ee100CA: e units of traffic11e6Routing: Persistent OscillationsAssume link cost = amount of carried traffic ADCB11+ee0e1100ADCB2+e0001+e1B to A:cost(BCDA) = 1 lowerthan cost(BA) = 1+eC to A:cost(CDA) = 1 lowerthan cost(CBA) = 1+2*e1 1eB to A: switches to BCDAC to A: switches to CDA7Routing: Persistent OscillationsAssume link cost = amount of carried traffic ADCB2+e000e111+e 1B to A:cost(BA) = 0 lower thancost(BCDA) = 4+2*eC to A:cost(CBA) = 0 lowerthan cost(CDA) = 3+2*eD to A:cost(DCBA) = 0 lowerthan cost(DA) = 2+eB to A: switches to BAC to A: switches to CBAD to A: switches to DCBAADCB02+e1+e10011e8Routing: Persistent OscillationsAssume link cost = amount of carried traffic B to A:cost(BCDA) = 0 lower thancost(BCDA) = 4+2*eC to A:cost(CBA) = 0 lowerthan cost(CDA) = 3+2*eD to A:cost(DCBA) = 0 lowerthan cost(DA) = 2+eB to A: switches to BCDAC to A: switches to CDAD to A: switches to DAADCB02+e1+e10011eADCB2+e0e01+e11 1eOutlinePersistent OscillationsTCPWireless MACMulticast: DVRMPToken BucketIntegrated & Differentiated ServicesRouting in CAN & ChordTCP Congestion ControlFlow control keeps one fast sender from overwhelming a slow receiverCongestion control keeps a set of senders from overloading the networkThree congestion control problems:Adjusting to bottleneck bandwidthWithout any a priori knowledgeCould be a Gbps link; could be a modemAdjusting to variations in bandwidthSharing bandwidth between flows11The big picture (with timeouts)TimecwndInitially:cwnd = 1;ssthresh = infinite;New ack received:if (cwnd < ssthresh) /* Slow Start*/ cwnd = cwnd + 1;else /* Congestion Avoidance */ cwnd = cwnd + 1/cwnd;Timeout:/* Multiplicative decrease */ssthresh = cwnd/2;cwnd = 1;12The big picture (with timeouts)TimecwndSlowStartInitially:cwnd = 1;ssthresh = infinite;New ack received:if (cwnd < ssthresh) /* Slow Start*/ cwnd = cwnd + 1;else /* Congestion Avoidance */ cwnd = cwnd + 1/cwnd;Timeout:/* Multiplicative decrease */ssthresh = cwnd/2;cwnd = 1;13The big picture (with timeouts)TimecwndTimeoutSlowStartInitially:cwnd = 1;ssthresh = infinite;New ack received:if (cwnd < ssthresh) /* Slow Start*/ cwnd = cwnd + 1;else /* Congestion Avoidance */ cwnd = cwnd + 1/cwnd;Timeout:/* Multiplicative decrease */ssthresh = cwnd/2;cwnd = 1;1/2 cwndssthresh14The big picture (with timeouts)TimecwndTimeoutSlowStart1/2 cwndssthreshInitially:cwnd = 1;ssthresh = infinite;New ack received:if (cwnd < ssthresh) /* Slow Start*/ cwnd = cwnd + 1;else /* Congestion Avoidance */ cwnd = cwnd + 1/cwnd;Timeout:/* Multiplicative decrease */ssthresh = cwnd/2;cwnd = 1;SlowStart15The big picture (with timeouts)TimecwndTimeoutSlowStartAIMDssthreshSlowStart1/2 cwndInitially:cwnd = 1;ssthresh = infinite;New ack received:if (cwnd < ssthresh) /* Slow Start*/ cwnd = cwnd + 1;else /* Congestion Avoidance */ cwnd = cwnd + 1/cwnd;Timeout:/* Multiplicative decrease */ssthresh = cwnd/2;cwnd = 1;16The big picture (with timeouts)TimecwndTimeoutSlowStartAIMDTimeoutssthreshSlowStart1/2 cwndInitially:cwnd = 1;ssthresh = infinite;New ack received:if (cwnd < ssthresh) /* Slow Start*/ cwnd = cwnd + 1;else /* Congestion Avoidance */ cwnd = cwnd + 1/cwnd;Timeout:/* Multiplicative decrease */ssthresh = cwnd/2;cwnd = 1;17The big picture (with timeouts)TimecwndTimeoutSlowStartAIMDTimeoutssthreshSlowStartSlowStartAIMD1/2 cwndInitially:cwnd = 1;ssthresh = infinite;New ack received:if (cwnd < ssthresh) /* Slow Start*/ cwnd = cwnd + 1;else /* Congestion Avoidance */ cwnd = cwnd + 1/cwnd;Timeout:/* Multiplicative decrease */ssthresh = cwnd/2;cwnd = 1;18The big picture (with timeouts)TimecwndAIMDTimeoutSlowStartAIMDInitially:cwnd = 1;ssthresh = infinite;New ack received:if (cwnd < ssthresh) /* Slow Start*/ cwnd = cwnd +


View Full Document

Berkeley ELENG 122 - EE 122 Final Review

Documents in this Course
Lecture 6

Lecture 6

22 pages

Wireless

Wireless

16 pages

Links

Links

21 pages

Ethernet

Ethernet

10 pages

routing

routing

11 pages

Links

Links

7 pages

Switches

Switches

30 pages

Multicast

Multicast

36 pages

Switches

Switches

18 pages

Security

Security

16 pages

Switches

Switches

18 pages

Lecture 1

Lecture 1

56 pages

OPNET

OPNET

5 pages

Lecture 4

Lecture 4

16 pages

Ethernet

Ethernet

65 pages

Models

Models

30 pages

TCP

TCP

16 pages

Wireless

Wireless

48 pages

Load more
Download EE 122 Final Review
Our administrator received your request to download this document. We will send you the file to your email shortly.
Loading Unlocking...
Login

Join to view EE 122 Final Review and access 3M+ class-specific study document.

or
We will never post anything without your permission.
Don't have an account?
Sign Up

Join to view EE 122 Final Review 2 2 and access 3M+ class-specific study document.

or

By creating an account you agree to our Privacy Policy and Terms Of Use

Already a member?