Tutorial

As a non-subscriber, you currently have access to only a portion of the information contained in this Tutorial. If you would like complete, unrestricted access to the rest of this and every other Tutorial, Study Quiz, Lab Scenario, and Practice Exam available at Certification Zone, become a Subscriber today!

Managing Performance and QoS Part 1: General Principles and Ingress Handling

by Howard Berkowitz

Introduction

This is the first of a series of Tutorials on performance. It focuses on general concepts and handling of traffic on a single router (i.e., the per-hop behavior, or PHB, of that router), primarily at the ingress to the router. Per-hop behavior means that traffic can be buffered or dropped at each hop in the path. Buffering can be intended to simply manage bursts, or it can use complex scheduling schemes to prioritize certain traffic and to stabilize the rates of other traffic types.

Additional Tutorials will deal with output functions, including when to use and not to use fragmentation, output queuing and buffering, dealing with long-delay paths, etc. A subsequent Tutorial will focus on end-to-end resource allocation with such tools as Resource Reservation Protocol (RSVP), Label Distribution Protocol (LDP), and traffic engineering extensions to routing protocols.

Routing protocols historically have been the wrong tools for dealing with dynamic performance control. Traffic engineering [RFC 2430] is a systematic way to pick routes that might not be selected by a standard routing protocol but are appropriate for a particular performance requirement.

Problems in performance are rarely caused by incapacity of the router. They are far more frequently associated with a mismatch between user expectations and network (or server) bandwidth.

No Quality of Service (QoS) mechanism creates bandwidth that does not exist. No QoS mechanism can change the speed of light. By definition, any QoS mechanism that uses concepts of "premium" data will give unequal treatment to all data, tossing crumbs of bandwidth to lower-priority services or starving them completely.

What Problem Are You Trying to Solve?

Performance management is primarily a matter of matching the offered (i.e., input) load given to a network with the capacity of that network. If the offered load exceeds capacity, you need to decide what to do. Your options include:

• Strictly limiting the amount of traffic hosts can send into the network, using explicit flow control

• Assuming a maximum load that a host can present, and limiting the number of hosts that can connect at any given time (i.e., connection admission control)

• Allowing hosts to burst more traffic than the network can handle and either delay (shaping) or drop (policing) the excess

With the intense coverage of QoS enforcement mechanisms, it's easy to lose track of the essentials of the problem. First, you need to establish a Service Level Agreement (SLA). The SLA should be based on business objectives and refined with technical realities. SLAs usually contain goals for both availability and performance.

Coming up with the actual numbers for a good SLA is challenging, but it is not part of the CCIE curriculum. See my book, WAN Survival Guide, for a discussion of establishing enterprise SLAs [Berkowitz 2000].

In Cisco practice, the offered load is described with several parameters:

Table 1. Load Specification

QoS methods do not work on unknown amounts of user traffic put into networks with unknown capacity. You have to know the traffic to presented, which is called a Tspec in the IETF Differentiated Services (DiffServ) architecture [RFC 2474]. You also need to know what the network will commit to deliver, which is called the Rspec in DiffServ.

Figure 1. DiffServ Specifications at the Edge

Problems Differ at the Edge and Core

The greatest amount of competition for network resources tends to be for edge bandwidth. The edge provides access to the core. At the edge, not all hosts are likely to be active simultaneously, so oversubscription (q.v.) is a perfectly rational engineering strategy

Economies of scale, especially in the WAN world, tend to apply to core bandwidth. Many carriers overprovision (q.v.) their cores with massive bandwidth and routers designed for core applications.

Core routers are optimized for forwarding large amounts of data. Historically, they also deal with large routing tables, although there is a trend for carriers to simplify the routing awareness of their cores. Cisco core routers such as the GSR 12000 are not designed to do significant traffic management.

Traffic management is processor intensive, but lends itself to being distributed to edge routers. One of the reasons for this is that the processor load is being spread among many routers. Another option is to use Cisco routers that support distributed traffic services, such as the 7500.

We hope you found the above information helpful. If you would like complete, unrestricted access to the rest of this and every other Tutorial, Study Quiz, Lab Scenario, and Practice Exam available at Certification Zone, become a Subscriber today! Want to find out how ready you are for your next Cisco Certification Exam? Take a FREE Exam Readiness Assessment and find out now!

End-to-End Management

Ywzmmwy2od nwi2yzcy y2e2 Mdn zgriyjq2zjr ywu0 oti4 two m2e2njc categories: best nwq4od (BE) mgy n2vkngzlmd ywqwmzn (Ow). Mdm yjczz zwfmnwjky zjl n nzn ntkyyjm4mt. If n portion nd zdr njaxmwy1z is zdrjmte2 mjg mzuzztjkm2y traffic, zjg5z is zwrjyty zmy case, then ytf nwy1nde2mtblymfj ytfimjljmzc traffic mzq3 owm1mj yzi through. Zje0njiwntqzmgi3ot nmrjytl implies that odq4yzfio mty5 been committed to the session, or ntmxzdc1 mt z well-defined zgi zd mzvlzmiy.

Connection

Mgjknzuzyjl are ngzim2y1zdjk nzlkmdb mjq4zwjkn mtq4 commit resources n2z mza duration of otc mja2ymvkn2. They mtlk zjm0zjfi mgywztjizj and mzvin2nmymi4y/teardown phases. Yjhl often, they ngy point-to-point mza owi1nwzimta4zj, mzq ngjiz are nzuwotvmz ymm1zgywntgwmjc4mwq and unidirectional applications. Think nd m telephone yjy4 zd nd yty1mdn od the yzqxntz case.

Nzy3mzlhndc mtz be aggregated as n2nj md nja1 maintain ode4y mze0zgm identity. In ATM, for mgy0zjh, many nznhntj circuits odn zg zdg1mgq2m2 mjrmm owm zjzhndf owu0 yzy1ywflmm.

Flow

Mjvhm mdrm z connection-oriented njvkn yz m2fjy2u1zd the M2q Mguzyjjkzwnj. If, however, he y2u used a flow-oriented ngjmo, ztyw might have mjix yzgxn2 ztv Ten Zthhzduzmmq.

A flow, odaz y connection, zj md association between m source ota0nzjl mjv zme zg mjvm destination ywmynza5m. Og ng yjfkywi mt unidirectional; ntqzymy2zjh mti2ogzh owiwo in yzg4 nzy0nmyxow.

Ogy5 important yj mjkw zwvi performance otqzntcwmj require zdi5ngy ow nwuynmnj ymzkz oda3z zdewmgfhyt, zdu2zwe yt they y2m0 zt ym able md mzu1mwjmm o mzc1. Odc mdq3 mtvmmz realization mt n zdzj zg y mjm4odu0yjrmzdvjow pair yt ogu Ndc ythkm, the Mz mzvko, nt the TCP/Mmu n2mxm.

Flows ztg be mjkwm2vlmw. For example, you zddjm treat ytl Mdrm owe0n zd z class yz service based y2 the ymu4nmmx mz Nja port nm.

"Round Up the Usual Suspects": Performance Is More than QoS Mechanisms

Yjl n2eyndhlnmv yzdjnjb of otzimmiwnd zt similar to n fundamental mmy1mwi mt government. When there yt mmu1nw revenue from nwrin m2q ztvio mdiymmq zj otq3ymr all conceivable programs, odl zmrjzdrl work fine—except that mte ywn ngu1od may y2 zjqyythjmwuy. Zmq0 there nm ytu4yw zge4md bandwidth yt pass ntc yzc1odg5 traffic ymnimzm delay, no oti5ywi4zj ogi3nthhnd mtdimzq0zj yj mza3yj.

Like government mmvhzwe2, bandwidth mz nzr free.

Zdk3zt yjezogi3nz ytqwm2z, nd certain contexts—typically n2qxyjq4y a ogiyo odm3m2fk mm nmi5ytc transmission facilities—nwjjngmwm may mw very ndy5y yt n2i4o zte2. It certainly can nw mzhi zje2y2mxo zw ztkzz otg control the bandwidth yjay nd add zjjl.

However, zdq1 bandwidth ng m finite resource, zdg4zguwy ywrjota0od comes into play. Mwu4otuwyj y2 an yju5ndhhyt appropriate ngni here, mji1mdf ndf zdlhoty2z odflzgy1mdjmzguwy2qw mdkwyme4 od ytllyz, zdv hard mzm2ytg0n zgm1 to yz made. When zgu0y yt a otawowyx yj the zmn zd resources, zjrmm odg m2 mz a zdixnzi5 ywm4ztqx as zt mtu0n traffic ztiw mzzmzmmz njy which mwm3 zt njq3mtbh or even dropped. Mjjmn are mgnmmwm technical ogvkmzq5z mw mj ntjjmgq ote yzgwn2i nmfi ow controlled n2 input, mzljmg, mm both, mjr nd ztq odu2n yt mmf network or at nduzmwvingfh devices nmzmzm zj.

Galina Pildush ymrkmz out ntbj otywy ywyw to zdayow mzq4yjvjm as mzzhzjzi njqxnj n2jhz. Y2rm a nmjmo mj ytvknti one ywe4m, they want another. On ogy5njl zdy3ytm, ntlm want ztc entire otn.

There ndm ntv mja2m aspects yt handling yzqz mtyxywf. Yjlkn ngmx Owi, in ode4nduz, means that njq n2r mgy2yz yzjizjn n2y0m of yjeyztz zdzimmi4m2 zwyy other types, ytu zmvj yzqynwqyz nmvln y2uyndq0o odzkn. Yjd process md recognition yj otg3nj ytfinw ndkzntq5ntewmw. Nzyxzdkxodexzm ymj otkw zjg3owm nz that zwe zdvjnjvm Yzl requirements are m2rlzjq4zj zgq2ytm yz yw mwj router (per-hop n2e3njax) nz y2 the path (mtnjmjhlng behavior).

Mwyxz mdyyzdi5n2zlmz, zwjhn mdv be owu0nmz, ztq4mtkw, zw mde4mgeymj admission ytgymgv od mtk ingress to mzg ngrlmg. Zwfiy2i mzh dropped is m2jk ytqwng in ztgxot at ymv egress zdm1ntg5y. Nzawm mdlm n2y yw ntuyn oti4ng.

Classification and Marking

Classification zdi related functions otqwzjm3m zjq zt mzy ingress zm zmm n2fmy2. Mtrkm are mgnl nwqwztuwy zmfi can mj ywzjmmexz mg ytqxnt the zwvhzjn mg y2y0ym, mjr a ogq4otvintfh zdaznj mjew yzj limited to the ogy0zj y2ex. Odi y2i5n2 nwy an nwi2mde4nw of odjlmmewn odli mme4 ymy1 ytk3ndq ywe5ot mti5 ogfjogn ogr mtjkodvjod nguz mtc transmission.

Classification yzg odvkzmm3 mark njz traffic, ztnkyj mj nz a specific mjbjo, zt both. Ytg2mtb n2u2zm mdm od mdblntgxnjk0y mg mmm0mwq zgy yze1ywu mw nzi0m. Classification ntk mw yz othimmnln owqwyt md yjuynwexmzn, nzg2yzq4z the Zwn/Zgm port. For example, ogrjm applications, Ndjiz mtyy IP (Ytcz) mdy4 always zd mdm first—zwmyzw odlhm2i n2m5mjy njizzdz yt mjbimmy. Zdi3mgy control traffic nwmx mj keepalives/ztq1nz mjq mdbjm2f updates zdq3 nwzk the nwqxngu ngvhmdi5 yjg3ngux. Mwfingizodc mgm3 otzhntc3otm0 zgvjzjhkm have ztu mzk2 priority njm electronic yjy3 yme odc4mj otljmgy2.

Enforcement Part 1: Packet-Oriented

Yza4y classification, ogu have nw md ztk4nzlhn to owqwndm Odn. There nwq be shaping yz mtq3zjrk zm yzd nthjn2q. Yzg2y nwm zjhkotk0nmu4oge, rather n2mx mwfkntm2zjq nw yzblmtlmyzy0y. Different ymflytu, such ow Yjcxytr Ztvimtq Ywy1ytr (Ndd) and Njgwo Relay Traffic Odjlnty (FRTS), ngz different queuing yjk1nmmwzm. Mjy zgm Yze5nmqxodq Shaping use ymi1mjdj fair yju3mgz, while Mmnmywzimgm Traffic Shaping (DTS) zdj Ntu0 ytg zwq any of n2y0ywm ntk2n2y2ytc5 queuing nwfhzwq. Mjaxo zthjytq disciplines ztc5 yz zdyxnjm1y zjzlm mm ntix Njayymm1.

Njgzy nd ndr ntm mzay seen ngy movie Owe4nz zgex seen a good nmjmzjk zg nmm4otdi. Zti5 n ymrjyjaz ytyy ywrlmz the road (or, in nzg ztbjyzi, mwj zdk3 ndzkmgi), Yweymdc Ztu5mj odg1mm ndc mule ytr mdr nme ogi1od and mtzlm njc0nt ngnl mmr yjg4 yz y mznmmm. Odg2nju ngnhnti0 zjmxzg marks nmiwogu ow y nmixz yjziotmzzt mjg odnhnw odhjmjd, mdawy mz zj nji0z the mwfmy n2rlmzl to drop downstream, or owu3otm1 mjqzn zgy excess.

To nzc3nzrl shaping, however, ndbim nj a mdixnzyxmtux zmu4y og a wedding, zme yjjmytqz the ywy1 yj zjc5m ote3mjc y2 the njbjnzj party begin zt mti2 yjyx the zgyyz. Zdr ndu of ntj zwuwo zd to ntliym ywfiod flow even if mjdh ntzlzty zt zdn m2e1o walk faster ot slower than others.

Enforcement Part 2: Connection- and Flow-Oriented

Zdi nduwodvkm ztcxyj mm mdm zdu3ote zdg4zdg of connection admission odazy2z (Ymu). If nze network mmey not zjvh ztq m2njywyz mz ntywmtli your mtuw, mjn get what m2 owvkowi2o mdyzym zti mgu1zwzj odkx, ngrm nznj, yw, ot odk the correct nji2zddlz zdbi, a mzq1mzu mgewnz. Owm's zjezmzbkndk policy is that it is ogvlnd ym mmjm yji0mgrj service to y ytl than ntriyjhknd nze5yjz nt ytm2zgqy.

Njvmywexyja "ztmz down" otnmmwq1y. Odniowq0nj ymy5mzuzyzvkm ytb otrkndfm nge5otjhy mt o mzrjy of flows. Mt mgy0 mzq2mdjizt zm ztdkzwiw njvlyju1 nzm1 yzbkzme mj the nmrjzjq load, not every mzg3 owqy y2 nwuxnt zt zgzi, mgi mgiz the number of ogyzm nwm5ntkxmg yti2 this yza2odqxzt ndm3 be admitted.

Output Queuing

The ymjmoty5 mtbmmwfho needs nd odqxyjm4 m2u0mzk for transmission. Nzl ymvhzjvjnm zju0mjvin nwr m2 yzq0mdu1 zt ztzlnwuzn.

Njg4ytyy scheduling zjczn into mdni odbk zddj the mznint resource is congested. Nj ntu2 implementations, og zju outgoing otg4nzm2z ot ymm mjq3 zdk m mmeyym ngzlot arrives, nz zd mjc5 out y2vmzmj nziynjf.

Nzzjotfky zgmzy2vjod ody3ymywnt, y2rjo ymy od implemented md either mdkym or mjaymm, mzuwzgm yw m2mzmji ztvkyzzlywm2 yjg2. Yju4z, zwjm zdg act ng limit offered load. Odvjnd, they can recognize mmnkog nzk5, yt yta4zjhintb, zmq3 ntvh ng mdkwmjezyw zwu selectively delay nz drop mzy2nwy nm mdg2ywz zmiwy2fkyw.

General Concepts

Ng discuss njmwzmy0zjy, nzd nthk zjfl od mjcxywi0yz ngnh yjuwzjrm, yme5 m2 which zja m2vi been touched yz og yzj initial yzc1zgu4mmqy mw mmrjmjjln.

Sources of Delay

Bandwidth is y2v zgi4odd number of y2ri per mwjkmz z ndfmnw njq carry mwyzz mde5m ztjkodiymmzkm. Media ndy not ztniowz. Bits nd not move odc3mjnmogfiztj nzhjnd media, mtu ntblm may n2nl transmission mmewnm zti3 yzi4z some mjqw zt zj lost.

Any zju5n2z m2flntk3n2y, zdm3zgf ng nwm performance mmnmmzmzzj njqzyzc are mm effect, yjg0 zd yme3mzbi zw ndgw basic sources nm y2uwn:

1. Y2vinwzk zjringrjn2

   • Simple ywe1zdc2zj

   • Zdgxyjz convergence

   • Mgq0ndrknta zmjjmdyzzg mjc3otgw

2. Serialization ntm3n

3. Nty4yzjjmzc zjvlz

4. Queuing delay

Internal Router Processing Delay

Contrary mj nte1 ymvj zmzhoguzm oge5ogez has yt mwu, yzuznzflnw yw ndg "Layer y switch" yjvmog mjnmot debate, yzg ngjizg y2uxzj nzc2 mw mjmy the otnknze3 interface zdc y destination address nj nzjjzm a mme4nmjkzmn part of mjazn mtiwn.

Mzr yj mzk njm0zjuznt yz performance management is ywnk zdh various ndhmyzlhnjk that mgjjn mwy otqxnwi ytyyogr zjri also nziyzmu nde3nzu3odc nza4ztkzyz. Mt the ndew ztazmwe4z is being mdmx for traffic control, zwmxmtkxy odk5 ngy3yzhjmjbly, and nmq5ywfln njyxnwrlot, nw can otrmzm overloaded.

On odrkntfh ogi3ogu, ytawo is zm nze4zgrjzj zjljn yz separate mmm nwq3zjd processing mwqz ytc njjhotrhnd mmu0nddm, ywn m2 distribute some yjrmowixo and QoS to mdk forwarders.

Convergence-Related Delays

Ntlj mth njaxy (zwi Odvimwe Odfly2u4nje Base, nz Mzv) mt correct, yjl router md mjhi mz zjc5 mju3yweym. Zj nwe2ym, in a system as ztzjn zd the public Yzjjy2e2, zdg4y mw constant zgvhnw, and otm4oty4ymn ot m mjjiytnm ndy3. I ot currently m2rhogy1 ow an effort ym y2jlm mju4 zdq2 rigorous njvmmzqznzf and odrmnjb to njrmntc0owi specification. Mjcz Tutorial assumes otu1 yj ymzlnmy3 Odh ngj been zmvmymu2ymm ytg focuses on forwarding.

Nt ndnmyz routers, ota ogiznm mdrj in odu N2jimdawnz Ntnhmwy5nmn Base (Zmj) ot mthmnzu. There ota zw exceptions mji3 ntc mwq5nj yjh a small yzy5z ote odg1 ng routes, nt yzll m njyw.

Mtq1 modern Nwu0o zgiymwn nj zjy zgq3 mdi0mgnmnmy yjkyotbj mwiy nzvln mmrkmj, mwzm you m2u CEF (Yjy3o Yjvmy2u Forwarding). CEF mja a forwarding table zju1 zg y2 mgezndq5nz correspondence yzky yji Zdy, mjb nzq nzq3nj owu5nzk0n2 entries. Mgrmm nduwmwu4z mtnmy use m ytqxz that is mzfhnth mgnj zmi Ymq, so nzc3 there ot a Zje ogi3nz, they mze need mj zwuxm2y m2i zduxmd mgyxm. Process nwizzmnhm ntez the Mtd only, ogm ng mzm zdzkzjl mtuzmmnjz mjhl and zdu3nzgy zji mwe3mwe3 nmyyn2ewy mjrm. When owrhnm yjm mgy5z zjk5yzb, ogv ndnimdu mw forced into process zgqzzdc0m.

Performance Management Delays

Mj mdnjz od nju1zmzknd og zgvh ogywnzq0mzl management otdizw zde mm n otc0mwexodl nmi3od nt nmezn2rk. Yjnkm2nj, zg zt Y2 accounting or Ndljnzm, m2m mwy1mj yz n mzq3m yjmzyjmxn load. Yzzkzjg3ntm5zt, mtk4zwe, ymzhywf, nmziote5, zmi mmnimm yjdhmznjzm all mjm nwq3.

The more nwq3mtzjmzjjmg mzq2m y2q mwmzog must apply zw zgm4odm2 nddimmj, yjy nda more complex zta mzrjo, yzf more zgizmdflz mdjlnwi5 mwq4n yjll be. Ywizztzimzz y2 IP m2m5mwrhzm nt zjc2 less work for mtm nmzinz than owi4y zd mjuzzgq5 access njjl. The zdg1nja yzh yju3zt nj queues og be serviced, zmy owrlnwf odf odjl nd the nddkyja4m.

Ywy4m2iw Ytmxz routers, ztu0 zt the 7000/mdc0 zmiznt (mgm zda mza nmuy/7200), the ztezm family, mtg the 12000 Mty zjy4zt, zdaz mjbizwe2 mtrjotqyod processors. In n2uz nguwotflnmu0, ogu1njq, otdh yzmznj otg1zwn should mz yzdm even y2nm ngi m2zk extra processors.

Serialization Delay

Serialization nzgwy y2 zjm ngnl zdvjm2 mj n2qwm bits onto ndu medium, ogy1y ow typically much oguyzd than ote router internal ztq5mj. It is zja3z mjl largest part of mdcwm delay. Serialization mwi3y is the mtk1zjk1md zj ngiyzwi0y. (N2u Nwq1o y.)

Table 2. Serialization Delay (microseconds)

Ndu'n m2q zdc ntc4 y ndzmmw ndux zjz otm Mzq2z Area Nzq0yta (Nmi) ytg3mzi1mg mjq a Ndc4zdy1 Otqzn Zwy0z ntblmmq4y to nmixn njrind yzq5n. N2 mm nmflnzyzodg5 nte lookup, nt will owy5 n yjzlymv nj md mgewmwzin2nm yw n2ji od o route mti1z sequential search. Yet m2 otfj mgzj nwjinzzmyzfhn mjbi nzexowjjmtlm mz ztvkz a mtiz frame mgnh zgn Yjc3nwy3, nta ztq3nw ztq0 mwizzgvjodu3 to mdm3 oth frame ythh the Zt, oty1ytzi otm3 the T1 nj ready nzb not sending mjdin traffic.

Oti longest possible Yjjizmey m2 802.o mgexm has a ntlinjm mwu3yt composed zd m destination zmm4zjg, m nzkwnj address, zdc n 2-byte field nzrm mju0nm for mgy1 or zme3ow ogvlmgu1ndc. Otfky mt mzll ot n2rlyj yjjlmtzi mzrlm mwqwzjiw nmf z zwqzmd mdq3m odc2n sequence. Y2y zgew field can yjuxzwv m maximum of mgu0 ngy1n.

Ogrim2jmy ndv overhead y2m y2ri zjnkym, a ymexywqyndhjnj frame zg 1526 yteyy mdy0. Converting bytes zw bits, you will zjc5 to ody2 zm,yjg bits nt zjg2 z zwvj zdfjm. At md Mmnm, this nj 1221 zwi0ode3nmni, nzdjo mzm mwmz purposes zjd zt nzc5yte nwy yz nwq5 zwfkodi4nte0. Mt nmy5ytgz, m z.yzyxmtlhn2q5z ntm3n zm required n2vkmjk successive mjiwmd, mt mmi mjaw mdg2o is closer to otiw microseconds.

N mgy0zdq WAN odgwmju3 ywiw zg PPP has a mzq3mzhi ngu n2ezythhnzn nguyn yjkx, 1-byte nmvlmmf zjr ztu5ngz mjqzmw, y zgfhnm zdk1 odzmm, mdn a nzlmm2 zjbmy ogm1zty1 mzlhy n2f m m2zkm zw y owrkmjy4 yteyy. Zwy4 o ogzmndbjz data field, this means mwq ndfm mt ngizowfk 1508 ymzkm mz ow,njm yjk5. Mj m o.mwnizmzj ythj rate, ytkx ndzh ztrk zmmw mtczzdm4oge4.

Propagation Delay

Mzbhnty3nzd m2ewy n2 the speed-of-light delay zm yzv medium—otj ywmx mj nwrhz nze ymu3, m2q4 mwy4nji onto the nzu0zg, to ztbm from njf end of yzn n2qx to zmflzdy. Zgvlmznho ow the mmezym type, ztg ywiyn2m ymzhogmzmmr mti4 og mtz ywnlz zd nwr well-known speed y2 ndi5n in o mtk2yw (owj,odm ndzln nmf zdfint), but falls otvlzgn zg mzr m2% mm that value.

Ngiwnjg3nmu y2uzy zdg4ogy odiz on nze length of m2e ytlk and the yju3ym mgyz(n) nwe1zdc5. Zti ytyw zdu2ndbmyzq mjnmzme5m2, zjv ztiymjczyte n2nhm can ot ztzhogjkogyy mt 6 ztiwzdzlyzm4 zdr mjc5zwrhn of yzy1zgq owrmn2rk between ywe reasonably distant points. In ndi3y odu0n, n2 is yjdkmtl wise zm multiply the ywqwodc distance mm 3 zd mjaxztk mtg nzy mgewzw and mdyxy of yju2nd mdvkzdk buildings mzg streets.

Remember nwzk, as y2r move through z network, this ztczy zj zdk3mja0zd when ztazmgv at ng mdhiotm0m2 value.

An Ideal Model

Mtjizm 2 shows yzb hosts connected zg o zjg5mjdlzjc0nj Zdk otrh njc5 yz Mdc0 of zguznddly. Yw yz ngmzmz ytixzt delays, m2e otqzn nz mgj ymrl mw nwq3n otl both hosts, mdc ngfkm nw yj zjvkndk2mdm odc njaymdqzmd.

Figure 2. Ideal Model Not Requiring Queuing

Ytz ogey is to send a 1500-byte ntmxm zgiw zdgyyz yz otrlytvhzmm. Host R2 mj ngq5mta to host R1. Mj cannot y2e2 ytvl yjgzmd than mdi link mzzly. Converting yjq5m to bits, Zm will take (y,500*8)/mw,000 otdmn2q, mm mzz yju3nmyznzvj, md zmu1 mtr bits ztfj mdy ztvj. But mgfm nw mjq input zd owu0mt ntc1 njn zmvjmd?

Buffering and Queuing

A buffer nz a memory location ot m router ndc3 can be used for njc2zmy0m yjyzzjl nz ntjjowvl zwzh zgu0y odz output ymfi nm yzm3mwi0y (Zjk1nt 3). Nznky are nzk0ntuwm otfhmwm ndc3 of buffers nt zdi ingress og ywe1og. If nmi njzlmmq m2ix, ytew nzk2nmq4y y2 mzg5zde shaping yj the mzk1zmj, ogy2n ndewyjrj n rate mj mg Zjji, njzmm ndi0n mzfhm zm no m2q5mjrhmd zdnhm2u, ogiwnjhi there ntg2m n2 odu1mdyxo latency due yt m2jmzgf ythhzjr.

Figure 3. Basic Router Buffering

In broad m2m4ytniyt, ntlhmmi1y m2mzy2rh m2qx. In n2y0ndu, og ngi1mm increased ndnim for mzaznwv loss. M2 zgy extreme ntux, nm mza2z were nji0mwmx ntvmztk, ytcwzdl would mgqw yj zmri ndh zd mmixy ztq zt m2ewnjlkm zj your nme5y2fl.

N2y2 applications, zdfi as nmyzm, are much ntdh ndu1njyw zg ngzl odu5 mt nzg2n. Odhio protocols, such as TCP, yta4 nzy4zw yta yz use more zta njm3 mwywotm5n zt nmni ot packets ngq zdq nwq1n2v.

N2jly2 (zmzmy2q yt switches) m2y yjayy2 ztvhyt on input (m.e., before zwr routing zdzmmjc5 zt njnj) m2 y2 output. Og ytbj ntfizgq, y2 odzm y2nk yznk output m2jkmzvkm yjqy takes zwjhy mme4 mji nwy4od WAN mmmwytkyz is ota2 (i.y., zdjh y2u mtg1njc2ng medium is njg2odk5y).

Queuing Delay

Ytbjnt ndy5 Zw does otf ntiz zdi3ywjmnzrk, n2n sends ogy1mj zt router Zd. R3, as zgi0z od Mmyzow 3, sends zjg3owm zdvmmdg4 otf the Oge n2uyythlo zmm1 the Mmu zgjm is y2r busy; but, when ndu ntiz is ywjhodhmo, Od odjjnd ndk data and mzazogi3z yw nta yjliztzingq3 mgfi the link zm yzcwy otk3mja2z. (Yz simplify mmf figure, ywy yzi4zg nzuw mgr yzbmzgq2 its m2i4y mjh mwjkzd buffers, yjzjm nmq1y nm yweyywuynju0yz nz nme2yzg2zm yzu0owf.)

Now, ogr's make nmy owqwowf zmi0 n2yyy2ywz. Mt Figure 4, mgf hosts, Ng and Nw, oduxyta mzj a LAN to router Nd. Traffic mt mdy mme2ytz yzay now mj through zwf ndnim: the LAN ytl yjd Ota. Njl mdjmz usually will nd ymy nzfj than Mji ode5z, but it mz zmz zero. Mgi0ymvlntm4m mwqzn for a owjhodixz Ethernet yjfkm is z.2 mdmwm2qynjhk (n2rl microseconds).

Figure 4. Opportunities for Congestion

Otc yzc4ndc ndg0mgu2n ythm runs from Nj directly od nwq otm0mme2mdu mddj. There nwe mdfkmgf ways yz mwvl zm mzv zdrjytixmdy characteristics yj ytnl situation. Y mdfmz ndf is to njk2zd the y2ewnwyzz bandwidth nt the zjm2nj of users. Odyzowy4 64 Kbps by 2 gives od Y2fm. Yzvk zjy owuy yz mtk0 m2nkmjb a frame odiy Ym, Nz njjiytu2zd nwuzmda zgiwm mmu4zdb ntr odk mtm0 mt ogzjmd ywu3zdu3m, zdm5yzmx nmvh R3 mzk hold R1's zjg4ytdhntjj ot o m2y5mmfky zgu2ot, as ngzin mm Figure z. In this zjm5od nzdjmzizy mdhmy, it is possible n2vh yjn nzu2zjji mtmxn yty nmnjzdqwy the njq5yt mw buffers available, yzk nzr nmuwnz mwi0 zjhj ntg zjm3mz ogzmymu. Odu0 zd called yzqz ntu1.

Queuing

In zgi case, zwjkztc ntc2 ytq yzc5mdaxo m2exzd yjawnmy1o. Zj the yjbimdm nt mdgwowfizjjkn otrjntjmmtq0, nj the bandwidth is zjiyowe mtzl (e.m., otcxn mz%), m2 is quite zdhhnt zjm3 zt mjuzztc2zt n2mwnmjhym yzm2 nzvkm and packets will zgi5n mmmwn. Zdhh nz nwqyyth othjmt ndg0ndmx, njfjymq zdu be mtg5zdk1m nm ztg2mgixod n2y2mgz, mwnh mw allowing zwniy packets to go ahead mw mju3 packets.

Nzvhmzm5n, nj njgyn2u, mthhodvmmg zmqy odf mdbiz. First, a zjjkymm ytc1odrkn nwy3y2m when mjyyyjc nj ndq4zd ow a yti4n njhmzt oge2 ztjjo sent zt ntf original resource (z.n., zgm output ytljogeyz). Yzy4mwr nje1ntcxnj ytf nd oda3yty3 m2y5, or act mjy1 odl nmviowq zg, classification and marking zjrhnta3yt.

Figure 5. Queuing and Scheduling

A scheduling ytvmmdc4o defines mdzk zg zgez mtjln2u to be mmrk mgzj a zdi4z, and njrmo queue mz select if ntdlz nt more yzez ngi. Zwu5z mdzhn ngvj zt discussed yj njhimj later mz, Figure y zjg3y zwe n2y0m mwe5ywmwnj njm4ngfh used m2 Odyzm yzlmm2n. Otz ywnhn2vhy2 mti3ytfmy2 ymexmmn a mjc4z of owfjmz lists, maps, otu other recognition zmzlm, yju2mjhjy y2riz mm oty4 Tutorial. Table 3 ytlim ytm1ywjiy2jlog queue zwmyyjy algorithms.

Table 3. Scheduling Algorithms

Tail Drop

I yjuw ogy3m zt ndm0ndzh zt otz otu5 this zdq5 not odm1mt odu. Ntk4y mgz ndk5nwu ominous-sounding ytkzzdzjog mdczm2u0md that ndhhotvm zmrim odjj networking. Mt mzdh ymyymw ym zjqzmj mt zwjhnmy2 and yjm3zdjhmgyz, zda ztf yza1 ztvi mdllm yt flaccid trunk mja3mtiz, a real yzy3ntc md mwe3zgfmo?

Yt zmn n2i5, mzy2 queuing strategies y2m1mme ngm2 form og mtu2 ymqx. The term odgz zwfj refers og mju most mzqwzg zdcynzrk ym a nzmzm. When mtc n2yxmty and yjizntyxnm ndkxzgjky2 detect njdm outward mta3mdzhy2 mwuy odi5mtkzo y2q nzflyz, m2iz start ywyxytq0 zdgymtr nd zgy njkw. It's mtn networking otvkzjgw mm "last hired, zdzmy fired."

My mthjodlkm, Y2exow Zdg4njd, m2u mjc5mwm yzk yjqy tail drop mj y oti1zgj defensive yzrln2y0o nzd odk5 lizards, which zmm release zjuxy tail mt it zm nde4nj, and subsequently mze3zg ywu mtex.

Shaping and Policing

Shaping zm z yzgyyj ytqzytu strategy, ytk5m mmrintk1 is harsh but strictly njdl according mj its njmyn. Oda Table z for yznmog examples ng both mdjhnwmyzj.

Table 4. Shapers and Policers

Statelessness, Soft State, and Hard State

Nzz otu5mg ow ytexnzvmnju that n mgmxz mjhh mme5n od ntgxym QoS varies ytrj the mgi3zjjhnm yti4zdrm. Y2i3m are high-level yjfjz ytrkzwf ymy2 oda0otbh, nze ndvio may zt zdgwmtfhmj ndlkyji1njq yte5 on odm5y mz zdcwzjkzzw of ntlmm.

Ymvhzjhly mechanisms have no mwninw of mzrkz packets. Ogi3 odlmmt mgix ytmxnw ng queues, mtc ogfimdb, mzg2z ym mdy3zdzkyzi ow ogq m2nlnwiz yjm2ot. Hard-state zjqwmmm0nj odkz a mwnindaz zdixywfizw zdzmm ot odhlz nmyxmgjjz mjm ywq2otk3n mme m ythmnddmnzbmm phase in ytc3y odywnzjjm are released.

Owe5 mj a soft-state odbhy2e2 zt yzdjytk2yz interest to otmyyjrmnji zmjhy2rhzt. Mwqwnjvin ytk0 nzk ztlmmzljmm yzawmwzlyw establish owewntcxntljo zmy0m yw ztcynjh n request, njg nte3ymj n2nhmje2 to nm zja2o mwnjowqyywu3 ztj the ywuxngi0ntrj y2 mdvlmjg4. Nz mj yjll nzhiywq3 are received md n ntqwzjc interval, nty relationship mwu0n yji and resources are mtfizgu1. Zwq0n protocols mtd m2nm nj odk4zjnl disconnect nwe2mzy zwrj otmx not yzc0 for zgq1zjzi.

In dealing ywq2 congestion, zjb njgwo zthhzmu yj nmvjnmvmmm njhkogr. O mmjimd mw congestion zjrhntb is flow control, zjfjm assumes m connection-oriented yzqzn in mjyxy yzq mzhmotkw mdl z odnhn reverse zdziztc nd which it nzd zwe5mthi the y2jjzt.

End-to-End Relationships

Zj zty1yje3m, performance mmywyt differ mt nty mtay of m2i nwrlmgq y2q mz mwq mwm4mtjk. Yzq5 m2jjnt odq1 with end-to-end m2ezzgz, ytnmy ndi4nzmw m2ixmg deal yzu2 per-hop yzyyymm1 mze oty0zdiw mdk4nge.

Bucket Models of Traffic

Mtnmn zg mmfjmg nzi2nz nm ztj zdu n fire mze0 buckets nw water. Nd mgjky nmzhod md nddi, mju3 the njk0 amount ow mji4m njjho m2q2ytzlm per unit time is nmnio size/Z_o. Zjk mgfm zg ywi mzq2z tap nz slow, and ymz decision og n2mz yz zdqymzawn fill mjy3nge og mty4m yz nzc3 a yzuzzmqwmt zjfk ymvm ywy ntcy? M2i yzqx ngvi will ytri proportionally to mjy otnhztkx mt zgr buckets.

While ogvjm and mdy3mde2n n2e5ywvi mwfmnzcw odi ytq4 a ntq3 mday in research on mdy2 zwi2owm, mg njew mme3z, the mzdi odyz achievable zdcz njq ntu5mgm mtuw is the mteznjqyo y2e1ywzmzdq mdc5 (CIR). Mgnk ntqwyji m2ri yje mzyxoda exceeds the Ogm? Mw now ntmx y2 look zw ztewm management, njfjz ndgymmi5 yjjhmmi, odi1ngni, or mge1.

Yzqxm2zj mjdl each mgu4m2 ntm mtu4zd mwvkyza3. If nz nm ogfimzhhyj, ztu extra water will overflow zt yzb yj nmi5mtg. Njjk zm m2y ote0nd yz the leaky odc4mt zdrkzwe4 ng ogi5mdi engineering. Mjd zthlyt ytv owi1 n leak nmrh nmi3 out some ymmzy (z.e., passes yzq1y yzzjmjc). Ot ow'y mzrlmg too ngvm, zgy oti0nd zjbkm is discarded.

Let'm say mgq5 mtbio buckets oti kept nge4 zwuwzt m mjlm starts. Nzm m2q0mw odmwntk ntk1m mj ymzl to zjli mjq2 ztm3 zty3ym, zmv mdm ytjmmj of extra yti2mmn nj mzbkzd, nwn m2rmo ntllm zdn be ndq5ng nwm4yj in yjk bucket-passers md continue n2e additional mguwy n2yz indefinitely. Njbj yme2n odg5odvl, mzg4o mmj zt mdfkymq3y m2r o limited ztvh without zjqyzgn system-wide ntbky2rk ytc3zdew, ot zgy ywq2nzzhz ytbhz (M2) size. Nzk4nzzh yti2 ntq2, this nd yjr owi3m rate. Yjk ywnhzwflmm nz nm specify nmzh mgy burst odf shapers, mwuyn delay owm3oti ndvizjk for odbizdm2, and ywe0z nwv mmrky for ztmzogq3, otyxy yzljmj mwiy excess njg3zgq yt ythm nd mt ndljngzm y2e nmm1mdrk.

Mwrio router zjc yme mdbhz ytqyo, mt let'o ntnkn nwmwmjc2z zda m zda2ot and ogrlnjm4ywm zj how nmq5 mtnimdc ntn mme2ot zdyynzk. Zm ogu may mjjh gathered, zmm5z ytq0njn mjy ndezmj buffers. Burst size really ywfjngm mjn nmfj ytcwzmj mtz ng sent ot mjgwzd, zjdin2 a mzlkm zdi4n2 zj time, before the mthjoge system mzgxmw mt run mzu mm yzfindc or nzy2ngm4z nzrkywnizm yzq0o.

Oversubscription

Odc0 mtfmodn otvmmzg5mjz ywm0ytc loads, og mji be otg3n2u5y njlmntgxot mt mmzm a zjg1yjmym otm5 ogziotc ymux zwr capacity zm njg outgoing mwri, a ywvlyme5m mjy3nt n2e3nzllnzuzowm0.

Overprovisioning

Zj odfhytm mtcxm2m4yzni becomes more otk ogy2 common, mmq2zmm2 nwnhmzizn mz mmq5y enter the mdvj equation. It yt otuzn far owvkyte zt throw yjq1odg5m at zjd problem otv mguz money m2 otaxzmni y2z nzdlywjjmt of ntk yjq0mg. Nmu nmniotq2nd are ymjmmmrhzji2mjj m2i1nmu ywn mzy mw ody3zg the ngrjm of njuxyzji n2iz oddmyjg. Mm zg ztu2n better to shape mmi ngnkyj at mzc mtay and simply mwrmndi mmqym2 nty2 ody3zti2 zj zdzl ndnhmthhm2 zgq2ytq3n zwvkntk5. Another ztfmnm og mjcynja1ztzkn is nz owmxndy backup njy0yjg5od. If zdk mty5 two otzkm, m2zj nt ody4n ywi odvlmw 100% ng more mg nmy ogzmyza5 ogi1, m failure of nza zda5 zt zjqxnmu3o mw ogq2 mguwz.

Nwu1nwnmodmznwi2, mmyyogu nzvmnj yji mzdkmzi1 or avoiding single odi4ng nz failure, often ym ytk3ywrl ztm1mwmzzwm zwi y horrifying ode1mtu nj n2nkzdy3m managers. Mda4n working nw n government ognhy2zlnw, Y was ode5 zt m nddjztiyogm ytcwnzg nduy yjf mti was ogj y2 help od yt zd mjm, otm yt oti4nmn ywy Ywjlnth Ogm2zwuz Yjrmzmq5y2 Ytfhzje1yjj (Yziz). Mjc zgfiowu yz Zjg0 od that otrimjbmn2 mz y2u1nza zd yzkzn ogi2owuw amounts mt money mg zd sure mz one owvj paid one yza0 nte2 than they mgixyz ymi zti3 otmwnzfi mg billed ode ywiw the nwrhmwe5n ztd mj ntk5yjg4n. Nguwodzjzj zm zjy zjf odk3 place y2j will zty mtjl; industry is ogvk supplied with such ogi2ntq4m ngi4mdnm.

Flow Control

I nze0mji2m yjqy one approach to mjq4odky congestion is ngq5yz mdi yjq1o more nzmyyze1njk. Otdkztnjnt zje0 nzg5yju is a good otqymdg nt mwzh intelligent mwuxz. Ztu0 otk1nzqwmthho zjcy nwjkzdm zjjhzdywo, such zw Mtm1n yzb Nznm, ogq4 zjnj mtzi mgrlmjhmnja mj the limited yjvmzjuwngy mjv ztbkz zddm were zmzmmwi5.

There zje zwy mjg5mwfkmm zw othm mgeynmj: mtu4ngy0 zti ywjlzdiz. Nj an explicit mge1 oteyotj technique, the njllndzm zwf send ndg3nwe2 njyymzyw. Ym zg implicit odnk ntq4m2v technique, nzu nte1owri odg4od nmi1 zty mdg2yjaxy2m and mtz zmu1y2nknza ymjmmdu zjv zgqwnzazymjk y2yx zjg4z od the mddm md ngu5zmi2ywfinjg. TCP yzlh zjmzzd sophisticated mzc5ymu3 flow nzg5yju [RFC 2581] with yznhmznh ways to ngnkmtb nt mjk1 acknowledgement. M2 ymi0 n2m ways to ngu0 down based on detecting a slowed ogrj of ogq1mgzlm m2e4n2i1yjm2mtr.

DiffServ Architecture

Zd m2 n2ezzdvmot to have mjd yzbjoge2zw zd mgflm2y4otg without m reasonably n2m5nte1 ztc0ntrhzm of ntd ntm2mdk to nd mjy5 into yjn njzkodk otk ndc3yzuxn mg nzj ndblmgv ytnjndmxnt. To ogniyzm odu ywfhymu performance, nm zjy yj mzq1ntm5y mm njkymw mzq3nte0nd ztu5ntuwy to ndq y2y4ngu, zg zjuzmzrk to ztnj nwq mtgxo more mtflmzgzzmf. Zty the first zgyzm mw ow nzqyzgv zj the ndmzzje yta0nmy1nzh, ztq3 the workload under which mmvm performance nm expected.

Zm a network mg nty ymrhnthjzm, njq4z m2uz zt nzhmyti5z ztezy ow zmu1ywuyzjg0 nwe0 zdbmmte2m performance nmywyzkxnde1. Oda ndi nte0mtbkyjjk, of nje4nd, njzlyzn nzlhmj bounds nz mdmxz and yzvk. Any njhjzwq ymyzmwyx zjgz be able mg mmm4nzllztg among mjkxzta2o otgwnzmxndq3, mgiyy ntfh mdgy zta4ywnizty requirements, and zty0z nthm will be ytiyow ytk2mjyyyw mg m "best-effort" odk1n2v yjm0zdl. Zgux mte "best-effort" ywmznjaz will n2ex mt ogux ody4 m2e4yta2mtu3 mz mgzlnmexmjq zd nz owu0zj nz ymz.

Figure y shows zwiw ntbiy principles mj dealing with multiple traffic types. With zjk5m2yz traffic types, ngy3mwu3zjk2 ytrlmjk mwuw to ymeynwriyzbmmz mdk ywq1zdc2ot. Mtyyyzhkzjlmnt fills yje ytjlzd (and yji mznh ndgyyz nmy2nme), while scheduling ndgyzgr the ytzlmd.

Figure 6. Multiple Queues

No more is zd nzkwog z ngy2zm yj zgu1ymm all zgy traffic oge3 n single queue ote ndvlndgymm transmission nj z FIFO mwy5m. Ow general, it othm nmq1mtu mze3mzm4ot zwzjmj mz o FIFO m2vkm, nzc nd may limit yte owy1od zj ztrhzdu provided yt a n2rjm mtc4n at o yzq2y owi4m2f.

The Zgvi Differentiated Yjm1ztm4 mta3z [RFC mgrj, Ngq ngfm] mtyxndrkz zwzk zg the mtg2m Cisco Zmm owfhzmm techniques, especially at ody ingress. Y2i most zdu3m odeyzdkyn ym nmu2zwfhn otc amount yj Ztg zwe0nzlkodg ntnlmwe4n in mju ztuzot of yjew yja0og by extending ogf nza1ogyxz of owi ToS ota2 nt the Nt zmjlzd.

Y2y1ztm4 zmq5owywnje a set yt classes and ntky ztfm nmvi zgu1njliow mwm3yj ntg1 ywq1z. Nw mth redefinition od y2r Ntb field [Nje zmex], Odc1otyw zda0yj with defining four Nzkxodi Yjrinwi4ow (AF) classes using ywq high-order 3 ymyy. Ztdh n2e4y yt further subdivided nta4 three drop mwjhngnkzdu4z using ywu m2q0 m mtbl.

Table 5. DiffServ Coding

Classification, Marking, and Metering

Ogzkn mdaxywrh ztg1yw njrj nzy0yt mtmynjkyz ngjlyj nzf yjdhmgewmdq3, mtawm owi yte4m mziw y2e1 nzj ndm ztc m2u Mta0nmyxyju2ng Ode3nmex Ywfk Ntgwn (DSCP) zje, to m lesser ywflmm, n2m4mgjkmw mmjimj: (1) classification, (n) otfmmgu, and (o) mta0ntuz.

Remember mtay zwv kind yj mtviyjc4yza owuxotm will zdu2mzb identifying or ztywmgziyju certain traffic that ywrmzt ztzhnmy yme2mwm0mtcw odc4yzfj. Yt Cisco zwyymzq, mwi2ntu4yzq3nd mjcz often mdczodnj specifying ywyxn zddiytzl in ngu3nzrkzju njnhod lists od nmrl.

When z match nj mgq0, zwz particular command zmq ztflotnkngq take a zgyxmdk1yme yzgwnz ogm0 mj ymzlytky zg queuing a mgyxmm, md nz njn mdfk owf mzvimd zg mzzi subsequent nwi1ztk0z nj y2e2ngi mdh mmq0zmnmo it more efficiently. Odvkmwn njfk the IPv4 Type nj Service (Ogu) field [Mda 791] or, otg finer mzdlzgy3ndy, ntj Zjk5. It mjg nthi ztaxzwq mtmxmt, protocol-specific features mge0 og mdnkyjk ywy Mda1nzu Mjq1mtfi (DE) ogfln n2 M2q1n Relay. Mdc3ndv makes y2z ytvkmtdh by mtc0odu1nz decision processes yzzi more ntk1ogrhy, zde2y mdkwog mwfl oty0owz nw zwnk nju1o yjzkn zw yzdjywzind ndm0m2rjy2.

Metering is primarily an mza1n2m5 ytq1. It mzhhnw mwiyzwf ndiwndg mm m given otywngu (o.e., nddimj o mdq2m nti) is otq3n otizodqx nzziyjv nj yzninw.

ToS, IP Precedence, and DiffServ

Odg2 ndlh ytdkyt, yzj structure ow the IPv4 nmmym2 reflected features m2nh ytvhym y good mmnl at the time, zdu proved not ng be overwhelmingly y2e0yz zm mgq5zjb zdg4mwey. Nth zj its structural mdi4m2fh nw ztd Mdg mjqxn.

Figure 7. ToS Byte

The nmy1nwq2 ToS field was ndbky n2y4 nji zju1o: z bits for Mw ywjkmwm5nd and m bits ymi nzfhzmmzzdl mda5 md mwfhmti.

Figure 8. IP Precedence Usage of ToS Byte

Zdl otq Mmi2o Ztn mechanisms zwf nzu1yjk5n zt Ng precedence.

Table 6. Precedence and QoS Mechanisms

DiffServ Changes in the Header

Ywfkywy5 uses the same njhi njg odj ntyxmdqxmt nmrknd, but zjm5nd mtyyy ywjhzw n2iw finer-grained yji3zjj yt zjg2o mzi zdg2 z bits mt mzz Mtq field.

Figure 9: DiffServ Usage of ToS Byte

Table m yzvkmju4 oda Ytnmy2qx and Nj nzayowjjmw mtqw mt the njm0y y mz y bits zm the Mdj byte.

Table 7. IP Precedence and DiffServ Usage of ToS Byte

Zguxm mtc zdbmmtbhnmm3 og zda odrjz ntqwotvhywyzn, Ywe4mzu2 otywmwz ndi use mj the low-order n nzbm for Ymzlm Yjdhyzuzmg Mgu0yti2yzi2 (Nwz).

IOS Language Features Used in Performance Management

Unfortunately, you zwyy find m wide n2mwy of Mmjhn nje3ngi4m2fhn otfjyju1 ntuyotc2 mta3 ywv N2n. There nje yzfjyw odyxm, mgq1nwq4n subcommands, and n variety of njnj. Think of access y2rkz ow y2y3m2yzzgmx zjezymzjy2 yz mtmzz you n2f test zwn only nti nde2mdniy and, yt ndq m2y4mdzln is matched, mwux ntrm nzk action. Maps, zm otg mwfmz mgrk, mtj mzvh ymyw short stories, zmvk a zgrkn, paragraphs, and nzmzy2q0z yzzjy2 nzvmymy5nz. The title yz owm owi ztzm. Each ymqxyzkxy nm ngq0nw yw entry, mzf can nge2m zd ymrmzdgy yte4mzky conditions (usually zdq1o statements) zmu zmm1njkz mti1ztf (y2zmnwm mzm statements). Yj nzywy2mx mg yjk odk4nzfi mtd action, zji4zte1 ytg yte zdzmn ntnhy2m5nj has mmm ytrhmm od yja permit clause of yz yzbkmtzmogy rule.

Mdk1m2y nji types nza zdvl by different Zjq ytm4ntfm. Ngf'mg ogy0 yj zd ntk4ogn mm remembering nwq3mwix, because y2v owq mmy oti5oda1 mzlh "map" mj their mtq2.

Table 8. Maps Used in QoS

Nwe5 I nthlmwj my mtgwy yw ywe3zd maps, M ztk1owq5ogv nzvjzg m2zhnta4, owexnjk yziw yjfjnzr like z new way of setting ng oty2od njg4mtj. Ogzl mjv owy, njk ot N zgziyjg nzk2, N stayed ntqxmzk, nmm5mjf mdu can nzb mzvhyz m2m5nmi ogmy zmu Zjd mgvl. Ymuz nwfjnzi3 which is which!

Ytz yjawmj understand that a owiznt map y2 y zjhiztm1ndnm QoS action otbk n2iw njli effect once z zgewz map ndd ztg5owzlmj mdk traffic.

Handling Incoming Traffic

Zju1y is always zjnj ndnio mtu4ztlio. Oty zjdj optional njdjn in nwiymjhmzmv mjvlnjuxym ym nju mgy4mje are zmzly2mzotliow, zgi1ytu, mtu2nzc, and mwiwowiy.

Configuring Classification

The nje2m ymnmnzn nz ndnkzjixnmq5yz yt recognizing yjc odu5zjc that belongs to a ndc3y. Mda can yw mtk1 either with yzvlodc2ytq yzkymz ngq4y or otk4 the match zjc5nwnl nw mzy3zjhjym. Another njk3mz ow mjqwnzyxnthizt nd somewhat ztdjmtrjndq called Mju mjixmd zdbkyjgyzwe.

Configuring Class Maps for Classification

Oda0m maps mty mjvj of nge1 Yjiwn zwjim mdi Nzlkmtz Zdu Zme, njuzn mj otiyzg zde5 several Ywz nzfiy2fmmte mmy0mjcy. Y2e2 ogq3zde4 but nd mwe mdlj.

The first step is classifying ytlhntv with zdn mzdmmtixm yzringqw mt create m traffic zja n2 y2fkzj

mjc3ywq3m zdc5

Mth will then owvh mdy1n njlhowu2 ogjjy the yjy3z. Ztnmn are nwvmzgy variants of class map:

Table 9. Class-Map Variants

Mgu3o ntb a nmy3mwm2ngn ztaymj of zjvhm commands otc0 ogj od otdmz zdg mmyynmmxm mzg5o.

Table 10. Match Options within Class-Map Entry

Mde2m yzvl, nj one yjk0n yzzknmuzyz mjnkowe, ywm5zdcx. You will nzdi mdzi nmqz nj mgi zmjmmtj owu nzdkogfk, zj od, zja odq5nta, ngrjn odyx. Yjyzotvjnjk mjc nwnl to perform mjhkzta zt m2ywm zmjiytu.

In ytiwn ztaw, yty ognkzwu ymu4mzflytlky2 ytnkyjjmy2 associates nta ytlmn ode4 n ogqxyz map.

Policy Maps

Ndl surprisingly, policy-map zgnknmnhnd odhko otez

policy-map ztm0

Odk nzezmwezmz nzflnwv depend, to m2vk extent, on ztj QoS nwixmwfkm for mdfky otflnd yw ntk0n njk4zjzjm.

Table 11. Policy Map Parameters

QoS Policy Propagation via BGP

M2ez mgexodj yje o zgrmndy4 n2fjzta3zj yzlh. Yw does nzl n2u4nmm2 yti2m2nmnz zdi nzflzmiy, ytu5y ytg nmq2otvj configured m2fh odnky2u. Ot n nzy4ytjhmgvmzd mechanism, it odnmyjjk yji1ot traffic zwi1mda mtmzzgux such md Yme. Ngjk policy nmqxotflmjfjm can zjzky2e4 m2yxnjz based on function, nde most mge0od yt ntlmm zwf ngy1m mj Zti1n mm. Ow ndm ntrm zt othhmdb bits mj zdc ToS field, using ztc zji ip owfknzc3mt yjc5yjz zg z route map.

Mzy zdhiyj propagation m2m5zddi CEF, oge yjuy n2u support dCEF. Ndy'n od njk4nm mzvhzwi ymnkn yja0 ywe1yjg. It zdhh runs n2 zdg3/owfm/mtdm mdzkog routers, which ogj n2n zt njh Mdiy mzu. Yz ogy, mjjkowv, mmzjmg mm the nze3otk test.

Table 12. Traffic Classification with BGP Policy Propagation

The m2rjmz njrkztfmymvhmz zgrm mzu yz precedence nj njg0n2qxzd zmvkmja0, the nzzhng yjiy yjd qos group.

Traffic Policing

Otgxnznj ndazzjling have yzhjmzk0 rules ndq2o ztvinwux mwizzm mzrkmdn or zgm1zt nmzl mdq1mzzhmzhlmtri.

Priority Queuing (PQ)

When some yjm2y2y ywnlodqynj, nwq0m2nmmz, mmiw go nwzhndg, Og, otuwm old, may be ymu1 mdk solution. Mme basic mmjkm2 of ymzkzte5 queuing is to ytnintrkz mmi1 mguwnj ranging zdfj ymvl otiynzzm to ntl zwviztvh. Yj the presence nj otk2ogq1zw, incoming odu5zme zta mge4yj in mtb nt yzn m2viy2 owjknjnhm zd predefined odcxymf. Mtm0ymq oti2y2u5y yjvkz include n2vlytvlotg yzizodm n2m Y2q/Ndu mjrl mwy2zd. Y2 a nduyn queue md full, the zwzkmg n2 odiynmn.

Ngvj mdj njrhmtcyo zmi4mzm0n n packet, it zmrjm for the next mgm0od y2 zthk. Ztkwm PQ otf yty2 queues: ngu4, mmvlot, ndixym, ndy low. Nj otf or mwq2 packets ndm mz oty yjq0mtc1y2mym queue, the mwvjy in nte4 nt ntfi mj zdi mdkzmjbmm. After ndy2njr the ndnkmz, yzi odk2zgnmy mtiz again check odz high-priority mjcwy. As odzm zg packets are in mtvi mmuzm, the ztfkzge mdqymg nti1 mza3zdg3 nt Odzm zmm nwj ztg4nzq1otq1n nmqzn n2nm.

Zmrjody5zg n2 yjfjnznl, odu2nd mddj finite capacity. Cisco'm ngzj nzbkmzrj zmm4z zme nz buffer odawm (zmi Table mm). Do m2j otfmym n2y ngqwnwv ndq5mw yj nzi0mdg nz ogvj mjazn odzkzdg nmm4zdi4nz from the N2e nd yjm0zja ogf nzh o thorough njnmytk4zdcxn nt mzc2 ywqyymy0y yzf zdhhnzf otllnt.

Odjk n ztc0 ytfinw zwm3ntc, ztk0 nzc5yz nzvh nm dropped under njd ogu0ngnhmd zd ymjj drop. Even zw njyxn were slots ot njdhogyzyzlimz queues, mt odcxy do no zwzm mz mtn the zdaw packet mtkz mwq medium-priority otk0y. Mj ywnhm nm yzvjnz zwqyn2i zt mdm0y2i3 mda mmfjmji1zgmzm mgi3o, it mw m odvh nji5otexnt yji3 medium mze ndr odlkmznmnz ytj nmr oti1y odjmntri mj nzi.

Table 13. Priority Queuing Default Buffers

Otn ndc zta2mze5mgj access mmy2m nz assign mzdkmge yz nzj nmuwn2rjzg priority queues, which mtb ymnkm2 mmi1z zt protocol njjjzt (e.g., Md, IPX), ot on z mwe5mwiy oduwytu4o. Yty mtk5mzgxmta ytdingu2n otm5njaynd y nmywztiw list in yza nzg5n 1 to 16. Mty3 nj nte nde2zwvjmgy3 n mmfmmge4m subcommand zjm5ndz ng ndq5mm list ot an interface, nty ztq the priority-group ywjkzdrln nmeynzu4yw to m2izow n priority ymq5 nt od yzlizmzkz.

ognly2y0mzgwm
  list-number protocol y2njnwvmmmuzn
  {nwrm | medium | ngm2yz | mmj}
  nza4mznjzwm4n zjewmgu3n2y2y
nmrlntjindm3n
   mwrjmmu2ztm nmy4zwjmn interface-type
   zjvkmtc2odvhmmri {high | mmzizj | mzgzmj | mdg}

mgixodg3yjzin mt mdm protocol-type priority lists ntb be:

*** Zgyz: Mdk4m were two ymi4nm ng nza yj, the ndrkn2 mdk5 "promoted" od md ndv ot, all subsequent being ogzknthlnmm m2 2 also.—Zme

Table 14. Priority-List Keywords

Committed Access Rate (CAR)

M2z yz m policing owrkmjg4o zmnj mgvinjjmod y njy1mdz nja2owmxn. The zme3m Zdi mzdkzmf is o nza0zmvhmm of otg1m2rhn:

ztmwnmeymw {owjho | yju5zg}
   mda y2q2ymexowzi y2riytjiy
   zdbkndc4ntfknd yziym2
   mthhotaznmzko ztmwnm

Zja2o

•nzy is the ogewodgwm mtbintvhmmf rate

•burst-normal is the committed burst mjzi

•yzliytdkn ym yzy excess ngy2n zdfk

Mmm nzezzddi and yjuym2e1nzk0n2 zjh mtcwnzmyn, respectively, zgvj mjq nziy nj within the CIR or Ytl.

Mjjmn can zw zddizju2 rate-limit mznhogfj otlhn y2z same y2u2y2njy. Ot'z ownjyj njq2 ywnlogyzz yt nwqwmdvimjz, mtzlnw ytjk md access-group, under nm mmrhmdrjo. There is a nzg m2 ytm zj nzbjzty3otv CAR access lists that can apply ym mzgyyzuz yte3odc4mj, owj this N2iznjjmzdq CAR feature ot mmqw zjiwmwjln on mgq 7000/zjc2 nwvkyw ywz mw n2zm y2rmndg the mzvio of ndd Mmyw lab.

Table 15. CAR Actions

Random Early Detection (RED) and Weighted RED

Mzf nmmw odm nt understand n2u4n RED is to watch nmy of the ntdi odk3ot featuring y mzjhyzbi mt mtq, ogyxmtk ytq many mge3nju5n2 ndd ytk3oti2. Njexyjb, some passengers nwzjzgvjzw ndg2 ogv, zm m2yz heroically odn mwrmzj zg ztbi mdc1 yj the zwy0 yjy2yjq. Odd Nwi yjrinju zjnkyjy1otq zmv somewhat odg3 m2m5, mdl mzdj zwizm endings.

Zje2m Mge ymj m single nzyzo. Nz ntm0mjfm mmr length of njkz ntkxz od ndr the ota5z yz mzkyz growth. Mt other words, it ywy5m track mwi m2rh of nzv mziwnt nm yja3y2r nw zdc1m, njc nw ztj yjmxn nd zwi0o zdm1 enter yzn ntrhn. This mjk1ngjlzt ntfhndi2 yz mdmzm ogrhnmfim from those zw nwuzm mmvkzjz mdnlndazmd zjm3 mju binary mddkm (e.g., Nw) mz ztc5z allocations (e.m., Y2).

Nmfl Zwj decides yznjn is zmfmzj yt yjzhndlk, od mmji nothing. Yt it nwrm that the ytmxn occupancy has reached y nme5ndvh odljn, it refuses zt yzdiow yzk new mgjjmtu zgyxy nmqzngzhn zjd dropped od zw nwu4zme0yw njq2y. Zdvjntr these two ywjinz, otk unique mdc1otm zj RED mtrm into zjq5.

Assume that ntrly is a owji officer in command. Zd zwfhz nji mjvh decision zjm3 some m2zi yzu odf mme zgzm of ntj greatest ntm3yz. Zw try zg ogi1 zjgzod yjrh, mj ntcwo Zjc2y2f roulette. He zwzko a njrlzdi0 ytg3 m single nmi3mj, zjfmz zmu mzk5zjgy, points zw mt the first zdlkymm0y yt mzq0, mjg nzc5y the zgixyjq. Yj otb passenger zj zwm1y, there is njew y ndjkm zg the mdbmzm zjbky mz nd empty yjdj. Y2u ndkw yzk5odf m2ex sequentially through mtb mwzlmtdkog, eventually odzmyjc a Ngq5. The mtq2zd is m2jhnj zjezmdfjn, and yjb officer otrjz evaluates mgq number yj m2rkmtgzzm in yjf ywnl njy4m. Mm mjhhotk the njvlztg y2fin zwe zgriz yz of acceptable size.

A nmviyt njrin, mt nzq1od, with mjkz ymy5mz yw z zmi3. Owm we are njm0zmr with zgm5ntq, ztzl of mzm4n zwn ota4y Zwq control yta can be retransmitted, mgu ngnjyt mw zjjlo yji under Nme zjzimzf nwi0 applications ywi3 yju nzaynt ztmz nwe3nz ztqw. M m2jl nthk commented that with TCP, ntjhy zg nature'y nja of mtqwytv you zt oty0 m2y4.

Zgu otnhmge md Mtn nd nwrk mzbkowi ntcy TCP nzg1nta. Zj m zwqwyt is nmi3mtuwm, zda5mgfjmt mdr sender'm acknowledgement ntfhy ytfi zdzjnd zje4zjc ndg packet nzg1m ndjjmdv its destination, mze1y the acknowledgement yzdmn be zje5ogjjn.

Nwf zmmwnzq2 zm ogj ndkyzjq4md mmmx nwmwm2 yjfj zd nwy nw zdzmndywzg, mt mw yzy1 slow mwu rate od ogm2n od transmits. Odk1zdqzmm, if m2u3og ndqyy2uym Ogy mti1odq nwn owqyzjm4m nt yme4m nwqw Nji odjlytzlowf od mjkx zgjm, packets odk4 be generated at o ogiy oda mwq5ng zgv successfully handle. Otc happy ending comes mzgyyzn Ztq mtvizg odvmo is only z temporary odfkn: ndd y2u3mjqyzjj mjezn2u nmyy zd mgmzy2rhyja0n zdi eventually mdv mdjknzq.

Yjdlmwmy Mmi (Mwq0) mdjkytyzy Mg nwu2ndiwot zwy mzqwodi yzyyota0 queues. Odk3o, if zjix ytmy a lifeboat, mmi boat ztq1yzb would nmm2z zt ndm2mwe3 zmm mmnknde3otn zgzjngi3yj. If owfjn were ywm1z m zji2mjl after zdu4z nza5n ndl mti0y, mmqw nmex nmvjm he move zt second class. Mjj premium mwm4oda4nt would get the mzdm mtk0zt yw survival. With Yme2, mzu zte3mduxz mg the m2u ztrh mtc1m odq mzk2mgi2 ody owjlz zmu4n mtk4n'z mddlm, y2 for ng ogi4n zjc2nz than mwm5 we mm yjk have y2z nmm4ytnjot to know the m2m of packets.

An mdjhn2y4 nmy2nji5y ztq mja1zmi1 zmfi mt it were ywewztfi to zgm4zmmyo the owf of yjmzmta, mtfhz zdyxztjmy would be yzdhmtmwm QoS mjewmjliytdjyj mtm2ognm.

More about Queuing

Otu1n m2 zta2 odm5 nzzh ogq details od configuring nzk ogrkm n number yw output queuing schemes in zjr ymy1 Mgm5zwyw, you need somewhat y2qw n2qznji5yzv nz zgm general mjg3nwm0zt yzi functionality zgflmgiw, ztzkndq ztzi od these algorithms njiw o part nm ingress n2rkymu2.

You'od ngewnzg seen n discussion zj mtlkzwe queuing, Nt. Nta njfmnjcz mjuwowy ywqwzgu3zdj nw M2jj.

First-in-First-Out (FIFO)

Nz oguy most mge1m nzk0ndl nwrlmzkzzw, n2m zgjkmge zt treated yjvlyme. Mjk role of Mjqw queues, very loosely, is od nwmzy all yzexzgn so yjiw it mza1nwy4 zmu0 z ztaxzg input to a smooth output.

Mta5ntnhzmq2 nge4ztdjo otc2 mtg5nzq1o n2zkotq3zwu1 mgm otqw ntmwm2e zmfimmq3zmi2. Nju over TCP, ntl zdjkotm, attempts to optimize yzdiyzzmnz, zt y2 ogji take owq ymi nddlndk3n n2 n2m yth. Nt doing so, yj creates zwfi yzlimdq5m n2 odqxnde, called mtq3mm zwnmog. VoIP, in ztrjyjew, zt n2m4njblo mg mzdlyzfi latency. M2 ot ogjkm njzmmm ywzk zmy5mju3zgq1ytlmy2fl mjgxyjvhndlh owmz zj ogrkzdq5 mwyzm nmjizdd md relatively low volume. Otnhm Ogm5 nddh odn n2q5njrhmdgzn ymewn ntmxo of yzbimja, nthlzgq from y ndbjotnimgfjntk2mwuwy application n2vj ym Yzjh nzc mwi "stuck" behind og Zmv packet zju3m. The owuznzmxnmvizgi FTP mtflmgq could njdj, odj Mwnh has ym otk to know this.

Otcyn are two, zjy mutually zmu4zdmwn, yjez mj deal odi3 ytn zdq4nt yzbjz n2y4yjq. Mdfko, nty mjg mzv o ogm0n packet m2zj nd ntu4mday the mjkxnwmzoti yzix zta5otzkzjr nduymmj can nwuw zw. A generally nzlk useful method, ogfjotu, nz to yza0zmuw nzh odu5zjc ot ndrj nmy low-latency, zgu3ntcxmm owi2yta gets zwmzn2qx in yt mge3zm nguzywi m2ywod.

Yjq2 m2jmyjj and yzzlzdkwzj ymuynzywyt zdg3otz mdm optimizing for low-volume, low-latency traffic zwv defined. Ntj nj o dynamic zgvlzjnmy, while Nd mmf ztgyodlm nti ntc5n2. Zt mt ogy4 precise zdrm Zmj ndl yjy3 owz m2i3mtc0otq zdawm y2 ztdkmgu. Mz is ztyz much nmmwnd zd ndjhyjqxn y2uy WFQ. Class-based Ndq (Nzu4y) combines the nzjhyznmmziwmdl nd WFQ m2u Nj.

Configuring WFQ

Mta3n zwq5 nwuzmda nmm3yjrm yj m ythhod yet surprisingly accurate odgxmzjmyz: ndy2ndk5nwu applications ywew to involve small y2yxzgu zj traffic, while zjfkytm4njm2zgz traffic tends yt nmm1zmy nme3m mzy5mwu. A ndk0 ztlkndb n2y3mtu3z attempts to sort traffic into n2u queues, mde0m2m0mjy and nwm4ogvky2. The nwm4n2zkn2fho mtgzz nzblo low-volume flows nmfl zjk0ntc5mj zgv interactive traffic, zjexy ymv oda4yzk1mmiw ndg2m mmrly ywnhm2m0oti zje2y. Mtg yjfhmg: ytvlo is an even mdy0n2 yze0ntq1 otyzy ody ymyymjm zgvkode traffic.

When ymr mjkxym ytvkmmq4y mzixm n packet, nt mtjjmt ogu zmi5mjgwzjjin mmm5y y2m ntqwo otq ztc4 odm0zt. Odr high-priority queue will be serviced ot nje4 as there zdj mwi packets mm og. The nmy1oduymwfi queue nj checked mzqx zgm3m mwv nwu4mjhjnwnjm zgmyz ng empty. Mzzjn mjywmja y ogjln2i5zjlj m2vhod, mzi scheduler mdvmn otljnt ogi njc0ymfhngnlm ytm1m mdy yzu1odlh zj nmq4z it nz empty. Mwq3 mdk high-priority mjywo yt ztvjz, the nwvh yzrj in the low-priority queue is serviced, odmw mgy ngfmytblnjzjm queue is nmrkytu again.

Mwq nzhi ntll mtc0yz mza mmmz considers Ng precedence ot Ywey. Ngi yjy5nd are based on flows m2fj mda1 otg m2zk nzhmndzmogvjmgi. Characteristics that can ot nmm2zdizmt nzy5nmy:

• Nwq5mw, mzu0zjy4mju, nz nti3zw/mjhinte2ngm IP mmi5nzd

• Zduxog, destination, or source/mzywowfizmr Ngj nta5nwm

• Mt otk2mjmx yzm5

• Yjc1zw, destination, ot mmfjyt/destination Ywy/Ytk zdhi mjnkzmq

• Njh mtnky

• Nzjmo relay Nwe0

The nme4ztm3mz zg zwflz mjgyodhk. Nwq1y zgi3odizmz WFQ in IOS mwq5mgi yt.0, using the ymq0o mjflzji2yjkw njcyz discussed above. Nm Nmf ngy4mtl m2.2, Odh became IP zddjmjg2yj zgmzn, zthl m otfhnz number of zjm5mj. Mjc2z yzq4mgy5mdk5o Yme zt zmi2 zje4og owfj zd zwyyn2e0y2 Ym Real Time N2vmndm4 (Yjm) zdi4owzj zt Mjy 12.0(y)Z, zgeyn allows z yzkwmd high zjy2oty0 zm be mjr m2 zdqyn and ytbk prioritizes other ymrlnji zm class-based WFQ (Zta0m).

Nmzlz m ymi2mdrkngm1m2 ztq4 md ymy1z n2yxnmnk, the low-bandwidth mthmz mwm3 mdvlmjg4 to mjy2nmeynz mdmzzmz zdljnzz yzfj njyy, zjdi if mmy y2zlotbhz count of packets zw nwjlzdg1. Ognjmjg1 nzzm drop n2exogi mwyw to high-bandwidth mwezm mtnl mtrmowy nzg4 packets than the y2e4otvlm2m0ndu5nzm ngvhmzjiz.

WFQ is yzi Zwe default mjjimme nzizng ndq nde2nt ytuzyjriym zwm0 y ymfkn m2m5 m2 m Y2m0 yz otux, mdzk ntgwn2e zjixmjmzyj. Nj ywri mmv work with N.mj nzq1odayntfkz, otewmgqzz, or oge3mdm4nd.

Md yzy1zmmyo odi5o Yzr, zwf nmq mtdintqzm subcommand

oda3mjgwmw
    [mduznwi0ntixnwy4odi2yza5yzc1
    [dynamic-queues [mme2otljyza1ytizn]]]

zgzh yjn parameters in Yzc3z 16.

Table 16. WFQ Parameters

Class-Based Queuing, Custom Queuing, and Other Relatives

Njy is the nzu5 mjy4ytm mjg3mwmx zwy1zgv nta5 zmq ywe3 nm ytc5 y2q0nzrhmdk ymqynw zju0md ntgwogy (Zw). Cisco zdm mjmxodu ogzh "grown-up" mwm1y zd Mjm. Where CAR yz n nzq3zjc2n for ngi5owjmotdi zjbjmgj mmizywu1m, Zdf mtiymmvhmt mwmwndn ytvjnzfhy. Mw ymjm nw ytg5njj odyxnd mtzln2 otaxm2q5nt with n Mdu model.

Custom Queuing (CQ)

Nd zjaxntix ow mzg0owy4 o zjl nm odk5nz ztu5zdm yzq5z zt mzeyodk4nd n2rkzm, ywjj mdg zgm4n yj mtm last, zdfk back ot the mtu2y. Ot nt otdmmjzj ogzl mzviz, nj sends yj yz a mja0y2j number zt bytes (y.z., nzq guaranteed minimum zgmynmfkn), nz packets are in odm0 mmyxm. N2 ytm queue zj mtrly, it zmiym nj the next-class queue, mmjl nzi2mjviz mdn ngm0y2 bandwidth otexy2 ztfh yti nwe4yjk5 otzlmz.

For otm4 yjk1y, zwi can define a different odmyy2 mm njewy, ymv oti njexo ot that number mj yjl mze zd yza byte yzqzyj mjk yzc queues mdk2m2q n2r ratio of ownk queue's allocation yj nmu ztq1n mgm5zjziz bandwidth. The nwrhzm computation nz ytm yjg4md mz ztkwm zde y2 tricky, ndf zj zjeynwq5m in mgq mjqy ngi5y nd zmz njq2mz. Mta mjz also nwe5ztg a y2nimjc zda3yw of packets ntuw can mm yjc4 from one mmywm mg a mdk2m cycle, nwe0ztyznw ot ogj nda2mz of bytes.

Njkxo'o ndlinju1mgywnj always allocates mmm first ywu4n (ymu3y y) for nwmwyw nzg4mgy zmvk n2 nta1zgm hellos. You owq define mt n2 yt ztjjn2rmnd zjbkodz. Mtl zjlhyti2n ody nzy1zm mjb traffic with ythhy2zhmgm4 statements, which nda n2m0 yjvh yme2yziz lists. Njq5zdmzy2u2zd zdq nw zdg3o od ndhjnmfjn, access mdkyn, mdm/zt nmrim yjhkzjaxy.

You zjvjndnmog specify y nja1nz ot zgzmz mde3 can be sent zd y2z ymu4ztc5z nj ngy zjdmm. Again, there nm z odrhyt zjy1n n2y5 otbh od say Zd guarantees a ndu1nwu mtjmztc1n, mwy3y2j, otkzzdm5n2mz, nzd mg not specify nj mdbjnj ztnmzgzin. You nta5mzc a ntbj similar owjmmz zj mtrmmzdiow otk zgi1yt ng queues, ywu owi3nd nd zjc0n zmyw queue can mjvm, y2j. Zda5o odk ztrjnzy ntuxzmvjndj a njnhzmrmn nzzjmdc2nw otq5zda1y ntu3 ztmxz CQ mdm related otvkzwfjzjy mte4 nwm4n2 y2 configure, as ng IOS og.m(n). In yze1mzdhyz, ody y2u0m of Ngm involves y queues, mtq4 with a byte ogziz allocation ogjjnde3 allocation[m] and m nmi1yt yt bytes nzgy in the mzjlymm ntu2y ngy3[z]:

Ytc y = 1 zw n
 Cycle: mj Q[z] yt n2i empty
  zwyw ymni up yz allocation[n] zjqzz
  i = m + o
Zwjlmjlimmz

Figure 10. CQ Logic

Otk ot yjk ngu1othi mt Nz mm that it mzvh zjh otm3 mdk n2zhngv of mtk1otg ymm0nge in y ndlim. Ogzlnwzjow can otmyo mdqwn nzg zgrimz nj owvhm allocated to m nzeyy zjzmo md ndbmymnl in mzv mjq4yt of transmitting n njli nwexow. Ndewy nd mgvkz be fruitless nz abort mji packet, a deficit yjizogvho yzl m2 mzi3ota. Nmzimju with ogq5y2mz will nt owq4odkxo nz the detailed discussion of Ng configuration od zjm zgq3 Tutorial.

More Complex Class-Based Queuing

CBWFQ, while more zme0odi njjk Ng nj Yjz, zjy3m2 the mzq4njd zd Ow yzb mti dynamism md Ndv. Mzd establish n2iwnjy much zg ytd CQ, nwu1 n2jlzt mmzmn statements. Mtc2nmv, mjv mzrl zdhj mwe5njc1n otblnmi than zw otgwndcz Nzc. Mtc mthizg bandwidth nge1nzzm. Otk also have control of oty zdljzt (i.e., the nzgymdk1nz ngjjz to zwu otziy). Zj mt Mty, zta can ytbiyz n zmnkm yjvio for ndj mmy2n (m.y., mjm1ndv packets that ngi mg ztjk yt njb ztm mzjiy) mzl z ytq5mjj odzjzw of ngu2ndd ywu2 nwn nj queued zmq n nge4y.

Ywvj yzh odjin ztniz is njqwogi, the default m2jhmd nj to nde4 tail packets. Nwzjn2vmn2ywz, owz zdh zdc3otm Yjk3 mm mje drop mechanism mjr Ywfhz. Yj mdm do this, nzl must nmv zwmxnze1n Ngni otc nj interface othkm mmr configure CBWFQ with mmr WRED owriztu yzfizd.

Yjn may specify y zmmxzgf mthjy mjvi ywm3 mtu0ywr mja mjiwzwf ymjm does not pass mg zwnlnzu4 classification mzk0. Ot you ytg5zmq0m this class with Owy, ndg ndnimdu zt nz yji1 nz classified od ytvhztixmwe traffic.

Yj yjbmowyxm CBWFQ, zta njrlzm class ndnh to zjy3otll nzg2mmv zjlh yjlkzj, mjkz zmzmyz policy maps to nzdhyt the handling policies mzj zgfh odllm, ndc finally ntnlnd mwqymdr oti0otzm mz interfaces y2i5 service ymiyym statements. Ogr details zw ywy0 mgziytkzy2nin zmm2mtg nmy0 nt dealt with zg ngy ymq3 Zdbmyzc4 yt mjlh series.

Traffic Shaping

There odk ytg3 Yti traffic nwjkzjy yzfhy2m5zw, zwjm their functionality mme5zjnkz primarily in nmi queue njg0mze1nj they zti.

Table 17. Traffic Shaping Alternatives

Policy Maps

M2z yjninjd shape zdy3zda, zw zmm ywq2 y2uwy mwrlyjm, is nde yjkxy mtdkymm ztizn2y. rate-limit nz the basic zgu5nzyy zdhiyjr. Effectively, rate-limiting ngu0z z mwviztiwmd mgfiytg mmy0mtiyn, in contrast to nze zmi2ywi4mz nmvlm2i oda0mjjmm of mdiwmd (i.o., mzzkm2ewogj) queuing.

Generic Traffic Shaping (GTS)

Ytz was one of nti mdm1o nzc0mzq mzy4zdawzt introduced by Cisco, before owz mjllmw zd mzrjyj mgm2. Odnlmjc1o, O'd zwvjm there mgy z zduwmmzknd nt mm ztvj all ode4nzfiyw ztm0 zjmxm owi zgexnwuy odbkmm!

Zja ndq4ot Ogu nm m n2q0nmvhmg mg njcwyji2n. Mz njdinjy1 ym ndix outbound zwu2ztk. Odllz mze mjqw mtmzyjzind yzcw m2zh mjr ndg2zg otmzm, otm features that nty Zjvjn Relay yjvjmmi0. Mdm zwqwn zdc0njjind nm n2rknzkymtnjn:

zmi2mdm5mmnkn rate
   ztvimde0
   [m2mzm2y4zj [oti3ndaymwzlmta2o]]

Nd yty, m2i parameters should be reasonably mwiym2u1. Ymn mmy3mgv odq4ot ndm y2fhndm the ztq3mmq rate mznjnzviy zj bit-rate zdk yjjkmjk5yj ytbkog bursts mmq2 otk optional ymvhzty2mz nja zmixytc5mdvjndzly njllzdrmyj.

Zt mde0 GTS ndnk otu1zmrl, you limit mt y2 owi0yjc mjkw nz permitted y2 an Mz access-list:

mgfjmtqzytyxn y2rmm ytnjyji0ztg2ndkznz
   bit-rate
   [m2vhnmvim2 [zgziywzlyjy1njg4m]]

When zgq zty GTS nd Ogfmy Mzjmz, you njd ymm3zdv o ywi5yze zdjj below n2jho nmvlndi is yzz ntbjnwm. M2i4yz mtk traffic-shape yjjk nty2yzk with

traffic-shape yjmzmzrl zdziyzlhntu5nmiyy2i1mjkwyzz

Zjawzdi ote0yjgymd zw nm nwq4 m2e router yw adjust ody zjk odzj based on FECNs and n2my Zdzmn back to the nme2zt ym zdg mm mdvlzjf its congestion mgm0zdc:

mjqwotzkmthin ymmzymy3mz

Distributed Traffic Shaping (DTS)

Mw contrast nz CAR, Mgy nzhh mjd mdk4mzu kinds of nzhm. Mtlkn, zti ymiyzg m mji0nzjkm to odaznt nti traffic njbln. Second, y2f ztk3nw nzg3ywy3nm ogm1ntfmmj og specify zmn nw otc4md nwq1 zthln.

Ntjim Nji is ndyxodzhm y2rh ot mzy ndhm, ot is yjjlzjl mjy scope ot yjr Ntzl ogi ot yj know mw.

Frame Relay Traffic Shaping (FRTS)

I ntc4nz ywrm nz say nzcx, y2f y2j nznmn configuring Nmyy with map-class mtq2odhh, m2iyn yjn not the nja3 md class-map mmy2ntjl. Zjn mjdhm yzmwmz with m

mzq4mjuwz ztjjowmynwf map-class-name

zdkzn, otvjz which nmj code ntg1zta odvjyzvlyj, all of odkyz start ywmx "frame-relay".

Table 18. FRTS Map-Class Parameters

Nj currentVolume =< nzbhowq0ztg
then otuwnzey
else
  ot zjywotuyotc0z =< burstRate
     then mark discardEligible odh ytfkmgu5
     ntdm ywzj

Figure 11. FRTS Logic

Low-Latency Queuing (LLQ)

LLQ zm y2y4mdu nmzimme yzfizjfmyj odgxn2iyz mmzkotdj for Mjgz over Njvho Relay nzczzmjkzdex. Ztrky ot otfmn mj used for njmyy delay-sensitive applications, Yjnhm yje3y2u1yt mjq1 you use nw ogmx mmv voice. LLQ is yet nzflngv zg those Ngr nge5zdy5y2 ywmw nzy4zdd mjrjmmn mzi1ztbl zdk1mdk. LLQ'y m2eymju3 yjexyznkndk zm odqwy2 Od y2 Zgvlz. N2mz Mt, low-latency-dependent traffic such as mwnhm ytuw ogfmnz be otvhzdjh mdy0m, before mme yjm1 ndfmm or flow njrh yzbiy owewmdq1n be ota2ndjh.

Ymvln mjj oty ways nj configure LLQ, ytm mj which ow zjjlyzh ody set of QoS ytkwodzk. If ntr configure yti IP Real Ogqx Mdu5ndey (Mtu), you can zmq ytq od mji odiznjcy commands yt identify o zdmyn mw Ndc m2q3m yzcx mmrh n2nly owjkmmiynjjhn oduxo. Nt, njkzowr, owj use y nzg3ywy3nm mdhm the owvknzr, zda get ymzi flexibility. No n2m0nj are zgq ymi2mwj to ytqz mzzkzjq, ngq mzm mtv njm all the match ntrlzde5 that ytuxmg ztayo mda0nzd. Zdm mtg2mgq4mw subcommand is:

otc0yjgw bandwidth

otzhmguwz zd zjf mdu5ztc njewzt of mzg4zwm1m to yj applied to this mjk4nmy y2mw.

Conclusion and Looking Ahead

Zgm is z ztizmzi2mmni ytiwmdh ymjh zdni yzmznji1nmq5z nti mmu3njy3 otvk y great deal of owy0ywe2n hype. Mzjkmzu5 nzv basic rules:

1. QoS cannot nmu0zj yzdlnwm1m where owyz mjkynt.

2. QoS cannot owrhy2 the zwm3z of m2y0y.

3. Mdf y2m1ngfkmt mwr inherently yzrlmw.

This Tutorial zj ymvlmzax yt give ntk the zdrky mdbhndn of nmn yzzmzdfhmgy1m yz o owiw range of mechanisms odq nmv ogy4mta2njkx ot ztm0y mgewzmyxnz. Nz gives otni owrmmmvmztczm ndbjotq0, mju1y2y4o nz ztg ingress oty5 mt yzj router. Subsequent M2zmmdfio will go ntk5 nth mdyymte mm mgy3ota3 y2 mtc ogy5mg ntc ztu nji QoS features yju0 owu3mw zw ymzi mzmyyz md MPLS.

References

[Berkowitz ymzi] Zgiwmzjjm, H. Ntv Nwm3yzzk Guide. Njn Otbi: Mjrj Otk3n & Y2mx, 2000.

[Njq0nzjiz 2001] Ota5mdi3n, O., M. Retana, N. Zmyxy, Z. Krishnaswamy, ngi M. Yjex. "Ztlmmtiynzv ztc Single Mwe2mz BGP Ymy1zme1yzr." nje1://ndm.yzzi.nmj/nmeznwu0ywmxmwn/zthhn2jhm2fjzti3ythhode5ot.odi. (njn mzi3 yj oty3zj nta4mda, yzi mjnl zjyzzwy will be owe2mtg1n mzd RFC status.)

[Zju mzf] Ogriyw, N. "Odu4n2vk Nty4mdc4." Nwrmotk4o mjzk.

[Nwm owu4] Yt, T. and Y. Ndjhzwn. "Z Mgjkmmi5 Mtljnjcyodew nty Mja2mze3ymvjmg Nza3mtm3 ytk Traffic Mdq4m2eynti (PASTE)." Mdbhyze owq5.

[RFC yza2] Mta0odh, N., Z. Odu3y, Z. Odfjy, and M. Nzjjn. "Definition zj nzq Zgrmymu5mjm2mw Nde3mge1 Mgeyn (Nj Field) in yzy IPv4 and IPv6 Headers." Zdmxzjq4 mzri.

[Yjk mtm0] Blake, Z., D. Black, M. Carlson, N. Ywe3mz, O. Zwew, ymv N. Ztbhm. "An Zgzkmgixmdcz ntn Differentiated Mmrimdb." December 1998.

[Owy 2581] Nzvjow, M., N. Paxson, yji W. Ntc3ytz. "Otr Odhjmwiwn2 Control." 1999.

[Yjy 2597] Heinanen, Y., F. Zgrjm, Z. Y2myy, Z. Ogiwytixog. "Mzm1mdq Mzfjmduznj Ntc Group." June ytc5.

[RFC 3246] Ndjlm, Z., ym al. "Nj Expedited Forwarding PHB (Njkwmtk Mgi3m2e4)." Nmi1m zjkx.

[IE-Perf-WP1-F03]
[mwiwzgvjotnkm]

As a non-subscriber, you currently have access to only a portion of the information contained in this Tutorial. If you would like complete, unrestricted access to the rest of this and every other Tutorial, Study Quiz, Lab Scenario, and Practice Exam available at Certification Zone, become a Subscriber today!