Traffic supervisory method and traffic supervisory apparatus
First Claim
Patent Images
1. A traffic supervisory method for supervising a group of packets generated in a terminal according to an assigned traffic characteristic in which a maximum number of packets which is generated within a regular period of time T is set at N, where N is a positive number, comprising the steps of:
- defining a first set of parameters α
1, α
2, . . . α
M, for a number M, where M>
2, where respective parameters of said first set are greater than one and arranged in an ascending order, and a second set of parameters β
1, β
2, . . . β
M, said second set of parameters being arranged in a descending order so that a last one of the second set of parameters, β
M, equals zero;
respectively counting the number of packets which are generated within regular periods of time expressed by α
i ·
T, where i=1, 2, . . . , M;
respectively calculating α
i ·
(1+β
i)·
N where i=1, 2, . . . , M;
evaluating whether the packets counted in the above counting step violate the assigned traffic characteristic whenever the packets generated within the regular period of time T exceed α
i ·
(1+β
i)·
N within at least one regular period of time α
i ·
T;
transmitting the packets evaluated in the evaluating step as violating the traffic characteristic with an identification tag; and
prioritizing rejection of the tagged packets.
1 Assignment
0 Petitions
Accused Products
Abstract
A traffic supervisory method for supervising a group of packets generated in a terminal according to an assigned traffic characteristic in which the maximum number of packets generated within a regular period time T is set at N comprises respectively counting the number of packets which are generated within regular time periods αi·T ({αi|1≦i≦M, 1≦α1<α2<. . . <αM }) in a packet flow and judging the packets to violate the assigned traffic characteristic in the case where more packets are generated than αi·(1+βi)·N({βi|1≦i.ltoreq.M, β1≧β2> . . . >βM =0}) within at least one regular interval of time αi·T.
-
Citations
5 Claims
-
1. A traffic supervisory method for supervising a group of packets generated in a terminal according to an assigned traffic characteristic in which a maximum number of packets which is generated within a regular period of time T is set at N, where N is a positive number, comprising the steps of:
-
defining a first set of parameters α
1, α
2, . . . α
M, for a number M, where M>
2, where respective parameters of said first set are greater than one and arranged in an ascending order, and a second set of parameters β
1, β
2, . . . β
M, said second set of parameters being arranged in a descending order so that a last one of the second set of parameters, β
M, equals zero;respectively counting the number of packets which are generated within regular periods of time expressed by α
i ·
T, where i=1, 2, . . . , M;respectively calculating α
i ·
(1+β
i)·
N where i=1, 2, . . . , M;evaluating whether the packets counted in the above counting step violate the assigned traffic characteristic whenever the packets generated within the regular period of time T exceed α
i ·
(1+β
i)·
N within at least one regular period of time α
i ·
T;transmitting the packets evaluated in the evaluating step as violating the traffic characteristic with an identification tag; and prioritizing rejection of the tagged packets. - View Dependent Claims (2)
-
-
3. A traffic supervisory apparatus for supervising a group of packets generated in a terminal according to an assigned traffic characteristic in which a maximum number of packets which is generated within a regular period time T is set at N, where N is a positive number, and having a first set of parameters α
-
1, α
2, . . . α
M, for a number M, where M>
2, where respective said parameters of said first set are greater than one and arranged in an ascending order, and a second set of parameters, β
1, β
2, . . . β
M, which are arranged in a descending order so that a last one of the second set of parameters equals to zero, comprising;a plurality of packet counters for respectively counting the number of packets which are generated within regular periods of time expressed by α
i ·
T, where i=1, 2, . . . , M;a judgement section, receiving input from said packet counters, for calculating α
i ·
(1+β
i)·
N, where i=1, 2, . . . , M and for performing an evaluation of whether the packets counted in the packet counters violate the assigned traffic characteristic whenever the generated packets exceed α
i ·
(1+β
i)·
N within at least one regular interval of time α
i ·
T; anda transmission control section for controlling subsequent arrival packets based on the evaluation at the judgement section. - View Dependent Claims (4, 5)
-
1, α
Specification
-
- Resources
Litigation Campaign Assessment
Thank you for your request. You will receive a custom alert email when the Litigation Campaign Assessment is available.
×
-
Current AssigneeKabushiki Kaisha Toshiba (Toshiba Corporation)
-
Original AssigneeKabushiki Kaisha Toshiba (Toshiba Corporation)
-
InventorsIwamura, Kazuaki, Katsube, Yasuhiro
-
Primary Examiner(s)Olms, Douglas W.
-
Assistant Examiner(s)NGUYEN, CHAU T
-
Application NumberUS07/759,569Time in Patent Office879 DaysField of Search370/13, 370/17, 370/60, 370/60.1, 370/94.1, 370/94.2, 370/94.3US Class Current370/234CPC Class CodesH04L 12/5602 Bandwidth control in ATM Ne...H04L 2012/5615 Network termination, e.g. N...H04L 2012/5636 Monitoring or policing, e.g...H04L 49/3081 ATM peripheral units, e.g. ...H04Q 11/0478 Provisions for broadband co...
