1 / 10

Traffic Shaping in ATM Networks

Traffic Shaping in ATM Networks. Raj Jain Professor of Computer and Information Sciences The Ohio State University Columbus, OH 43210 jain@acm.org These slides are available at http://www.cse.ohio-state.edu/~jain/cis777-00/. Overview. Leaky bucket Generic Cell Rate Algorithm

juro
Télécharger la présentation

Traffic Shaping in ATM Networks

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Traffic Shaping in ATM Networks Raj Jain Professor of Computer and Information SciencesThe Ohio State UniversityColumbus, OH 43210 jain@acm.org These slides are available athttp://www.cse.ohio-state.edu/~jain/cis777-00/

  2. Overview • Leaky bucket • Generic Cell Rate Algorithm • GCRA Implementations: • Virtual Scheduling Algorithm • Leaky bucket algorithm • Examples

  3. Leaky Bucket • Provides traffic shaping:Input bursty. Output rate controlled. • Provides traffic policing: Ensure that users are sending traffic within specified limitsExcess traffic discarded or admitted with CLP = 1 Overflow Non-Conforming Conforming

  4. Theoretical Arrival Time Last Cell Time No OK Yes I-L L Time I I L Generic Cell Rate Algorithm: GCRA(I, L) • I = Increment = Inter-cell Time = Cell size/PCR • L = Limit  Leaky bucket of size I + L and rate 1

  5. GCRA: Virtual Scheduling Algorithm Cell Arrival at t Yes (late) TAT<t? Late? No (early) Non Conforming Cell TAT = t TAT > t + L? Too early? Yes No TAT =Theoretical Arrival Time TAT = TAT + IConforming Cell

  6. GCRA: Leaky Bucket Algorithm F = X-(t-LCT) Yes F < 0? No F = 0 Non-Conforming Cell Yes F > L? No LCT = Last Compliance TimeX = Bucket contents at LCTF = Bucket contents now X = F + I; LCT = tConforming Cell

  7. GCRA Examples •  = cell time = 2.73 s at 155 Mbps • GCRA(4.5 , 0.5 ): Arrivals TAT Time 0 4 8 12 16 • GCRA(4.5 , 7 ): Arrivals TAT Time 0 4 8 12 16

  8. Maximum Burst Size  = cell time at Peak Cell Rate (PCR), I = cell time at Sustained Cell Rate (SCR), L=Limit N = Maximum burst size (MBS) GCRA(I , L ): 0  (N-1) Arrivals 0 I (N-1) I TAT Time 0 4 8 12 16 (N-1) I - (N-1) < L MBS= N= Int[1+ L/(I-)] L = (MBS-1)(I-)

  9. Summary • Leaky bucket is used to smooth bursty arrivals • GCRA requires increment (inter-cell arrival time) and limit (on earlyness) • Two implementations: Virtual scheduling and leaky bucket

  10. Homework • Read Section 12.5.2, 22.1, 22.2.1-22.2.3 of McDysan’s book.(Or Read pages 240-243 of Black’s Emerging Technologies book 2nd edition.Or Read pages 505-513 of Stallings’ ISDN and Broadband ISDN with Frame Relay and ATM) • Conduct Lab exercise 1

More Related