FIELD: communication technology.
SUBSTANCE: invention relates to a method for fair queue maintenance in routers of a transport communication network. The absolute weight for each queue, the rate of receipt of priority data traffic streams and the average packet size for each priority data traffic stream are set. All options (combinations) of active queues are formed. For each option (combination) of active queues, a vector of service intensities (WM) is calculated. A vector of service intensity intervals (IntWM) is formed for each vector of service intensities. Streams of priority data traffic are received to the input ports of the device. Priority data traffic flows are classified into classes according to the ToS Precedence field of the IP packet header, or according to the DSCP field of the IP packet header. The priority data traffic flows are routed to the corresponding output ports of the router based on the routing table. Data traffic packets of the appropriate class are queued in accordance with the ToS Precedence field of the IP packet header, or in accordance with the DSCP field of the IP packet header, the current status of the output port of the device is checked. The presence of packets in queues is checked, if the queues are not empty, a vector of active queues is formed, a vector of service intensity intervals taking into account the vector of active queues is selected. A random number evenly distributed in the range from 0 to 1 is generated. The number of the active queue is selected taking into account a random number and the vector of service intensity intervals (IntWM). The packet is transmitted to the output port of the device, the current state of the output port of the device is updated.
EFFECT: reduction in the complexity of calculations with the support of a large number of classes or service flows.
3 cl, 9 dwg
Title | Year | Author | Number |
---|---|---|---|
METHOD FOR PROBABILISTIC PRIORITY QUEUE MAINTENANCE AND A DEVICE IMPLEMENTING IT | 2021 |
|
RU2776658C1 |
METHOD OF MANAGING QUEUES IN ROUTERS OF TRANSPORT COMMUNICATION NETWORK | 2018 |
|
RU2696218C1 |
METHOD FOR AUTOMATIC CLASSIFICATION OF NETWORK TRAFFIC BASED ON HEURISTIC ANALYSIS | 2018 |
|
RU2690758C1 |
METHOD FOR AUTOMATIC CONFIGURATION OF OpenFlow SWITCHES AND OpenFlow ROUTERS | 2013 |
|
RU2544741C1 |
LIMITING TRAFFIC FOR NETWORK TRANSMITTING AT QUALITY-OF-SERVICE LEVELS | 2002 |
|
RU2299516C2 |
METHOD, APPARATUS AND SYSTEM FOR DATA STREAM PLANNING | 2011 |
|
RU2533166C2 |
METHOD FOR DETECTING DUPLICATE PACKETS IN A NETWORK TRAFFIC FLOW | 2022 |
|
RU2790636C1 |
TRANSMISSION OF INFORMATION IN BATCH-ORIENTED COMMUNICATIONS NETWORKS | 2002 |
|
RU2338327C2 |
QUALITY OF SERVICE INFORMATION CONFIGURATION | 2008 |
|
RU2454012C2 |
METHOD FOR DYNAMIC FILTRATION OF INTERNET PROTOCOL DATAGRAMS | 2013 |
|
RU2580808C2 |
Authors
Dates
2022-08-01—Published
2022-01-21—Filed