CA1207462A - Method and apparatus for the detection and regeneration of a lost token in a token based data communications network - Google Patents
Method and apparatus for the detection and regeneration of a lost token in a token based data communications networkInfo
- Publication number
- CA1207462A CA1207462A CA000446951A CA446951A CA1207462A CA 1207462 A CA1207462 A CA 1207462A CA 000446951 A CA000446951 A CA 000446951A CA 446951 A CA446951 A CA 446951A CA 1207462 A CA1207462 A CA 1207462A
- Authority
- CA
- Canada
- Prior art keywords
- token
- node
- data packet
- packet
- transmitting
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Expired
Links
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L12/00—Data switching networks
- H04L12/28—Data switching networks characterised by path configuration, e.g. LAN [Local Area Networks] or WAN [Wide Area Networks]
- H04L12/40—Bus networks
- H04L12/407—Bus networks with decentralised control
- H04L12/417—Bus networks with decentralised control with deterministic access, e.g. token passing
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L12/00—Data switching networks
- H04L12/28—Data switching networks characterised by path configuration, e.g. LAN [Local Area Networks] or WAN [Wide Area Networks]
- H04L12/40—Bus networks
- H04L12/40006—Architecture of a communication node
- H04L12/40032—Details regarding a bus interface enhancer
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L12/00—Data switching networks
- H04L12/28—Data switching networks characterised by path configuration, e.g. LAN [Local Area Networks] or WAN [Wide Area Networks]
- H04L12/40—Bus networks
- H04L12/40169—Flexible bus arrangements
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L12/00—Data switching networks
- H04L12/28—Data switching networks characterised by path configuration, e.g. LAN [Local Area Networks] or WAN [Wide Area Networks]
- H04L12/42—Loop networks
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L12/00—Data switching networks
- H04L12/28—Data switching networks characterised by path configuration, e.g. LAN [Local Area Networks] or WAN [Wide Area Networks]
- H04L12/42—Loop networks
- H04L12/427—Loop networks with decentralised control
- H04L12/433—Loop networks with decentralised control with asynchronous transmission, e.g. token ring, register insertion
Abstract
Abstract of the Disclosure A token-passing, ring-based data com-munications network provides a distributive method and apparatus for detecting and regenerating a lost token.
The method includes, after detection of the loss of the token, transmitting at a detecting node a data packet not including a token, the data packet uniquely iden-tifying the transmitting node as the data source.
Simultaneously, the transmitting node, after transmitting the tokenless data packet, strips all incoming data from the network. If the transmitted packet is successfully received by the transmitting node, a new token is generated by the node. If the packet is not received, the node defers to an arbitra-tion method which includes delaying a next data packet transmission for a probabilistically determined period of time. The mean time upon which the probabilistic approach is based increases with each unsuccessful data packet transmission attempt.
The method includes, after detection of the loss of the token, transmitting at a detecting node a data packet not including a token, the data packet uniquely iden-tifying the transmitting node as the data source.
Simultaneously, the transmitting node, after transmitting the tokenless data packet, strips all incoming data from the network. If the transmitted packet is successfully received by the transmitting node, a new token is generated by the node. If the packet is not received, the node defers to an arbitra-tion method which includes delaying a next data packet transmission for a probabilistically determined period of time. The mean time upon which the probabilistic approach is based increases with each unsuccessful data packet transmission attempt.
Description
~2~74~2 REGENERATIoN OF A LOST TOKEN IN A TOKEN BASED DATA
COMMUNICATIONS NETWORK
~A~
i The invention relates generally to data com-munications networks and in particular to a method and apparatus for the detection and re~eneration of a lost token in a token passing data communications network.
The advent of intelligent terminals incor-porating a microprocessor has led to the development of new generations of data communications networks. The networks differ from each other in many features, such as for example the topology of the network, the type of apparatus which is attached to the network, and the protocols used on the network to avoid collision of messages or other interferences. In one particular type network, known as a ring network, various nodes are interconnected along a continuous loop so that a message is passed from node to node in a single direc-tion. The message identifies its source and destina-tion in what is generally called the header portion of the message.
In the ring topology, as in many other data communications systems, absent predetermined protocol~
or priorities, more than one node could access the net-work simultaneously. A "collision" could then occur wherein two or more messages on the communications media would interfere and hence "garble" each other.
As a result r there has been developed what is often called a token-pas~ing pr~t~col wherein a node cannot ~Z~7~Z
1 transmit a message on the network unless it has control or possession of the "token" or marker. According to one protocol, the node receives the token and tra~smits a data packet appending the token at the end of the data packet. The destination of the packet thus receives the message and passes the token onto a next node (assuming that the destination node does not itself have a data packet to transmit or that the token was not "grabbed" by an intermediate node).
It often happens due to for example noise or other electrical effects that the ~oken can be "lost".
This can happen, for example, as the tok.en degenerates and is no longer recognizabla due to losses or phase distortions as it passes along the channel. As a result, the network must have a protocol for regener-ating the token. There have generally been two methods used for regenerating the token. According to the first method, one and only one of the nodes of the net-work is ass;gned the task of regenerating the ~oken.
This can often be costly in terms of network perfor-mance depending upon the location of the node relative to the location of the "disappearance" of the token and because it provides a single failure point. In other protocols, neighboring nodes generally arbitrate with respect to which node will regenerate the token. This requires complex circuitry and is often guite time con-suming and hence reduces network performance.
It is therefore an object of the invention to provide a token regeneration protocol which is inexpen-sive to implemen~ in terms of both time and hardware.Other objects of the invention are an apparatus and method for regenerating a token in a ring-based data communications network which is reliable, and capable of being implemented in MOS-VSLI integrated circuit designs.
~Z~7462 1 Summary of the Invention The invention relates to a method and appara-tus for detecting and regenerating a lost token on a token-passing, ring-based data communications network.
The method features the steps of monitoring the com-munications network at eac~ node having a pending data packet transmission for detecting the loss o the token; and transmitting, at each monitoring node detecting the loss of the token, a data packet not con-taining the token and which uniquely identifies thetransmitting node as the source thereof. The method then features stripping, at each such transmitting node, all incoming data rom the network; transmitting a new token upon the successful receipt by the transmitting node of the data packet transmitted from the node, and falling back to an arbitration method if the transmitted data packet is not received within a predetermined period of time. The method further f0atures an arbitration method which delays transmission oE a next data packet for a probabilisti-cally determined period of time, the average time of the delay increasing, according to the probabilistic approach/ accordin~ to the number of unsuccessful transmission attempts.
According to the invention, the monitoring step determines the loss of the ~oken based upon at -least one of the following criteria: a token transit time around the ring-based network wherein the token is not used by any node; a maximum allowable data packet duration; and the multiplicative product of the maximum number of nodes and the maximum packet duration.
The apparatus according to the preerred embodiment of the invention features circuitry for monitoring and communications network at each node 746~
1 having a pending data packe~ transmission and which detects the loss of a tokenO The circuitry then transmits, at each such node which detects the loss of the token, a data packet which uniquely identifies the transmitting node as the source of the packet but which does not include a token, which under normal cir-cumstances would have been included in the packet.
While the packet is circulating around the ring, each transmitting node strips all incoming data from the ring network and upon the successful receipt of the transmitted data packet, the transmitting node g~ne rates a new token and places it on the ring.
The appara$us further features circuitry for implementing the arbitration method noted in connection with the description of the method of the invention if the transmitted data packet is not received within a predetermined time out period.
~rief Descri tion of the Drawings .P
Other objects, advantages, and eatures of the invention will be apparent from the following description taken together with the drawings in which:
Figure 1 is a schematic block diagram of a typical ring network according to the invention;
Figure 2 is a flow chart showing the method of the invention for detecting and generating a new token when necessary; and Figure 3 is a block diagram of a typical node for detecting and generating a lost token.
1 escription of a Preferred Embodiment Referring to Figure 1, a ring-based data com-munications network 10 has a plurality of nodes 12 attached thereto. The ring network 10 is of the type designated a token-passing network so that a node 12 cannot transmit data on the network unless it has in its possession or control the token or marker. The token or marker is passed along the ring network in a unilateLal direction by the nodes 12. As the marker is passed from node to node, it can deteriorate or other-wise become unreadable. In addition, external forces such as electrical noise can further aid in the deterioration and loss of the token. Finally a malfunction, for example at a node, can effect loss of the token.
When the token is lost, it must be regener-ated by one or more of the nodes, operating either singly or together. In accordance wi~h the illustrated embodiment, the token regeneration method i5 imple-mented by a distributive unction wherein each of nodes12, operating independently, can effect regeneration of the token~
According to the invention, and referring to Fi~ure 2, each time a data packet is ready to be transmitted, for example at 14, a time out period is-started. This is indicated at 16. The ~ime out period i9 based upon at least one of the following criteria:
the token transit time around the ring upon the assump-tion that ths token is not used by any of the nodes, a maximum allowable data packet duration, and/or the multiplicative product of the maximum number of nodes on the network and the maximum data packet duration.
Thus~ the time out period is related to the real time required for a token to make one complete ~ircuit around the ring.
~079~Z
1 In the illustrated embodiment, two time out timers are employed, a token timer and a data packet timer. If either timer "times out", it is presumed that the time out period has ended and that the token must be regenerated. The token timer, in the illustrated embodiment, is set to a time equal to the multiplicative product of the maximum number of nodes on the network and the maximum data packet duration.
The packet timer, in the illustrated embodiment, is set to a time greater than the maximum packet size plus the maximum network delay. In the illustrated embodiment a time duration equal to twice the sum of the maximum packet size and maximum network delay is conv~niently used. Both timers are initiated at a node when a data packet i5 ready for transmission.
~ ach node 12 which is ready to transmit thus continually "looks" for the token (at 18~ and once found, the detection of a token starts the packet transmission. If the token is not detected within the time allotted, the node goes into a token regeneration mode of operation. This occurs at 20 after the time out period has ended at 22. If the time out period has not ended and a packet is seen, the packet time out period is resta~ted (at 23).
~ t this time, a data packet is applied to the ring network by a node 12. The data packet is unique to the node and contains correct parity and an iden-tification of the source of the packet. At the same time that the packet is placed on the ring/ a packet time out clock is started For this stage of opera-tion, the time out duration is preferably set to one~
half of the time out duratio~ ordinarily associated with the packet timer. This time is not critical but is designed to limit the allowable transit time for the packet If the packet is successfully received ~at 24) ~Z~7~L~Z
1 prior to the end of the packet time out period, the node 12 generates a new token, 26, and normal operation of the ring resumes. The successfully received packet is that packet which identifies the receiving node as the source of the packet and optionally, which main-tains its proper parity. In the illustrated embodi-ment~ the parity check is not required. The packet could have but need not have included other pertinent information.
If the packet is not received before the packet time out period ends, at 28, the node is effec~
tively taken "off line" for a time period which is determined probabilistically in accordance with the maximum time it takes a packet to circulate in the ring. The probabilistically determined time out period (at 30) sets a time during which no transmission of a data packet will be made by the node. Furthermore, unlike the time duration during which the data packet was circulatin~ and during which any new data was str;pped from the network, during the time out period new data is examined for a token~ If the token is received during the delay, that is, the ~oken was regenerated by another node, normal ring operation resumes. Othe~wise, after the probabilistically deter-mined time out period ends, the n~de transmits a next test data packet ~which may be tha same data packet) at 20 and the entire procedure continues. Impor~antly,-~he mean time of the probabilistically determined time out period increases in direct proportion to the number of unsuccessful transmission attempts. In the illustrated embodiments, a limit is placed on the number of retries after which the network is declared inoperative (at 32 and 34).
In accordance with the invention, referring to Figure 3, each n~de 12 has a transceiver/relay 40, a ~2~
1 controller/processor 42, and end user equipment 44.
The controller/processor is typically a microprocessor based sys~em which controls operation of a relay in the transceiver for bypassing the node and operation of the transceiver itself. The microprocessor prepares the data which the transceiver will apply to the network, and operates to monitor the data received by the transceiver and to control the processing of that data.
That data which is to be used by the node, is applied to the end user 44.
The microprocessor of controller/processor 42 is designed to implement the flow chart of Figure 2 using a token detect time ou~ counter 46 and a packet time out counter 48.
It would be obvious to those skilled in the art to modify the specific microprocessor implemen-tation as well as the flow chart of Figure 2 to accomplish the goal~ o the presen~ invention.
Therefore, additionsl subtractions, deletions, and o~her modifications of the disclosed preferred embodi-ment would be obvious to those practiced in the art and are within the scope of the following claims.
COMMUNICATIONS NETWORK
~A~
i The invention relates generally to data com-munications networks and in particular to a method and apparatus for the detection and re~eneration of a lost token in a token passing data communications network.
The advent of intelligent terminals incor-porating a microprocessor has led to the development of new generations of data communications networks. The networks differ from each other in many features, such as for example the topology of the network, the type of apparatus which is attached to the network, and the protocols used on the network to avoid collision of messages or other interferences. In one particular type network, known as a ring network, various nodes are interconnected along a continuous loop so that a message is passed from node to node in a single direc-tion. The message identifies its source and destina-tion in what is generally called the header portion of the message.
In the ring topology, as in many other data communications systems, absent predetermined protocol~
or priorities, more than one node could access the net-work simultaneously. A "collision" could then occur wherein two or more messages on the communications media would interfere and hence "garble" each other.
As a result r there has been developed what is often called a token-pas~ing pr~t~col wherein a node cannot ~Z~7~Z
1 transmit a message on the network unless it has control or possession of the "token" or marker. According to one protocol, the node receives the token and tra~smits a data packet appending the token at the end of the data packet. The destination of the packet thus receives the message and passes the token onto a next node (assuming that the destination node does not itself have a data packet to transmit or that the token was not "grabbed" by an intermediate node).
It often happens due to for example noise or other electrical effects that the ~oken can be "lost".
This can happen, for example, as the tok.en degenerates and is no longer recognizabla due to losses or phase distortions as it passes along the channel. As a result, the network must have a protocol for regener-ating the token. There have generally been two methods used for regenerating the token. According to the first method, one and only one of the nodes of the net-work is ass;gned the task of regenerating the ~oken.
This can often be costly in terms of network perfor-mance depending upon the location of the node relative to the location of the "disappearance" of the token and because it provides a single failure point. In other protocols, neighboring nodes generally arbitrate with respect to which node will regenerate the token. This requires complex circuitry and is often guite time con-suming and hence reduces network performance.
It is therefore an object of the invention to provide a token regeneration protocol which is inexpen-sive to implemen~ in terms of both time and hardware.Other objects of the invention are an apparatus and method for regenerating a token in a ring-based data communications network which is reliable, and capable of being implemented in MOS-VSLI integrated circuit designs.
~Z~7462 1 Summary of the Invention The invention relates to a method and appara-tus for detecting and regenerating a lost token on a token-passing, ring-based data communications network.
The method features the steps of monitoring the com-munications network at eac~ node having a pending data packet transmission for detecting the loss o the token; and transmitting, at each monitoring node detecting the loss of the token, a data packet not con-taining the token and which uniquely identifies thetransmitting node as the source thereof. The method then features stripping, at each such transmitting node, all incoming data rom the network; transmitting a new token upon the successful receipt by the transmitting node of the data packet transmitted from the node, and falling back to an arbitration method if the transmitted data packet is not received within a predetermined period of time. The method further f0atures an arbitration method which delays transmission oE a next data packet for a probabilisti-cally determined period of time, the average time of the delay increasing, according to the probabilistic approach/ accordin~ to the number of unsuccessful transmission attempts.
According to the invention, the monitoring step determines the loss of the ~oken based upon at -least one of the following criteria: a token transit time around the ring-based network wherein the token is not used by any node; a maximum allowable data packet duration; and the multiplicative product of the maximum number of nodes and the maximum packet duration.
The apparatus according to the preerred embodiment of the invention features circuitry for monitoring and communications network at each node 746~
1 having a pending data packe~ transmission and which detects the loss of a tokenO The circuitry then transmits, at each such node which detects the loss of the token, a data packet which uniquely identifies the transmitting node as the source of the packet but which does not include a token, which under normal cir-cumstances would have been included in the packet.
While the packet is circulating around the ring, each transmitting node strips all incoming data from the ring network and upon the successful receipt of the transmitted data packet, the transmitting node g~ne rates a new token and places it on the ring.
The appara$us further features circuitry for implementing the arbitration method noted in connection with the description of the method of the invention if the transmitted data packet is not received within a predetermined time out period.
~rief Descri tion of the Drawings .P
Other objects, advantages, and eatures of the invention will be apparent from the following description taken together with the drawings in which:
Figure 1 is a schematic block diagram of a typical ring network according to the invention;
Figure 2 is a flow chart showing the method of the invention for detecting and generating a new token when necessary; and Figure 3 is a block diagram of a typical node for detecting and generating a lost token.
1 escription of a Preferred Embodiment Referring to Figure 1, a ring-based data com-munications network 10 has a plurality of nodes 12 attached thereto. The ring network 10 is of the type designated a token-passing network so that a node 12 cannot transmit data on the network unless it has in its possession or control the token or marker. The token or marker is passed along the ring network in a unilateLal direction by the nodes 12. As the marker is passed from node to node, it can deteriorate or other-wise become unreadable. In addition, external forces such as electrical noise can further aid in the deterioration and loss of the token. Finally a malfunction, for example at a node, can effect loss of the token.
When the token is lost, it must be regener-ated by one or more of the nodes, operating either singly or together. In accordance wi~h the illustrated embodiment, the token regeneration method i5 imple-mented by a distributive unction wherein each of nodes12, operating independently, can effect regeneration of the token~
According to the invention, and referring to Fi~ure 2, each time a data packet is ready to be transmitted, for example at 14, a time out period is-started. This is indicated at 16. The ~ime out period i9 based upon at least one of the following criteria:
the token transit time around the ring upon the assump-tion that ths token is not used by any of the nodes, a maximum allowable data packet duration, and/or the multiplicative product of the maximum number of nodes on the network and the maximum data packet duration.
Thus~ the time out period is related to the real time required for a token to make one complete ~ircuit around the ring.
~079~Z
1 In the illustrated embodiment, two time out timers are employed, a token timer and a data packet timer. If either timer "times out", it is presumed that the time out period has ended and that the token must be regenerated. The token timer, in the illustrated embodiment, is set to a time equal to the multiplicative product of the maximum number of nodes on the network and the maximum data packet duration.
The packet timer, in the illustrated embodiment, is set to a time greater than the maximum packet size plus the maximum network delay. In the illustrated embodiment a time duration equal to twice the sum of the maximum packet size and maximum network delay is conv~niently used. Both timers are initiated at a node when a data packet i5 ready for transmission.
~ ach node 12 which is ready to transmit thus continually "looks" for the token (at 18~ and once found, the detection of a token starts the packet transmission. If the token is not detected within the time allotted, the node goes into a token regeneration mode of operation. This occurs at 20 after the time out period has ended at 22. If the time out period has not ended and a packet is seen, the packet time out period is resta~ted (at 23).
~ t this time, a data packet is applied to the ring network by a node 12. The data packet is unique to the node and contains correct parity and an iden-tification of the source of the packet. At the same time that the packet is placed on the ring/ a packet time out clock is started For this stage of opera-tion, the time out duration is preferably set to one~
half of the time out duratio~ ordinarily associated with the packet timer. This time is not critical but is designed to limit the allowable transit time for the packet If the packet is successfully received ~at 24) ~Z~7~L~Z
1 prior to the end of the packet time out period, the node 12 generates a new token, 26, and normal operation of the ring resumes. The successfully received packet is that packet which identifies the receiving node as the source of the packet and optionally, which main-tains its proper parity. In the illustrated embodi-ment~ the parity check is not required. The packet could have but need not have included other pertinent information.
If the packet is not received before the packet time out period ends, at 28, the node is effec~
tively taken "off line" for a time period which is determined probabilistically in accordance with the maximum time it takes a packet to circulate in the ring. The probabilistically determined time out period (at 30) sets a time during which no transmission of a data packet will be made by the node. Furthermore, unlike the time duration during which the data packet was circulatin~ and during which any new data was str;pped from the network, during the time out period new data is examined for a token~ If the token is received during the delay, that is, the ~oken was regenerated by another node, normal ring operation resumes. Othe~wise, after the probabilistically deter-mined time out period ends, the n~de transmits a next test data packet ~which may be tha same data packet) at 20 and the entire procedure continues. Impor~antly,-~he mean time of the probabilistically determined time out period increases in direct proportion to the number of unsuccessful transmission attempts. In the illustrated embodiments, a limit is placed on the number of retries after which the network is declared inoperative (at 32 and 34).
In accordance with the invention, referring to Figure 3, each n~de 12 has a transceiver/relay 40, a ~2~
1 controller/processor 42, and end user equipment 44.
The controller/processor is typically a microprocessor based sys~em which controls operation of a relay in the transceiver for bypassing the node and operation of the transceiver itself. The microprocessor prepares the data which the transceiver will apply to the network, and operates to monitor the data received by the transceiver and to control the processing of that data.
That data which is to be used by the node, is applied to the end user 44.
The microprocessor of controller/processor 42 is designed to implement the flow chart of Figure 2 using a token detect time ou~ counter 46 and a packet time out counter 48.
It would be obvious to those skilled in the art to modify the specific microprocessor implemen-tation as well as the flow chart of Figure 2 to accomplish the goal~ o the presen~ invention.
Therefore, additionsl subtractions, deletions, and o~her modifications of the disclosed preferred embodi-ment would be obvious to those practiced in the art and are within the scope of the following claims.
Claims (10)
1. In a token-passing, ring-based data communications network, a method for the detection and regeneration of a lost token comprising the steps of monitoring the communication network at each node having a pending packet transmission for detecting the loss of the token, transmitting, at each monitoring node detecting the loss of the token, a data packet without a token, said data packet uniquely identifying the transmitting node as the source, stripping, at each such transmitting node, all incoming data from the network, transmitting a new token upon successful receipt of its transmitting data packet by the node which transmitted it, and instituting a node transmission arbitration method if the transmitted data packet is not received within a predetermined time out period.
2. The method of claim 1 wherein said instituting step comprises the step of delaying transmission of a next data packet for a probabilistically determined period of time, the mean time of said probabilistic approach increasing with each unsuccessful transmission attempt.
3. The method of claim 1 wherein said monitoring step determines the loss of the token based upon at least one of a token transit time around the ring based network wherein the token is not used,
3. The method of claim 1 wherein said monitoring step determines the loss of the token based upon at least one of a token transit time around the ring based network wherein the token is not used,
Claim 3 continued...
a maximum allowable data packet duration, and a multiplicative product of the maximum number of nodes and the maximum packet duration.
4. In a token-passing, ring-based data communications system, a method for the detection and regeneration of a lost token comprising the steps of monitoring the communications network at each node connected to the network and having a data packet for transmission for detecting the loss of the token, said monitoring step basing said loss of token upon at least one of a token transit time around the ring-based network during which time the token is not used by any node, a maximum allowable data packet duration, and the multiplicative product of the maximum number of nodes allowable on the network and the maximum packet duration, transmitting, at each node detecting the loss of the token, a data packet not including a token, which packet uniquely indentifies the transmitting node as the source of the data packet, stripping, at each such transmitting node, all incoming data from the communications network, transmitting a new token upon successful receipt of the transmitted data packet, said successful receipt being the recognition of the node as the node which is the transmitting source of the data packet, and initiating a node transmission arbitration method when the transmitted data packet is not successfully received
a maximum allowable data packet duration, and a multiplicative product of the maximum number of nodes and the maximum packet duration.
4. In a token-passing, ring-based data communications system, a method for the detection and regeneration of a lost token comprising the steps of monitoring the communications network at each node connected to the network and having a data packet for transmission for detecting the loss of the token, said monitoring step basing said loss of token upon at least one of a token transit time around the ring-based network during which time the token is not used by any node, a maximum allowable data packet duration, and the multiplicative product of the maximum number of nodes allowable on the network and the maximum packet duration, transmitting, at each node detecting the loss of the token, a data packet not including a token, which packet uniquely indentifies the transmitting node as the source of the data packet, stripping, at each such transmitting node, all incoming data from the communications network, transmitting a new token upon successful receipt of the transmitted data packet, said successful receipt being the recognition of the node as the node which is the transmitting source of the data packet, and initiating a node transmission arbitration method when the transmitted data packet is not successfully received
Claim 4 continued...
within a predetermined time out period, said arbitration method including delaying transmission of a next data packet for a probabilistically determined period increasing with each unsuccessful attempt to transmit and receive a data packet on said ring-based data communications network.
within a predetermined time out period, said arbitration method including delaying transmission of a next data packet for a probabilistically determined period increasing with each unsuccessful attempt to transmit and receive a data packet on said ring-based data communications network.
5, A token-passing ring-based data communications network having means for detecting and regenerating a lost token comprising means for monitoring the communications network at each node having a pending packet transmission, for detecting the loss of the token, means for transmitting, at each node detecting the loss of a token, a data packet not including a token which packet uniquely identifies the transmitting node as the source, means for stripping all incoming data from the communications network in response to the transmission of a said data packet without a token, said transmitting means further having means for transmitting a new token upon successful receipt of its transmitted data packet, and means for instituting a node transmission arbitration method if the transmitted data packet is not received within a predetermined time out period.
6. The apparatus of claim 5 wherein said instituting means comprises means for probabilistically determining a delay period, the mean time of the delay period increasing with each unsuccessful transmission attempt, and
6. The apparatus of claim 5 wherein said instituting means comprises means for probabilistically determining a delay period, the mean time of the delay period increasing with each unsuccessful transmission attempt, and
Claim 6 continued...
means for delaying transmission of a next packet of data without a token for said probabilistically determined delay period.
means for delaying transmission of a next packet of data without a token for said probabilistically determined delay period.
7. The apparatus of claim 5 further wherein said monitoring means includes means for determining the loss of the token while taking into account at least one of a token transit time around the ring-based network wherein the token is not used, a maximum allowable data packet duration, and a multiplicative product of the maximum number of nodes allowed on the network and the maximum packet duration.
8. The apparatus of claim 5 wherein said transmitting means further comprises means for determining the successful receipt of a transmitted data packet by recognizing the source of the packet as being said transmitting node.
9. The method of claim 1 wherein said monitoring step employs a packet timing period and a token timing period for determining the loss of the token.
10. The apparatus of claim 5 further wherein said monitoring means comprises a packet timer, and a token timer, said packet timer and said token timer being initiated when the node has a pending data packet transmission, said token timer having a duration equal to the multiplicative product of the maximum number of nodes on the network and the maximum packet duration, and
10. The apparatus of claim 5 further wherein said monitoring means comprises a packet timer, and a token timer, said packet timer and said token timer being initiated when the node has a pending data packet transmission, said token timer having a duration equal to the multiplicative product of the maximum number of nodes on the network and the maximum packet duration, and
Claim 10 continued...
said packet timer having a time duration greater than the sum of the time duration of a maximum size data packet and the maximum transit time around the network.
said packet timer having a time duration greater than the sum of the time duration of a maximum size data packet and the maximum transit time around the network.
Applications Claiming Priority (2)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
US466,109 | 1983-02-14 | ||
US06/466,109 US4494233A (en) | 1983-02-14 | 1983-02-14 | Method and apparatus for the detection and regeneration of a lost token in a token based data communications network |
Publications (1)
Publication Number | Publication Date |
---|---|
CA1207462A true CA1207462A (en) | 1986-07-08 |
Family
ID=23850508
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
CA000446951A Expired CA1207462A (en) | 1983-02-14 | 1984-02-07 | Method and apparatus for the detection and regeneration of a lost token in a token based data communications network |
Country Status (6)
Country | Link |
---|---|
US (1) | US4494233A (en) |
EP (1) | EP0119003B1 (en) |
JP (1) | JPS59158161A (en) |
AT (1) | ATE38923T1 (en) |
CA (1) | CA1207462A (en) |
DE (1) | DE3475370D1 (en) |
Families Citing this family (29)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
JPS59188256A (en) * | 1983-04-11 | 1984-10-25 | Hitachi Ltd | Transmitting method of loop transmission system |
US4566098A (en) * | 1984-05-14 | 1986-01-21 | Northern Telecom Limited | Control mechanism for a ring communication system |
JPS6130834A (en) * | 1984-07-23 | 1986-02-13 | Canon Inc | Data transmission control system |
JPS6184938A (en) * | 1984-10-02 | 1986-04-30 | Nippon Telegr & Teleph Corp <Ntt> | Token passing network system |
JPS61125252A (en) * | 1984-11-20 | 1986-06-12 | Fujitsu Ltd | Transition and interruption system of medium access control state |
US4649535A (en) * | 1985-05-13 | 1987-03-10 | General Electric Company | Method and apparatus for maintaining a dynamic logical ring in a token passing LAN |
US4682326A (en) * | 1985-11-27 | 1987-07-21 | General Electric Company | Method and apparatus for maintaining a dynamic logical ring in a token passing lan |
US4745598A (en) * | 1985-11-27 | 1988-05-17 | General Electric Company | Method and apparatus for maintaining a dynamic logical ring in a token passing LAN |
JPS62168441A (en) * | 1986-01-20 | 1987-07-24 | Mitsubishi Electric Corp | Autonomous type transmission controller |
JPS6339038A (en) * | 1986-08-01 | 1988-02-19 | Nec Corp | Process synchronizing method |
JPS6339039A (en) * | 1986-08-01 | 1988-02-19 | Nec Corp | Process synchronizing method |
JP2585306B2 (en) * | 1986-11-07 | 1997-02-26 | 株式会社日立製作所 | Loop transmission system and data transmission control method |
JPH01132244A (en) * | 1987-11-18 | 1989-05-24 | Hitachi Ltd | Frame communication system |
JPH0666806B2 (en) * | 1988-02-08 | 1994-08-24 | 住友電気工業株式会社 | Token ring transmission method |
US5179553A (en) * | 1988-06-16 | 1993-01-12 | Kabushiki Kaisha Toshiba | Strip frame recognition apparatus |
US5331636A (en) * | 1988-08-12 | 1994-07-19 | Digital Equipment Corporation | Frame removal mechanism using count of frames and delimiter frame for token ring networks |
AU622208B2 (en) * | 1988-08-12 | 1992-04-02 | Digital Equipment Corporation | Frame removal mechanism for token ring networks |
US4972363A (en) * | 1989-02-01 | 1990-11-20 | The Boeing Company | Neural network using stochastic processing |
US5029159A (en) * | 1989-07-18 | 1991-07-02 | International Business Machines Corporation | Method and means for leader choosing on a token ring system |
US5257264A (en) * | 1989-08-29 | 1993-10-26 | Digital Equipment Corporation | Automatically deactivated no-owner frame removal mechanism for token ring networks |
US5280478A (en) * | 1989-08-29 | 1994-01-18 | Digital Equipment Corporation | No-owner frame and multiple token removal mechanism for token ring networks |
EP0719010A3 (en) * | 1990-06-29 | 1997-01-08 | Digital Equipment Corp | Frame removal mechanism for token ring network |
JPH0735469Y2 (en) * | 1990-07-23 | 1995-08-09 | 横河電機株式会社 | Baton pass communication bus controller |
KR950001265B1 (en) * | 1990-08-29 | 1995-02-15 | 가부시키가이샤 도시바 | Communication control device having a apparatus for detecting the absense of a control data on a ring communication network |
US5291491A (en) * | 1991-01-22 | 1994-03-01 | Digital Equipment Corporation | Avoidance of false re-initialization of a computer network |
US5377190A (en) * | 1991-03-28 | 1994-12-27 | Digital Equipment Corporation | Frame removal mechanism using frame count for token ring networks |
JP2770282B2 (en) * | 1992-04-13 | 1998-06-25 | 本田技研工業株式会社 | Vehicle data transmission system |
US6445717B1 (en) | 1998-05-01 | 2002-09-03 | Niwot Networks, Inc. | System for recovering lost information in a data stream |
US7269186B2 (en) * | 2001-08-06 | 2007-09-11 | Qualcomm Incorporated | Protocol for framing a payload |
Family Cites Families (6)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US3593290A (en) * | 1969-07-17 | 1971-07-13 | Bell Telephone Labor Inc | Round robin data station selective calling system |
US4063220A (en) * | 1975-03-31 | 1977-12-13 | Xerox Corporation | Multipoint data communication system with collision detection |
US4281380A (en) * | 1978-12-27 | 1981-07-28 | Harris Corporation | Bus collision avoidance system for distributed network data processing communications system |
US4292623A (en) * | 1979-06-29 | 1981-09-29 | International Business Machines Corporation | Port logic for a communication bus system |
JPS5745758A (en) * | 1980-09-03 | 1982-03-15 | Hitachi Ltd | Loop type data transmission controller |
JPS5781747A (en) * | 1980-11-11 | 1982-05-21 | Nec Corp | Data transmission control system for loop transmission system |
-
1983
- 1983-02-14 US US06/466,109 patent/US4494233A/en not_active Expired - Lifetime
-
1984
- 1984-02-07 CA CA000446951A patent/CA1207462A/en not_active Expired
- 1984-02-08 AT AT84300793T patent/ATE38923T1/en not_active IP Right Cessation
- 1984-02-08 EP EP84300793A patent/EP0119003B1/en not_active Expired
- 1984-02-08 DE DE8484300793T patent/DE3475370D1/en not_active Expired
- 1984-02-13 JP JP59023071A patent/JPS59158161A/en active Pending
Also Published As
Publication number | Publication date |
---|---|
EP0119003A3 (en) | 1985-10-23 |
DE3475370D1 (en) | 1988-12-29 |
EP0119003A2 (en) | 1984-09-19 |
US4494233A (en) | 1985-01-15 |
EP0119003B1 (en) | 1988-11-23 |
ATE38923T1 (en) | 1988-12-15 |
JPS59158161A (en) | 1984-09-07 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
CA1207462A (en) | Method and apparatus for the detection and regeneration of a lost token in a token based data communications network | |
US4561092A (en) | Method and apparatus for data communications over local area and small area networks | |
US4500989A (en) | Digital communication system | |
EP0094180B1 (en) | Dual-count, round-robin distributed arbitration technique for serial buses | |
US4757460A (en) | Communications network with individualized access delays | |
US5828663A (en) | Access control system for wireless-lan terminals | |
US6611529B1 (en) | Priority access for real-time traffic in contention-based networks | |
JPH07307751A (en) | Full duplex communication between terminal stations in tokenring local area network | |
US5576702A (en) | Method and apparatus for fault-tolerant transmission in multi-channel networks | |
EP0404707A2 (en) | Frame stripping method for removing corrupted messages in a ring communication network | |
US4707830A (en) | Token passing LAN using a plurality of tokens | |
US5280478A (en) | No-owner frame and multiple token removal mechanism for token ring networks | |
US4751700A (en) | Method and apparatus for local area communication networks | |
CA1204189A (en) | Control mechanism for a ring communication system | |
EP0597030B1 (en) | Automatically deactivated no-owner frame removal mechanism for token ring networks | |
JP3087695B2 (en) | COMMUNICATION TERMINAL, COMMUNICATION SYSTEM USING THE SAME, AND RECORDING MEDIUM CONTAINING COMMUNICATION CONTROL PROGRAM BY THE SYSTEM | |
JPS59139742A (en) | Information transfer system | |
JPS6130834A (en) | Data transmission control system | |
SU1550516A1 (en) | Method of determining procedure of message transmission | |
JPH0482345A (en) | Method for detecting plural master stations | |
JPH02149041A (en) | Transmission access system in local area network | |
WO2002043318A2 (en) | Media access control with echo based collision detection and resolution | |
JPS6360641A (en) | Access control system in network | |
JPH0482346A (en) | System for detecting presence of master station | |
JPS61120544A (en) | Information communication system |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
MKEX | Expiry |