Router and method of managing packet queue using the same

Abstract

A router for performing queue management for packet transmission is provided, which includes a first storage unit for storing and outputting packets input to request transmission from a source device to a destination device; a second storage unit for storing information on the packets stored in the first storage unit; and a packet-processing determination unit for determining whether the input packets are to be stored in the first storage unit, based on whether there is a available storage capacity in the first storage unit, and updating information on the packets into the second storage unit.

Description

CLAIM OF PRIORITY [0001] This application makes reference to, incorporates the same herein, and claims all benefits accruing under 35 U.S.C. 19 from an application entitled ROUTER AND METHOD OF MANAGING PACKET QUEUE USING THE SAME earlier filed in the Korean Intellectual Property Office on Nov. 16, 2004 and thereby duly assigned Serial No. 2004-93741. BACKGROUND OF THE INVENTION [0002] 1. Technical Field [0003] The present invention relates to a router and method of managing a packet queue using the same and, more particularly, to a router and method of managing a packet queue using the same capable of controlling packet transmission while maintaining fair buffer occupation. [0004] 2. Related Art [0005] In general, different traffics of several sizes and transmission rates are flowing over the Internet. Queue managing and scheduling schemes are used to minimize problems, such as congestion, that may occur while the traffics flow over the Internet. [0006] One such problem is unfairne...

AI Technical Summary

Benefits of technology

[0023] The present invention has been made to solve the aforementioned problems. It is an object of the present invention to provide a router and method of managing a queue using the same, capable of maintaining fairness for a buffer without causing a specific flow to occupy all buffers of a router, by using a partial state.

[0024] It is another object of the present invention to provide a router and method of managing a packet queue using the same, capable of relieving a requirement on a use storage space by using a partial state scheme.

[0038] According to the present invention, a requirement on a storage space can be relieved using a partial state scheme and, based on it, unfairness for buffer occupation is controlled up to a level defined through a threshold so that buffer occupation for packets can be more fairly controlled. Further, when there is no storage space in the buffer, queue management for the relevant packet is performed, thereby maximizing buffer utilization. Furthermore, if necessary, it is easy to change a buffer management policy by adjusting a regulation on buffer based on the threshold.

Problems solved by technology

One such problem is unfairness for traffics.

Therefore, even though the application A 10 using the TCP desires to transmit the packet to a sink for A 50, there is no remaining bandwidth for transmission, which results in unfairness of transmission.

However, the drop tail based FIFO scheduling supports only a best effort service.

In other words, this scheme has structural disadvantages in that no quality of service is guaranteed and that a buffer of the router can be occupied by some flows that generate a number of traffics.

However, there are problems with the IntServ model in that it has insufficient extensibility and requires a number of resources because it secures resources for the services in advance and retains information for all the flows.

In turn, this requires a great capacity of storage in the router and greatly affects a processing speed in much flow.

Further, high overhead is accompanied by processing control-related functions such as access management and approval / permission.

Meanwhile, a traffic aggregation model used in the DiffServ model has poor prediction.

Therefore, it is very difficult for the DiffServ model to guarantee a specific level of service.

It degrades overall buffer usage.

In addition, it is difficult to establish a reliable regulation policy since the regulation is based on probability.

The LRU-FQ causes a problem of packet recording, and a fairness problem in a network where there are a number of flows that exchange small number of packets.

Images