Baraka Network Baraka Network
Translate this page in :
French
German Italian Portuguese Arabic Japanese Korean Spanish
Mastering Networks made easy
Products

 

"I needed help urgently with my office network.
I called up Baraka and they solved the issue in no time at all. "
            -Mike Kendrick.


Easy Solutions at Baraka

 

ontact Details:
Head office
6-353 Broadway
Shawinigan Que.
Canada G9N-1M2
(819) 531-2340

 

BTC Help File

Not sure what your doing?
Read our Tcp/IP tutorial.

Note that the rules that you insert will correspond to packet going out of the device on which you connect to with BTC. No matter if the packets goes to your LAN or WAN.

As a generic note, most rate limiting features don’t work on loop back, so don’t test them locally.

Priority
The priority of this classifier. Lower numbers get tested first.
Each list will be passed in the order the rules were added, then list with lower priority (higher preference number) will be processed.

By default, all filters reside in one big chain which is matched in descending order of priority. If you have 1000 rules, 1000 checks may be needed to determine what to do with a packet.
Matching would go much quicker if you would have 256 chains with each four rules - if you could divide packets over those 256 chains, so that the right rule will be there.

Rate
The implementation consists of a buffer (bucket), constantly filled by some virtual pieces of information called tokens, at a specific rate (token rate). The most important parameter of the bucket is its size, that is the number of tokens it can store. Each arriving token collects one incoming data packet from the data queue and is then deleted from the bucket. Associating this algorithm with the two flows -- token and data, gives us three possible scenarios:

The data arrives in at a rate that’s equal to the rate of incoming tokens. In this case each incoming packet has its matching token and passes the queue without delay.

The data arrives in at a rate that’s smaller than the token rate. Only a part of the tokens are deleted at output of each data packet that’s sent out the queue, so the tokens accumulate, up to the bucket size. The unused tokens can then be used to send data a speed that’s exceeding the standard token rate, in case short data bursts occur.

The data arrives in at a rate bigger than the token rate. This means that the bucket will soon be devoid of tokens, which causes the bucket to throttle itself for a while. This is called an ’over limit situation’. If packets keep coming in, packets will start to get dropped.

Max Burst
The accumulation of tokens allows a short burst of over limit data to be still passed without loss, but any lasting overload will cause packets to be constantly delayed, and then dropped.

Isolated/sharing
A class that is configured with ’isolated’ will not lend out bandwidth to sibling classes. Use this if you have competing or mutually-unfriendly agencies on your link who do want to give each other freebies. The control program also knows about ’sharing’, which is the reverse of ’isolated’.

Bounded/borrow
A class can also be ’bounded’, which means that it will not try to borrow bandwidth from sibling classes. The program also knows about ’borrow’, which is the reverse of ’bounded’. A typical situation might be where you have two agencies on your link which are both ’isolated’ and ’bounded’, which means that they are really limited to their assigned rate, and also won’t allow each other to borrow.

Nat this IP
In the event that you assign a non routable IP address to your host / group / subnet. Accessing the internet is still possible.
Check this box and the device will forward your request on your behalf.

Not sure what your doing?
Read our Tcp/IP tutorial.

 

BTC menu

BTC Help Files

Device setup howto

Tcp/IP tutorial

Add a host
Add a group
Add host to group
Add a subnet
Delete host
Delete group
Delete subnet
Monitor
Priority
Rate
Max Burst
Bounded
Borrowed
Shared
Isolated
Nat this IP
Port
Source
Destination
Lan / Wan / Both

Home :: :: Products :: :: How to :: :: FAQs :: :: Download :: :: Contact Us