Claims Analysis
Total Claims: 26
Claim 1
Independent Claim
192 words
A method of asynchronously accessing a high-speed local area network having a ring-transmission line along which a plurality of nodes are arranged with each node being capable of signal regeneration, said method comprising the steps of: organizing information which is transmitted along said line into hybrid frames each having a circuit region in the form of a zone allotted to communications with information-continuity requirements and a packet region in the form of a zone allotted to communications which do not require continuity of information; effecting asynchronous access of the individual nodes for circuit and packet transmission along said line in sequence to said line in a given order and maintaining said order in both the circuit region and the packet region of each of said frames; and in the packet region of each frame, starting from an instant preceding by a predetermined time period the end of the frame, disabling the packet transmission of the node which has the right of transmission at that instant or of the nodes which would have the right of access from that instant to the end of the present frame, thereby avoiding overlapping between adjacent frames.
Claim 2
Independent Claim
192 words
A method of asynchronously accessing a high-speed local area network having a ring-transmission line along which a plurality of nodes are arranged with each node being capable of signal regeneration, said method comprising the steps of: organizing information which is transmitted along said line into hybrid frames each having a circuit region in the form of a zone allotted to communications with information-continuity requirements and a packet region in the form of a zone allotted to communications which do not require continuity of information; effecting asynchronous access of the individual nodes for circuit and packet transmission along said line in sequence to said line in a given order and maintaining said order in both the circuit region and the packet region of each of said frames; and in the packet region of each frame, starting from an instant preceding by a predetermined time period the end of the frame, disabling the packet transmission of the node which has the right of transmission at that instant or of the nodes which would have the right of access from that instant to the end of the present frame, thereby avoiding overlapping between adjacent frames.
Claim 3
Dependent Claim
37 words
The method defined in claim 1 wherein said predetermined time period is equal to the time (T p ) necessary for the information emitted by a node to return over said ring-transmission line to the emitting node.
Claim 4
Dependent Claim
35 words
The method defined in claim 1 wherein after transmission is disabled, in the circuit region of a new frame, said nodes resume accessing of said line in the same order as in the previous frame.
Claim 5
Dependent Claim
56 words
The method defined in claim 3 wherein said time (T p ) is counted only in a master node of said plurality of nodes, and said master node at each frame sends disabling signals to the other nodes after a time (Z-T p ) has expired from the beginning of the frame, Z being frame duration.
Claim 6
Dependent Claim
22 words
The method defined in claim 2 wherein the recognition of the disabling instant is managed individually and independently by the individual nodes.
Claim 7
Dependent Claim
48 words
The method defined in claim 2, further comprising the steps of communicating the value (T p ) of the predetermined time period to all of said nodes during an initialization phase, and periodically updating said value with a network control center operatively connected to one of said nodes.
Claim 8
Dependent Claim
52 words
The method defined in claim 2, further comprising the steps of communicating the value (T p ) of the predetermined time period to all of said nodes during an initialization phase by a network control center, and periodically updating said value with a master node forming one of said plurality of nodes.
Claim 9
Dependent Claim
56 words
The method defined in claim 1 wherein master node functions are assigned during each frame to the one of said nodes whose packet transmission has been interrupted in the previous frame upon expiration of the predetermined time, or by the first node having a right of access after said instant when no node was then transmitting.
Claim 10
Dependent Claim
51 words
The method defined in claim 1 wherein each of said nodes emits at the end of its circuit or packet information, or in place of such information, a signal of end-of-activity, and access right recognition is effected by counting said signal or a guard time indicating an isolated or faulty node.
Claim 11
Dependent Claim
41 words
The method defined in claim 1, further comprising the step of effecting recognition of the access right of each of said nodes to said transmission line in response to the presence of a token in each frame transmitted along said line.
Claim 12
Dependent Claim
29 words
The method defined in claim 10 wherein the same token is used for recognition of the access right in both the circuit and the packet region of each frame.
Claim 13
Dependent Claim
27 words
The method defined in claim 10 wherein different tokens are used for recognition of the access right in the circuit and the packet regions of each frame.
Claim 14
Dependent Claim
84 words
The method defined in claim 1 wherein each active one of said nodes emits at the end or in place of its packet or circuit activity a signal of end-of-activity and recognizes the right of access from the lack of activity after the signal of end-of-activity, said method further comprising the step of storing in each node information indicating whether or not the respective node has had access during a particular frame to recognize whether access has occurred in the circuit or packet region.
Claim 15
Dependent Claim
348 words
A local area network, comprising a plurality of nodes each capable of signal regeneration, a ring-transmission line coupled to all of said nodes whereby information is transmitted along said line in hybrid frames each having a circuit region in the form of a zone allotted to communications with information-continuity requirements and a packet region in the form of a zone allotted to communications which do not require continuity of information, and wherein asynchronous access of the individual nodes is effected for circuit and packet transmission along said line in sequence to said line in a given order and said order is maintained in both the circuit region and the packet region of each of said frames, and wherein in the packet region of each frame, starting from an instant preceding by a predetermined time period the end of the frame, the packet transmission of the node which has the right of transmission at that instant or of the nodes which would have the right of access from that instant to the end of the present frame is disabled, thereby avoiding overlapping between adjacent frames, said nodes each having a line-access managing device comprising: means for controlling reception and transmission of information relevant to packet-switched and/or circuit-switched communications; means for recognizing a right of access to said line; and means for suppression of information which has completed travel along the ring formed by said line; said line-access managing device of at least a master node forming one of said plurality of nodes further comprising: a frame signal generator generating ccmmands for sending over said line coded signals indicating significant events in the frame; means for generating in the packet region of each frame a signal indicating the instant of the beginning of an interval of predetermined duration extending up to the frame end and constituting said predetermined time period; means for disabling packet transmission by the nodes which have right of access during said interval; and a logic network recognizing the right of access of a node into said circuit region and into said packet region of said frame.
Claim 16
Dependent Claim
348 words
A local area network, comprising a plurality of nodes each capable of signal regeneration, a ring-transmission line coupled to all of said nodes whereby information is transmitted along said line in hybrid frames each having a circuit region in the form of a zone allotted to communications with information-continuity requirements and a packet region in the form of a zone allotted to communications which do not require continuity of information, and wherein asynchronous access of the individual nodes is effected for circuit and packet transmission along said line in sequence to said line in a given order and said order is maintained in both the circuit region and the packet region of each of said frames, and wherein in the packet region of each frame, starting from an instant preceding by a predetermined time period the end of the frame, the packet transmission of the node which has the right of transmission at that instant or of the nodes which would have the right of access from that instant to the end of the present frame is disabled, thereby avoiding overlapping between adjacent frames, said nodes each having a line-access managing device comprising: means for controlling reception and transmission of information relevant to packet-switched and/or circuit-switched communications; means for recognizing a right of access to said line; and means for suppression of information which has completed travel along the ring formed by said line; said line-access managing device of at least a master node forming one of said plurality of nodes further comprising: a frame signal generator generating ccmmands for sending over said line coded signals indicating significant events in the frame; means for generating in the packet region of each frame a signal indicating the instant of the beginning of an interval of predetermined duration extending up to the frame end and constituting said predetermined time period; means for disabling packet transmission by the nodes which have right of access during said interval; and a logic network recognizing the right of access of a node into said circuit region and into said packet region of said frame.
Claim 17
Dependent Claim
23 words
The local area network defined in claim 14 wherein the same node of said plurality of nodes always acts as said master node.
Claim 18
Dependent Claim
45 words
The local area network defined in claim 14 wherein said means for disabling is active only in the line-access managing device of said master node and consists of said frame generator constructed and arranged to broadcast a disabling signal to all of the other nodes.
Claim 19
Dependent Claim
37 words
The local area network defined in claim 14 wherein said means for disabling is active in each node and is constructed and arranged to generate a disabling signal only for the node containing the respective disabling means.
Claim 20
Dependent Claim
70 words
The local area network defined in claim 17 wherein said master node is the last node to have access during the frame, said disabling signal being represented by a command of emission of a start-of-frame flag for the master node and by an output signal of a counter of a time (Z-T p ) for the other nodes, Z being frame duration and T p being said predetermined time period.
Claim 21
Dependent Claim
58 words
The local area network defined in claim 14 wherein the function of a master node in a frame is assumed by a node which was transmitting at the moment of emission of a disabling signal during the preceding frame, or in case no node was transmitting, by the first node having the right of access during said interval.
Claim 22
Dependent Claim
34 words
The local area network defined in claim 19 wherein the node which assumes the function of the master node transmits a start-of-frame flag together with a signal of the identity of the latter node.
Claim 23
Dependent Claim
21 words
The local area network defined in claim 20 wherein said disabling signal is a command of emission for said start-of-frame flag.
Claim 24
Dependent Claim
66 words
The local area network defined in claim 14 wherein said logic network recognizes in each of said regions of each frame the right of access of the node of the logic network by counting signals emitted by a circuit of said line-access management device able to recognize and signal an occurred access of a node or expiration of a guard time indicating impossibility of such access.
Claim 25
Dependent Claim
103 words
The local area network defined in claim 14 wherein said logic network recognizes in each of said regions of each frame the right of access of the node of the logic network on the basis of a token passing, said line-access managing device comprising means for signalling to said logic circuit the presence on said line of a token and the presence of information to be transmitted by the node in either region of the frame, and for controlling extraction from said line of the token and its re-emission over the line at the end of transmission of information by the respective node.
Claim 26
Dependent Claim
102 words
The local area network defined in claim 14 wherein said logic network recognizes in each of said regions of each frame the right of access of the node of the logic network because a signal indicating the end of activity of a node is not immediately followed by a signal indicating the beginning of the information relevant to a communication transmitted by another node, said logic circuit comprising means storing information indicating whether or not the node has already obtained the access in a current frame to make a distinction between access in the circuit region or access in the packet region.