Network traffic control: Difference between revisions
No edit summary |
|||
| Line 4: | Line 4: | ||
== Traffic shaping == |
== Traffic shaping == |
||
{{main|Traffic shaping}} |
{{main|Traffic shaping}} |
||
Traffic shaping is the retiming (delaying) of [[Network packet|packet]]s (or [[frame (networking)|frame]]s) until they meet specified bandwidth and or burstiness limits. Since such delays involve queues that are nearly always finite and, once full, excess traffic is nearly always dropped (discarded), traffic shaping nearly always implies traffic |
Traffic shaping is the retiming (delaying) of [[Network packet|packet]]s (or [[frame (networking)|frame]]s) until they meet specified bandwidth and or burstiness limits. Since such delays involve queues that are nearly always finite and, once full, excess traffic is nearly always dropped (discarded), traffic shaping nearly always implies traffic policin as well. |
||
== Traffic policing == |
== Traffic policing == |
||
Revision as of 14:16, 22 August 2015
 |
In computer networking, network traffic control is the process of managing, controlling or reducing the network traffic, particularly Internet bandwidth, e.g. by the network scheduler. It is used by network administrators, to reduce congestion, latency and packet loss. This is part of bandwidth management. In order to use these tools effectively, it is necessary to measure the network traffic to determine the causes of network congestion and attack those problems specifically.
Traffic shaping
Traffic shaping is the retiming (delaying) of packets (or frames) until they meet specified bandwidth and or burstiness limits. Since such delays involve queues that are nearly always finite and, once full, excess traffic is nearly always dropped (discarded), traffic shaping nearly always implies traffic policin as well.
Traffic policing
Traffic policing is the dropping (discarding) or reduction in priority (demoting) of packets (or frames) that exceed some specified bandwidth and or burstiness limit.