of cardinal gregory of crescentia. as bishop he devoted special care to the training of the clergy. he probably wrote out the law of jutland ( jydske lov ) and composed the original preface to it, and was present when it was published at vordingborg in 1241. he died at asmild, 25 aug., 1251, and was buried in front of the shrine of st. kjeld. thorleif olafsson ( 1438 - 50 ) was translated to bergen, and succeeded at viborg by canute mikkelsen ( 1451 - 78 ), dean of the church of our lady at copenhagen, and rector of the university of erfurt in 1434. a great diplomatist and jurist, he was author of the latin notes appended to the first two editions of the law of jutland and of a popular treatise on the plague. the last catholic bishop was jorgen friis ( 1521 - 36 ). he was a worldly - minded man and quite unable to cope with the movement to which the preaching of hans tausen at viborg ( 1525 ) gave rise. in 1530 the cathedral was in the possession of the protestants. friis retired to the castle of hald, where he was imprisoned in his own dungeon in 1536. two years later he was released on promising to submit to the new order of things. in 1540 he was endowed with the lands of the abbey of vrejlev and some of the property of the see, and though he never married, he led the life of a lay nobleman until his death in 1547. though the danish reformation began at viborg, certain catholic usages were kept up in its cathedral longer than anywhere else in denmark. the shrines of st. kjeld and st. willehad were removed to the choir of the cathedral in 1538, but lutheran ministers continued to recite daily the office of the dead for the soul of king eric glipping ( d. 1286 ) from 1560 to 1630. the protestant bishop hans wandal shortened and protestantized the service and entrusted its performance to the senior curate of the cathedral and twelve of the school boys. these all benefited by the endowment, and continued the service until 1684. of the twelfth - century cathedral nothing remains but the crypt. the upper church built in 1876 contains splendid frescoes by joachim skovgaard begun in 1895 and a seven - branched candlestick from 1494. the abbey church of grinderslev, the church of


the twelfth - century cathedral nothing remains but the crypt. the upper church built in 1876 contains splendid frescoes by joachim skovgaard begun in 1895 and a seven - branched candlestick from 1494. the abbey church of grinderslev, the church of st. botolph, at aalborg, and numerous village churches are memorials of the catholic past. at karup there was a pilgrimage to our lady ' s well. the chapter of the cathedral of st. mary and st. kjeld was secularized in 1440, after which it consisted of a dean, an archdeacon, a precentor, and twelve secular canons. there were also at viborg the benedictine nunnery of st. botolph, a franciscan friary from 1235, and a dominican friary from 1246, as well as the hospitals of st. michael and of the holy ghost. at aalborg there were a benedictine nunnery and a franciscan friary. the cistercian abbey of vidskild ( vitae scola ) founded in 1158, the augustinian abbey at grinderslev founded before 1176, and the augustinian nunnery of asmild were all situated in the diocese, as were also the benedictine (? ) nunnery of sibber, and the hospitals at tesdrup and karup. in 1523 there were 236 churches in the diocese of viborg. now ( 1912 ) the camillians have a church and hospital at aalborg, while viborg is one of their out - stations. more catholic encyclopedia browse encyclopedia by alphabet the catholic encyclopedia is the most comprehensive resource on catholic teaching, history, and information ever gathered in all of human history. this easy - to - search online version was originally printed in fifteen hardcopy volumes. designed to present its readers with the full body of catholic teaching, the encyclopedia contains not only precise statements of what the church has defined, but also an impartial record of different views of acknowledged authority on all disputed questions, national, political or factional. in the determination of the truth the most recent and acknowledged scientific methods are employed, and the results of the latest research in theology, philosophy, history, apologetics, archaeology, and other sciences are given careful consideration. no one who is interested in human history, past and present, can ignore the catholic church, either as an institution which has been the central figure in the civilized world for nearly two thousand years, decisively affecting its destinies, religious, literary, scientific, social


a titular see in crete, suffragan of gortyna, was probably a colony of tarrha. it was taken by storm and almost entirely destroyed by the romans. augustus restored it and in consideration of the aid rendered him in his struggle with m. antonius, he bestowed on the citizens their freedom, and with it the right of coinage. it has been identified with the modern small village of polis. the episcopal see is mentioned in the " notitiae episcopatuum " as late as the twelfth and thirteenth centuries. it was re - established by the greeks about the end of the nineteenth century ; the bishop resides in the monastery of preveli. lequien ( oriens christianus, ii, 268 ) mentions petrus, who attended the council of ephesus, 431 ; deneltius, at chalcedon, 451 ; prosdocius, in 458 ; john, who appealed to rome against his metropolitan paul, and attended the council of constantinople, 667 ; epiphanius at nicaea, 786. more catholic encyclopedia browse encyclopedia by alphabet the catholic encyclopedia is the most comprehensive resource on catholic teaching, history, and information ever gathered in all of human history. this easy - to - search online version was originally printed in fifteen hardcopy volumes. designed to present its readers with the full body of catholic teaching, the encyclopedia contains not only precise statements of what the church has defined, but also an impartial record of different views of acknowledged authority on all disputed questions, national, political or factional. in the determination of the truth the most recent and acknowledged scientific methods are employed, and the results of the latest research in theology, philosophy, history, apologetics, archaeology, and other sciences are given careful consideration. no one who is interested in human history, past and present, can ignore the catholic church, either as an institution which has been the central figure in the civilized world for nearly two thousand years, decisively affecting its destinies, religious, literary, scientific, social and political, or as an existing power whose influence and activity extend to every part of the globe. in the past century the church has grown both extensively and intensively among english - speaking peoples. their living interests demand that they should have the means of informing themselves about this vast institution, which, whether they are catholics or not, affects their fortunes and their destiny. browse the catholic encyclopedia by topic copyright © catholic encyclopedia. robert appleton company new york, ny.


| home astrology. love match. dating. wedding date. baby gender. baby name. marriage. lucky year. lucky bedroom menu | where does the yin yang symbol come from? is a well - known chinese yin yang symbol. sometimes it ' s called tai - chi symbol. the tai - chi is from i - ching. the i - ching is the greatest foundation of chinese philosophy. itis development is from the natural phenomena of our universe. because i - ching comes from nature, it should be easy. the chinese characters of i - ching are. the second character means a book, a profound book. the first character means ease or change. since i - ching is easy, some people call it as " the book of ease " or " the book of changes ". the original chinese character of is, which is a symbol combining the sun ( top ) and moon ( bottom ). it ' s easy for people to understand the philosophy by talking about the sun ( yang ), moon ( yin ) and universe. after observing the universe, ancient chinese found that the universe is changing every day. although it changes easily every day, it also has seasonal and annual cycles. from these cycles the unchanging rules are created. however, it ' s not easy to use the method to find the unchanging rules from the universe and apply on human activities. that ' s why some people think i - ching is easy and some don ' t. by observing the sky, recording the dipper ' s positions and watching the shadow of the sun from an 8 - foot ( chinese measurement ) pole, ancient chinese determined the four directions. the direction of sunrise is the east ; the direction of sunset is the west ; the direction of the shortest shadow is the south and the direction of the longest shadow is the north. at night, the direction of the polaris star is the north. they noticed the seasonal changes. when the dipper points to the east, it ' s spring ; when the dipper points to the south, it ' s summer ; when the dipper points to the west, it ' s fall ; when the dipper points to the north, it ' s winter. when observing the cycle of the sun, ancient chinese simply used a pole about 8 feet long, posted at right angles to the ground and recorded positions of the shadow. then they found the length of a year is around 365. 25 days. they even divided the year ' s cycle into 24 segments, including the vernal equinox,


posted at right angles to the ground and recorded positions of the shadow. then they found the length of a year is around 365. 25 days. they even divided the year ' s cycle into 24 segments, including the vernal equinox, autumnal equinox, summer solstice and winter solstice, using the sunrise and dipper positions. they used six concentric circles, marked the 24 - segment points, divided the circles into 24 sectors and recorded the length of shadow every day. the shortest shadow is found on the day of summer solstice. the longest shadow is found on the day of winter solstice. after connecting each lines and dimming yin part from summer solstice to winter solstice, the sun chart looks like below. the ecliptic angle 23 26 ' 19 ' ' of the earth can be seen in this chart. | the ecliptic is the sun ' s apparent path around the earth. it ' s tilted relative to the earth ' s equator. the value of obliquity of the ecliptic is around 23 26 ' 19 ' ' in year 2000. by rotating the sun chart and positioning the winter solstice at the bottom, it will look like this. the light color area which indicates more sunlight is called yang ( sun ). the dark color area has less sunlight ( more moonlight ) and is called yin ( moon ). yang is like man. yin is like woman. yang wouldn ' t grow without yin. yin couldn ' t give birth without yang. yin is born ( begins ) at summer solstice and yang is born ( begins ) at winter solstice. therefore one little circle yin is marked on the summer solstice position. another little circle yang is marked on the winter solstice position. these two little circles look like two fish eyes. in general, the yin yang symbol is a chinese representation of the entire celestial phenomenon. it contains the cycle of sun, four seasons, 24 - segment chi, the foundation of the i - ching and the chinese calendar. © copyright 1999 - allen tsai translated language : serbo - croatian more yin yang symbols at yin yang mania world dr. stefan jaeger ' s yin - yang symbol : mathematical daylight model and video where is the chinese hell? where do 12 - branch symbols come from? fortune angel chinese astrology 2012 chinese astrology year of dragon chinese astrology for tiger woods marriage complete michael jackson chinese astrology home of chinese fortune calendar


wheezing is common in small children — around a third of all children will have an episode of wheezing before they are three years old. although it ’ s common, we still don ’ t quite know the best thing to do about it. the problem is that wheezing, like fever, is a symptom of a disease, not a disease itself. it ’ s not one thing. every physician who treats small children in the office, the emergency department, or the pediatric intensive care unit is often faced by the dilemma of what to do with a wheezing small child. in such children wheezing is often triggered by a viral illness. when it happens in infants it is often caused by a virus we call rsv ( short for respiratory syncytial virus ) and causes a disorder called bronchiolitis. for those children, we know that not much of anything helps the symptoms — all we can do is provide supportive care and wait for the illness to run its course. what about wheezing children who don ’ t have bronchiolitis? can anything help them? the problem facing the doctor is that all the treatments we ’ ve tried over the years for small children who wheeze are taken from how we handle older children who have chronic, frequent wheezing — what we call asthma. these treatments work for asthma, yet they often don ’ t for wheezing that isn ’ t. a certain number of children who have their first spell of wheezing will go on, over years, to develop true asthma. but most wheezing toddlers won ’ t progress to asthma — they will have an episode or two ( or three ) of wheezing and then “ grow out of it. ” if you bring your infant or toddler to the doctor for a first ( or second ) episode of wheezing, the doctor has no way of knowing which of these two things will happen. there are a few clues, such as a family history of asthma, which will increase the chances of future asthma, but there ’ s no good way to tell. how do most doctors handle this problem? most will try a dose or two of asthma medications ( inhaled albuterol and / or budesonide, or oral prednisolone are commonly used ) just to see if it helps. if the child gets better, they can be continued. my point is that you should understand that for this problem — wheezing in an infant or toddler — your doctor is handicapped


##olone are commonly used ) just to see if it helps. if the child gets better, they can be continued. my point is that you should understand that for this problem — wheezing in an infant or toddler — your doctor is handicapped by not being able to predict the future. only time will tell. it ’ s a frustrating, but common medical scenario. 11 / 13 / 2010 • the winter virus season is fast approaching, bringing with it the old dilemma of what to do about infants and toddlers who wheeze. last year i noted that we had no specific treatment that worked. a... more 05 / 14 / 2010 • the traffic analysis of this blog tells me that wheezing - - what causes it and what we do about it - - is one of the most common search terms that bring people here. it ' s a... more 02 / 01 / 2011 • the traffic analysis of this blog tells me that wheezing - - what causes it and what we do about it - - is one of the most common search terms that bring people here. it ' s a... more 12 / 04 / 2011 • i generally put up a variant of this post every year or so because the traffic analysis of this blog tells me that wheezing - - what causes it and what we do about it - -... more - wheezing in infants and toddlers : we still don ’ t know what ’ s best to do | christopher johnson m. d. picu author - just what is wheezing, anyway? | christopher johnson m. d. picu author 11 / 08 / 2011 • my last post was about asthma. this one is about another very common breathing problem in children - - bronchiolitis. in some ways it is similar to asthma, but in other important ways it is very... more 01 / 28 / 2011 • i ' ve written before ( here, here, and here ) about rsv, one of the most common causes of respiratory illness in infants and toddlers, and the most common cause of illness severe enough to land them in... more 02 / 27 / 2010 • bronchiolitis is the leading cause of hospitalization for very young children in the usa. you ' ll find various definitions of what bronchiolitis is, but a standard one is a viral illness that starts in the upper... more


table of contents congestion management overview congestion management features allow you to control congestion by determining the order in which packets are sent out an interface based on priorities assigned to those packets. congestion management entails the creation of queues, assignment of packets to those queues based on the classification of the packet, and scheduling of the packets in a queue for transmission. the congestion management qos feature offers four types of queueing protocols, each of which allows you to specify creation of a different number of queues, affording greater or lesser degrees of differentiation of traffic, and to specify the order in which that traffic is sent. during periods with light traffic, that is, when no congestion exists, packets are sent out the interface as soon as they arrive. during periods of transmit congestion at the outgoing interface, packets arrive faster than the interface can send them. if you use congestion management features, packets accumulating at an interface are queued until the interface is free to send them ; they are then scheduled for transmission according to their assigned priority and the queueing mechanism configured for the interface. the router determines the order of packet transmission by controlling which packets are placed in which queue and how queues are serviced with respect to each other. this module discusses these four types of queueing, which constitute the congestion management qos features : • fifo ( first - in, first - out ). fifo entails no concept of priority or classes of traffic. with fifo, transmission of packets out the interface occurs in the order the packets arrive. • weighted fair queueing ( wfq ). wfq offers dynamic, fair queueing that divides bandwidth across queues of traffic based on weights. ( wfq ensures that all traffic is treated fairly, given its weight. ) to understand how wfq works, consider the queue for a series of file transfer protocol ( ftp ) packets as a queue for the collective and the queue for discrete interactive traffic packets as a queue for the individual. given the weight of the queues, wfq ensures that for all ftp packets sent as a collective an equal number of individual interactive traffic packets are sent. ) given this handling, wfq ensures satisfactory response time to critical applications, such as interactive, transaction - based applications, that are intolerant of performance degradation. for serial interfaces at e1 ( 2. 048 mbps ) and below, flow - based wfq is used by default. when no other queueing strategies are configured, all other interfaces use fifo


intolerant of performance degradation. for serial interfaces at e1 ( 2. 048 mbps ) and below, flow - based wfq is used by default. when no other queueing strategies are configured, all other interfaces use fifo by default. there are four types of wfq : – flow - based wfq ( wfq ) – distributed wfq ( dwfq ) – class - based wfq ( cbwfq ) – distributed class - based wfq ( dcbwfq ) • custom queueing ( cq ). with cq, bandwidth is allocated proportionally for each different class of traffic. cq allows you to specify the number of bytes or packets to be drawn from the queue, which is especially useful on slow interfaces. • priority queueing ( pq ). with pq, packets belonging to one priority class of traffic are sent before all lower priority traffic to ensure timely delivery of those packets. note you can assign only one queueing mechanism type to an interface. note a variety of queueing mechanisms can be configured using multilink, for example, multichassis multilink ppp ( mmp ). however, if only ppp is used on a tunneled interface — for example, virtual private dialup network ( vpnd ), ppp over ethernet ( pppoe ), or ppp over frame relay ( pppofr ) — no queueing can be configured on the virtual interface. why use congestion management? heterogeneous networks include many different protocols used by applications, giving rise to the need to prioritize traffic in order to satisfy time - critical applications while still addressing the needs of less time - dependent applications, such as file transfer. different types of traffic sharing a data path through the network can interact with one another in ways that affect their application performance. if your network is designed to support different traffic types that share a single data path between routers, you should consider using congestion management techniques to ensure fairness of treatment across the various traffic types. here are some broad factors to consider in determining whether to configure congestion management qos : • traffic prioritization is especially important for delay - sensitive, interactive transaction - based applications — for instance, desktop video conferencing — that require higher priority than do file transfer applications. however, use of wfq ensures that all traffic is treated fairly, given its weight, and in a dynamic manner. for example, wfq addresses the


desktop video conferencing — that require higher priority than do file transfer applications. however, use of wfq ensures that all traffic is treated fairly, given its weight, and in a dynamic manner. for example, wfq addresses the requirements of the interactive application without penalizing the ftp application. • prioritization is most effective on wan links where the combination of bursty traffic and relatively lower data rates can cause temporary congestion. • depending on the average packet size, prioritization is most effective when applied to links at t1 / e1 bandwidth speeds or lower. • if users of applications running across your network notice poor response time, you should consider using congestion management features. congestion management features are dynamic, tailoring themselves to the existing network conditions. however, consider that if a wan link is constantly congested, traffic prioritization may not resolve the problem. adding bandwidth might be the appropriate solution. • if there is no congestion on the wan link, there is no reason to implement traffic prioritization. the following list summarizes aspects you should consider in determining whether you should establish and implement a queueing policy for your network : • determine if the wan is congested — that is, whether users of certain applications perceive a performance degradation. • determine your goals and objectives based on the mix of traffic you need to manage and your network topology and design. in identifying what you want to achieve, consider whether your goal is among the following : – to establish fair distribution of bandwidth allocation across all of the types of traffic you identify. – to grant strict priority to traffic from special kinds of applications you service — for example, interactive multimedia applications — possibly at the expense of less - critical traffic you also support. – to customize bandwidth allocation so that network resources are shared among all of the applications you service, each having the specific bandwidth requirements you have identified. – to effectively configure queueing. you must analyze the types of traffic using the interface and determine how to distinguish them. see the " classification overview " module for a description of how packets are classified. after you assess your needs, review the available congestion management queueing mechanisms described in this module and determine which approach best addresses your requirements and goals. • configure the interface for the kind of queueing strategy you have chosen, and observe the results. traffic patterns change over time, so you should repeat the analysis process described in the second bullet periodically, and adapt the queueing configuration accordingly. see the following section " deciding which queueing


of queueing strategy you have chosen, and observe the results. traffic patterns change over time, so you should repeat the analysis process described in the second bullet periodically, and adapt the queueing configuration accordingly. see the following section " deciding which queueing policy to use " for elaboration of the differences among the various queueing mechanisms. deciding which queueing policy to use this section looks briefly at some of the differences between the types of queueing and includes a table that compares the main queueing strategies. fifo queueing performs no prioritization of data packets on user data traffic. it entails no concept of priority or classes of traffic. when fifo is used, ill - behaved sources can consume available bandwidth, bursty sources can cause delays in time - sensitive or important traffic, and important traffic may be dropped because less important traffic fills the queue. consider these differences in deciding whether to use cq or pq : • cq guarantees some level of service to all traffic because you can allocate bandwidth to all classes of traffic. you can define the size of the queue by determining its configured packet - count capacity, thereby controlling bandwidth access. • pq guarantees strict priority in that it ensures that one type of traffic will be sent, possibly at the expense of all others. for pq, a low priority queue can be detrimentally affected, and, in the worst case, never allowed to send its packets if a limited amount of bandwidth is available or if the transmission rate of critical traffic is high. in deciding whether to use wfq or one of the other two queueing types, consider these differences among wfq and pq and cq : • wfq does not require configuration of access lists to determine the preferred traffic on a serial interface. rather, the fair queue algorithm dynamically sorts traffic into messages that are part of a conversation. • low - volume, interactive traffic gets fair allocation of bandwidth with wfq, as does high - volume traffic such as file transfers. • strict priority queueing can be accomplished with wfq by using the ip rtp priority, frame relay ip rtp priority, low latency queueing ( llq ), distributed low latency queueing, low latency queueing for frame relay, or frame relay pvc interface priority queueing features. strict pq allows delay - sensitive data such as voice to be dequeued and sent before packets in other queues are dequeued. table 1 compares the salient features of flow -


relay pvc interface priority queueing features. strict pq allows delay - sensitive data such as voice to be dequeued and sent before packets in other queues are dequeued. table 1 compares the salient features of flow - based wfq, cbwfq and dcbwfq, cq, and pq. in its simplest form, fifo queueing — also known as first - come, first - served ( fcfs ) queueing — involves buffering and forwarding of packets in the order of arrival. fifo embodies no concept of priority or classes of traffic and consequently makes no decision about packet priority. there is only one queue, and all packets are treated equally. packets are sent out an interface in the order in which they arrive. when fifo is used, ill - behaved sources can consume all the bandwidth, bursty sources can cause delays in time - sensitive or important traffic, and important traffic can be dropped because less important traffic fills the queue. when no other queueing strategies are configured, all interfaces except serial interfaces at e1 ( 2. 048 mbps ) and below use fifo by default. ( serial interfaces at e1 and below use wfq by default. ) fifo, which is the fastest method of queueing, is effective for large links that have little delay and minimal congestion. if your link has very little congestion, fifo queueing may be the only queueing you need to use. weighted fair queueing this section discusses the four types of wfq described in the following sections : this section also discusses the six related features described in the following sections : table 2 summarizes the differences among wfq, dwfq, cbwfq, and dcbwfq. for dwfq and dcbwfq, all queueing is transacted by the vip. on the vip, all packets are sent directly out the interface. a route switch processor ( rsp ) resides on the same platform as the vip. the rsp handles all tasks associated with system maintenance and routing. the vip and the rsp each handle some scheduling. the dual - processor support accounts for the faster speed of dwfq and dcbwfq over wfq running on standard cisco ios platforms. for information on how to configure wfq, dwfq, cbwfq, and dcbwfq, see the " configur


frame relay data - link connection identifier ( dlci ) value, and tos value. there are two categories of flows : high - bandwidth sessions and low - bandwidth sessions. low - bandwidth traffic has effective priority over high - bandwidth traffic, and high - bandwidth traffic shares the transmission service proportionally according to assigned weights. low - bandwidth traffic streams, which comprise the majority of traffic, receive preferential service, allowing their entire offered loads to be sent in a timely fashion. high - volume traffic streams share the remaining capacity proportionally among themselves. wfq places packets of the various conversations in the fair queues before transmission. the order of removal from the fair queues is determined by the virtual time of the delivery of the last bit of each arriving packet. new messages for high - bandwidth flows are discarded after the congestive - messages threshold has been met. however, low - bandwidth flows, which include control - message conversations, continue to enqueue data. as a result, the fair queue may occasionally contain more messages than are specified by the threshold number. wfq can manage duplex data streams, such as those between pairs of applications, and simplex data streams such as voice or video. the wfq algorithm also addresses the problem of round - trip delay variability. if multiple high - volume conversations are active, their transfer rates and interarrival periods are made much more predictable. wfq greatly enhances algorithms such as systems network architecture ( sna ) logical link control ( llc ) and tcp congestion control and slow start features. flow - based wfq is used as the default queueing mode on most serial interfaces configured to run at e1 speeds ( 2. 048 mbps ) or below. wfq provides the solution for situations in which it is desirable to provide consistent response time to heavy and light network users alike without adding excessive bandwidth. wfq automatically adapts to changing network traffic conditions. wfq is not supported with tunneling and encryption because these features modify the packet content information required by wfq for classification. although wfq automatically adapts to changing network traffic conditions, it does not offer the degree of precision control over bandwidth allocation that cq and cbwfq offer. wfq and ip precedence wfq is ip precedence - aware. it can detect higher priority packets marked with precedence by the ip forwarder and can schedule them faster, providing superior response time for this traffic. thus, as the precedence increases, wfq all


ip precedence wfq is ip precedence - aware. it can detect higher priority packets marked with precedence by the ip forwarder and can schedule them faster, providing superior response time for this traffic. thus, as the precedence increases, wfq allocates more bandwidth to the conversation during periods of congestion. wfq assigns a weight to each flow, which determines the transmit order for queued packets. in this scheme, lower weights are served first. for standard cisco ios wfq, the ip precedence serves as a divisor to this weighting factor. like cq, wfq sends a certain number of bytes from each queue. with wfq, each queue corresponds to a different flow. for each cycle through all flows, wfq effectively sends a number of bytes equal to the precedence of the flow plus one. this number is only used as a ratio to determine how many bytes per packets to send. however, for the purposes of understanding wfq, using this number as the byte count is sufficient. for instance, traffic with an ip precedence value of 7 gets a lower weight than traffic with an ip precedence value of 3, thus, the priority in transmit order. the weights are inversely proportional to the ip precedence value. to determine the bandwidth allocation for each queue, divide the byte count for the flow by the total byte count for all flows. for example, if you have one flow at each precedence level, each flow will get precedence + 1 parts of the link : 1 + 2 + 3 + 4 + 5 + 6 + 7 + 8 = 36 thus, precedence 0 traffic will get 1 / 36 of the bandwidth, precedence 1 traffic will get 2 / 36, and precedence 7 traffic will get 8 / 36. however, if you have 18 precedence 1 flows and one of each of the rest, the total is now : 1 + 2 ( 18 ) + 3 + 4 + 5 + 6 + 7 + 8 = 70 precedence 0 traffic will get 1 / 70, each of the precedence 1 flows will get 2 / 70, and so on. as flows are added or ended, the actual allocated bandwidth will continuously change. wfq and rsvp rsvp uses wfq to allocate buffer space and schedule packets, and to guarantee bandwidth for reserved flows. wfq works with rsvp to help provide differentiated and guaranteed qos services. rsvp is the internet engineering task force ( ietf ) internet standard ( rfc 2205 ) protocol for allowing an application


to guarantee bandwidth for reserved flows. wfq works with rsvp to help provide differentiated and guaranteed qos services. rsvp is the internet engineering task force ( ietf ) internet standard ( rfc 2205 ) protocol for allowing an application to dynamically reserve network bandwidth. rsvp enables applications to request a specific qos for a data flow. the cisco implementation allows rsvp to be initiated within the network using configured proxy rsvp. rsvp is the only standard signalling protocol designed to guarantee network bandwidth from end to end for ip networks. hosts and routers use rsvp to deliver qos requests to the routers along the paths of the data stream and to maintain router and host state to provide the requested service, usually bandwidth and latency. rsvp uses a mean data rate, the largest amount of data the router will keep in queue, and minimum qos to determine bandwidth reservation. wfq or weighted random early detection ( wred ) acts as the preparer for rsvp, setting up the packet classification and scheduling required for the reserved flows. using wfq, rsvp can deliver an integrated services guaranteed service. distributed weighted fair queueing dwfq is a special high - speed version of wfq that runs on the vip. it is supported on the following routers with a vip2 - 40 or greater interface processor : • cisco 7000 series with rsp7000 • cisco 7500 series a vip2 - 50 interface processor is recommended when the aggregate line rate of the port adapters on the vip is greater than ds3. a vip2 - 50 card is required for oc - 3 rates. to use dwfq, distributed cisco express forwarding ( dcef ) switching must be enabled on the interface. for more information on cef, see the " cisco express forwarding features roadmap " module. note the vip - distributed wfq implementation differs from wfq that runs on all other platforms. there are two forms of distributed wfq : • flow - based. in this form, packets are classified by flow. packets with the same source ip address, destination ip address, source tcp or user datagram protocol ( udp ) port, destination tcp or udp port, protocol, and tos field belong to the same flow. ( all non - ip packets are treated as flow 0. ) each flow corresponds to a separate output queue. when a packet is assigned to a flow,


tcp or udp port, protocol, and tos field belong to the same flow. ( all non - ip packets are treated as flow 0. ) each flow corresponds to a separate output queue. when a packet is assigned to a flow, it is placed in the queue for that flow. during periods of congestion, dwfq allocates an equal share of the bandwidth to each active queue. flow - based dwfq is also called fair queueing because all flows are equally weighted and allocated equal bandwidth. in the current implementation of dwfq, weights are not assigned to flows. with dwfq, well - behaved hosts are protected from ill - behaved hosts. • class - based. in this form, packets are assigned to different queues based on their qos group or the ip precedence in the tos field. qos groups allow you to customize your qos policy. a qos group is an internal classification of packets used by the router to determine how packets are treated by certain qos features, such as dwfq and committed access rate ( car ). use a car policy or the qos policy propagation via border gateway protocol ( bgp ) feature to assign packets to qos groups. if you want to classify packets based only on the two low - order ip precedence bits, use tos - based dwfq. specify a weight for each class. in periods of congestion, each group is allocated a percentage of the output bandwidth equal to the weight of the class. for example, if a class is assigned a weight of 50, packets from this class will be allocated at least 50 percent of the outgoing bandwidth during periods of congestion. when the interface is not congested, queues can use any available bandwidth. the " drop policy " section describes the drop policy used by both forms. dwfq keeps track of the number of packets in each queue and the total number of packets in all queues. when the total number of packets is below the aggregate limit, queues can buffer more packets than the individual queue limit. when the total number of packets reaches the aggregate limit, the interface starts enforcing the individual queue limits. any new packets that arrive for a queue that has exceeded its individual queue limit are dropped. packets that are already in the queue will not be dropped, even if the queue is over the individual limit. in some cases, the total number of packets in all queues put together may exceed the aggregate limit. use dwfq


dropped. packets that are already in the queue will not be dropped, even if the queue is over the individual limit. in some cases, the total number of packets in all queues put together may exceed the aggregate limit. use dwfq with ip traffic. all non - ip traffic is treated as a single flow and, therefore, placed in the same queue. dwfq has the following restrictions : • can be configured on interfaces, but not subinterfaces. • is not supported with the atm encapsulations aal5 - mux and aal5 - nlpid. • is not supported on fast etherchannel, tunnel interfaces, or other logical ( virtual ) interfaces such as multilink ppp ( mlp ). • cannot be configured on the same interface as rsp - based pq, cq, or wfq. class - based weighted fair queueing cbwfq extends the standard wfq functionality to provide support for user - defined traffic classes. for cbwfq, you define traffic classes based on match criteria including protocols, access control lists ( acls ), and input interfaces. packets satisfying the match criteria for a class constitute the traffic for that class. a fifo queue is reserved for each class, and traffic belonging to a class is directed to the queue for that class. once a class has been defined according to its match criteria, you can assign it characteristics. to characterize a class, you assign it bandwidth, weight, and maximum packet limit. the bandwidth assigned to a class is the guaranteed bandwidth delivered to the class during congestion. to characterize a class, you also specify the queue limit for that class, which is the maximum number of packets allowed to accumulate in the queue for the class. packets belonging to a class are subject to the bandwidth and queue limits that characterize the class. after a queue has reached its configured queue limit, enqueueing of additional packets to the class causes tail drop or packet drop to take effect, depending on how class policy is configured. tail drop is used for cbwfq classes unless you explicitly configure policy for a class to use wred to drop packets as a means of avoiding congestion. note that if you use wred packet drop instead of tail drop for one or more classes comprising a policy map, you must ensure that wred is not configured for the interface to which you attach that service policy. if a default class is configured with the bandwidth policy - map class configuration command,


instead of tail drop for one or more classes comprising a policy map, you must ensure that wred is not configured for the interface to which you attach that service policy. if a default class is configured with the bandwidth policy - map class configuration command, all unclassified traffic is put into a single fifo queue and given treatment according to the configured bandwidth. if a default class is configured with the fair - queue command, all unclassified traffic is flow classified and given best - effort treatment. if no default class is configured, then by default the traffic that does not match any of the configured classes is flow classified and given best - effort treatment. once a packet is classified, all of the standard mechanisms that can be used to differentiate service among the classes apply. flow classification is standard wfq treatment. that is, packets with the same source ip address, destination ip address, source tcp or udp port, or destination tcp or udp port are classified as belonging to the same flow. wfq allocates an equal share of bandwidth to each flow. flow - based wfq is also called fair queueing because all flows are equally weighted. for cbwfq, the weight specified for the class becomes the weight of each packet that meets the match criteria of the class. packets that arrive at the output interface are classified according to the match criteria filters you define, then each one is assigned the appropriate weight. the weight for a packet belonging to a specific class is derived from the bandwidth you assigned to the class when you configured it ; in this sense the weight for a class is user - configurable. after the weight for a packet is assigned, the packet is enqueued in the appropriate class queue. cbwfq uses the weights assigned to the queued packets to ensure that the class queue is serviced fairly. configuring a class policy — thus, configuring cbwfq — entails these three processes : • defining traffic classes to specify the classification policy ( class maps ). this process determines how many types of packets are to be differentiated from one another. • associating policies — that is, class characteristics — with each traffic class ( policy maps ). this process entails configuration of policies to be applied to packets belonging to one of the classes previously defined through a class map. for this process, you configure a policy map that specifies the policy for each traffic class. • attaching policies to interfaces ( service policies ). this process


applied to packets belonging to one of the classes previously defined through a class map. for this process, you configure a policy map that specifies the policy for each traffic class. • attaching policies to interfaces ( service policies ). this process requires that you associate an existing policy map, or service policy, with an interface to apply the particular set of policies for the map to that interface. cbwfq bandwidth allocation the sum of all bandwidth allocation on an interface cannot exceed 75 percent of the total available interface bandwidth. the remaining 25 percent is used for other overhead, including layer 2 overhead, routing traffic, and best - effort traffic. bandwidth for the cbwfq class - default class, for instance, is taken from the remaining 25 percent. however, under aggressive circumstances in which you want to configure more than 75 percent of the interface bandwidth to classes, you can override the 75 percent maximum sum allocated to all classes or flows. if you want to override the default 75 percent, exercise caution and ensure that you allow enough remaining bandwidth to support best - effort and control traffic, and layer 2 overhead. when atm is used you must account for the fact that atm cell tax overhead is not included. for example, consider the case where a class needs guaranteed bandwidth on an atm permanent virtual circuit ( pvc ). suppose the average packet size for the class is 256 bytes and the class needs 100 kbps ( which translates to 49 packets per second ) of guaranteed bandwidth. each 256 - byte packet would be split into six cells to be sent on a vc, giving a total of 6 * 53 = 318 bytes. in this case, the atm cell tax overhead would be 62 bytes or 49 * 62 * 8 = 24. 34 kbps. when configuring cbwfq in this example, ensure that the sum of all the configured class bandwidths is less than the vc bandwidth by at least 24. 34 kbps to ensure desired payload guarantee for the configured classes ( in this example, there is only one class ). if you have several classes, the sum of all the class overheads should be estimated and added to the sum of all the configured class bandwidths. this total should be less than the vc bandwidth to ensure the required payload guarantees. why use cbwfq? here are some general factors you should consider in determining whether you need to configure cbwfq : • bandwidth allocation. cbwfq allows you to specify the exact amount of bandwidth to be allocated


why use cbwfq? here are some general factors you should consider in determining whether you need to configure cbwfq : • bandwidth allocation. cbwfq allows you to specify the exact amount of bandwidth to be allocated for a specific class of traffic. taking into account available bandwidth on the interface, you can configure up to 64 classes and control distribution among them, which is not the case with flow - based wfq. flow - based wfq applies weights to traffic to classify it into conversations and determine how much bandwidth each conversation is allowed relative to other conversations. for flow - based wfq, these weights, and traffic classification, are dependent on and limited to the seven ip precedence levels. • coarser granularity and scalability. cbwfq allows you to define what constitutes a class based on criteria that exceed the confines of flow. cbwfq allows you to use acls and protocols or input interface names to define how traffic will be classified, thereby providing coarser granularity. you need not maintain traffic classification on a flow basis. moreover, you can configure up to 64 discrete classes in a service policy. cbwfq and rsvp rsvp can be used in conjunction with cbwfq. when both rsvp and cbwfq are configured for an interface, rsvp and cbwfq act independently, exhibiting the same behavior that they would if each were running alone. rsvp continues to work as it does when cbwfq is not present, even in regard to bandwidth availability assessment and allocation. configuring cbwfq on a physical interface is only possible if the interface is in the default queueing mode. serial interfaces at e1 ( 2. 048 mbps ) and below use wfq by default — other interfaces use fifo by default. enabling cbwfq on a physical interface overrides the default interface queueing method. enabling cbwfq on an atm pvc does not override the default queueing method. if you configure a class in a policy map to use wred for packet drop instead of tail drop, you must ensure that wred is not configured on the interface to which you intend to attach that service policy. traffic shaping and policing are not currently supported with cbwfq. cbwfq is supported on variable bit rate ( vbr ) and available bit rate ( abr ) atm


on the interface to which you intend to attach that service policy. traffic shaping and policing are not currently supported with cbwfq. cbwfq is supported on variable bit rate ( vbr ) and available bit rate ( abr ) atm connections. it is not supported on unspecified bit rate ( ubr ) connections. cbwfq is not supported on ethernet subinterfaces. distributed class - based weighted fair queueing as explained earlier, wfq offers dynamic, fair queueing that divides bandwidth across queues of traffic based on weights. wfq ensures that all traffic is treated fairly, given its weight. for more information about wfq, see the " weighted fair queueing " section of this module. the dcbwfq feature extends the standard wfq functionality to provide support for user - defined traffic classes on the vip. these user - defined traffic classes are configured in the modular quality of service command - line interface ( modular qos cli ) feature. for information on how to configure qos with the modular qos cli, see the " applying qos features using the mqc " module. the maximum number of packets allowed to accumulate in a traffic class queue is called the queue limit and is specified with the queue - limit command when you create a service policy with the policy - map command. packets belonging to a traffic class are subject to the guaranteed bandwidth allocation and the queue limits that characterize the traffic class. after a queue has reached its configured queue limit, enqueuing of additional packets to the traffic class causes tail drop or wred drop to take effect, depending on how the service policy is configured. ( tail drop is a means of avoiding congestion that treats all traffic equally and does not differentiate between classes of service. queues fill during periods of congestion. when the output queue is full and tail drop is in effect, packets are dropped until the congestion is eliminated and the queue is no longer full ). tail drop is used for dcbwfq traffic classes unless you explicitly configure a service policy to use wred to drop packets as a means of avoiding congestion. note that if you use wred packet drop instead of tail drop for one or more traffic classes making up a service policy, you must ensure that wred is not configured for the interface to which you attach that service policy. for information on how to configure dcbwfq, see the " configuring weighted fair queueing " module


policy, you must ensure that wred is not configured for the interface to which you attach that service policy. for information on how to configure dcbwfq, see the " configuring weighted fair queueing " module. rsvp interaction with dcbwfq when rsvp and dcbwfq are configured, rsvp and dcbwfq act independently of one another. rsvp and dcbwfq allocate bandwidth among their traffic classes and flows according to unallocated bandwidth available at the underlying point of congestion. when an rsvp flow is created, the vip queueing system reserves the unit of bandwidth allocation in an rsvp queue, similar to the way a traffic class queue is allotted to a dcbwfq traffic class. dcbwfq traffic classes are unaffected by the rsvp flows. dcbwfq allows you to specify the amount of guaranteed bandwidth to be allocated for a traffic class. taking into account available bandwidth on the interface, you can configure up to 64 traffic classes and control bandwidth allocation among them. if excess bandwidth is available, the excess bandwidth is divided among the traffic classes in proportion to their configured bandwidths. flow - based wfq allocates bandwidth equally among all flows. coarser granularity and scalability dcbwfq allows you to define what constitutes a traffic class based on criteria that exceed the confines of flow. dcbwfq allows you to use acls and protocols or input interface names to define how traffic is classified, thereby providing coarser granularity. you need not maintain traffic classification on a flow basis. moreover, you can configure up to 64 discrete traffic classes in a service policy. using the bandwidth command on vip default traffic class on a vip, all traffic that does not match a user - defined traffic class is classified as part of the default traffic class. the implicit bandwidth allocated to the default traffic class on a vip is equal to the link bandwidth minus all of the user - defined bandwidth given to the user - defined traffic classes ( with the bandwidth command ). at least 1 percent of the link bandwidth is always reserved for the default traffic class. because the bandwidth of the default traffic class for a vip is implicit ( the default traffic class receives all remaining bandwidth not given to the user - defined traffic classes ), the bandwidth command cannot be used with the default traffic class when you configure a vip.


of the default traffic class for a vip is implicit ( the default traffic class receives all remaining bandwidth not given to the user - defined traffic classes ), the bandwidth command cannot be used with the default traffic class when you configure a vip. using the match protocol command on a vip do not use the match protocol command to create a traffic class with a non - ip protocol as a match criterion. the vip does not support matching of non - ip protocols. dcbwfq is not supported on cisco 7500 series routers with pa - a3 - 8t1ima modules. attaching a service policy to an interface disables wfq on that interface if wfq is configured for the interface. for this reason, you should ensure that wfq is not enabled on such an interface. for information on wfq, see the " configuring weighted fair queueing " module. you can specify a numbered access list as the match criterion for any traffic class that you create. for this reason, you should know how to configure access lists. modular qos cli you can configure dcbwfq using the modular qos cli. for information on configuring qos features with the modular qos cli, see the " applying qos features using the mqc " module. ip rtp priority the ip rtp priority feature provides a strict priority queueing scheme for delay - sensitive data such as voice. voice traffic can be identified by its real - time transport protocol ( rtp ) port numbers and classified into a priority queue configured by the ip rtp priority command. the result is that voice is serviced as strict priority in preference to other nonvoice traffic. note although this section focuses mainly on voice traffic, ip rtp priority is useful for any rtp traffic. the ip rtp priority feature extends and improves on the functionality offered by the ip rtp reserve command by allowing you to specify a range of udp / rtp ports whose traffic is guaranteed strict priority service over any other queues or classes using the same output interface. strict priority means that if packets exist in the priority queue, they are dequeued and before packets in other queues are dequeued. we recommend that you use the ip rtp priority command instead of the ip rtp reserve command for voice configurations. the ip rtp priority feature does not require that you know the port of a voice call. rather, the feature gives you


the " configuring weighted fair queueing " module. ip rtp priority bandwidth allocation if you want to understand its behavior and properly use the ip rtp priority feature, it is important to consider its admission control and policing characteristics. when you use the ip rtp priority command to configure the priority queue for voice, you specify a strict bandwidth limitation. this amount of bandwidth is guaranteed to voice traffic enqueued in the priority queue. ( this is the case whether you use the ip rtp priority feature with cbwfq or wfq. ) note ip rtp priority does not have per - call admission control. the admission control is on an aggregate basis. for example, if configured for 96 kbps, ip rtp priority guarantees that 96 kbps is available for reservation. it does not ensure that only four calls of 24 kbps are admitted. a fifth call of 24 kbps could be admitted, but because the five calls will only get 96 kbps, the call quality will be deteriorated. ( each call would get 96 / 5 = 19. 2 kbps. ) in this example, it is the responsibility of the user to ensure that only four calls are placed at one time. ip rtp priority closely polices use of bandwidth for the priority queue, ensuring that the allocated amount is not exceeded in the event of congestion. in fact, ip rtp priority polices the flow every second. ip rtp priority prohibits transmission of additional packets once the allocated bandwidth is consumed. if it discovers that the configured amount of bandwidth is exceeded, ip rtp priority drops packets, an event that is poorly tolerated by voice traffic. ( enable debugging to watch for this condition. ) close policing allows for fair treatment of other data packets enqueued in other cbwfq or wfq queues. to avoid packet drop, be certain to allocate to the priority queue the most optimum amount of bandwidth, taking into consideration the type of codec used and interface characteristics. ip rtp priority will not allow traffic beyond the allocated amount. it is always safest to allocate to the priority queue slightly more than the known required amount of bandwidth. for example, suppose you allocated 24 kbps bandwidth, the standard amount required for voice transmission, to the priority queue. this allocation seems safe because transmission of voice packets occurs at a constant bit rate. however, because the network and the router or switch can use some of the bandwidth and introduce jitter and delay,


required for voice transmission, to the priority queue. this allocation seems safe because transmission of voice packets occurs at a constant bit rate. however, because the network and the router or switch can use some of the bandwidth and introduce jitter and delay, allocating slightly more than the required amount of bandwidth ( such as 25 kbps ) ensures constancy and availability. the ip rtp priority admission control policy takes rtp header compression into account. therefore, while configuring the bandwidth parameter of the ip rtp priority command you only need to configure for the bandwidth of the compressed call. for example, if a g. 729 voice call requires 24 kbps uncompressed bandwidth ( not including layer 2 payload ) but only 12 kbps compressed bandwidth, you only need to configure a bandwidth of 12 kbps. you need to allocate enough bandwidth for all calls if there will be more than one call. the sum of all bandwidth allocation for voice and data flows on the interface cannot exceed 75 percent of the total available bandwidth. bandwidth allocation for voice packets takes into account the payload plus the ip, rtp, and udp headers, but again, not the layer 2 header. allowing 25 percent bandwidth for other overhead is conservative and safe. on a ppp link, for instance, overhead for layer 2 headers assumes 4 kbps. if you know how much bandwidth is required for additional overhead on a link, under aggressive circumstances in which you want to give voice traffic as much bandwidth as possible, you can override the 75 percent maximum allocation for the bandwidth sum allocated to all classes or flows. if you want to override the fixed amount of bandwidth, exercise caution and ensure that you allow enough remaining bandwidth to support best - effort and control traffic, and layer 2 overhead. as another alternative, if the importance of voice traffic far exceeds that of data, you can allocate most of the 75 percent bandwidth used for flows and classes to the voice priority queue. unused bandwidth at any given point will be made available to the other flows or classes. because the ip rtp priority command gives absolute priority over other traffic, it should be used with care. in the event of congestion, if the traffic exceeds the configured bandwidth, then all the excess traffic is dropped. the ip rtp reserve and ip rtp priority commands cannot be configured on the same interface. frame relay ip rtp priority the frame relay ip rtp priority feature provides a strict priority queueing scheme on a frame relay pvc


traffic is dropped. the ip rtp reserve and ip rtp priority commands cannot be configured on the same interface. frame relay ip rtp priority the frame relay ip rtp priority feature provides a strict priority queueing scheme on a frame relay pvc for delay - sensitive data such as voice. voice traffic can be identified by its rtp port numbers and classified into a priority queue configured by the frame - relay ip rtp priority command. the result of using this feature is that voice is serviced as strict priority in preference to other nonvoice traffic. this feature extends the functionality offered by the ip rtp priority command by supporting frame relay pvcs. this feature allows you to specify a range of udp ports whose voice traffic is guaranteed strict priority service over any other queues or classes using the same output interface. strict priority means that if packets exist in the priority queue, they are dequeued and sent before packets in other queues are dequeued. this process is performed on a per - pvc basis, rather than at the interface level. for information on how to configure frame relay ip rtp priority, see the " configuring weighted fair queueing " module. frame relay pvc interface priority queueing the frame relay pvc interface priority queueing ( pipq ) feature provides an interface - level priority queueing scheme in which prioritization is based on destination pvc rather than packet contents. for example, frame relay ( fr ) pipq allows you to configure a pvc transporting voice traffic to have absolute priority over a pvc transporting signalling traffic, and a pvc transporting signalling traffic to have absolute priority over a pvc transporting data. frame relay pipq provides four levels of priority : high, medium, normal, and low. the frame relay packet is examined at the interface for the data - link connection identifier ( dlci ) value. the packet is then sent to the correct priority queue based on the priority level configured for that dlci. note when using frame relay pipq, configure the network so that different types of traffic are transported on separate pvcs. frame relay pipq is not meant to be used when an individual pvc carries different traffic types that have different qos requirements. you assign priority to a pvc within a frame relay map class. all pvcs using or inheriting that map class will be classed according to the configured priority. if a pvc does not have a map class associated with it, or if the


you assign priority to a pvc within a frame relay map class. all pvcs using or inheriting that map class will be classed according to the configured priority. if a pvc does not have a map class associated with it, or if the map class associated with it does not have priority explicitly configured, then the packets on that pvc will be queued on the default " normal " priority queue. if you do not enable frame relay pipq on the interface using the frame - relay interface - queue priority command in interface configuration mode, configuring pvc priority within a map class will not be effective. at this time you have the option to also set the size ( in maximum number of packets ) of the four priority queues. frame relay pipq works with or without frame relay traffic shaping ( frts ) and frf. 12 ( or higher ). the interface - level priority queueing takes the place of the fifo queueing or dual fifo queueing normally used by frts and frf. 12 ( or higher ). pvc priority assigned within fr pipq takes precedence over frf. 12 priority, which means that all packets destined for the same pvc will be queued on the same interface queue whether they were fragmented or not. note although high priority pvcs most likely will transport only small packets of voice traffic, you may want to configure frf. 12 ( or higher ) on these pvcs anyway to guard against any unexpectedly large packets. the following restrictions apply to frame relay pipq : • it is not supported on loopback or tunnel interfaces, or interfaces that explicitly disallow priority queueing. • it is not supported with hardware compression. • it cannot be enabled on an interface that is already configured with queueing other than fifo queueing. fr pipq can be enabled if wfq is configured, as long as wfq is the default interface queueing method. the following prerequisites apply to frame relay pipq : • pvcs should be configured to carry a single type of traffic. • the network should be configured with adequate call admission control to prevent starvation of any of the priority queues. low latency queueing the llq feature brings strict pq to cbwfq. strict pq allows delay - sensitive data such as voice to be dequeued and sent before packets in other queues are dequeued. without llq, cbwfq provides wfq based on defined classes with no


. strict pq allows delay - sensitive data such as voice to be dequeued and sent before packets in other queues are dequeued. without llq, cbwfq provides wfq based on defined classes with no strict priority queue available for real - time traffic. cbwfq allows you to define traffic classes and then assign characteristics to that class. for example, you can designate the minimum bandwidth delivered to the class during congestion. for cbwfq, the weight for a packet belonging to a specific class is derived from the bandwidth you assigned to the class when you configured it. therefore, the bandwidth assigned to the packets of a class determines the order in which packets are sent. all packets are serviced fairly based on weight ; no class of packets may be granted strict priority. this scheme poses problems for voice traffic that is largely intolerant of delay, especially variation in delay. for voice traffic, variations in delay introduce irregularities of transmission manifesting as jitter in the heard conversation. llq provides strict priority queueing for cbwfq, reducing jitter in voice conversations. configured by the priority command, llq enables use of a single, strict priority queue within cbwfq at the class level, allowing you to direct traffic belonging to a class to the cbwfq strict priority queue. to enqueue class traffic to the strict priority queue, you specify the named class within a policy map and then configure the priority command for the class. ( classes to which the priority command is applied are considered priority classes. ) within a policy map, you can give one or more classes priority status. when multiple classes within a single policy map are configured as priority classes, all traffic from these classes is enqueued to the same, single, strict priority queue. one of the ways in which the strict pq used within cbwfq differs from its use outside cbwfq is in the parameters it takes. outside cbwfq, you can use the ip rtp priority command to specify the range of udp ports whose voice traffic flows are to be given priority service. using the priority command, you are no longer limited to a udp port number to stipulate priority flows because you can configure the priority status for a class within cbwfq. instead, all of the valid match criteria used to specify traffic for a class now apply to priority traffic. these methods of specifying traffic for a class include matching on access lists


##figure the priority status for a class within cbwfq. instead, all of the valid match criteria used to specify traffic for a class now apply to priority traffic. these methods of specifying traffic for a class include matching on access lists, protocols, and input interfaces. moreover, within an access list you can specify that traffic matches are allowed based on the ip differentiated services code point ( dscp ) value that is set using the first six bits of the tos byte in the ip header. although it is possible to enqueue various types of real - time traffic to the strict priority queue, we strongly recommend that you direct only voice traffic to it because voice traffic is well - behaved, whereas other types of real - time traffic are not. moreover, voice traffic requires that delay be nonvariable in order to avoid jitter. real - time traffic such as video could introduce variation in delay, thereby thwarting the steadiness of delay required for successful voice traffic transmission. for information on how to configure llq, see the " configuring weighted fair queueing " module. llq bandwidth allocation when you specify the priority command for a class, it takes a bandwidth argument that gives maximum bandwidth in kbps. you use this parameter to specify the maximum amount of bandwidth allocated for packets belonging to the class configured with the priority command. the bandwidth parameter both guarantees bandwidth to the priority class and restrains the flow of packets from the priority class. in the event of congestion, policing is used to drop packets when the bandwidth is exceeded. voice traffic enqueued to the priority queue is udp - based and therefore not adaptive to the early packet drop characteristic of wred. because wred is ineffective, you cannot use the wred random - detect command with the priority command. in addition, because policing is used to drop packets and a queue limit is not imposed, the queue - limit command cannot be used with the priority command. when congestion occurs, traffic destined for the priority queue is metered to ensure that the bandwidth allocation configured for the class to which the traffic belongs is not exceeded. priority traffic metering has the following qualities : • it is much like the rate - limiting feature of car, except that priority traffic metering is only performed under congestion conditions. when the device is not congested, the priority class traffic is allowed to exceed its allocated bandwidth. when the device is congested, the priority class traffic above the allocated bandwidth is discarded. • it is performed on a per -


under congestion conditions. when the device is not congested, the priority class traffic is allowed to exceed its allocated bandwidth. when the device is congested, the priority class traffic above the allocated bandwidth is discarded. • it is performed on a per - packet basis, and tokens are replenished as packets are sent. if not enough tokens are available to send the packet, it is dropped. • it restrains priority traffic to its allocated bandwidth to ensure that nonpriority traffic, such as routing packets and other data, is not starved. with metering, the classes are policed and rate - limited individually. that is, although a single policy map might contain four priority classes, all of which are enqueued in a single priority queue, they are each treated as separate flows with separate bandwidth allocations and constraints. it is important to note that because bandwidth for the priority class is specified as a parameter to the priority command, you cannot also configure the bandwidth policy - map class configuration command for a priority class. to do so is a configuration violation that would only introduce confusion in relation to the amount of bandwidth to allocate. the bandwidth allocated for a priority queue always includes the layer 2 encapsulation header. however, it does not include other headers, such as atm cell tax overheads. when you calculate the amount of bandwidth to allocate for a given priority class, you must account for the fact that layer 2 headers are included. when atm is used, you must account for the fact that atm cell tax overhead is not included. you must also allow bandwidth for the possibility of jitter introduced by routers in the voice path. consider this case that uses atm. suppose a voice stream of 60 bytes emitting 50 packets per second is encoded using g. 729. prior to converting the voice stream to cells, the meter for the priority queue used for the voice stream assesses the length of the packet after the layer 2 logical link control ( llc ) headers have been added. given the 8 - byte layer 2 llc header, the meter will take into account a 68 - byte packet. because atm cells are a standard 53 bytes long, before the 68 - byte packet is emitted on the line, it is divided into two 53 - byte atm cells. thus, the bandwidth consumed by this flow is 106 bytes per packet. for this case, then, you must configure the bandwidth to be at least 27. 2 kbps ( 68 * 50 * 8


two 53 - byte atm cells. thus, the bandwidth consumed by this flow is 106 bytes per packet. for this case, then, you must configure the bandwidth to be at least 27. 2 kbps ( 68 * 50 * 8 = 27. 2 kbps ). however, recall that you must also allow for the atm cell tax overhead, which is not accounted for by the configured bandwidth. in other words, the sum of the bandwidths for all classes must be less than the interface bandwidth by at least 15. 2 kbps ( [ 106 - 68 ] * 50 * 8 = 15. 2 kbps ). you should also remember to allow bandwidth for router - introduced jitter. llq with ip rtp priority llq and ip rtp priority can be configured at the same time, but ip rtp priority takes precedence. to demonstrate how they work together, consider the following configuration : policy - map llqpolicyclass voicepriority 50ip rtp priority 16384 20000 40service - policy output llqpolicy in this example, packets that match the 16384 to 20000 port range will be given priority with 40 kbps bandwidth ; packets that match the voice class will be given priority with 50 kbps bandwidth. in the event of congestion, packets that match the 16384 to 20000 port range will receive no more than 40 kbps of bandwidth, and packets that match the voice class will receive no more than 50 kbps of bandwidth. if packets match both criteria ( ports 16384 to 20000 and class voice ), ip rtp priority takes precedence. in this example, the packets will be considered to match the 16384 to 20000 port range and will be accounted for in the 40 kbps bandwidth. llq and committed burst size the functionality of llq has been extended to allow you to specify the committed burst ( bc ) size in llq. this functionality is provided with the configuring burst size in low latency queueing feature. with this new functionality, the network can now accommodate temporary bursts of traffic and handle network traffic more efficiently. note the default bc size used by llq is intended to handle voice - like non - bursty traffic. if you want to configure llq to handle the traffic of non - voice applications, you may need to increase the burst size accordingly, based on the application in use on your network. llq and per - vc hold queue support for atm adapters by default, the


command instead of the priority command. ( the ip rtp priority command provides priority only for even port numbers. ) • the random - detect command, queue - limit command, and bandwidth policy - map class configuration command cannot be used while the priority command is configured. • the priority command can be configured in multiple classes, but it should only be used for voice - like, constant bit rate ( cbr ) traffic. distributed low latency queueing the distributed llq feature provides the ability to specify low latency behavior for a traffic class on a vip - based cisco 7500 series router except one with a pa - a3 - 8t1ima module. llq allows delay - sensitive data such as voice to be dequeued and sent before packets in other queues are dequeued. the distributed llq feature also introduces the ability to limit the depth of a device transmission ring. before the introduction of distributed llq, the maximum transmission ring depth was not a user - configurable parameter. therefore, particles could accumulate on a transmission ring without limitation, which could result in unavoidable high latencies. the distributed llq feature allows users to limit the number of particles that may exist on a transmission ring, effectively lowering the latency incurred by packets sitting on that transmission ring. the priority command is used to allow delay - sensitive data to be dequeued and sent first. llq enables use of a single priority queue within which individual classes of traffic can be placed. to enqueue class traffic to the priority queue, you configure the priority command for the class after you specify the named class within a policy map. the amount of bandwidth available for the priority queue can be specified either as a set amount of bandwidth in kbps or as a percentage of all available bandwidth ( beginning in cisco ios release 12. 1 ( 5 ) t ). within a policy map, you can give one or more classes priority status. when multiple classes within a single policy map are configured as priority classes, all traffic from these classes is enqueued to the same, single, priority queue. the tx - ring - limit command allows the user to specify the number of allowable particles on a transmission ring, effectively lowering the latency for that transmission ring. one packet can contain multiple particles, and a typical particle is 512 bytes in size ( the size depends on the interface types. for some interface types, a typical particle size is 256 bytes. ) these particles can no longer accumulate on a


transmission ring. one packet can contain multiple particles, and a typical particle is 512 bytes in size ( the size depends on the interface types. for some interface types, a typical particle size is 256 bytes. ) these particles can no longer accumulate on a transmission ring and cause unavoidable high latencies. distributed llq is supported on the cisco 7500 rsp series router with a vip except when a pa - a3 - 8t 1ima module is configured. this feature also supports the class - based quality of service mib. for information on how to configure distributed llq, see the " configuring weighted fair queueing " module. guaranteeing bandwidth with the priority command one method of using the priority command for a traffic class is to specify a bandwidth argument that gives the maximum bandwidth in kpbs. the other method of using the priority command for a traffic class, which was introduced in cisco ios release 12. 1 ( 5 ) t, is to specify a percentage of available bandwidth to be reserved for the priority queue. the bandwidth value or percentage guarantees the configured bandwidth to the priority class under worst - case congestion scenarios. if excess bandwidth is available, the priority class will be allowed to utilize the bandwidth. if no excess bandwidth is available, the priority traffic will be constrained to the configured rate via packet drops. each individual class that is configured to a bandwidth value will have its traffic constrained to its individual rate. when a class is constrained to its individual rate, the traffic is permitted a certain amount of burstiness because of the token bucket mechanism policing the stream. this amount of burstiness is controlled by the optional burst parameter in the priority command ( this burstiness cannot be specified when specifying a priority queue based on a percentage of available bandwidth ). the burst parameter specifies, in bytes, the amount of traffic allowed to pass through the token bucket as a one - time burst in excess of the token bucket drop parameters. the default burst value is 200 milliseconds of traffic at the configured token bucket drop parameters. it is important to note that because bandwidth for the priority class is specified as a parameter to the priority command, you cannot also configure the bandwidth command for a priority class. to do so is a configuration violation that introduces confusion in relation to the amount of bandwidth to allocate. the bandwidth allocated for a priority queue always includes the layer 2 encapsulation header. however, it does not include other headers, such as atm cell tax overheads. when you


in relation to the amount of bandwidth to allocate. the bandwidth allocated for a priority queue always includes the layer 2 encapsulation header. however, it does not include other headers, such as atm cell tax overheads. when you calculate the amount of bandwidth to allocate for a given priority class, you must account for the fact that the layer 2 headers are included. when atm is used, you must account for the fact that atm cell tax overhead is not included. you must also allow bandwidth for the possibility of jitter introduced by routers in the voice path. consider this case that uses atm : suppose a voice stream of 60 bytes emitting 50 packets per second is encoded using g. 729. prior to converting the voice stream to cells, the meter for the priority queue used for the voice stream assesses the length of the packet after the layer logical link control ( llc ) headers have been added. given the 8 - byte layer 2 llc header, the meter will take into account a 68 - byte packet. because atm cells are a standard 53 bytes long, before the 68 - kbps packet is emitted on the line, it is divided into two 53 - byte atm cells. thus, the bandwidth consumed by this flow is 106 bytes per packet. for this case, then, you must configure the bandwidth to be at least 27. 2 kbps ( 68 * 50 * 8 = 27. 2 kbps ). however, recall that you must also allow for the atm cell tax overhead, which is not accounted for by the configured bandwidth. in other words, the sum of the bandwidths for all classes must be less than the interface bandwidth by at least 15. 2 kbps ( [ 106 - 68 ] * 50 * 8 = 15. 2 kbps ). you should also remember to allow bandwidth for router - introduced jitter. provides priority service on atm vcs and serial interface the pq scheme allows delay - sensitive data such as voice to be dequeued and sent before packets in other queues are dequeued. this feature provides pq on atm vcs. by configuring the maximum amount of bandwidth allocated for packets belonging to a class, you can avoid starving nonpriority traffic. limiting particles on a transmission ring the distributed llq feature also introduces particle limiting for transmission rings. before the introduction of distributed llq, the transmission ring depth was not user - configurable. therefore, a user could experience unavoida


. limiting particles on a transmission ring the distributed llq feature also introduces particle limiting for transmission rings. before the introduction of distributed llq, the transmission ring depth was not user - configurable. therefore, a user could experience unavoidable high latencies on a transmission ring. the distributed llq feature allows users to limit the number of particles on a transmission ring to a predefined limit, effectively lowering the latency on transmission rings. the following restrictions apply to the distributed llq feature : • if you use access lists to configure matching port numbers, this feature provides priority matching for all port numbers. because voice typically exists on even port numbers, and control packets are generated on odd port numbers, control packets are also given priority when using this feature. on very slow links, giving priority to both voice and control packets may produce degraded voice quality. • the priority command can be used in conjunction with the set command. the priority command cannot be used in conjunction with any other command, including the random - detect, queue - limit, and bandwidth commands. • the priority command can be configured in multiple traffic classes. if the traffic is not cbr traffic, you must configure a large enough bandwidth - kbps parameter to absorb the data bursts. • because 1 percent of the available bandwidth is reserved for the default traffic class, the sum of the percentage for the bandwidth percent and priority percent command reservations cannot exceed 99 percent. • priority queues can be reserved by either size or percentage values, but not both, in the same policy map. therefore, if the priority command is used without the percent option in a policy map, the bandwidth command, if used, must also be used without the percent option, and vice versa. similarly, if the priority percent command is used in a policy map, the bandwidth percent command must be used to specify bandwidth allocation for the class, and vice versa. the priority and priority percent commands also cannot be used in the same policy map. • the bandwidth and priority commands cannot be used in the same class map. these commands can be used together in the same policy map, however. the following commands cannot be used in the same class or policy map with the priority command : the following commands cannot be used in the same class or policy map with the priority percentage command : – priority ( without the percent option ) – bandwidth ( without the percent option ) • the tx - ring - limit command can only affect a vbr vc on a pa - a3 port adapter.


or policy map with the priority percentage command : – priority ( without the percent option ) – bandwidth ( without the percent option ) • the tx - ring - limit command can only affect a vbr vc on a pa - a3 port adapter. the tx - ring - limit command does not affect ubr vcs. • dllq is not supported on cisco 7500 series routers with pa - a3 - 8t1ima modules. to use this feature, you should be familiar with the following features : • virtual templates and virtual access interfaces low latency queueing for frame relay llq for frame relay provides a strict priority queue for voice traffic and weighted fair queues for other classes of traffic. with this feature, llq is available at the frame relay vc level when frts is configured. llq, also called pq / cbwfq, is a superset of and more flexible than previous frame relay qos offerings, in particular rtp prioritization and pq / wfq. with rtp prioritization and pq / wfq, traffic that matches a specified udp / rtp port range is considered high priority and allocated to the priority queue ( pq ). with llq for frame relay, you set up classes of traffic according to protocol, interface, or access lists, and then define policy maps to establish how the classes are handled in the priority queue and weighted fair queues. queues are set up on a per - pvc basis : each pvc has a pq and an assigned number of fair queues. the fair queues are assigned weights proportional to the bandwidth requirements of each class ; a class requiring twice the bandwidth of another will have half the weight. oversubscription of the bandwidth is not permitted. the cli will reject a change of configuration that would cause the total bandwidth to be exceeded. this functionality differs from that of wfq, in which flows are assigned a weight based on ip precedence. wfq allows higher precedence traffic to obtain proportionately more of the bandwidth, but the more flows there are, the less bandwidth is available to each flow. the pq is policed to ensure that the fair queues are not starved of bandwidth. when you configure the pq, you specify in kbps the maximum amount of bandwidth available to that queue. packets that exceed that maximum are dropped. there is no policing of the fair queues. llq for frame relay is configured using a combination of class


frf. 12 ) is to support voice and data packets on lower - speed links without causing excessive delay to the voice packets. large data packets are fragmented and interleaved with the voice packets. when frf. 12 is configured with llq, small packets classified for the pq pass through unfragmented onto both the llq pq and the high priority interface queue. large packets destined for pq are shaped and fragmented when dequeued. use the frame - relay fragment and service - policy map - class configuration commands to enable llq with frf. 12. ip cisco express forwarding switching ip cef switching is not affected by llq functionality. cq allows you to specify a certain number of bytes to forward from a queue each time the queue is serviced, thereby allowing you to share the network resources among applications with specific minimum bandwidth or latency requirements. you can also specify a maximum number of packets in each queue. for information on how to configure cq, see the " configuring custom queueing " module. how it works cq handles traffic by specifying the number of packets or bytes to be serviced for each class of traffic. it services the queues by cycling through them in round - robin fashion, sending the portion of allocated bandwidth for each queue before moving to the next queue. if one queue is empty, the router will send packets from the next queue that has packets ready to send. when cq is enabled on an interface, the system maintains 17 output queues for that interface. you can specify queues 1 through 16. associated with each output queue is a configurable byte count, which specifies how many bytes of data the system should deliver from the current queue before it moves on to the next queue. queue number 0 is a system queue ; it is emptied before any of the queues numbered 1 through 16 are processed. the system queues high priority packets, such as keepalive packets and signalling packets, to this queue. other traffic cannot be configured to use this queue. for queue numbers 1 through 16, the system cycles through the queues sequentially ( in a round - robin fashion ), dequeueing the configured byte count from each queue in each cycle, delivering packets in the current queue before moving on to the next one. when a particular queue is being processed, packets are sent until the number of bytes sent exceeds the queue byte count or the queue is empty. bandwidth used by a particular queue can be indirectly specified only


the current queue before moving on to the next one. when a particular queue is being processed, packets are sent until the number of bytes sent exceeds the queue byte count or the queue is empty. bandwidth used by a particular queue can be indirectly specified only in terms of byte count and queue length. figure 2 shows how cq behaves. figure 2 custom queueing cq ensures that no application or specified group of applications achieves more than a predetermined proportion of overall capacity when the line is under stress. like pq, cq is statically configured and does not automatically adapt to changing network conditions. on most platforms, all protocols are classified in the fast - switching path. determining byte count values for queues in order to allocate bandwidth to different queues, you must specify the byte count for each queue. how the byte count is used the router sends packets from a particular queue until the byte count is exceeded. once the byte count value is exceeded, the packet that is currently being sent will be completely sent. therefore, if you set the byte count to 100 bytes and the packet size of your protocol is 1024 bytes, then every time this queue is serviced, 1024 bytes will be sent, not 100 bytes. for example, suppose one protocol has 500 - byte packets, another has 300 - byte packets, and a third has 100 - byte packets. if you want to split the bandwidth evenly across all three protocols, you might choose to specify byte counts of 200, 200, and 200 for each queue. however, this configuration does not result in a 33 / 33 / 33 ratio. when the router services the first queue, it sends a single 500 - byte packet ; when it services the second queue, it sends a 300 - byte packet ; and when it services the third queue, it sends two 100 - byte packets. the effective ratio is 50 / 30 / 20. thus, setting the byte count too low can result in an unintended bandwidth allocation. however, very large byte counts will produce a " jerky " distribution. that is, if you assign 10 kb, 10 kb, and 10 kb to three queues in the example given, each protocol is serviced promptly when its queue is the one being serviced, but it may be a long time before the queue is serviced again. a better solution is to specify 500 - byte, 600 - byte, and 500 - byte counts for the queue. this configuration results in a ratio of 31 / 38 / 31, which may be acceptable.


long time before the queue is serviced again. a better solution is to specify 500 - byte, 600 - byte, and 500 - byte counts for the queue. this configuration results in a ratio of 31 / 38 / 31, which may be acceptable. in order to service queues in a timely manner and ensure that the configured bandwidth allocation is as close as possible to the required bandwidth allocation, you must determine the byte count based on the packet size of each protocol, otherwise your percentages may not match what you configure. note cq was modified in cisco ios release 12. 1. when the queue is depleted early, or the last packet from the queue does not exactly match the configured byte count, the amount of deficit is remembered and accounted for the next time the queue is serviced. beginning with cisco ios release 12. 1, you need not be as accurate in specifying byte counts as you did when using earlier cisco ios releases that did not take deficit into account. note some protocols, such as internetwork packet exchange ( ipx ), will negotiate the frame size at session startup time. determining the byte count to determine the correct byte counts, perform the following steps : step 1 for each queue, divide the percentage of bandwidth you want to allocate to the queue by the packet size, in bytes. for example, assume the packet size for protocol a is 1086 bytes, protocol b is 291 bytes, and protocol c is 831 bytes. we want to allocate 20 percent for a, 60 percent for b, and 20 percent for c. the ratios would be : 20 / 1086, 60 / 291, 20 / 831 or 0. 01842, 0. 20619, 0. 02407 step 2 normalize the numbers by dividing by the lowest number : 1, 11. 2, 1. 3 the result is the ratio of the number of packets that must be sent so that the percentage of bandwidth that each protocol uses is approximately 20, 60, and 20 percent. step 3 a fraction in any of the ratio values means that an additional packet will be sent. round up the numbers to the next whole number to obtain the actual packet count. in this example, the actual ratio will be 1 packet, 12 packets, and 2 packets. step 4 convert the packet number ratio into byte counts by multiplying each packet count by the corresponding packet size. in this example, the number of packets sent is one 1086 - byte packet, twelve 291 - byte packets, and two 831 - byte packets


convert the packet number ratio into byte counts by multiplying each packet count by the corresponding packet size. in this example, the number of packets sent is one 1086 - byte packet, twelve 291 - byte packets, and two 831 - byte packets, or 1086, 3492, and 1662 bytes, respectively, from each queue. these are the byte counts you would specify in your cq configuration. step 5 to determine the bandwidth distribution this ratio represents, first determine the total number of bytes sent after all three queues are serviced : ( 1 * 1086 ) + ( 12 * 291 ) + ( 2 * 831 ) = 1086 + 3492 + 1662 = 6240 step 6 then determine the percentage of the total number of bytes sent from each queue : 1086 / 6240, 3492 / 6240, 1662 / 6240 = 17. 4, 56, and 26. 6 percent this result is close to the desired ratio of 20 / 60 / 20. step 7 if the actual bandwidth is not close enough to the desired bandwidth, multiply the original ratio of 1 : 11. 2 : 1. 3 by the best value, trying to get as close to three integer values as possible. note that the multiplier you use need not be an integer. for example, if we multiply the ratio by two, we get 2 : 22. 4 : 2. 6. we would now send two 1086 - byte packets, twenty - three 291 - byte packets, and three 831 - byte packets, or 2172 / 6693 / 2493, for a total of 11, 358 bytes. the resulting ratio is 19 / 59 / 22 percent, which is much closer to the desired ratio that we achieved. the bandwidth that a custom queue will receive is given by the following formula : ( queue byte count / total byte count of all queues ) * bandwidth capacity of the interface where bandwidth capacity is equal to the interface bandwidth minus the bandwidth for priority queues. window size also affects the bandwidth distribution. if the window size of a particular protocol is set to one, then that protocol will not place another packet into the queue until it receives an acknowledgment. the cq algorithm moves to the next queue if the byte count is exceeded or no packets are in that queue. therefore, with a window size of one, only one frame will be sent each time. if your frame count is set to 2 kilobytes, and your frame size is 256 bytes, then only 256


or no packets are in that queue. therefore, with a window size of one, only one frame will be sent each time. if your frame count is set to 2 kilobytes, and your frame size is 256 bytes, then only 256 bytes will be sent each time this queue is serviced. why use cq? you can use the cisco ios qos cq feature to provide specific traffic guaranteed bandwidth at a potential congestion point, assuring the traffic a fixed portion of available bandwidth and leaving the remaining bandwidth to other traffic. for example, you could reserve half of the bandwidth for sna data, allowing the remaining half to be used by other protocols. if a particular type of traffic is not using the bandwidth reserved for it, then unused bandwidth can be dynamically allocated to other traffic types. cq is statically configured and does not adapt to changing network conditions. with cq enabled, the system takes longer to switch packets than fifo because the packets are classified by the processor card. pq allows you to define how traffic is prioritized in the network. you configure four traffic priorities. you can define a series of filters based on packet characteristics to cause the router to place traffic into these four queues ; the queue with the highest priority is serviced first until it is empty, then the lower queues are serviced in sequence. for information on how to configure pq, see the " configuring priority queueing " module. how it works during transmission, pq gives priority queues absolute preferential treatment over low priority queues ; important traffic, given the highest priority, always takes precedence over less important traffic. packets are classified based on user - specified criteria and placed into one of the four output queues — high, medium, normal, and low — based on the assigned priority. packets that are not classified by priority fall into the normal queue. figure 3 illustrates this process. figure 3 priority queueing when a packet is to be sent out an interface, the priority queues on that interface are scanned for packets in descending order of priority. the high priority queue is scanned first, then the medium priority queue, and so on. the packet at the head of the highest queue is chosen for transmission. this procedure is repeated every time a packet is to be sent. the maximum length of a queue is defined by the length limit. when a queue is longer than the queue limit, all additional packets are dropped. note the priority output queueing mechanism can be used to manage