Patent US5361252A successfully refreshed from Google Patents.
← Back to Patent Explorer
US5361252A Expired / Lapsed US ⏱️ 0.0 years remaining

Method and a device for monitoring channel split data packet transmission

Assignee: Telefonaktiebolaget LM Ericsson AB
•
Filing: 1993-03-12
•
Granted: 1994-11-01
•
Expires: 2013-03-12
📄 Original PDF 🌐 Google Patents 🔄 Sync Now

Abstract

Abstract The transfer of data packets are monitored in a line having various logical channels. For each logical channel there is a count value and at the arrival of a data packet, or in each time slot when the transmission on said line is time multiplexed, i.e., for each time when a packet could have arrived in a time multiplexed system, only the count value for a single channel is decremented. Then it is determined whether the received data packet, if there is one, is to be forwarded or is to be discarded by the comparison of a calculated value (Fn) to a threshold value (Tn) belonging to the channel to which the packet belongs. In the calculation of the value (Fn), the number is used of those channels which have not been decremented after decrementing the channel to which the received packet belongs. In this way, the calculated value (Fn) can be made to resemble the calculated value or level value, which is used in prior methods for handling loss of packets in a network. For each received packet this method requires only a decrementing of one count value, implying a significant saving of time and a simplification of the circuits used for carrying out the method.

Inventors

  • 👤 Hans K. M. Sallberg
  • 👤 Leif M. Larsson

Bibliographic Details

Application Number —
Jurisdiction US
Data Source google_patents
Last Synchronized 2026-10-29 21:44
CPC Classifications
H; H04; H04L; H04L12/00; H04L12/54; H04L12/56; H04L12/5601; H04L12/5602; H04Q; H04Q11/00; H04Q11/04; H04Q11/0428; H04Q11/0478; H04L2012/5629; H04L2012/5631; H04L2012/5636; H04L2012/5637

Claims Analysis

Total Claims: 36
Claim 1
Independent Claim 260 words
In a packet data communication system comprising a transmission line on which data packets are transmitted on a plurality of channels, wherein each channel respectively has a predetermined maximal packet transmission frequency, a first value, and a second value, a method of controlling transmission such that data packets are not transmitted with a frequency exceeding a channel's predetermined maximal packet transmission frequency comprising the steps of: changing the first value of a next one of the channels by a first step, wherein the first values are changed at each of successive first time intervals and in a cyclic order; for each data packet arriving on the transmission line, determining a channel number of an arriving channel carrying the arriving data packet; determining, for each arriving channel, a third value based on the arriving channel's first value and on the value of one of: (a) a total number of data packets that have arrived on the transmission line since the first value of the arriving channel was last changed, and (b) when successive data packets arrive during successive second time intervals, a total number of second time intervals elapsed since the first value of the arriving channel was last changed, wherein the third values of different arriving channels are based on the same one of (a) and (b); respectively comparing each third value to each arriving channel's second value and, based on the comparison, performing one of the steps of: permitting transmission of the respective arriving data packet, discarding the respective arriving data packet, and marking the respective arriving data packet.
Claim 2
Dependent Claim 260 words
In a packet data communication system comprising a transmission line on which data packets are transmitted on a plurality of channels, wherein each channel respectively has a predetermined maximal packet transmission frequency, a first value, and a second value, a method of controlling transmission such that data packets are not transmitted with a frequency exceeding a channel's predetermined maximal packet transmission frequency comprising the steps of: changing the first value of a next one of the channels by a first step, wherein the first values are changed at each of successive first time intervals and in a cyclic order; for each data packet arriving on the transmission line, determining a channel number of an arriving channel carrying the arriving data packet; determining, for each arriving channel, a third value based on the arriving channel's first value and on the value of one of: (a) a total number of data packets that have arrived on the transmission line since the first value of the arriving channel was last changed, and (b) when successive data packets arrive during successive second time intervals, a total number of second time intervals elapsed since the first value of the arriving channel was last changed, wherein the third values of different arriving channels are based on the same one of (a) and (b); respectively comparing each third value to each arriving channel's second value and, based on the comparison, performing one of the steps of: permitting transmission of the respective arriving data packet, discarding the respective arriving data packet, and marking the respective arriving data packet.
Claim 3
Dependent Claim 25 words
The method of claim 1, wherein the first time intervals are such that the first values are changed upon the arrivals of the data packets.
Claim 4
Dependent Claim 17 words
The method of claim 1, wherein the first time intervals and the second time intervals are equal.
Claim 5
Dependent Claim 37 words
The method of claim 1, wherein the third value of an arriving channel is a change of the first value of the arriving channel having a sign that is different from a sign of the first step.
Claim 6
Dependent Claim 13 words
The method of claim 1, wherein each channel has a respective first step.
Claim 7
Dependent Claim 36 words
The method of claim 1, wherein only one first value is changed at each first time interval and the first step is based on a product of the total number of channels and a fourth value.
Claim 8
Dependent Claim 13 words
The method of claim 6, wherein each channel has a respective fourth value.
Claim 9
Dependent Claim 31 words
The method of claim 1, wherein, when a changed first value has a sign that is different from its sign before being changed, the changed first value is changed to zero.
Claim 10
Dependent Claim 19 words
The method of claim 1, wherein the determination of the third value is also based on a fourth value.
Claim 11
Dependent Claim 13 words
The method of claim 9, wherein each channel has a respective fourth value.
Claim 12
Dependent Claim 115 words
The method of claim 1, wherein the third value is one of a sum of and a difference of the first value of the arriving channel and a value derived from a predetermined function of one of (a) the total number of data packets that have arrived on the transmission line since the first value of the arriving channel was last changed and, (b) when successive data packets arrive during successive second time intervals, the total number of second time intervals elapsed since the first value of the arriving channel was last changed; and the value derived from the predetermined function for different arriving channels is based on the same one of (a) and (b).
Claim 13
Dependent Claim 101 words
The method of claim 11, wherein the value derived from the predetermined function is a product of a fourth value and one of (a) the total number of data packets that have arrived on the transmission line since the first value of the arriving channel was last changed and, (b) when successive data packets arrive during successive second time intervals, the total number of second time intervals elapsed since the first value of the arriving channel was last changed; and the value derived from the predetermined function for different arriving channels is based on the same one of (a) and (b).
Claim 14
Dependent Claim 13 words
The method of claim 12, wherein each channel has a respective fourth value.
Claim 15
Dependent Claim 29 words
The method of claim 1, wherein the first value of an arriving channel is changed by a second step when transmission of the respective arriving data packet is permitted.
Claim 16
Dependent Claim 13 words
The method of claim 14, wherein each channel has a respective second step.
Claim 17
Dependent Claim 16 words
The method of claim 14, wherein the first step and the second step have different signs.
Claim 18
Dependent Claim 45 words
The method of claim 1, wherein, when a third value has a sign that is different from a sign of the respective arriving channel's first value, that first value is changed such that a third value determined based on the changed first value is zero.
Claim 19
Dependent Claim 47 words
The method of claim 1, wherein, when the channels are organized in groups, the first values of the channels in a next one of the groups are changed by the first step at each of successive first time intervals, the groups being changed in a cyclic order.
Claim 20
Independent Claim 264 words
A device for controlling transmission of data packets on a transmission line having a plurality of channels such that data packets are not transmitted with a frequency greater than each channel's respective maximal packet transmission frequency, wherein each channel has a respective channel number, comprising: means for storing a first value and a second value for each channel; means for changing the first value of a channel by a first step, the first values of successive next ones of the channels being changed during successive first time intervals and in a cyclic order; means for determining, for each data packet arriving on the transmission line, a channel number of an arriving channel carrying the arriving data packet and for determining, for each arriving channel, a third value based on the respective arriving channel's first value and on the value of one of: (a) a total number of data packets that have arrived on the transmission line since the first value of the arriving channel was last changed, and (b) when successive data packets arrive during successive second time intervals, a total number of second time intervals elapsed since the first value of the arriving channel was last changed, wherein the third values of different arriving channels are based on the same one of (a) and (b); a comparator for comparing a third value to the respective arriving channel's second value; and means, based on the comparison, for performing one of the functions of permitting transmission of the respective arriving data packet discarding the respective arriving data packet, and marking the respective arriving data packet.
Claim 21
Independent Claim 264 words
A device for controlling transmission of data packets on a transmission line having a plurality of channels such that data packets are not transmitted with a frequency greater than each channel's respective maximal packet transmission frequency, wherein each channel has a respective channel number, comprising: means for storing a first value and a second value for each channel; means for changing the first value of a channel by a first step, the first values of successive next ones of the channels being changed during successive first time intervals and in a cyclic order; means for determining, for each data packet arriving on the transmission line, a channel number of an arriving channel carrying the arriving data packet and for determining, for each arriving channel, a third value based on the respective arriving channel's first value and on the value of one of: (a) a total number of data packets that have arrived on the transmission line since the first value of the arriving channel was last changed, and (b) when successive data packets arrive during successive second time intervals, a total number of second time intervals elapsed since the first value of the arriving channel was last changed, wherein the third values of different arriving channels are based on the same one of (a) and (b); a comparator for comparing a third value to the respective arriving channel's second value; and means, based on the comparison, for performing one of the functions of permitting transmission of the respective arriving data packet discarding the respective arriving data packet, and marking the respective arriving data packet.
Claim 22
Dependent Claim 18 words
The device of claim 19, wherein the first values are changed upon the arrivals of the data packets.
Claim 23
Dependent Claim 17 words
The device of claim 19, wherein the first time intervals and the second time intervals are equal.
Claim 24
Dependent Claim 38 words
The device of claim 19, wherein the third value of an arriving channel is is a change of the first value of the arriving channel having a sign that is different from a sign of the first step.
Claim 25
Dependent Claim 18 words
The device of claim 19, wherein the storing means also stores a respective first step for each channel.
Claim 26
Dependent Claim 49 words
The device of claim 19, wherein the storing means stores a fourth value for each channel and the changing means changes only one first value at each first time interval and the first step is based on a product of the total number of channels and the fourth value.
Claim 27
Dependent Claim 33 words
The device of claim 19, wherein when a changed first value has a sign that is different from its sign before being changed, the changing means changes the changed first value to zero.
Claim 28
Dependent Claim 33 words
The device of claim 19, wherein the storing means also stores a fourth value for each channel and the determining means determines the third value also on the basis of the fourth value.
Claim 29
Dependent Claim 115 words
The device of claim 19, wherein the determining means determines one of a sum of and a difference of a first value of the arriving channel and a value derived from a predetermined function of one of (a) the total number of data packets that have arrived on the transmission line since the first value of the arriving channel was last changed and, (b) when successive data packets arrive during successive second time intervals, the total number of second time intervals elapsed since the first value of the arriving channel was last changed; and the value derived from the predetermined function for different arriving channels is based on the same one of (a) and (b).
Claim 30
Dependent Claim 116 words
The device of claim 27, wherein the storing means also stores respective fourth values for the channels and the value derived from the predetermined function is a product of the respective fourth value and one of (a) the total number of data packets that have arrived on the transmission line since the respective first value of the arriving channel was last changed and, (b) when successive data packets arrive during successive second time intervals, the total number of second time intervals elapsed since the respective first value of the arriving channel was last changed; and the value derived from the predetermined function for different arriving channels is based on the same one of (a) and (b).
Claim 31
Dependent Claim 29 words
The device of claim 19, wherein the first value of an arriving channel is changed by a second step when transmission of the respective arriving data packet is permitted.
Claim 32
Dependent Claim 16 words
The device of claim 29, wherein the first step and the second step have different signs.
Claim 33
Dependent Claim 47 words
The device of claim 19, wherein the changing means, when a third value has a sign that is different from a sign of the respective arriving channel's first value, changes that first value such that a third value determined based on the changed first value is zero.
Claim 34
Dependent Claim 43 words
The device of claim 19, wherein, when the channels are organized in groups, the changing means changes the first values of the channels in successive next ones of the groups during successive first time intervals, the groups being changed in a cyclic order.
Claim 35
Independent Claim 167 words
A method of controlling data packet transmission on a transmission line comprising the steps of: providing a plurality of channels, each channel having a maximal packet transmission frequency, a channel number, a count value, and a threshold value; changing the count value of each of the channels in succession, one count value being changed during each successive first time interval; determining, for each data packet arriving on the transmission line, the channel number of an arriving channel which is carrying the arriving data packet; generating, for each arriving channel, a frequency value based on the arriving channel's count value and channel number and on the channel number corresponding to the count value most recently changed in the changing step; and comparing, for each arriving channel, the frequency value with the respective arriving channel's threshold value and, based on the comparison, performing one of the steps of: permitting transmission of the respective arriving data packet; discarding the respective arriving data packet; and marking the respective arriving data packet.
Claim 36
Independent Claim 167 words
A method of controlling data packet transmission on a transmission line comprising the steps of: providing a plurality of channels, each channel having a maximal packet transmission frequency, a channel number, a count value, and a threshold value; changing the count value of each of the channels in succession, one count value being changed during each successive first time interval; determining, for each data packet arriving on the transmission line, the channel number of an arriving channel which is carrying the arriving data packet; generating, for each arriving channel, a frequency value based on the arriving channel's count value and channel number and on the channel number corresponding to the count value most recently changed in the changing step; and comparing, for each arriving channel, the frequency value with the respective arriving channel's threshold value and, based on the comparison, performing one of the steps of: permitting transmission of the respective arriving data packet; discarding the respective arriving data packet; and marking the respective arriving data packet.

USPTO Annuity & Maintenance Windows

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

Assigned Categories & Tags

No categories assigned to this patent yet.

Assign Category Tag