Welcome to Linux Knowledge Base and Tutorial
"The place where you learn linux"
UNICEF

 Create an AccountHome | Submit News | Your Account  

Tutorial Menu
Linux Tutorial Home
Table of Contents

· Introduction to Operating Systems
· Linux Basics
· Working with the System
· Shells and Utilities
· Editing Files
· Basic Administration
· The Operating System
· The X Windowing System
· The Computer Itself
· Networking
· System Monitoring
· Solving Problems
· Security
· Installing and Upgrading
· Linux and Windows

Glossary
MoreInfo
Man Pages
Linux Topics
Test Your Knowledge

Site Menu
Site Map
FAQ
Copyright Info
Terms of Use
Privacy Info
Disclaimer
WorkBoard
Thanks
Donations
Advertising
Masthead / Impressum
Your Account

Communication
Feedback
Forums
Private Messages
Surveys

Features
HOWTOs
News Archive
Submit News
Topics
User Articles
Web Links

Google
Google


The Web
linux-tutorial.info

Who's Online
There are currently, 89 guest(s) and 0 member(s) that are online.

You are an Anonymous user. You can register for free by clicking here

  

tc-htb



SYNOPSIS

       tc  qdisc  ...  dev  dev ( parent classid | root) [ handle
       major: ] htb [ default minor-id ]

       tc class  ...  dev  dev  parent  major:[minor]  [  classid
       major:minor  ]  htb  rate rate [ ceil rate ] burst bytes [
       cburst bytes ] [ prio priority ]


DESCRIPTION

       HTB is  meant  as  a  more  understandable  and  intuitive
       replacement  for  the CBQ qdisc in Linux. Both CBQ and HTB
       help you to control the use of the outbound bandwidth on a
       given  link.  Both  allow  you to use one physical link to
       simulate several slower links and to send different  kinds
       of  traffic  on  different simulated links. In both cases,
       you have to specify how to divide the physical  link  into
       simulated  links and how to decide which simulated link to
       use for a given packet to be sent.

       Unlike CBQ, HTB shapes traffic based on the  Token  Bucket
       Filter  algorithm which does not depend on interface char­
       acteristics and so does not need to  know  the  underlying
       bandwidth of the outgoing interface.


SHAPING ALGORITHM

       Shaping works as documented in tc-tbf (8).


CLASSIFICATION

       Within  the  one HRB instance many classes may exist. Each
       of these classes contains another qdisc,  by  default  tc-
       pfifo(8).

       When  enqueueing a packet, HTB starts at the root and uses
       various methods to determine which  class  should  receive
       the data.

       In the absence of uncommon configuration options, the pro­
       cess is rather easy.  At each node we look for an instruc­
       tion,  and  then go to the class the instruction refers us
       to. If the class found  is  a  barren  leaf-node  (without
       children), we enqueue the packet there. If it is not yet a
       leaf node, we do the whole thing over again starting  from
       that node.

       The following actions are performed, in order at each node
       we visit, until one sends us to another  node,  or  termi­
       nates the process.

       (i)    Consult filters attached to the class. If sent to a


QDISC

       The  root  of  a  CBQ  qdisc  class tree has the following
       parameters:

       parent major:minor | root
              This mandatory parameter determines  the  place  of
              the  CBQ  instance, either at the root of an inter­
              face or within an existing class.

       handle major:
              Like all other qdiscs, the CBQ can  be  assigned  a
              handle. Should consist only of a major number, fol­
              lowed by a colon.  Optional,  but  very  useful  if
              classes will be generated within this qdisc.

       default minor-id
              Unclassified  traffic  gets  sent to the class with
              this minor-id.


CLASSES

       Classes have a host of parameters to configure their oper­
       ation.

       parent major:minor
              Place  of  this  class  within  the  hierarchy.  If
              attached directly to a qdisc  and  not  to  another
              class, minor can be omitted. Mandatory.

       classid major:minor
              Like qdiscs, classes can be named. The major number
              must be equal to the major number of the  qdisc  to
              which  it  belongs.  Optional,  but  needed if this
              class is going to have children.

       prio priority
              In the round-robin process, classes with the lowest
              priority  field are tried for packets first. Manda­
              tory.

       rate rate
              Maximum rate this class and all  its  children  are
              guaranteed. Mandatory.

       ceil rate
              Maximum rate at which a class can send, if its par­
              ent has bandwidth to spare.  Defaults to  the  con­
              figured rate, which implies no borrowing
              dren.


NOTES

       Due to Unix timing constraints, the maximum ceil  rate  is
       not infinite and may in fact be quite low. On Intel, there
       are 100 timer events per second, the maximum rate is  that
       rate  at  which  'burst'  bytes  are sent each timer tick.
       From this, the mininum burst size for a specified rate can
       be calculated. For i386, a 10mbit rate requires a 12 kilo­
       byte burst as 100*12kb*8 equals 10mbit.


BUGS

       Not in the stock kernel yet.


SEE ALSO

       tc(8)

       HTB website: http://luxik.cdi.cz/~devik/qos/htb/


AUTHOR

       Martin Devera <devik@cdi.cz>. This manpage  maintained  by
       bert hubert <ahu@ds9a.nl>

iproute2                 10 January 2002                   HTB(8)
  




Login
Nickname

Password

Security Code
Security Code
Type Security Code


Don't have an account yet? You can create one. As a registered user you have some advantages like theme manager, comments configuration and post comments with your name.

Help if you can!


Amazon Wish List

Did You Know?
You can get all the latest Site and Linux news by checking out our news page.


Friends



Tell a Friend About Us

Bookmark and Share



Web site powered by PHP-Nuke

Is this information useful? At the very least you can help by spreading the word to your favorite newsgroups, mailing lists and forums.
All logos and trademarks in this site are property of their respective owner. The comments are property of their posters. Articles are the property of their respective owners. Unless otherwise stated in the body of the article, article content (C) 1994-2013 by James Mohr. All rights reserved. The stylized page/paper, as well as the terms "The Linux Tutorial", "The Linux Server Tutorial", "The Linux Knowledge Base and Tutorial" and "The place where you learn Linux" are service marks of James Mohr. All rights reserved.
The Linux Knowledge Base and Tutorial may contain links to sites on the Internet, which are owned and operated by third parties. The Linux Tutorial is not responsible for the content of any such third-party site. By viewing/utilizing this web site, you have agreed to our disclaimer, terms of use and privacy policy. Use of automated download software ("harvesters") such as wget, httrack, etc. causes the site to quickly exceed its bandwidth limitation and are therefore expressly prohibited. For more details on this, take a look here

PHP-Nuke Copyright © 2004 by Francisco Burzi. This is free software, and you may redistribute it under the GPL. PHP-Nuke comes with absolutely no warranty, for details, see the license.
Page Generation: 0.11 Seconds