Sponsored Content
The Lounge What is on Your Mind? How many hours do you spend at unix.com a week ? Post 302468706 by phoenix_nebula on Wednesday 3rd of November 2010 03:02:56 PM
Old 11-03-2010
i like this fourm than any other fourms i have been earlier;
very helpful guys!! and very responsive thanks for sharing your knowledge!!
 

8 More Discussions You Might Find Interesting

1. UNIX for Dummies Questions & Answers

Unix IMAP e-mail via Outlook showing +10 hours

Multiple users at my work are connecting to a UNIX IMAP e- mail server via Outlook 2003 that is creating a small problem. Random new e-mails repeat themselves up to 3 times with an additional 10 hours added to them of when the original arrived. i.e Original e-mail marked arrived at 10:00am... (2 Replies)
Discussion started by: arkady
2 Replies

2. UNIX for Dummies Questions & Answers

Help me spend $1000

Hey, As part of a Master's Degree program in Aeronautical Engineering I need a dedicated Unix PC to run a computational fluid dynamics (CFD) code in Fortran. Each run to model a single flow can take several days or weeks, so optimizing system resources is the only consideration. I need to buy... (1 Reply)
Discussion started by: John Bruzzese
1 Replies

3. UNIX for Dummies Questions & Answers

crontab every 2 minutes, 24 hours and once a week

can someone please check my answers for the crontabs I am making 1. how would I set up a crontab tab executes every 2 minutes each and every day of the week? answer: 2 * * * * /path/to/file.pl <-- is this correct? 2. how would I set up a crontab that executes every 24 hours at 2am?... (6 Replies)
Discussion started by: Bobafart
6 Replies

4. Shell Programming and Scripting

unix command/s to find files older than 2 hours in a directory

I need to write a script to find files older than 2 hours in set of direcotries and list them ina mail. I know find command ti list files greater/lesser than days but i need to do it for hours. Any input. (6 Replies)
Discussion started by: Presanna
6 Replies

5. Shell Programming and Scripting

how to list files between last 6 hours to 3 hours

Hi Frens, I want to list some files from a directory, which contains "DONE" in their name, i am receiving files every minute. In this i want to list all the files which are newer than 6 hours but older than 3 hours, of current time i dont want my list to contain the latest files which are ... (4 Replies)
Discussion started by: Prat007
4 Replies

6. Shell Programming and Scripting

Can we get Tuesday's date of the current week in UNIX

Hi All, I have a requirement which would calculate the Tuesday's date of the current week in yyyymmdd format in unix shell script. Please help me out how could I do this . I appreciate your help Regards, raj (7 Replies)
Discussion started by: rajeevm
7 Replies

7. Shell Programming and Scripting

Can anyone help me to print UNIX epoch time to days,hours,min,sec ?

I have unix epoch time 1441678454803, Can you please help me to print this time in below format ? DAY,HOUR,MIN,SEC Appreciate your help!!! Thanks, Prince (7 Replies)
Discussion started by: prince1987
7 Replies

8. What is on Your Mind?

You Want to Spend Time with Friends and Family a UNIX.com Cartoon Explainer

Well, this was kinda fun and different: You Want to Spend Time with Friends and Family a UNIX.com Cartoon Explainer https://youtu.be/6jPDpuxI2OA You want to spend time with friends and family. But you are stuck on some problem... Your Linux or Unix code is buggy and you don't know... (1 Reply)
Discussion started by: Neo
1 Replies
SFB(8)                                                                 Linux                                                                SFB(8)

NAME
sfb - Stochastic Fair Blue SYNOPSIS
tc qdisc ... blue rehash milliseconds db milliseconds limit packets max packets target packets increment float decrement float penalty_rate packets per second penalty_burst packets DESCRIPTION
Stochastic Fair Blue is a classless qdisc to manage congestion based on packet loss and link utilization history while trying to prevent non-responsive flows (i.e. flows that do not react to congestion marking or dropped packets) from impacting performance of responsive flows. Unlike RED, where the marking probability has to be configured, BLUE tries to determine the ideal marking probability automati- cally. ALGORITHM
The BLUE algorithm maintains a probability which is used to mark or drop packets that are to be queued. If the queue overflows, the mark/drop probability is increased. If the queue becomes empty, the probability is decreased. The Stochastic Fair Blue (SFB) algorithm is designed to protect TCP flows against non-responsive flows. This SFB implementation maintains 8 levels of 16 bins each for accounting. Each flow is mapped into a bin of each level using a per-level hash value. Every bin maintains a marking probability, which gets increased or decreased based on bin occupancy. If the number of packets exceeds the size of that bin, the marking probability is increased. If the number drops to zero, it is decreased. The marking probability is based on the minimum value of all bins a flow is mapped into, thus, when a flow does not respond to marking or gradual packet drops, the marking probability quickly reaches one. In this case, the flow is rate-limited to penalty_rate packets per second. LIMITATIONS
Due to SFBs nature, it is possible for responsive flows to share all of its bins with a non-responsive flow, causing the responsive flow to be misidentified as being non-responsive. The probability of a responsive flow to be misidentified is dependent on the number of non-responsive flows, M. It is (1 - (1 - (1 / 16.0)) ** M) **8, so for example with 10 non-responsive flows approximately 0.2% of responsive flows will be misidentified. To mitigate this, SFB performs performs periodic re-hashing to avoid misclassification for prolonged periods of time. The default hashing method will use source and destination ip addresses and port numbers if possible, and also supports tunneling proto- cols. Alternatively, an external classifier can be configured, too. PARAMETERS
rehash Time interval in milliseconds when queue perturbation occurs to avoid erroneously detecting unrelated, responsive flows as being part of a non-responsive flow for prolonged periods of time. Defaults to 10 minutes. db Double buffering warmup wait time, in milliseconds. To avoid destroying the probability history when rehashing is performed, this implementation maintains a second set of levels/bins as described in section 4.4 of the SFB reference. While one set is used to manage the queue, a second set is warmed up: Whenever a flow is then determined to be non-responsive, the marking probabilities in the second set are updated. When the rehashing happens, these bins will be used to manage the queue and all non-responsive flows can be rate-limited immediately. This value determines how much time has to pass before the 2nd set will start to be warmed up. Defaults to one minute, should be lower than rehash. limit Hard limit on the real (not average) total queue size in packets. Further packets are dropped. Defaults to the transmit queue length of the device the qdisc is attached to. max Maximum length of a buckets queue, in packets, before packets start being dropped. Should be sightly larger than target , but should not be set to values exceeding 1.5 times that of target . Defaults to 25. target The desired average bin length. If the bin queue length reaches this value, the marking probability is increased by increment. The default value depends on the max setting, with max set to 25 target will default to 20. increment A value used to increase the marking probability when the queue appears to be over-used. Must be between 0 and 1.0. Defaults to 0.00050. decrement Value used to decrease the marking probability when the queue is found to be empty. Must be between 0 and 1.0. Defaults to 0.00005. penalty_rate The maximum number of packets belonging to flows identified as being non-responsive that can be enqueued per second. Once this num- ber has been reached, further packets of such non-responsive flows are dropped. Set this to a reasonable fraction of your uplink throughput; the default value of 10 packets is probably too small. penalty_burst The number of packets a flow is permitted to exceed the penalty rate before packets start being dropped. Defaults to 20 packets. STATISTICS
This qdisc exposes additional statistics via 'tc -s qdisc' output. These are: earlydrop The number of packets dropped before a per-flow queue was full. ratedrop The number of packets dropped because of rate-limiting. If this value is high, there are many non-reactive flows being sent through sfb. In such cases, it might be better to embed sfb within a classful qdisc to better control such flows using a different, shaping qdisc. bucketdrop The number of packets dropped because a per-flow queue was full. High bucketdrop may point to a high number of aggressive, short- lived flows. queuedrop The number of packets dropped due to reaching limit. This should normally be 0. marked The number of packets marked with ECN. maxqlen The length of the current longest per-flow (virtual) queue. maxprob The maximum per-flow drop probability. 1 means that some flows have been detected as non-reactive. NOTES
SFB automatically enables use of Explicit Congestion Notification (ECN). Also, this SFB implementation does not queue packets itself. Rather, packets are enqueued to the inner qdisc (defaults to pfifo). Because sfb maintains virtual queue states, the inner qdisc must not drop a packet previously queued. Furthermore, if a buckets queue has a very high marking rate, this implementation will start dropping packets instead of marking them, as such a situation points to either bad congestion, or an unresponsive flow. EXAMPLE &; USAGE To attach to interface $DEV, using default options: # tc qdisc add dev $DEV handle 1: root sfb Only use destination ip addresses for assigning packets to bins, perturbing hash results every 10 minutes: # tc filter add dev $DEV parent 1: handle 1 flow hash keys dst perturb 600 SEE ALSO
tc(8), tc-red(8), tc-sfq(8) SOURCES
o W. Feng, D. Kandlur, D. Saha, K. Shin, BLUE: A New Class of Active Queue Management Algorithms, U. Michigan CSE-TR-387-99, April 1999. AUTHORS
This SFB implementation was contributed by Juliusz Chroboczek and Eric Dumazet. iproute2 August 2011 SFB(8)
All times are GMT -4. The time now is 08:47 AM.
Unix & Linux Forums Content Copyright 1993-2022. All Rights Reserved.
Privacy Policy