Multiplex communications – Data flow congestion prevention or control – Control of data admission to the network
Reexamination Certificate
1999-02-03
2004-07-13
Nguyen, Steven H. D. (Department: 2732)
Multiplex communications
Data flow congestion prevention or control
Control of data admission to the network
C370S233000, C370S252000
Reexamination Certificate
active
06762996
ABSTRACT:
BACKGROUND OF THE INVENTION
The present invention relates to a network policing method for cell tagging within a communications network as described in the preamble of claim
1
and related device as described in the preamble of claim
2
.
Such a cell tagging method is already known in the art, e.g. from the section “Traffic and Congestion Control in ATM Networks”, pages 302-340 in Asynchronous Transfer Mode: Solution for Broadband ISDN, third edition, from the author Martin de Prycker. Therein, a cell based traffic policing method called Usage Parameter Control (UPC), containing the steps of checking cells called determining cells to be conforming or non-conforming and tagging cells called cell tagging is described.
Since in a cell based tagging method only single cells from a frame are tagged, the frame may exist of a mix of tagged and non-tagged cells. In case of congestion the tagged cells might be discarded from the frame leaving incomplete frames in the network. Since incomplete frames are useless from an application point of view, hence the presence of these frames decreases network throughput.
This situation can be improved by using frame based traffic policing methods but, these often have the disadvantage that a number of cells of the entire frame which should be tagged, already have left the traffic policer. Only the cells that still remain within the traffic policer can be tagged. A frame exist of a mix of tagged and non-tagged cells is left then in the communications network. In case of congestion the tagged cells might be discarded from the frame leaving incomplete frames in the network. If such incomplete frames are not used anywhere in the communication network, then again the presence of these frames decreases network throughput.
As a remark on this frame based policing methods it should be mentioned that there are frame based policing algorithms possible and available not having the disadvantage of leaving corrupted frames within the network. One of those methods is described in the U.S. Pat. No. 5.666.353 with title “Frame based traffic policing for a digital switch”. However the disadvantage of this kind of methods is that the network has to support this method throughout the entire network to avoid incomplete frames within the network. This is very unlikely in the near future because it should be agreed and supported by all network operators.
Summarising the former, it can be said that applying traffic policing methods in a communication network in general, involves that the frames within the communication network may be incomplete because of a number of different possible problems as mentioned before. If such incomplete frames are not used anywhere in the communication network, then the presence of these frames decreases network throughput.
SUMMARY OF THE INVENTION
An object of the present invention is to provide a cell tagging method of the above known type and related devices adapted to perform this method, but wherein the network throughput is improved.
According to the invention, this object is achieved by the method described in claim
1
and the network buffer described in claim
2
.
Indeed by determining a tagged cell distribution within a frame by the network buffer a decision on the distribution of tagged cells within this frame can be made. Based on this decision all cells of the entire frame can be marked with a low or high cell loss priority. In this way the network only transports frames consisting of tagged cells only or non-tagged cells only. If all cells have the same cell loss priority, the entire frame will be passed or discarded in case of congestion. In case of congestion within the network, no incomplete frames are transported through the network. Network resources consequently are no longer occupied by incomplete frames that are not used.
BRIEF DESCRIPTION OF THE DRAWINGS
The above and other objects and features of the invention will become more apparent and the invention itself will be best understood by referring to the following description of an embodiment taken in conjunction with the accompanying drawing that represents, for the present invention, a relevant part of a Telecommunications network wherein a method for cell tagging according to the present invention is applied. The part of the telecommunications network drawn in the figure comprises a traffic policer TP and a network buffer NB which are interconnected and along which a communications path is set-up.
REFERENCES:
patent: 5313454 (1994-05-01), Bustini et al.
patent: 5524006 (1996-06-01), Hluchyj et al.
patent: 5541913 (1996-07-01), Witters et al.
patent: 5568468 (1996-10-01), Ogasawara et al.
patent: 5666353 (1997-09-01), Klausmeier et al.
patent: 5764641 (1998-06-01), Lin
patent: 6072773 (2000-06-01), Fichou et al.
patent: 6266327 (2001-07-01), Hernandez-Valencia
M. Gerla et al, LAN/Man Interconnection to ATM: A Simulation Study One World Through Communications, Florence, May 4-8, 1992, vol. 3, No. Conf. 11, Jan. 1, 1992, Institute of Electrical and Electronics Engineers, pp. 2270-2279, XP000300352.
Traffic and Congestion Control in ATM Networks, pp. 302-340, Asynchronous Transfer Mode: Solution for Broadband ISDN.
Alcatel
Nguyen Phuongchau Ba
Nguyen Steven H. D.
LandOfFree
Cell tagging method for buffered and fragmented frames does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Cell tagging method for buffered and fragmented frames, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Cell tagging method for buffered and fragmented frames will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-3237632