DOC PREVIEW
WUSTL CIS 777 - Frame Relay Congestion Control

This preview shows page 1-2-3-4 out of 13 pages.

Save
View full document
View full document
Premium Document
Do you want full access? Go Premium and unlock all 13 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 13 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 13 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 13 pages.
Access to all documents
Download any document
Ad free experience
Premium Document
Do you want full access? Go Premium and unlock all 13 pages.
Access to all documents
Download any document
Ad free experience

Unformatted text preview:

Frame Relay Congestion ControlOverviewFrame Relay Congestion TechniquesDiscard ControlSlide 5Slide 6Slide 7Leaky Bucket AlgorithmFECNBECNBECN (Cont.)Implicit Congestion ControlSummaryRaj JainThe Ohio State University1Frame Relay Frame Relay Congestion ControlCongestion ControlRaj Jain Professor of Computer and Information SciencesThe Ohio State UniversityColumbus, OH [email protected] slides are available at http://www.cse.ohio-state.edu/~jain/cis777-00/Raj JainThe Ohio State University2OverviewOverviewCongestion avoidance vs recoveryDiscard controlExplicit forward/backward congestion notificationImplicit notificationRaj JainThe Ohio State University3Frame Relay Frame Relay Congestion TechniquesCongestion TechniquesDiscard Control (DE Bit)Backward Explicit Congestion NotificationForward Explicit Congestion NotificationImplicit congestion notification (sequence numbers in higher layer PDUs)Raj JainThe Ohio State University4Discard ControlDiscard ControlCommitted Information Rate (CIR)Committed Burst Size (Bc): Over measurement interval T T = Bc/CIRExcess Burst Size (Be)Between Bc and Bc + Be  Mark DE bitOver Be  DiscardRaj JainThe Ohio State University5BitsBc + BeBcT0T0 + TTimeDE = 1DE = 0Access rateCIRDiscardFrames 1 3All frames with CIR2Raj JainThe Ohio State University6BitsB + BBccT0T + T0TimeDE = 1DE = 0Access rateCIRDiscardeOne Frame marked DEFrames 1 32 4Raj JainThe Ohio State University7BitsB + BBccT0T + T0TimeDE = 1DE = 0Access rateCIRDiscardeOne Frame marked DE; one frame discardedFrames 1 32 4Raj JainThe Ohio State University8Leaky Bucket AlgorithmLeaky Bucket AlgorithmBeC = counter; increment with incoming dataDecrement C by min{C, Bc} every T Time unitsCIR = Bc /TLimit C to Bc + BeDiscard any incoming data while C is at its thresholdBcRaj JainThe Ohio State University9FECNFECNForward Explicit Congestion NotificationSource sets FECN = 0Networks set FECN if avg Q >1Dest tells source to inc/dec the rate (or window)Start with R = CIR (or W=1)If more than 50% bits set  decrease to 0.875 × R (or 0.875W)If less than 50% bits set  increase to 1.0625 × R (or min{W+1, Wmax})If idle for a long time, reset R = CIR (or W=1)S DFrame Relay SwitchFECNRaj JainThe Ohio State University10S DFrame Relay SwitchBECNBECNBECNBackward Explicit Congestion NotificationSet BECN bit in reverse traffic or send Consolidated Link-Layer Management (CLLM) message to sourceOn first BECN bit: Set R = CIROn further "S" BECNs: R=0.675 CIR, 0.5 CIR, 0.25 CIROn S/2 BECNs clear: Slowly increase R = 1.125 RIf idle for long, R = CIRRaj JainThe Ohio State University11 BECN (Cont.)BECN (Cont.)For window based control:S = One frame intervalStart with W=1First BECN W = max(0.625W,1)Next S BECNs W = max(0.625W,1)S/2 clear BECNs  W = min(W+1, Wmax)CLLM used if no reverse trafficCLLM = XID message on maintenance DLCI = 1007 (decimal)CLLM contains a list of congested DLCIsRaj JainThe Ohio State University12Implicit Congestion Implicit Congestion ControlControlDecrease window on frame lossIncrease window slowlyDecrease by 1, Decrease to Wmin, Decrease by a factor Increase by 1 after N framesIncrease by 1 after W framesRaj JainThe Ohio State University13SummarySummaryDiscard strategy: Leaky bucketForward explicit congestion notificationBackward Explicit congestion notificationImplicit congestion


View Full Document

WUSTL CIS 777 - Frame Relay Congestion Control

Documents in this Course
SONET

SONET

17 pages

SONET

SONET

22 pages

SONET

SONET

19 pages

Load more
Download Frame Relay Congestion Control
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 Frame Relay Congestion Control 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 Frame Relay Congestion Control 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?