Claims Analysis
Total Claims: 28
Claim 1
Independent Claim
163 words
A system for processing data, comprising: circuitry for receiving a request from a network user to allow a potential event to occur; circuitry for generating timing signal pulses: circuitry responsive to said generating circuitry for incrementing a reference level for use in determining whether to allow said potential event to occur; circuitry responsive to said receiving circuitry for retrieving event rate information associated with said network user from a memory circuit; circuitry responsive to said incrementing circuitry and said retrieving circuitry for determining if previous events have been allowed at such a rate for the user that there is an available backlog to allow said potential event to occur; and circuitry responsive to said incrementing circuitry and said retrieving circuitry for selectively updating said event rate information for said network user using the reference level and said event rate information retrieved from said memory circuit such that the rate at which events occur for a particular user does not exceed a predetermined rate.
Claim 2
Independent Claim
163 words
A system for processing data, comprising: circuitry for receiving a request from a network user to allow a potential event to occur; circuitry for generating timing signal pulses: circuitry responsive to said generating circuitry for incrementing a reference level for use in determining whether to allow said potential event to occur; circuitry responsive to said receiving circuitry for retrieving event rate information associated with said network user from a memory circuit; circuitry responsive to said incrementing circuitry and said retrieving circuitry for determining if previous events have been allowed at such a rate for the user that there is an available backlog to allow said potential event to occur; and circuitry responsive to said incrementing circuitry and said retrieving circuitry for selectively updating said event rate information for said network user using the reference level and said event rate information retrieved from said memory circuit such that the rate at which events occur for a particular user does not exceed a predetermined rate.
Claim 3
Dependent Claim
63 words
The system of claim 1, wherein said retrieving circuitry comprises: a random access memory operable to store an event count, a maximum backlog amount, and an event rate for the selected user; and a plurality of registers responsive to said random access memory for providing said event count, said maximum backlog and said event rate to said updating circuitry and said determining circuitry.
Claim 4
Dependent Claim
57 words
The system of claim 1, wherein said generating circuitry and said incrementing circuitry comprise: a clock; a plurality of counters responsive to said clock for scaling down the frequency of said clock; and a register responsive to said counters for storing a reference level such that said reference level increments at a frequency slower than said clock.
Claim 5
Dependent Claim
67 words
The system of claim 1, wherein said determining circuitry comprises: a subtractor for determining said available backlog by subtracting an event count for said network user from said reference level; and a comparator responsive to said subtractor and a constant low logic level for comparing said available backlog with zero such that a flag is set to allow said potential event if the available backlog exceeds zero.
Claim 6
Dependent Claim
43 words
The system of claim 1, wherein said determining circuitry further comprises an open collector output to indicate whether to allow the potential event such that the rate at which events occur for a particular user may be simultaneously maintained below multiple predetermined rates.
Claim 7
Dependent Claim
97 words
The system of Claim 1, wherein said updating circuitry comprises: first function generating circuitry responsive to said reference level generating circuitry and said retrieving circuitry for generating the function ##EQU11## second function generating circuitry responsive to said reference level generating circuitry for generating the function R.sub.t if R.sub.t -F.sub.i,t ≦0 and third function generating circuitry responsive to said retrieving circuitry for generating the function ##EQU12## wherein R t +1, and R t are reference levels, D i /E i is a maximum backlog, 1/E i is an event rate, and F i ,t is an event count.
Claim 8
Independent Claim
169 words
A system for processing data in an asynchronous transfer mode network, comprising: circuitry for receiving a request from a network user to allow a potential event to occur; circuitry for generating timing signal pulses; circuitry responsive to said generating circuitry for incrementing a reference level for use in determining whether to allow said potential event to occur; circuitry responsive to said receiving circuitry for retrieving event rate information associated with said network user from a memory circuit; circuitry responsive to said incrementing circuitry and said retrieving circuitry for determining if previous events have been allowed at such a rate for the user that there is an available backlog to allow said potential event to occur; and circuitry responsive to said incrementing circuitry and said retrieving circuitry for selectively updating said event rate information for said network user using the reference level and said event rate information retrieved from said memory circuit such that the rate at which events occur for a particular user does not exceed a predetermined rate.
Claim 9
Independent Claim
169 words
A system for processing data in an asynchronous transfer mode network, comprising: circuitry for receiving a request from a network user to allow a potential event to occur; circuitry for generating timing signal pulses; circuitry responsive to said generating circuitry for incrementing a reference level for use in determining whether to allow said potential event to occur; circuitry responsive to said receiving circuitry for retrieving event rate information associated with said network user from a memory circuit; circuitry responsive to said incrementing circuitry and said retrieving circuitry for determining if previous events have been allowed at such a rate for the user that there is an available backlog to allow said potential event to occur; and circuitry responsive to said incrementing circuitry and said retrieving circuitry for selectively updating said event rate information for said network user using the reference level and said event rate information retrieved from said memory circuit such that the rate at which events occur for a particular user does not exceed a predetermined rate.
Claim 10
Dependent Claim
63 words
The system of claim 7, wherein said retrieving circuitry comprises: a random access memory operable to store an event count, a maximum backlog amount, and an event rate for the selected user; and a plurality of registers responsive to said random access memory for providing said event count, said maximum backlog and said event rate to said updating circuitry and said determining circuitry.
Claim 11
Dependent Claim
57 words
The system of claim 7, wherein said generating circuitry and said incrementing circuitry comprises: a clock; a plurality of counters responsive to said clock for scaling down the frequency of said clock; and a register responsive to said counters for storing a reference level such that said reference level increments at a frequency slower than said clock.
Claim 12
Dependent Claim
74 words
The system of claim 7, wherein said determining circuitry comprises: a subtractor for determining said available backlog by subtracting an event count for said network user from said reference level; and a comparator responsive to said subtractor and a constant low logic level for comparing said available backlog with zero such that an open collector output is brought to a high logic level to allow said potential event if the available backlog exceeds zero.
Claim 13
Dependent Claim
43 words
The system of claim 7, wherein said determining circuitry further comprises an open collector output to indicate whether to allow the potential event such that the rate at which events occur for a particular user may be simultaneously maintained below multiple predetermined rates.
Claim 14
Dependent Claim
97 words
The system of claim 7, wherein said updating circuitry comprises: first function generating circuitry responsive to said reference level generating circuitry and said retrieving circuitry for generating the function ##EQU13## second function generating circuitry responsive to said reference level generating circuitry for generating the function R.sub.t if R.sub.t -F.sub.i,t ≦0; and third function generating circuitry responsive to said retrieving circuitry for generating the function ##EQU14## wherein R t +1, and R t are reference levels, D i /E i is a maximum backlog, 1/E i is an event rate, and F i ,t is an event count.
Claim 15
Independent Claim
134 words
A method for processing data, comprising the steps of: receiving a request from a network user to allow a potential event to occur; generating timing signal pulses; incrementing a reference level in response to the timing signal pulses for use in determining whether to allow the potential event to occur; retrieving event rate information associated with the network user from a memory circuit; determining if previous events have been allowed at such a rate for the network user that there is an available backlog to allow the potential event to occur; and selectively updating the event rate information for the network user using the reference level and the event rate information retrieved from the memory circuit such that the rate at which events occur for the network user does not exceed a predetermined rate.
Claim 16
Independent Claim
134 words
A method for processing data, comprising the steps of: receiving a request from a network user to allow a potential event to occur; generating timing signal pulses; incrementing a reference level in response to the timing signal pulses for use in determining whether to allow the potential event to occur; retrieving event rate information associated with the network user from a memory circuit; determining if previous events have been allowed at such a rate for the network user that there is an available backlog to allow the potential event to occur; and selectively updating the event rate information for the network user using the reference level and the event rate information retrieved from the memory circuit such that the rate at which events occur for the network user does not exceed a predetermined rate.
Claim 17
Dependent Claim
54 words
The method of claim 13, wherein said step of retrieving event rate information comprises the steps of: receiving an address for a memory location containing the event rate information for the network user; and retrieving an event count, a maximum backlog amount, and an event rate for the user from a random access memory.
Claim 18
Dependent Claim
70 words
The method of claim 13, wherein said steps of generating timing signal pulses and incrementing a reference level comprise the steps of: generating a timing signal having a predetermined frequency using a clock; scaling down the frequency of the clock using a plurality of counters; and storing a reference level in a register coupled to the counters such that the reference level increments at a frequency slower than the clock.
Claim 19
Dependent Claim
61 words
The method of claim 13, wherein said step of determining whether to allow the potential event comprises the steps of: determining the available backlog for a particular user by subtracting the reference level from an event count for the network user; comparing the available backlog with zero; and setting a flag to allow the event if the available backlog exceeds zero.
Claim 20
Dependent Claim
44 words
The method of claim 13, and further comprising the step of generating an open collector output to indicate whether to allow the potential event such that the rate at which events occur for a particular user may be simultaneously maintained below multiple predetermined rates.
Claim 21
Dependent Claim
64 words
The method of claim 13, wherein said step of selectively updating comprises the steps of: generating the function ##EQU15## generating the function R.sub.t if R.sub.t -F.sub.i,t ≦0; and generating the function ##EQU16## wherein R t +1, and R t are reference levels, D i /E i is a maximum backlog, 1/E i is an event rate, and F i ,t is an event count.
Claim 22
Independent Claim
157 words
A method for processing data in an asynchronous transfer mode network, comprising the steps of: receiving a request from a network user to allow a potential event to occur; generating timing signal pulses; incrementing a reference level in response to the timing signal pulses for use in determining whether to allow the potential event to occur; storing the reference level in a register; retrieving event rate information associated with the network user from a memory circuit; storing the event rate information in a plurality of registers; determining if previous events have been allowed at such a rate for the network user that there is an available backlog to allow the potential event to occur; and selectively updating the event rate information for the selected user using the reference level and the event rate information retrieved from the memory circuit such that the rate at which events occur for the network user does not exceed a predetermined rate.
Claim 23
Independent Claim
157 words
A method for processing data in an asynchronous transfer mode network, comprising the steps of: receiving a request from a network user to allow a potential event to occur; generating timing signal pulses; incrementing a reference level in response to the timing signal pulses for use in determining whether to allow the potential event to occur; storing the reference level in a register; retrieving event rate information associated with the network user from a memory circuit; storing the event rate information in a plurality of registers; determining if previous events have been allowed at such a rate for the network user that there is an available backlog to allow the potential event to occur; and selectively updating the event rate information for the selected user using the reference level and the event rate information retrieved from the memory circuit such that the rate at which events occur for the network user does not exceed a predetermined rate.
Claim 24
Dependent Claim
54 words
The method of claim 19, wherein said step of retrieving event rate information comprises the steps of: receiving an address for a memory location containing the event rate information for the network user; and retrieving an event count, a maximum backlog amount, and an event rate for the user from a random access memory.
Claim 25
Dependent Claim
58 words
The method of claim 19, wherein said step of generating timing signal pulses and incrementing a reference level comprise the steps of: generating a timing signal having a predetermined frequency using a clock; scaling down the frequency of the clock using a plurality of counters such that the reference level increments at a frequency slower than the clock.
Claim 26
Dependent Claim
68 words
The method of claim 19, wherein said step of determining whether to allow the potential event comprises the steps of: determining the available backlog for a particular user by subtracting the reference level from an event count for the network user; comparing the available backlog with zero; and bringing an open collector output to a high logic level to allow the event if the available backlog exceeds zero.
Claim 27
Dependent Claim
44 words
The method of claim 19, and further comprising the step of generating an open collector output to indicate whether to allow the potential event such that the rate at which events occur for a particular user may be simultaneously maintained below multiple predetermined rates.
Claim 28
Dependent Claim
64 words
The method of claim 19, wherein said step of selectively updating comprises the steps of: generating the function ##EQU17## generating the function R.sub.t if R.sub.t -F.sub.i,t ≦0; and generating the function ##EQU18## wherein R t +1, and R t are reference levels, D i /E i is a maximum backlog, 1/E i is an event rate, and F i ,t is an event count.