US5285442A — Traffic supervisory method and traffic supervisor…

Claim 1

Independent Claim 246 words

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.

Claim 2

Dependent Claim 246 words

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.

Claim 3

Dependent Claim 77 words

A method according to claim 1, wherein the counting step includes: counting the number of packets which arrived within a period of time α i ·T by incrementing when a packet arrives and decrementing when said period of time α i ·T has elapsed after the arrival of the packet; and comparing the counted value with the number α i ·(1+β i )·N for an i-th time period and providing a signal indicating a comparison result thereof.

Claim 4

Dependent Claim 244 words

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; and a transmission control section for controlling subsequent arrival packets based on the evaluation at the judgement section.

Claim 5

Dependent Claim 244 words

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; and a transmission control section for controlling subsequent arrival packets based on the evaluation at the judgement section.

Claim 6

Dependent Claim 93 words

An apparatus according to claim 3 in which each packet counter includes: a counter for counting the number of packets which arrived within a period of time α i ·T by incrementing in the case where a packet arrives and decrementing in the case where said period of time α i ·T has elapsed after the packet has arrived; and a comparison section for comparing the value counted at the counter with the value α i ·(1+β i )·N for an i-th time period and providing a signal indicating a comparison result thereof.

Claim 7

Dependent Claim 35 words

An apparatus according to claim 3 in which the transmission control section transmits packets determined in the judgement section as violating the traffic characteristic, with an identification tag to prioritize rejection of the tagged packets.

Annuity Stage	Window Opens	Payment Deadline	Surcharge Period Until	Estimated Fee	Status
3.5 Years (Year 4)	1997-02-07	1997-08-09	1998-02-08	$2000.00	Window Closed / Lapsed
7.5 Years (Year 8)	2001-02-07	2001-08-09	2002-02-08	$3760.00	Window Closed / Lapsed
11.5 Years (Year 12)	2005-02-07	2005-08-09	2006-02-08	$7700.00	Window Closed / Lapsed

Traffic supervisory method and traffic supervisory apparatus

Abstract

Inventors

Bibliographic Details

Claims Analysis

References Cited (Backward Citations)

USPTO Annuity & Maintenance Windows

Assigned Categories & Tags

Assign Category Tag