Random early detect and differential packet aging flow control in switch queues

Inactive Publication Date: 2005-07-07
INTEL CORP +1
View PDF16 Cites 6 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Benefits of technology

[0008] The present invention helps solve the problems of stagnant packets within queues, dropped high-priority packets and network congestion, using a random early detect and differential packet aging flow control method. A differential random early detect mechanism is used to prevent congestion in the Internet traffic. An aging mechanism solves the problem of packets being locked in the queue of a switching device for a certain time because it cannot exit the queue.

Problems solved by technology

A problem is, however, that packets get stuck in that queues when there is congestion in the network, or when a link is down or not ready.
Complex conditions arise when packets are destined for multiple ports, and the packets can exit from some of the ports but not from others.
The result can be that the packets can get stuck in the buffers indefinitely.
The disadvantage of this solution is that during the time when the packets are locked in the switching device, they take up valuable space resources.
The disadvantage of this solution is that it does not differentiate between low and high priority packets.
It also does not differentiate between time critical packets (e.g. for real time applications such as voice-over-IP, video-over-IP or other types of time critical packets).

Method used

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
View more

Image

Smart Image Click on the blue labels to locate them in the text.
Viewing Examples
Smart Image
  • Random early detect and differential packet aging flow control in switch queues
  • Random early detect and differential packet aging flow control in switch queues
  • Random early detect and differential packet aging flow control in switch queues

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0014]FIG. 1 is a schematic diagram illustrating a switching device 101 implementing the differential packet aging and random early detect method of the present invention to control one or more queues 11, 13, 15. A packet 103 enters a packet classification engine 105 of the switching device 101. The classification engine 105 checks the priority of the packet based on a set of rules 107 that can be programmed by a user or which can be hard-coded.

[0015] Based on the priority determined by the classification engine 105, a “weight” value 109 is determined by a weight value determination section 110 and is assigned to the packet 103. Packets that should be aged out faster from the queue will have a smaller weight, and thus have a higher probability for a shorter lifetime.

[0016] The weight value is then fed into a “random early detect” (RED) engine 111. Also, the queue occupancy (number of packets) 113 in the queue to which the packet 103 is assigned (in this example the queue 11) is de...

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to view more

PUM

No PUM Login to view more

Abstract

Flow control is provided for a packet switch. An incoming packet is classified according to its priority based on predefined rules to produce a weight value based on the priority of the packet. A lifetime value associated with the packet is produced based on the weight value and the queue occupancy in a queue to which the packet is assigned. The packet is discarded if its associated lifetime value is less than or equal to a threshold value. Otherwise the packet and associated lifetime value are sent to the queue. The lifetime value is periodically changed and compared to a threshold value. The packet is removed from the queue when its lifetime value reaches the threshold value.

Description

FIELD OF THE INVENTION [0001] The present invention relates to flow control in devices utilizing queuing systems for packets. BACKGROUND OF THE INVENTION [0002] Devices using queuing systems for packets, for example gateways, switches and routers, are often used in networks supporting IP or TCPIP, such as Ethernet. A problem is, however, that packets get stuck in that queues when there is congestion in the network, or when a link is down or not ready. Under this stuck condition two things happen. [0003] (1) Packets are stored in buffers and referenced through link lists. Complex conditions arise when packets are destined for multiple ports, and the packets can exit from some of the ports but not from others. Furthermore, new packets enter from other ports. The result can be that the packets can get stuck in the buffers indefinitely. [0004] (2) Buffer space can be taken up by packets that are of lower priority, and higher priority packets get dropped. [0005] One prior art solution is...

Claims

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to view more

Application Information

Patent Timeline
no application Login to view more
IPC IPC(8): G06F17/00H04L12/56
CPCH04L47/10H04L47/32H04L47/283
Inventor YONG, YEAN KEEKOO, HONG LEE
Owner INTEL CORP
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Try Eureka
PatSnap group products