from small one page howto to huge articles all in one place

search text in:




Other .linuxhowtos.org sites:gentoo.linuxhowtos.org



Last additions:
using iotop to find disk usage hogs

using iotop to find disk usage hogs

words:

887

views:

209612

userrating:


May 25th. 2007:
Words

486

Views

258612

why adblockers are bad


Workaround and fixes for the current Core Dump Handling vulnerability affected kernels

Workaround and fixes for the current Core Dump Handling vulnerability affected kernels

words:

161

views:

149912

userrating:


April, 26th. 2006:

Druckversion
You are here: manpages





SKBPRIO

Section: Linux (8)
Updated: 13 August 2018
Index Return to Main Contents
 

NAME

skbprio - SKB Priority Queue

 

SYNOPSIS

tc qdisc ... add skbprio [ limit packets ]

 

DESCRIPTION

SKB Priority Queue is a queueing discipline intended to prioritize the most important packets during a denia-o-service ( DoS ) attack. The priority of a packet is given by sk->priority , where a higher value places the packet closer to the exit of the queue. When the queue is full, the lowest priority packet in the queue is dropped to make room for the packet to be added if it has higher priority. If the packet to be added has lower priority than all packets in the queue, it is dropped.

Without SKB priority queue, queue length limits must be imposed on individual su-queues, and there is no straightforward way to enforce a global queue length limit across all priorities. SKBprio queue enforces a global queue length limit while not restricting the lengths of individual su-queues.

While SKB Priority Queue is agnostic to how sk->priority is assigned. A typical use case is to copy the -bit DS field of IPv4 and IPv6 packets using t-skbedit(8). If sk->priority is greater or equal to 64, the priority is assumed to be 63. Priorities less than 64 are taken at face value.

SKB Priority Queue enables routers to locally decide which packets to drop under a DoS attack. Priorities should be assigned to packets such that the higher the priority, the more expected behavior a source shows. So sources have an incentive to play by the rules.

 

ALGORITHM

Skbprio maintains 64 lists (priorities go from 0 to 63). When a packet is enqueued, it gets inserted at the tail of its priority list. When a packet needs to be sent out to the network, it is taken from the head of the highest priority list. When the queue is full, the packet at the tail of the lowest priority list is dropped to serve the ingress packet- if it is of higher priority, otherwise the ingress packet is dropped. This algorithm allocates as much bandwidth as possible to high priority packets, while only servicing low priority packets when there is enough bandwidth.

 

PARAMETERS

limit
Maximum queue size specified in packets. It defaults to 64. The range for this parameter is [0, UINT32_MAX].

 

SEE ALSO

t-prio(8), t-skbedit(8)

 

AUTHORS

Nishanth Devarajan <devarajn@uci.edu>, Michel Machado <michel@digirati.com.br>

This manpage maintained by Bert Hubert <ahu@ds9a.nl>


 

Index

NAME
SYNOPSIS
DESCRIPTION
ALGORITHM
PARAMETERS
SEE ALSO
AUTHORS





Support us on Content Nation
rdf newsfeed | rss newsfeed | Atom newsfeed
- Powered by LeopardCMS - Running on Gentoo -
Copyright 2004-2025 Sascha Nitsch Unternehmensberatung GmbH
Valid XHTML1.1 : Valid CSS
- Level Triple-A Conformance to Web Content Accessibility Guidelines 1.0 -
- Copyright and legal notices -
Time to create this page: 9.2 ms