Claims Analysis
Total Claims: 18
Claim 1
Independent Claim
292 words
A method of transmitting data packets in time slots on a communications network having first and second unidirectional buses which are respectively directed in downstream and upstream directions and a succession of access units coupled between the buses, said method including the steps of: forming a distributed queue of such data packets by establishing in each access unit a queue of the data packets therein which are to be transmitted on the first unidirectional bus; transmitting a request flag on the second unidirectional bus by each access unit for each data packet in the queue; keeping count in each access unit of the number of request flags passing such access unit on the second unidirectional bus; and transmitting a data packet at the head of the queue in an access unit when a predetermined number of empty time slots has passed said access unit on the first bus; characterized in that: at the time a further data packet which had been received in an access unit and added to the queue therein reaches a selected position in the queue, at which position there are a predetermined number of other data packets between said further data packet and the head of the queue, a request flag is transmitted on the second bus by said access unit; and said further data packet is transmitted by said access unit in the first empty time slot after passage of a predetermined number of empty time slots past said access unit on the first bus, said predetermined number of empty time slots being equal to the total number of data packets in the distributed queue for which request flags had already been transmitted at the time said further data packet reaches said selected position in said queue.
Claim 2
Independent Claim
292 words
A method of transmitting data packets in time slots on a communications network having first and second unidirectional buses which are respectively directed in downstream and upstream directions and a succession of access units coupled between the buses, said method including the steps of: forming a distributed queue of such data packets by establishing in each access unit a queue of the data packets therein which are to be transmitted on the first unidirectional bus; transmitting a request flag on the second unidirectional bus by each access unit for each data packet in the queue; keeping count in each access unit of the number of request flags passing such access unit on the second unidirectional bus; and transmitting a data packet at the head of the queue in an access unit when a predetermined number of empty time slots has passed said access unit on the first bus; characterized in that: at the time a further data packet which had been received in an access unit and added to the queue therein reaches a selected position in the queue, at which position there are a predetermined number of other data packets between said further data packet and the head of the queue, a request flag is transmitted on the second bus by said access unit; and said further data packet is transmitted by said access unit in the first empty time slot after passage of a predetermined number of empty time slots past said access unit on the first bus, said predetermined number of empty time slots being equal to the total number of data packets in the distributed queue for which request flags had already been transmitted at the time said further data packet reaches said selected position in said queue.
Claim 3
Dependent Claim
149 words
A method of transmitting data packets in time slots on a communications network according to claim 1, wherein the total number of data packets in the distributed queue for which request flags had already been transmitted at the time said further data packet reaches said selected position in said queue is determined by adding to the further data packet, at the time it arrives at said selected position, a priority value equal to the number of request flags counted by said access unit since arrival of the last data packet preceding said further data packet at said selected position in said queue, the sum of the priority values added to the data packets in the queue within any given access unit being equal to the total number of data packets for which request flags have been transmitted by other access units which are downstream of said given access unit.
Claim 4
Dependent Claim
82 words
A method of transmitting data packets in time slots on a communications network according to claim 1, wherein after the arrival of a data packet at said selected position in said queue, such data packet is transmitted on the first bus by the respective access unit in the first empty time slot following passage of a number of empty time slots past such access unit equal to the sum of the priority values of all data packets prior to said data packet.
Claim 5
Dependent Claim
71 words
A method of transmitting data packets in time slots on a communications network according to claim 1, wherein the total number of data packets in the distributed queue for which request flags had already been transmitted by other access units at the time said further data packet reaches said selected position in the queue in its access unit is arbitrarily selectable independent of said selected positions in such other access units.
Claim 6
Dependent Claim
44 words
A method of transmitting data packets in time slots on a communications network according to claim 1, wherein in each access unit said selected position is chosen in relation to a traffic density of the data packets to be transmitted by such access unit.
Claim 7
Dependent Claim
60 words
A method of transmitting data packets in time slots on a communications network according to claim 1, wherein the request flags are transmitted in the form of request bits and the rate at which said request bits are transmitted on the second bus is at least as high as the maximum transmission rate of time slots on the first bus.
Claim 8
Dependent Claim
88 words
A method of transmitting data packets in time slots on a communications network according to claim 1, wherein the request flags are transmitted on the second bus by means of request bit-strings, the value of which representing a number of request flags, which bit-strings are successively received by each upstream access unit along the second bus and either retransmitted unaltered if the receiving access unit has no request flag to transmit or retransmitted after incrementation by one if the receiving access unit has a request flag to transmit.
Claim 9
Independent Claim
49 words
A method of transmitting data packets in time slots on a communications network according to claim represented by a request bit-string at the time it is received by an access unit having a data packet ready for transmission is added to such data packet as said priority value thereof.
Claim 10
Dependent Claim
82 words
A method of transmitting data packets in time slots on a communications network according to claim 2, wherein after the arrival of a data packet at said selected position in said queue, such data packet is transmitted on the first bus by the respective access unit in the first empty time slot following passage of a number of empty time slots past such access unit equal to the sum of the priority values of all data packets prior to said data packet.
Claim 11
Dependent Claim
71 words
A method of transmitting data packets in time slots on a communications network according to claim 9, wherein the total number of data packets in the distributed queue for which request flags had already been transmitted by other access units at the time said further data packet reaches said selected position in the queue in its access unit is arbitrarily selectable independent of said selected positions in such other access units.
Claim 12
Dependent Claim
44 words
A method of transmitting data packets in time slots on a communications network according to claim 10, wherein in each access unit said selected position is chosen in relation to a traffic density of the data packets to be transmitted by such access unit.
Claim 13
Dependent Claim
60 words
A method of transmitting data packets in time slots on a communications network according to claim 11, wherein the request flags are transmitted in the form of request bits and the rate at which said request bits are transmitted on the second bus is at least as high as the maximum transmission rate of time slots on the first bus.
Claim 14
Dependent Claim
88 words
A method of transmitting data packets in time slots on a communications network according to claim 10, wherein the request flags are transmitted on the second bus by means of request bit-strings, the value of which representing a number of request flags, which bit-strings are successively received by each upstream access unit along the second bus and either retransmitted unaltered if the receiving access unit has no request flag to transmit or retransmitted after incrementation by one if the receiving access unit has a request flag to transmit.
Claim 15
Dependent Claim
53 words
A method of transmitting data packets in time slots on a communications network according to claim 13, wherein the value represented by a request bit-string at the time it is received by an access unit having a data packet ready for transmission is added to such data packet as said priority value thereof.
Claim 16
Independent Claim
313 words
A system for transmitting data packets in time slots on a communications network having first and second unidirectional buses which are respectively directed in upstream and downstream directions, and a succession of access units coupled between the busses; each access unit comprising: a request flag counter connected to become incremented by request flags passing on the second bus; a countdown counter connected to become decremented from an initially loaded value to a predetermined end value by successive empty time slots passing on the first bus; a queue buffer for storing data packets received by said access unit and which are to be transmitted on the first bus; and a logic interface adapted to (i) transmit a request flag for each data packet in the queue buffer, (ii) initiate transmission of the data packet at the head of the queue after the countdown counter reaches said predetermined end value, and (iii) reload said countdown counter on the basis of a value accumulated in the request flag counter; characterized in that in each access unit: the queue buffer is adapted to store in combination with each data packet therein a priority value which is shifted with the data packet through the queue buffer; and said logic interface is adapted to (iv) transmit a request flag on the second bus at the time a further data packet in the said buffer reaches a selected stage therein a predetermined number of stages prior to the head of said buffer, (v) store with said further data packet in said buffer a priority value corresponding to the accumulated value in said request counter when said further data packet reaches said selected stage of said buffer, and reset said request counter; and (vi) reload said countdown counter with the priority value of said further data packet in said buffer when said further data packet reaches the head of said buffer.
Claim 17
Independent Claim
313 words
A system for transmitting data packets in time slots on a communications network having first and second unidirectional buses which are respectively directed in upstream and downstream directions, and a succession of access units coupled between the busses; each access unit comprising: a request flag counter connected to become incremented by request flags passing on the second bus; a countdown counter connected to become decremented from an initially loaded value to a predetermined end value by successive empty time slots passing on the first bus; a queue buffer for storing data packets received by said access unit and which are to be transmitted on the first bus; and a logic interface adapted to (i) transmit a request flag for each data packet in the queue buffer, (ii) initiate transmission of the data packet at the head of the queue after the countdown counter reaches said predetermined end value, and (iii) reload said countdown counter on the basis of a value accumulated in the request flag counter; characterized in that in each access unit: the queue buffer is adapted to store in combination with each data packet therein a priority value which is shifted with the data packet through the queue buffer; and said logic interface is adapted to (iv) transmit a request flag on the second bus at the time a further data packet in the said buffer reaches a selected stage therein a predetermined number of stages prior to the head of said buffer, (v) store with said further data packet in said buffer a priority value corresponding to the accumulated value in said request counter when said further data packet reaches said selected stage of said buffer, and reset said request counter; and (vi) reload said countdown counter with the priority value of said further data packet in said buffer when said further data packet reaches the head of said buffer.
Claim 18
Dependent Claim
39 words
A system according to claim 15, further comprising means for selecting, under the control of a control signal, any of the stages of said buffer prior to the head stage thereof to be said selected stage of said buffer.