Design of Traffic Shaper / Scheduler for Packet Switches and Diffserv Networks : Algorithms and Architectures
Total Page:16
File Type:pdf, Size:1020Kb
New Jersey Institute of Technology Digital Commons @ NJIT Dissertations Electronic Theses and Dissertations Spring 5-31-2001 Design of traffic shaper / scheduler for packet switches and DiffServ networks : algorithms and architectures Surong Zeng New Jersey Institute of Technology Follow this and additional works at: https://digitalcommons.njit.edu/dissertations Part of the Electrical and Electronics Commons Recommended Citation Zeng, Surong, "Design of traffic shaper / scheduler for packet switches and DiffServ networks : algorithms and architectures" (2001). Dissertations. 491. https://digitalcommons.njit.edu/dissertations/491 This Dissertation is brought to you for free and open access by the Electronic Theses and Dissertations at Digital Commons @ NJIT. It has been accepted for inclusion in Dissertations by an authorized administrator of Digital Commons @ NJIT. For more information, please contact [email protected]. Copyright Warning & Restrictions The copyright law of the United States (Title 17, United States Code) governs the making of photocopies or other reproductions of copyrighted material. Under certain conditions specified in the law, libraries and archives are authorized to furnish a photocopy or other reproduction. One of these specified conditions is that the photocopy or reproduction is not to be “used for any purpose other than private study, scholarship, or research.” If a, user makes a request for, or later uses, a photocopy or reproduction for purposes in excess of “fair use” that user may be liable for copyright infringement, This institution reserves the right to refuse to accept a copying order if, in its judgment, fulfillment of the order would involve violation of copyright law. Please Note: The author retains the copyright while the New Jersey Institute of Technology reserves the right to distribute this thesis or dissertation Printing note: If you do not wish to print this page, then select “Pages from: first page # to: last page #” on the print dialog screen The Van Houten library has removed some of the personal information and all signatures from the approval page and biographical sketches of theses and dissertations in order to protect the identity of NJIT graduates and faculty. ASAC ESIG O AIC SAE/SCEUE O ACKE SWICES A ISE EWOKS AGOIM A ACIECUE b Srn n The convergence of communications, information, commerce and computing are creating a significant demand and opportunity for multimedia and multi-class communication services. In such environments, controlling the network behavior and guaranteeing the user's quality of service is required. A flexible hierarchical sorting architecture which can function either as a traffic shaper or a scheduler according to the requirement of the traffic load is presented to meet the requirement. The core structure can be implemented as a hierarchical traffic shaper which can support a large number of connections with a wide variety of rates and burstiness without the loss of the granularity in cells' conforming departure time. The hierar- chical traffic shaper can implement the exact sorting scheme with a substantial reduced memory size by using two stages of timing queues, and with substantial reduction in complexity, without introducing any sorting inaccuracy. By setting a suitable threshold to the length of the departure queue and using a lookahead algorithm, the core structure can be converted to a hierarchical rate- adaptive scheduler. Based on the traffic load, it can work as an exact sorting traffic shaper or a Generic Cell Rate Algorithm (GCRA) scheduler. Such a rate-adaptive scheduler can reduce the Cell Transfer Delay and the Maximum Memory Occupancy greatly while keeping the fairness in the bandwidth assignment which is the inherent characteristic of GCRA. By introducing a best-effort queue to accommodate best- effort traffic, the hierarchical sorting architecture can be changed to a near work- conserving scheduler. It assigns remaining bandwidth to the best-effort traffic so a i imoes e uiiaio o e ouik wie i guaaees e quaiy o seice equiemes o ose seices wic equie quaiy o seice guaaees e iee eiiiy o e ieacica soig aciecue comie wi ie- ige agoims eemies is muie ucios Is imemeaio o oy ca maage ue a awi esouces eeciey u aso oes o equie o moe a o-e-se awae ecoogy e coeaio o e ea saig eay a e ae o e coecios is eeae a a imoe ai aic saig agoim eaue Ee ie us Comeig Seice ime esoig agoim is esee e oose agoim iouces a esoig ocess io eaue Ee ie aic Saig Agoim o esoe e coeio o muie ces wic ae a eigie o asmissio i e aic sae y usig e esoig ocess ase o eac coecios ae ee aiess a eiiiy i e awi assigme o coecios wi wie age o aes ca e gie A ua ee eaky ucke aic Sae(S aciecue is oose o e imemee a e ege oes o ieeiae Seices ewoks i oe o aciiae e quaiy o seice maageme ocess e oose aciecue ca guaaee o oy e cass-ase Seice ee Ageeme u aso e ai esouce saig amog ows eogig o e same cass A simiie S aciecue is aso gie wic ca aciee e goas o S wie maiai a ey ow imemeaio comeiy so a i ca e imemee wi e cue SI ecoogy I summay e saig a sceuig agoims i e ig see acke swices a iSe ewoks ae suie a e ieige imemeaio scemes ae oose o em ESIG O AIC SAE/SCEUE O ACKE SWICES A ISE EWOKS AGOIM A ACIECUE b Srn n A rttn Sbttd t th lt f r Inttt f hnl n rtl lfllnt f th rnt fr th r f tr f hlph n Eltrl Ennrn prtnt f Eltrl nd Cptr Ennrn M 1 Copyright © 2001 by Surong Zeng ALL RIGHTS RESERVED AOA AGE ESIG O AIC SAE/SCEUE O ACKE SWICES A ISE EWOKS AGOIM A ACIECUE Srn n ece Uu isseaio Co-Aiso ae Cie Aciec Auoaeics Ic Symeo aaassiiou isseaio Co-Aiso ae Assisa oesso o Eecica a Comue Egieeig I iwa Asai Commiee Meme ae oesso o Eecica a Comue Egieeig I r Sii ekiay Commiee Meme ae Assisa oesso o Eecica a Comue Egieeig I au aimiogu Commiee Meme ae Associae oesso o Comue a Iomaio Sciece oyecic Uiesiy ooky Y IOGAICA SKEC Athr Suog eg r oco o iosoy t May 1 Undrrdt nd Grdt Edtn • oco o iosoy i Eecica Egieeig ew esey Isiue o ecoogy ewak 1 • Mase o Sciece i Eecica Egieeig Uiesiy o Eecoic Sciece a ecoogy o Cia Cegu Sicua Cia 199 • aceo o Sciece i Eecica Egieeig Uiesiy o Eecoic Sciece a ecoogy o Cia Cegu Sicua Cia 1995 Mjr Eecica Egieeig bltn nd rnttn S eg Uu "A ieacica aic Sae o acke Swices" Proc. of IEEE GLOBECOM'99, 155-159 io e aeio ai ec 1999 S eg Uu Meme a Gogae "A oe ieacica ae-Aaie Sceue o ig See acke Swices" Networld+Interop'2000, as egas May S eg Uu "A oe ieacica aic Sae/Sceue o ig See acke Swices" sumie o IEEE/ACM Transaction on Networking, Mac v S eg Uu a S aaassiiou "A Imoe ai aic Saig Agoim o ig See acke Swices" accee y Proc. of 2001 IEEE Workshop on High Performance Switching and Routing, aas May 1 S eg Uu a S aaassiiou "A ua ee eaky ucke aic Sae Aciecue o iSe ewoks" accee y Proc. of 2001 IEEE Workshop on High Performance Switching and Routing, aas May 1 S eg Uu a S aaassiiou "A ua ee Access Coo Aciecue o iSe ewoks" sumie o Journal of Network and Systems Management, Ai 1 is wok is eicae o my eoe amiy i ACKOWEGME is a oemos I wou ike o eess my sicee gaiue o my aisos a meos ece Uu a Symeo aaassiiou I wou ike o ak Uu a ecee aiso a a goo ie o ioucig me o is eciig ie o eseac; o is cosa suo guiace a ecouageme i eey se o my way; a o is isiaio a auae iscussios I aeciae aaassiiou o is ecee suggesios; a o e ime e as u io e me o make e isseaio comee I wou ike o ak my isseaio commiee iwa Asai Sii ekiay a au aimiogu (ooky oyecic o ei eig ieese i is wok a simuaig auae iscussios a suggesios I wou ike o ak a eow eseaces a CM o a e e ey ae oee uig my ocoa eseac I wou eseciay ike o ak eiog Ce a ie Yag o aiey iscussig wi me a giig me auae suggesios I wou aso ike o ak Qiag eg i e uei Wei Miyi ao iaoog Cai o ei coiuous e a aice sice e is ay I oie I I wou ike o ak a my ies a CM o makig my say ee eoyae Wos cao eess e gaiue I e owa my aes wose suo oies e ouaio uo wic is wok was ui v AE O COES Chptr Page 1 INTRODUCTION 1 1.1 Background 1 1.2 Outline of the Dissertation 2 2 RELATED WORK OVERVIEW 6 2.1 Traffic Management Framework 7 2.2 Traffic Parameters and QoS Parameters 11 2.3 ATM Service Classes 15 2.4 Traffic Shaping 17 2.4.1 Generic Cell Rate Algorithm 18 2.4.2 Event-Driven Traffic Shaping Algorithms 21 2.5 QoS in Internet 25 2.5.1 Integrated Services and RSVP 25 2.5.2 Differentiated Services 32 3 THE HIERARCHICAL TIMING QUEUES TRAFFIC SHAPER 36 3.1 Motivation for the Hierarchical Timing Queues Traffic Shaper 36 3.1.1 Existing Traffic Shaper Architectures 36 3.1.2 Problems in the Existing Traffic Shaper Architecture 39 3.2 The Architecture Description for the Hierarchical Traffic Shaper .