Sponsored Content
Full Discussion: match a phrase
Top Forums Shell Programming and Scripting match a phrase Post 302158002 by ghostdog74 on Monday 14th of January 2008 02:05:45 AM
Old 01-14-2008
one way
Code:
if($sent1=~/$query/i)
{
    print "matched";
}

 

8 More Discussions You Might Find Interesting

1. Shell Programming and Scripting

Remove duplicate phrase

I have a value VAL=XXXX_20061001_00 XXXX_20061001_03 XXXX_20061001_00 XXXX_20061002_00 XXXX_20061002_03 XXXX_20061003_00 The VAL has duplicates like XXXX_20061001_00 repeated twice. How to make the VAL with unique values. Thanks in advance. (6 Replies)
Discussion started by: kesu2k
6 Replies

2. Shell Programming and Scripting

Dont Know How to Phrase the Title

Ok i have an expect script that logs into an appliance kinda like a Cisco router, runs a command, and I need to get some calculation out of the output of that command. The reason I have to use an expect script is the data I am trying to harvest does not have an SNMP variable assigned to it. I... (1 Reply)
Discussion started by: barney34
1 Replies

3. Shell Programming and Scripting

convert phrase

I am converting a mysql database from myIsam to innodb. After dumping all databases to a file, I am trying to make modification: sed s/ENGINE=MyISAM/ENGINE=InnoDB/ dump_1 > dump_1_inno however, when I import the modified dump file to mysql server, I got error: ERROR 1214 (HY000) at line... (4 Replies)
Discussion started by: fredao
4 Replies

4. Shell Programming and Scripting

find PHRASE and PATH

I've got a script which finds *.txt files in directories and subdirectories after providing the path by the user and then searches in the files for phrase given by the user How to write script in such way that the paths to the found *.txt files and the phrase given by the user were both... (2 Replies)
Discussion started by: patrykxes
2 Replies

5. Shell Programming and Scripting

Getting 15 characters after search phrase

I have data that looks like this: 2002 140 40800.0060 GPS 20 C1 25477810.2305 2002 140 41100.0060 GPS 20 C1 25298056.0453 I need to get data after certain pattern.. for example if i search for C1 it should return 25477810.2305 25298056.0453 To achieve this, it should: ... (3 Replies)
Discussion started by: bfr
3 Replies

6. Shell Programming and Scripting

regarding about the (/) in the phrase

Hello, I am trying to print lines from a text file using this command gawk '/Filename:/' 11.rtf >> 22.rtf and it work ok. but if the phrase has included forward (/) something like that gawk '/File/name:/' 11.rtf >> 22.rtf it give error . so is there any manipulation when it... (1 Reply)
Discussion started by: davidkhan
1 Replies

7. UNIX for Dummies Questions & Answers

How to match on phrase at beginning of line and specific columns?

Here is my file: 700 7912345678910 61234567891234567891 700 8012345678910 61234567891234567891 I want to pull all lines that begin with '700' only if columns 11-12 are '79'. My code so far only pulls the '79', not the whole line: grep ^700 file1 | cut -c 11,12 |... (7 Replies)
Discussion started by: Scottie1954
7 Replies

8. Shell Programming and Scripting

How to find a phrase and pull all lines that follow until the phrase occurs again?

I want to burst a report by using the page number value in the report header. Each section starts with *PAGE NO:* 1 Each section might have several pages, but the next section always starts back at 1. So I want to find the "*PAGE NO:* 1" value and pull all lines that follow until "*PAGE NO:* 1"... (4 Replies)
Discussion started by: Scottie1954
4 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 01:21 AM.
Unix & Linux Forums Content Copyright 1993-2022. All Rights Reserved.
Privacy Policy