The patent badge is an abbreviated version of the USPTO patent document. The patent badge does contain a link to the full patent document.
The patent badge is an abbreviated version of the USPTO patent document. The patent badge covers the following: Patent number, Date patent was issued, Date patent was filed, Title of the patent, Applicant, Inventor, Assignee, Attorney firm, Primary examiner, Assistant examiner, CPCs, and Abstract. The patent badge does contain a link to the full patent document (in Adobe Acrobat format, aka pdf). To download or print any patent click here.
Patent No.:
Date of Patent:
May. 02, 2006
Filed:
Dec. 31, 2001
Jussi Ruutu, Espoo, FI;
Dongmei Zhang, Beijing, CN;
Yu Shi, Beijing, CN;
Renaud Cuny, Helsinki, FI;
Jlan MA, Beijing, CN;
Khiem Le, Coppell, TX (US);
Ghassan Naim, Irving, TX (US);
Jussi Ruutu, Espoo, FI;
Dongmei Zhang, Beijing, CN;
Yu Shi, Beijing, CN;
Renaud Cuny, Helsinki, FI;
Jlan Ma, Beijing, CN;
Khiem Le, Coppell, TX (US);
Ghassan Naim, Irving, TX (US);
Nokia Corporation, Espoo, FI;
Abstract
The present invention relates to a method and network node for controlling packet flow in a buffer means () of a network node of a data network, wherein a nominal capacity is assigned to each data flow, and an additional or free capacity is shifted from a first flow portion to a second flow portion when a new data packet of said second flow portion has been received and said nominal capacity has been exceeded. The nominal capacity may be an upper buffer memory limit used for controlling queuing of data packets in a buffer memory () of said buffer means, wherein the memory space of the buffer memory () is shared between a plurality of channels allocated to respective packet data connections. Then, the free capacity corresponds to a memory space shifted from a first channel to a second channel, when a new data packet of the second channel has been received and not enough memory space is available for the second channel. Thus, a dynamic buffer-sharing mechanism is provided which reduces the number of packet drops in the buffer memory () during congestion and improves network throughput. Alternatively, the nominal capacity may be a nominal flow rate at which data flow traffic is guaranteed in a QoS scheduling algorithm. Then, a residual rate corresponding to the difference between the nominal flow rate and an instantaneous traffic is shifted between flow portions of a buffer means controlled by the scheduling algorithm to maximize total system throughput.