Intelligence transmission system of the local area network type

Claim 2

An intelligence transmission system of the closed-loop type, in which a number of stations one of which acts as a Master Station are connected to the loop, in which the system handles both circuit-switched and packet-switched calls, in which in each TDM cycle a group of adjacent time slots is used as a framing group which occurs once per cycle of the system, which framing group includes a multi-bit group number (GN) portion which identifies a said slot or group of slots, in which on system start-up the value of the GN in the framing group is initially set to zero by the Master Station whereafter the value of the GN is incremented by the Master Station by unity on each system cycle, in which when the value of GN reaches the maximum number of slots available for circuit-switched connections, that value is reset to zero, whereafter the sequence recommences, in which only after the value of GN has reached its maximum for the first time a packet-switching token is emitted from the Master Station to incidate to the other stations on the loop that packet-switched connections can be handled, whereafter the Master Station repeats the token each time the Master Station receives the token and in which the maximum value of GN attained during a said sequence, as read by a said station on the loop indicates to that station how many times slots are currently available for circuit-switched connections.

Claim 3

An intelligence transmission system of the closed-loop type, in which a number of stations one of which acts as a Master Station are connected to the loop, in which the system handles both circuit-switched and packet-switched calls, in which in each TDM cycle of the system the time slots are grouped in groups each of n adjacent time slots, and one of said groups of adjacent time slots is used as a framing group which occurs once per cycle of the system, in which the framing group includes a multi-bit group number (GN) portion which identifies a particular one of said groups of slots, in which on system start-up the value of the GN in the framing group is initially set to zero by the Master Station whereafter the value of the GN is incremented by the Master Station by unity on each system cycle, in which when the value of GN reaches the maximum number of slot groups available for circuit-switched connections, that value is reset to zero, whereafter the sequence recommences in which only after the value of GN has reached its maximum for the first time a packet-switching token is emitted from the Master Station to indicate to the other stations on the loop that packet-switched connections can be handled, whereafter the Master Station repeats the token each time the Master Station receives the token, and in which the maximum value of GN attained during a said sequence, as read by a said station on the loop indicates to that station how many time slot groups are currently available for circuit-switched connections.

Claim 4

An intelligence transmission system of the closed-loop type, in which a number of stations one of which acts as a Master Station are connected to the loop, in which the system handles both circuit-switched and packet-switched calls, in which in each TDM cycle of the system the time slots are grouped in groups each of n adjacent time slots, and one of said groups of adjacent time slots is used as a framing group which occurs once per cycle of the system, in which the framing group includes a multi-bit group number (GN) portion which identifies a particular one of said groups of slots, in which on system start-up the value of the GN in the framing group is initially set to zero by the Master Station whereafter the value of the GN is incremented by the Master Station by unity on each system cycle, in which when the value of GN reaches the maximum number of slot groups available for circuit-switched connections, that value is reset to zero, whereafter the sequence recommences in which only after the value of GN has reached its maximum for the first time a packet-switching token is emitted from the Master Station to indicate to the other stations on the loop that packet-switched connections can be handled, whereafter the Master Station repeats the token each time the Master Station receives the token, and in which the maximum value of GN attained during a said sequence, as read by a said station on the loop indicates to that station how many time slot groups are currently available for circuit-switched connections.

Claim 5

A system as claimed in claim 2, in which the Master Station monitors the proportion of the slots in use for both types of connections to assess whether the number of slots provided for circuit-switched connections is under- or over-provided, and in which if the number is incorrect the Master Station makes an appropriate adjustment to the value of GN during a subsequent said sequence.

Claim 6

A system as claimed in claim 3, and in which if the number of groups of slots in use for circuit-switched connections is excessive and the value of GN is reduced, any calls using slots being transferred from circuit-switched use to packet-switched use are transferred to other slots allocated to circuit-switched use.

Claim 7

A system as claimed in claim 2, in which when a said token reaches a station with packet data to send that token is removed from the loop, the packet data is transmitted, and the token reinserted into the loop at the end of the packet data, and in which one packet message can extend from the frame wherein it started into the packet-allocated slots in a later frame.

Claim 8

A system as claimed in claim 2, in which when a circuit switched connection is to be set up the calling station monitors the bit stream on the loop in search of a free time slot allocated to circuit switched connections, in which when such a free slot is found it is marked as busy and a message indicating the identity of the newly-seized time slot is sent over the loop to the wanted station in packet-switching manner, and in which when a wanted station receives such a message it sets itself to respond to the slot identified by that message.

Claim 9

A system as claimed in claim 6, in which when a connection using circuit switching needs more bandwidth than is available from one slot, two or more slots allocated to circuit switching are seized for use.

Claim 10

A system as claimed in claim 6 in which to provide a broadcast capability a single station writes data into a circuit slot and other stations read data therefrom without writing into that slot.

Claim 11

A system as claimed in claim 7 in which in each group of slots allocated to circuit switched connections there is a slot identifier field which indicates which slots of a group are free, and in which the selection of a free slot involves the calling station checking the slot identifier fields to select a slot group with at least one free slot, followed by the selection of a free slot from within the selected group.

Claim 12

A system as claimed in claim 6, in which a priority mechanism is provided by which each station is allocated one of a plurality of priority levels, in which the Master Station includes in the framing group a priority level indicator PI, and in which said station whose PI is equal to or greater than that in the framing group has access to all circuit switching slots whereas stations of a lower priority only have access to the lower-numbered circuit-switched slots, and in which the value of the indicator PI in the framing group is adjusted in accordance with the traffic state of the system.

Claim 13

A system as claimed in claim 6, in which when a station to which a circuit switching slot is allocated concludes its use it notifies the other station or stations involved in that connection of the fact by sending a packet switched release message.