CA1338220C - Variable speed local area network - Google Patents
Variable speed local area networkInfo
- Publication number
- CA1338220C CA1338220C CA000597735A CA597735A CA1338220C CA 1338220 C CA1338220 C CA 1338220C CA 000597735 A CA000597735 A CA 000597735A CA 597735 A CA597735 A CA 597735A CA 1338220 C CA1338220 C CA 1338220C
- Authority
- CA
- Canada
- Prior art keywords
- agent
- data
- high speed
- receiving
- low speed
- 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 - Fee Related
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]
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L9/00—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols
- H04L9/40—Network security protocols
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L69/00—Network arrangements, protocols or services independent of the application payload and not provided for in the other groups of this subclass
- H04L69/24—Negotiation of communication capabilities
Abstract
A local area network is disclosed including apparatus and methods for transmitting data between a plurality of data processing resources (agents) coupled to a cable. An agent desiring to send data to a receiving agent transmits a request to send (RTS) data packet which includes a control character requesting to either high or low speed data communication. Utilizing the teachings of the present invention, absent other predefined conditions a transmitting agent capable of high speed communication requests a high speed data exchange with the receiving agent. The RTS data packet itself is transmitted at low speed. Upon receiving the RTS packet, the receiving agent must transmit a clear to send (CTS) packet to the transmitting agent within a predetermined time after the receipt of the RTS packet. The CTS packet also includes a control character which either confirms that the data exchange will take place at high speed, or alternatively, a control character which requires atransmitting agent to use the low speed data rate. The transmitting agent, upon receipt of the CTS packet, generates and transmits a data packet to the receiving agent at either a high speed or low speed, depending upon the value of the control character within the CTS packet. The present invention further includes a status table maintained by each agent for tracking the address and communication capability of other agents coupled to the cable.
Description
BACKGROUND OF THE INVENTION
1. FIFLD OF THF INVFNTION:
The present invention relates to apparatus and methods for transferring data between a plurality of data processing devices, and in particular, the present invention relates to data transfer over a local area network between a plurality of data processing devices.
1. FIFLD OF THF INVFNTION:
The present invention relates to apparatus and methods for transferring data between a plurality of data processing devices, and in particular, the present invention relates to data transfer over a local area network between a plurality of data processing devices.
2. ART BACKGROUND:
0 It is common to utilize a local area network for the transfer of data and commands between a plurality of data processing devices, such as for example, computer work stations, personal computers, printers, memories and the like. So called ~Local Area Networks~ (LANs) were developed to connect a collection of computers, work stations, terminals, and other peripheral devices, typically in the same building, and permit each of these devices to communicate with devices attached to other networks. By having different data processing resources perform different tasks, distributed computing provides increased efficiency and power in an overall data processing system. Most local area networks utilize their own high band width cable to permit datagram service between the various devices coupled to the LAN. The most common transmission media for carrier sense local area networks are co~ cable, t risted pair and fiber opt,ics. A variety of cable topologies are possible using a local area network, such as by way of example, linear, spine, tree, ring and segmented topologies.
In the personal computer market, local area networks havs become quite popular as a means for providing distributed processing and communication between personal computers, work stations and other data R~.9 17 JJstcmm ~
processing resources. One such local area network is described in U.S.
Patents No. 4,689,786, issued August 25, 1987,and 4,661,901, issued April 28, 1987, both owned by Apple Computer, Inc. in Cuperbno, California.
The local area network disclosed in U.S. Patent No. 4,689,786 and 4,661,902 5 (hereinafter~the '786 and '902 patents") provide apparatus and methods for transferring data along the local area network between data pr~cessing agents.
Each agent coupled to the LAN of U.S. Patents Nos. '786 and '~02 follows a protocol for the self assignment of an address on the LAN. This network has become widely used for networking personal computers within office 10 environments and is known as the ~Appletalknd~ network. In practice, Appletalk~ operates at a speed of 230.4 kilobits per second.
As will be described, the present invention comprises improved apparatus and methods to boost the speed of communication along a local area network, and in particular, a network of the type disclosed in U.S. Patents '786and '902. Utilizing the teachings of the present invention, the speed of an AppletalklM local area network may be increased by a factor of 3.33. In addition, the present invention provides both high speed, as well as low speed, data communication along a LAN between various typ,es of computers, work stations, printers, disk drives and other data processing agents. The present 20 invention provides a high speed and reliable local area network heretofore unknown in the prior art.
P~5.~17 -2-JJB/cmm SUMMARY OF THE INVENTION
A local area. network is disclosed including apparatus and methods for transmitting data between a plurality of data processing resources 5 (agents) coupled to a cable. An agent desiring to send data to a receiving agent transmits a request to send (RTS) data packet which includes a control character requesting either high or low speed data communication. Utilizing the teachings of the present invention, absent other predefined conditions a transmitting agent capable of high speed communication requests a high speed 0 data exchange with the receiving agent. The RTS data packet itself is transmitted at low speed. Upon receiving the RTS packet, the receiving agent must transmit a clear to send (CTS) packet to the transmitting agent within a predetermined time after the receipt of the RTS packet. The CTS packet also includes a control character which either confirms that the data exchange will take place at high speed, or alternatively, a control character which requires atransmitting ager~t to use the low speed data rate. The transmitting agent, uponreceipt of the CTS packet, generates and transmits a data packet to the receiving agent at either a high speed or low speed, depending upon the value of the control character within the CTS packet. The present invention further 20 includes a status table maintained by each agent for tracking the address andcommunication capability of other agents coupled to the cable. The status table maintained by eacl~ agent further includes an error history register for each other agent in which is maintained the error status of the last N high speed data packet communications with that agent. In the event the number of errors 25 over N past high speed data communications from a given agent exceed a predetermined threshold value, the receiving agent requires that that agent communicate with it at low speed. In addition, if the receiving agent detects an P~5.~ 17 -3-J Ir'/~ .
error in a high speed data packet transmitted to it, the reoeiving agent enablesa slow down timer which, for a predetermined number of seconds, requires all transmitting agents in communication with the receiving agent operate at low speed. Accordingly, the present invention provides a method for operating a local area network at high speed for those agents capable of high speed, and at low speed for those agents capable of only low speed communication.
8~.9 ~7 -4 -JJB/crnm RRIEF DESCRIPTION OF TH~ DRAWINGS
FIGURE 1 illustrates a local area network utilizing the teachings of the present invention.
FIGURE 2 illusl-dtes the frame format utilized by the present invention for a request to send (RTS) and clear to send (CTS) message packet.
FIGURE 3 illustrates the present invention's control character 10 allocation for use in RTS and CTS message packets to provide both low speed and high speed data communication along a local area network.
FIGURE 4 illustrates the frams format for a low speed data packet utilizing the teachings of the present invention.
FIGURE 5 illustrates the frame format for a high speed data packet utilized by the present invention.
FIGURE 6 conceptually illustrates the present invention's use of 2C a status table for each agent coupled to the local area network.
FIGURE 7 is a flow chart illustrating the sequence of operations completed by a transmitting agent utilizing the teachings of the present invention.
FIGURE 8 is a flow chart illustrating the sequence of operations by a rsceiving agent utilizing the teachings of the pressnt invsntion.
82225.947 . _5.
JJB/cmm nETAILED DESCRIPTION OF THF INVFNTION
A local area network including apparatus and methods for transferring data between a plurality of data processing resources coupled to a s common cable is disclosed. In the following description, for purposes of explanation, specific numbers, bytes, registers, aWresses, times, signals and data message formats, etc. are set forth in order to provide a thorough understanding of the present invention. However, it will be apparent to one skilled in the art that the present invention may be practiced without these 0 specific details. In other instances, well known circuits and devices are shown in block diagram form in order not to obscure the present invention unnecessarily.
Referring to Figure 1, the present invention may include a plurality of data processing devices identified generally by the numerals 15 through 18 as well as peripheral devices, such as printer 19, or other devices, such as global disk drives, modems, and the like. For purposes of this disclosure and Specification, all data processing and peripheral devices which are coupled to the present invention's local area network are collectively referred to as ~agents~. As shown, data processing devices 15, 20 16, 17, 18 and printer 19 are interconnected for data transfer to one another by a common cable 20. The various devices are coupled to cable 20 using well known technj~ues and circuits. Cable 20 is appropriately terminated to eliminate signal reflections. It will be appreciated that cable 20 may comprise any shared media, such as co~ cable, fiber optics, radio channel, twisted 25 pair and the like. Since, in the present embodiment, the agents are passivelycoupled to cable 20, a failure of an agent will not disrupt communication over cable 20. For purposes of this Specification, the present invention is described 82225.947 -6-JJr~ .. .
.
generally utilizing the structure, protocols, and methods disclosed in U.S.
Patent 4,689,786, issued on August 25, 1987, and U.S. Patent No. 4,661,902, issued April 28, 1987. However, it will be appreciated by one skilled in the artthat the present invention has application beyond the improvements disclosed herein relative to the network described in the '786 and '902 patents.
As will be described, the present invention provides a local area networlc which permits synchronous serial communication and data transfer between data processing devices 15 through 1 8, and other peripheral devices, such as printer 19, utilizing protocols which permit both high speed 0 and low speed communication between agents. In the present embodiment, itis contemplated that some agents coupled to cable 20 may only be capable of low speed communication, while other agents may communicate at both high and low speed. Moreover, it is further assumed that the agents, such as personal computer (PC) 15 and work station 16 are utilizing different central processing units (CPU) and are manufactured by different manufacturers.
Referring now to Figure 2, the present invention utilizes predefined message ~frames~ (also referred to as ~packets~) for a handshake protocol known as a request to send (RTS) and clear to send (CTS). In the art, a ~frame~ typically refers to a plurality of bytes comprising a packet. The RTS/CTS packet includes a preamble consisting of two or more synchronization (~flag~) bytes 25 and 26. Presently, each synchronization byte comprises the bits 0 1 1 1 1 1 1 0, as in the case of the network disclosedin Patents '786 and '902. Each synchronization byte 25 and 26 permit receiving data processing agents coupled to cable 20 to synchronize their receiving circuits, and to receive necessary clock information through the use of FM-0 encoding. Following the synchronization bytes 25 and 26, is an eight bit destination address 30 which specifies the address of the receiving data .917 - 7-JJ~
processing agent for which the frame is intended. A source address 32 comprises an eight bit address of the data processing agent transmitting the packet. A control character 36 follows the source address 32, and specifies the type of frame which is transmitted through the use of various control character codes, as will be described. In the presently preferred embodiment, the control character 36 may designate whether the communication between agents coupled to bus 20 is to be conducted at high speed or at low specd.
The control character 36 is followed by two eight bit octets or bytes of cyclic redundancy code (CRC) 38 and 40, which, in the presently preferred embodiment utilizes the standard CRC-CCITT polynomial (as does the system of Patents '786 and '902). The CRC bytes 38 and 40 are followed by an eight bit synchronization flag trailer 42, and an abort sequence 46 which is used to delineate the end of the packet to agents coupled to cable 20.
Referring now to Figure 4, the present invention's low speed data packet is illustrated. As in the case of the RTS/CTS packet of Figure 2, the low speed data packet includes two eight bit flags 50 and 52, as well as a destination address 54, source address 56, and control character 60.
Following control character 60, is a multibyte data field 62 which may contain raw data, messages, commands, and the like to be transmitted between the agents coupled to cable 20. As illustrated, the low speed data packet further includes two eight bit bytes of cyclic redundancy code (CRC) 64 and 68, a closing flag 69, as well as an abort sequence 70. It will be appreciated that the low speed data packet of Figure 4 is substantially the same packet as illustrated in Figure 3 of Patents '786 and '902.
2s Referring now to Figure 5, the present invention's unique high speed data packet is illustrated. The high speed data packet inclucles synchronization flags 75 and 78 which are followed by a ~dummy~ destination e,~77.s q47 -8-~JB/~nm address 80. A ~dummy~ source address 82 follows the ~ummy~ destinatJon address 80, as illustrated in the Figure. The present invention utilizes the ~dummy~ destination and source addresses (where the addresses used comprise either illegal characters, or non-existent addresses) in order to be 5 compatible with the local area network protocol disclosed in Patents 786 and '902. Since the present invention is an improvement upon, and compatible with, the LAN of patents '786 and '902, and permits data processing agents which utilize only the protocols disclosed in these patents to be coupled to cable 20 of the present invention, the ~dummy~ addresses are required to 10 provide a proper notification to such agents (not utilizing the teachings of the present invention) that cable 20 is in use. In accordance with the methods of the present invention, prior to the complete transmission of the ~dummy~ source address 82, the transmitting agent switches to a high speed data transfer rate (presently 768 kilobits per second) and transmits three consecutive flag bytes 84, 86, and 90. A legitimate destination address 100 follows flag byte 90, as well as a legitimate source address 102 and a control character 104.
Following the control character 104 are one or more bytes of data 106, in the form of raw data, commands, and the like. A two byte CRC code 108 and 110 follows data 106. Following CRC 110 is a flag byte 112. In accordance with 20 the teachings of the present invention, subsequent to the transmission of flag byte 112 the transmitting agent switches to a low speed (presently 230.4 hlobits per second) and transmits an optional flag 113 and a final abort sequence 114. For those agents able to communicate only in accordanoe with the teachings of patents '786 and '902, the transmission of flags 75 and 78, 25 dummy destination address 80 and dummy source address 82, acts as a notification to those agents that cable i20 is in use. Subsequent bytes (flags 84, 86, 90, destination address 100, source address 102, control character 104, B~s.947 _9 JJB/crnm data 106, CRCs 108 and 110, and flag 112) ars unintelligibls to agents utilizingonly the teachings of the '786 and '902 patents. However, the transmission of the abort sequence 114 at the low speed is understandable to those agents operating only under the teachings of the '786 and '902 patents, and indicates 5 that the cable 20 is no longer in use.
Referring now to Figure 6, each agent coupled to cable 20 maintains a status table for all other agents coupled to the cable. The status table entry for each other agent includes an active bit 120, a high speed bit 122, low speed bit 124, as well as an error history register 126 (presently five10 bits) which is updated to keep track of successful high speed communications as well as communications resulting in errors. When an agent is initially coupled to cable 20, a self assigned address sequence is followed in order to assign an address on the cable 20 to the agent (see the methodology disclosed in U.S. patent 4,689,786). For all status table entries, the initial condition for the active, high speed, low speed, and last five high speed error bits is clear, equivalent to no activity since nothing is known about the speed capability of the other agents on cable 20, and no error history exists.
Each attempt made by a transmitting agent to send data to a receiving agent results in the active bit 120 being set (high) by the transmitting 20 agsnt. In addition, each tims a packet is successfully received from an agent, ths receiving agent also sets the active bit 120. In the presently preferred embodiment, a receive with an error does not result in the setting of active bit120. The setting of active bit 120 simply means that another agent (the transmitting agent) is now known to exist at the source address defined by the 25 received packet. However, no other capabilities of the sending agent are known. In addition, in the presently preferred embodiment, an aging timer is provided (presently set at two minutes) such that ths entire status table is ~s W7 -10-JJE/~
examined for each agent after a predetermined period of bme (X). If the active bit 120 for an agent is set, it is then cleared after the predetermined time X has elapsed. If both the active bit 120, high speed bit 122 and low speed bit 124 are set (meaning that the agent at that address is active, high speed capable 5 but using low speed), the low speed bit 124 is also cleared by the aging timer.
If the active bit 120 for an agent is clear, meaning that there have been no packets sent to, or received from the agent for that address during the predetermined time period (X), the agent's entry is cleared completely, including its error history inforrnation in error history register 126. It will be 10 appreci~te~ that this is equivalent to removing the agent's entry from the table.
Accordingly, normal activity between one agent and another will keep its the status table entry active, but a prolonged period of silence will cause the information stored in the status table for a particular agent to be discarded.
Since the network disclosed in U.S. patent 4,689,786 perrnits the dynamic reallocation of addresses (by for example, removing an agent from cable 20 and reconnecting at another location, or at a later time), the information in the status table must be continually revised in order to keep it valid.
The setting of high speed bit 122 indicates that the agent at the respective address is capable of communicating at high speed using the 20 protocol of the present invention. The high speed bit 122 is set upon the successful reception of an RTS or CTS packet in which the control character 36 comprises a code indlcating that the data transfer couW be at high speed lsee Flgure 3: presently the control values are 8CH for an RTS, and 85H (or 8DH in response to an 8CH RTS) for a CTS], regardless of the actual data 25 speed of the transmission. In other words, if an agent requests to send data to another agent at high speed, and the receiving agent understands the request, both agents must have high speed capability. The high speed bit 122 is also S.~7 JJB/cmm set provisionally in the case D~ the first time when an attempt is made to send to an agent whose status is unknown (both the high speed bit 122 and low speed bit 124 being clear). If an attempt fails, then the high speed bit 122 is cleared, the low speed bit 124 is set, and the transmitting agent makes another attempt to s contact the receiving agent.
The low speed bit 124 indicates that the agent at the essoci~ted address should be communicated with using low speed. If the high speed bit 122 is clear, and the low speed bit 124 is set, this indicates that the ~ssoci~ted agent may only bs communicated with at low speed. If the high speed bit 122 is o set, and the low speed bit 124 is set, this state indicates that excessive errors have been detected in high speed data packets originating from this agent, and therefore, low speed communication must be used. The low speed bit 124 is set by a receiving agent if it receives an RTS packet requesting to send data atlow speed from a transmitting agent (a so called bro~dc~st ~packet~ is always sent at low speed in accordance with the teachings of the present invention, and therefore the receipt of a bro~dc~st packet does not result in the setting of the low speed bit 124). The low speed bit 124 is cleared if a receiving agent (capable of high speed) receives a packet with a high speed RTS control character 36. The low speed bit 124 is also set after there has been detected 20 an error in a high speed data packet, if there have been more than a predetermined number of errors in the last N high speed data frames (presently if there have been more than three errors within the last six high speed frames).
The low speed bit 124 is also cleared by the aging timer in the case where the high speed bit 122 is set. The clearing of the low speed blt 124 in this fashion25 results in a periodic attempt by the transmitting a~ent to use high speed. The low speed bit 124 is also set if the first attempt to send at high speed to an unl~noJJn a~ent fails.
?47 -1 2-JJB~
For each agent entry in the status table there is a history of the success/failure of the last N high speed data frames received. This histo~ is recorded by the error history bit register 126. Only frames in which the data actually was sent at high speed are counted by the register, and the only errorss which are counted are those in the high speed frames. Receiving an error in a high speed data frame results in the error register 126 being checked, and if there have been more than a predetermined number of errors in the last N
frames, the low speed bit 124 is set, as discussed above. Referring now to Flgure 7, the sequence of operations which a transmitting agent performs to 10 transmit data to a receiving agent on cable 20 as illustrated. An agent (for example, work station 16) desiring to transmit data to another agent [for example, personal computer (PC)] 17 over cable 20 initially transmits a request to send (RTS) low speed data packet (see Figure 2) to the receiving agent (in the present example PC17). In accordance with the teachings of the present 1S invention, if the transmitting agent is capable of high speed, it will initially attempt to establish communication with the receiving agent at high speed if thespeed capability of the receiving agent is not known. (If the speed of the receiving agent is known, then that speed is used.) In accordance with the presently preferred embodiment, the transmitting agent, work station 16, will 20 utilize a value of 8C (hexidecimal) for control character 36, thereby indicating to the receiving agent, PC 17, that the communication request is for a high speed data transfer. It will be noted, however, that the RTS packet itself is transmitted by the lrans",illing agent is sent at low speed (presently 230.4 kilobits per second). Subsequent to the transmission of the RTS packet, the 2s transmitting agent waits an inter-frame gap (IFG) time period, forthe receipt of a clear to send (CTS) packet transmitted by the receiving agent (PC 17 in the present example), also at low speed. In accordance with the local area JJB/cmm network disclosed in U.S. patents '786 and '902, a transmitting agent must receive a CTS packet within the IF G period to complete the initial handshake protocol for data transfer.
If the transmitting agent does not receive a CTS packet over cable 5 20 from the receiving agent within the IF G period, this condition may be the result of either an error on cable 20, or altematively, that the receiving agent is incapable of utilizing the control character 36 requesting high speed communication. This situation- may exist in those cases where agents incorporating the teachings of the present invention are coupled to a cable or 10 other medium comprising a local area network as disclosed in U.S. patents '786 and '902, whose agents do not have the high speed capabilities of the present invention as disclosed herein. In any case, the failure to receive a CTS is treated as a collision, and the sending agent follows the collision algorithm, as disclosed in U.S. Patents '786 and '902, and retries the RTS.
As illustrated in Figure 7, if the speed capability of the receiving agent was unknown, a failure to receive a CTS packet within the IFG period after retrying for the maximum number of collisions results in the retransmission of an RTS packet by the transmitting agent at low speed, with a control character 36 which requests a low speed data exchange. As shown, the 20 transmitting agent once again waits to receive a CTS packet from the receiving agent within the IFG period. In the event that a CTS packet is received within the IFG period, the transmitting agent generates and transmits a low speed data packet (see Figure 4) to the receiving agent. However, if a CTS packet is not received by the transmitting agent, despite the request for a low speed 25 communication, then the transmitting agent proceeds to execute a collision adjustment sequence of operations ~isclosed in U.S. patents '786 and '902.
Upon the successful transmission of the low speed communication, the data 82225.947 -1 4-JJE/~. .
transfer is complete, and the status table entry is set to low speed (i.e., low speed bit set and high speed bit clear). However, continued failures results in a seneral error condition (possibly the result of a broken cable rendering communication physically impossible), and the status table entry is set to s speed unknown (i.e., both low speed and high speed bits cleared). If the initial anempt to send at high speed succeeds, and the receiving agent retums a CTS, then the status table entry is set to high speed (high speed bit set, low speed bit clear) and the data packet is sent at the speed appropriate to the CTS.
0 Re~erring now to Figure 8, the sequence of operations completed by a receiving agent is illustrated in flow chart form. Assume for sake of example that PC 15 transmits an RTS packet (in accordance with the sequence of steps illustrated in Figure 7) to work station 16 (see Figure 1).
Upon receipt of the RTS packet transmitted by work station 16, the receiving agent (PC 15) examines control character 36 of the RTS packet to determine whether or not a high speed data transmission is requested. if the transmitting agent (work station 16) requests only low speed communication (presently represented by a control character of 84H), the receiving agent marks its statustable entry as low speed, and transmits a CTS packet having a control character 36 which represents an acknowledgement for low speed communication (presently an 85H). The receiving agent then awaits the receipt of a low speed d~ta packet (see Figure 4) within the IFG period, and if received, the data communication is completed. In the event that a low speed data packet is not received within the IFG period, the receiving agent recovers 2s and awaits the arrival of the next RTS. (See U.S. patents '786 and '902 for a description of the subsequent retry sequence of operations).
~7~.917 -1 6-~B/cmm ~ 338220 In the evsnt the RTS packet requests high speed data communi-cation, the receiving agent marks its status table entry as high speed, and determines whether or not it will receive at high speed. If the particular receiving agent is incapable of receiving and transmitting at high speed then 5 the RTS for high speed will be ignored. If the receiving agent is capable of transmitting and receiving at high speed, then the receiving agent determines ifthe slow down timer has been set. The present invention includes the use of a slow down timer which is set by the receiving agent for a period of X seconds after an error has occurred in the receipt of a previous data packet. For lO example, if receiving agent PC 15 experienced an error in the previous packetreceived from transmitting agent work station 16, the receiving agent sets an internal slow down timer which results in a low speed CTS packet being retumed for any RTS packets received within the predetermined time period. It will be appreciated, that the effect of the slow down timer is to force communication between transmitting agents and the particular receiving agent to be conducted at low speed during the predetermined time period.
In the event that the slow down timer has not been set, then the receiving agent (PC 15) transmits a CTS packet to the transmitting agent with the control character indicating that high speed communication is to proceed.
20 The receiving agent then waits to receive a high speed data packet (see Figure 5), which if successfully received within the IFG period, terminates the communication between ~he transmitting and receiving agents and the error history register is updated. In the event that a valid high speed data packet isnot received within the IFG period, or the packet received is in error, the 25 receiving agent updates the error history register 126, enables the low speedslow down timer, and compares the number of high speed errors in the last N
high speed packets to a threshold M. If the number exceeds the threshold, the ~ q17 -1 6-JJB/cmm status table entry for that agent is marked as use low speed (i.e., its low speed bit is set). The receiving agent then awaits the receipt of any subsequent RTS
packet.
Accordingly, apparatus and methods have been disclosed 5 having particular utility for use in a local area network to permit both high speed and low speed communication among a variety of agents. The present invention's methods and apparatus are compatible with existing local area networks such as the network described in U.S. Patents Nos. '786 and '902, but may be equally utilized in conjunction with other network protocols. Although 0 the present invention has been described with reference to Figures 1-8, it will be apparent to one skilled in the art that the present invention has utility far exceeding that disc~osed in the figures. It is contemplated that many changes and modifications may be made, by one of ordinary skill in the art, without departing from the spirit and scope of the invention as disclosed herein.
R~.917 JJB/cmm
0 It is common to utilize a local area network for the transfer of data and commands between a plurality of data processing devices, such as for example, computer work stations, personal computers, printers, memories and the like. So called ~Local Area Networks~ (LANs) were developed to connect a collection of computers, work stations, terminals, and other peripheral devices, typically in the same building, and permit each of these devices to communicate with devices attached to other networks. By having different data processing resources perform different tasks, distributed computing provides increased efficiency and power in an overall data processing system. Most local area networks utilize their own high band width cable to permit datagram service between the various devices coupled to the LAN. The most common transmission media for carrier sense local area networks are co~ cable, t risted pair and fiber opt,ics. A variety of cable topologies are possible using a local area network, such as by way of example, linear, spine, tree, ring and segmented topologies.
In the personal computer market, local area networks havs become quite popular as a means for providing distributed processing and communication between personal computers, work stations and other data R~.9 17 JJstcmm ~
processing resources. One such local area network is described in U.S.
Patents No. 4,689,786, issued August 25, 1987,and 4,661,901, issued April 28, 1987, both owned by Apple Computer, Inc. in Cuperbno, California.
The local area network disclosed in U.S. Patent No. 4,689,786 and 4,661,902 5 (hereinafter~the '786 and '902 patents") provide apparatus and methods for transferring data along the local area network between data pr~cessing agents.
Each agent coupled to the LAN of U.S. Patents Nos. '786 and '~02 follows a protocol for the self assignment of an address on the LAN. This network has become widely used for networking personal computers within office 10 environments and is known as the ~Appletalknd~ network. In practice, Appletalk~ operates at a speed of 230.4 kilobits per second.
As will be described, the present invention comprises improved apparatus and methods to boost the speed of communication along a local area network, and in particular, a network of the type disclosed in U.S. Patents '786and '902. Utilizing the teachings of the present invention, the speed of an AppletalklM local area network may be increased by a factor of 3.33. In addition, the present invention provides both high speed, as well as low speed, data communication along a LAN between various typ,es of computers, work stations, printers, disk drives and other data processing agents. The present 20 invention provides a high speed and reliable local area network heretofore unknown in the prior art.
P~5.~17 -2-JJB/cmm SUMMARY OF THE INVENTION
A local area. network is disclosed including apparatus and methods for transmitting data between a plurality of data processing resources 5 (agents) coupled to a cable. An agent desiring to send data to a receiving agent transmits a request to send (RTS) data packet which includes a control character requesting either high or low speed data communication. Utilizing the teachings of the present invention, absent other predefined conditions a transmitting agent capable of high speed communication requests a high speed 0 data exchange with the receiving agent. The RTS data packet itself is transmitted at low speed. Upon receiving the RTS packet, the receiving agent must transmit a clear to send (CTS) packet to the transmitting agent within a predetermined time after the receipt of the RTS packet. The CTS packet also includes a control character which either confirms that the data exchange will take place at high speed, or alternatively, a control character which requires atransmitting ager~t to use the low speed data rate. The transmitting agent, uponreceipt of the CTS packet, generates and transmits a data packet to the receiving agent at either a high speed or low speed, depending upon the value of the control character within the CTS packet. The present invention further 20 includes a status table maintained by each agent for tracking the address andcommunication capability of other agents coupled to the cable. The status table maintained by eacl~ agent further includes an error history register for each other agent in which is maintained the error status of the last N high speed data packet communications with that agent. In the event the number of errors 25 over N past high speed data communications from a given agent exceed a predetermined threshold value, the receiving agent requires that that agent communicate with it at low speed. In addition, if the receiving agent detects an P~5.~ 17 -3-J Ir'/~ .
error in a high speed data packet transmitted to it, the reoeiving agent enablesa slow down timer which, for a predetermined number of seconds, requires all transmitting agents in communication with the receiving agent operate at low speed. Accordingly, the present invention provides a method for operating a local area network at high speed for those agents capable of high speed, and at low speed for those agents capable of only low speed communication.
8~.9 ~7 -4 -JJB/crnm RRIEF DESCRIPTION OF TH~ DRAWINGS
FIGURE 1 illustrates a local area network utilizing the teachings of the present invention.
FIGURE 2 illusl-dtes the frame format utilized by the present invention for a request to send (RTS) and clear to send (CTS) message packet.
FIGURE 3 illustrates the present invention's control character 10 allocation for use in RTS and CTS message packets to provide both low speed and high speed data communication along a local area network.
FIGURE 4 illustrates the frams format for a low speed data packet utilizing the teachings of the present invention.
FIGURE 5 illustrates the frame format for a high speed data packet utilized by the present invention.
FIGURE 6 conceptually illustrates the present invention's use of 2C a status table for each agent coupled to the local area network.
FIGURE 7 is a flow chart illustrating the sequence of operations completed by a transmitting agent utilizing the teachings of the present invention.
FIGURE 8 is a flow chart illustrating the sequence of operations by a rsceiving agent utilizing the teachings of the pressnt invsntion.
82225.947 . _5.
JJB/cmm nETAILED DESCRIPTION OF THF INVFNTION
A local area network including apparatus and methods for transferring data between a plurality of data processing resources coupled to a s common cable is disclosed. In the following description, for purposes of explanation, specific numbers, bytes, registers, aWresses, times, signals and data message formats, etc. are set forth in order to provide a thorough understanding of the present invention. However, it will be apparent to one skilled in the art that the present invention may be practiced without these 0 specific details. In other instances, well known circuits and devices are shown in block diagram form in order not to obscure the present invention unnecessarily.
Referring to Figure 1, the present invention may include a plurality of data processing devices identified generally by the numerals 15 through 18 as well as peripheral devices, such as printer 19, or other devices, such as global disk drives, modems, and the like. For purposes of this disclosure and Specification, all data processing and peripheral devices which are coupled to the present invention's local area network are collectively referred to as ~agents~. As shown, data processing devices 15, 20 16, 17, 18 and printer 19 are interconnected for data transfer to one another by a common cable 20. The various devices are coupled to cable 20 using well known technj~ues and circuits. Cable 20 is appropriately terminated to eliminate signal reflections. It will be appreciated that cable 20 may comprise any shared media, such as co~ cable, fiber optics, radio channel, twisted 25 pair and the like. Since, in the present embodiment, the agents are passivelycoupled to cable 20, a failure of an agent will not disrupt communication over cable 20. For purposes of this Specification, the present invention is described 82225.947 -6-JJr~ .. .
.
generally utilizing the structure, protocols, and methods disclosed in U.S.
Patent 4,689,786, issued on August 25, 1987, and U.S. Patent No. 4,661,902, issued April 28, 1987. However, it will be appreciated by one skilled in the artthat the present invention has application beyond the improvements disclosed herein relative to the network described in the '786 and '902 patents.
As will be described, the present invention provides a local area networlc which permits synchronous serial communication and data transfer between data processing devices 15 through 1 8, and other peripheral devices, such as printer 19, utilizing protocols which permit both high speed 0 and low speed communication between agents. In the present embodiment, itis contemplated that some agents coupled to cable 20 may only be capable of low speed communication, while other agents may communicate at both high and low speed. Moreover, it is further assumed that the agents, such as personal computer (PC) 15 and work station 16 are utilizing different central processing units (CPU) and are manufactured by different manufacturers.
Referring now to Figure 2, the present invention utilizes predefined message ~frames~ (also referred to as ~packets~) for a handshake protocol known as a request to send (RTS) and clear to send (CTS). In the art, a ~frame~ typically refers to a plurality of bytes comprising a packet. The RTS/CTS packet includes a preamble consisting of two or more synchronization (~flag~) bytes 25 and 26. Presently, each synchronization byte comprises the bits 0 1 1 1 1 1 1 0, as in the case of the network disclosedin Patents '786 and '902. Each synchronization byte 25 and 26 permit receiving data processing agents coupled to cable 20 to synchronize their receiving circuits, and to receive necessary clock information through the use of FM-0 encoding. Following the synchronization bytes 25 and 26, is an eight bit destination address 30 which specifies the address of the receiving data .917 - 7-JJ~
processing agent for which the frame is intended. A source address 32 comprises an eight bit address of the data processing agent transmitting the packet. A control character 36 follows the source address 32, and specifies the type of frame which is transmitted through the use of various control character codes, as will be described. In the presently preferred embodiment, the control character 36 may designate whether the communication between agents coupled to bus 20 is to be conducted at high speed or at low specd.
The control character 36 is followed by two eight bit octets or bytes of cyclic redundancy code (CRC) 38 and 40, which, in the presently preferred embodiment utilizes the standard CRC-CCITT polynomial (as does the system of Patents '786 and '902). The CRC bytes 38 and 40 are followed by an eight bit synchronization flag trailer 42, and an abort sequence 46 which is used to delineate the end of the packet to agents coupled to cable 20.
Referring now to Figure 4, the present invention's low speed data packet is illustrated. As in the case of the RTS/CTS packet of Figure 2, the low speed data packet includes two eight bit flags 50 and 52, as well as a destination address 54, source address 56, and control character 60.
Following control character 60, is a multibyte data field 62 which may contain raw data, messages, commands, and the like to be transmitted between the agents coupled to cable 20. As illustrated, the low speed data packet further includes two eight bit bytes of cyclic redundancy code (CRC) 64 and 68, a closing flag 69, as well as an abort sequence 70. It will be appreciated that the low speed data packet of Figure 4 is substantially the same packet as illustrated in Figure 3 of Patents '786 and '902.
2s Referring now to Figure 5, the present invention's unique high speed data packet is illustrated. The high speed data packet inclucles synchronization flags 75 and 78 which are followed by a ~dummy~ destination e,~77.s q47 -8-~JB/~nm address 80. A ~dummy~ source address 82 follows the ~ummy~ destinatJon address 80, as illustrated in the Figure. The present invention utilizes the ~dummy~ destination and source addresses (where the addresses used comprise either illegal characters, or non-existent addresses) in order to be 5 compatible with the local area network protocol disclosed in Patents 786 and '902. Since the present invention is an improvement upon, and compatible with, the LAN of patents '786 and '902, and permits data processing agents which utilize only the protocols disclosed in these patents to be coupled to cable 20 of the present invention, the ~dummy~ addresses are required to 10 provide a proper notification to such agents (not utilizing the teachings of the present invention) that cable 20 is in use. In accordance with the methods of the present invention, prior to the complete transmission of the ~dummy~ source address 82, the transmitting agent switches to a high speed data transfer rate (presently 768 kilobits per second) and transmits three consecutive flag bytes 84, 86, and 90. A legitimate destination address 100 follows flag byte 90, as well as a legitimate source address 102 and a control character 104.
Following the control character 104 are one or more bytes of data 106, in the form of raw data, commands, and the like. A two byte CRC code 108 and 110 follows data 106. Following CRC 110 is a flag byte 112. In accordance with 20 the teachings of the present invention, subsequent to the transmission of flag byte 112 the transmitting agent switches to a low speed (presently 230.4 hlobits per second) and transmits an optional flag 113 and a final abort sequence 114. For those agents able to communicate only in accordanoe with the teachings of patents '786 and '902, the transmission of flags 75 and 78, 25 dummy destination address 80 and dummy source address 82, acts as a notification to those agents that cable i20 is in use. Subsequent bytes (flags 84, 86, 90, destination address 100, source address 102, control character 104, B~s.947 _9 JJB/crnm data 106, CRCs 108 and 110, and flag 112) ars unintelligibls to agents utilizingonly the teachings of the '786 and '902 patents. However, the transmission of the abort sequence 114 at the low speed is understandable to those agents operating only under the teachings of the '786 and '902 patents, and indicates 5 that the cable 20 is no longer in use.
Referring now to Figure 6, each agent coupled to cable 20 maintains a status table for all other agents coupled to the cable. The status table entry for each other agent includes an active bit 120, a high speed bit 122, low speed bit 124, as well as an error history register 126 (presently five10 bits) which is updated to keep track of successful high speed communications as well as communications resulting in errors. When an agent is initially coupled to cable 20, a self assigned address sequence is followed in order to assign an address on the cable 20 to the agent (see the methodology disclosed in U.S. patent 4,689,786). For all status table entries, the initial condition for the active, high speed, low speed, and last five high speed error bits is clear, equivalent to no activity since nothing is known about the speed capability of the other agents on cable 20, and no error history exists.
Each attempt made by a transmitting agent to send data to a receiving agent results in the active bit 120 being set (high) by the transmitting 20 agsnt. In addition, each tims a packet is successfully received from an agent, ths receiving agent also sets the active bit 120. In the presently preferred embodiment, a receive with an error does not result in the setting of active bit120. The setting of active bit 120 simply means that another agent (the transmitting agent) is now known to exist at the source address defined by the 25 received packet. However, no other capabilities of the sending agent are known. In addition, in the presently preferred embodiment, an aging timer is provided (presently set at two minutes) such that ths entire status table is ~s W7 -10-JJE/~
examined for each agent after a predetermined period of bme (X). If the active bit 120 for an agent is set, it is then cleared after the predetermined time X has elapsed. If both the active bit 120, high speed bit 122 and low speed bit 124 are set (meaning that the agent at that address is active, high speed capable 5 but using low speed), the low speed bit 124 is also cleared by the aging timer.
If the active bit 120 for an agent is clear, meaning that there have been no packets sent to, or received from the agent for that address during the predetermined time period (X), the agent's entry is cleared completely, including its error history inforrnation in error history register 126. It will be 10 appreci~te~ that this is equivalent to removing the agent's entry from the table.
Accordingly, normal activity between one agent and another will keep its the status table entry active, but a prolonged period of silence will cause the information stored in the status table for a particular agent to be discarded.
Since the network disclosed in U.S. patent 4,689,786 perrnits the dynamic reallocation of addresses (by for example, removing an agent from cable 20 and reconnecting at another location, or at a later time), the information in the status table must be continually revised in order to keep it valid.
The setting of high speed bit 122 indicates that the agent at the respective address is capable of communicating at high speed using the 20 protocol of the present invention. The high speed bit 122 is set upon the successful reception of an RTS or CTS packet in which the control character 36 comprises a code indlcating that the data transfer couW be at high speed lsee Flgure 3: presently the control values are 8CH for an RTS, and 85H (or 8DH in response to an 8CH RTS) for a CTS], regardless of the actual data 25 speed of the transmission. In other words, if an agent requests to send data to another agent at high speed, and the receiving agent understands the request, both agents must have high speed capability. The high speed bit 122 is also S.~7 JJB/cmm set provisionally in the case D~ the first time when an attempt is made to send to an agent whose status is unknown (both the high speed bit 122 and low speed bit 124 being clear). If an attempt fails, then the high speed bit 122 is cleared, the low speed bit 124 is set, and the transmitting agent makes another attempt to s contact the receiving agent.
The low speed bit 124 indicates that the agent at the essoci~ted address should be communicated with using low speed. If the high speed bit 122 is clear, and the low speed bit 124 is set, this indicates that the ~ssoci~ted agent may only bs communicated with at low speed. If the high speed bit 122 is o set, and the low speed bit 124 is set, this state indicates that excessive errors have been detected in high speed data packets originating from this agent, and therefore, low speed communication must be used. The low speed bit 124 is set by a receiving agent if it receives an RTS packet requesting to send data atlow speed from a transmitting agent (a so called bro~dc~st ~packet~ is always sent at low speed in accordance with the teachings of the present invention, and therefore the receipt of a bro~dc~st packet does not result in the setting of the low speed bit 124). The low speed bit 124 is cleared if a receiving agent (capable of high speed) receives a packet with a high speed RTS control character 36. The low speed bit 124 is also set after there has been detected 20 an error in a high speed data packet, if there have been more than a predetermined number of errors in the last N high speed data frames (presently if there have been more than three errors within the last six high speed frames).
The low speed bit 124 is also cleared by the aging timer in the case where the high speed bit 122 is set. The clearing of the low speed blt 124 in this fashion25 results in a periodic attempt by the transmitting a~ent to use high speed. The low speed bit 124 is also set if the first attempt to send at high speed to an unl~noJJn a~ent fails.
?47 -1 2-JJB~
For each agent entry in the status table there is a history of the success/failure of the last N high speed data frames received. This histo~ is recorded by the error history bit register 126. Only frames in which the data actually was sent at high speed are counted by the register, and the only errorss which are counted are those in the high speed frames. Receiving an error in a high speed data frame results in the error register 126 being checked, and if there have been more than a predetermined number of errors in the last N
frames, the low speed bit 124 is set, as discussed above. Referring now to Flgure 7, the sequence of operations which a transmitting agent performs to 10 transmit data to a receiving agent on cable 20 as illustrated. An agent (for example, work station 16) desiring to transmit data to another agent [for example, personal computer (PC)] 17 over cable 20 initially transmits a request to send (RTS) low speed data packet (see Figure 2) to the receiving agent (in the present example PC17). In accordance with the teachings of the present 1S invention, if the transmitting agent is capable of high speed, it will initially attempt to establish communication with the receiving agent at high speed if thespeed capability of the receiving agent is not known. (If the speed of the receiving agent is known, then that speed is used.) In accordance with the presently preferred embodiment, the transmitting agent, work station 16, will 20 utilize a value of 8C (hexidecimal) for control character 36, thereby indicating to the receiving agent, PC 17, that the communication request is for a high speed data transfer. It will be noted, however, that the RTS packet itself is transmitted by the lrans",illing agent is sent at low speed (presently 230.4 kilobits per second). Subsequent to the transmission of the RTS packet, the 2s transmitting agent waits an inter-frame gap (IFG) time period, forthe receipt of a clear to send (CTS) packet transmitted by the receiving agent (PC 17 in the present example), also at low speed. In accordance with the local area JJB/cmm network disclosed in U.S. patents '786 and '902, a transmitting agent must receive a CTS packet within the IF G period to complete the initial handshake protocol for data transfer.
If the transmitting agent does not receive a CTS packet over cable 5 20 from the receiving agent within the IF G period, this condition may be the result of either an error on cable 20, or altematively, that the receiving agent is incapable of utilizing the control character 36 requesting high speed communication. This situation- may exist in those cases where agents incorporating the teachings of the present invention are coupled to a cable or 10 other medium comprising a local area network as disclosed in U.S. patents '786 and '902, whose agents do not have the high speed capabilities of the present invention as disclosed herein. In any case, the failure to receive a CTS is treated as a collision, and the sending agent follows the collision algorithm, as disclosed in U.S. Patents '786 and '902, and retries the RTS.
As illustrated in Figure 7, if the speed capability of the receiving agent was unknown, a failure to receive a CTS packet within the IFG period after retrying for the maximum number of collisions results in the retransmission of an RTS packet by the transmitting agent at low speed, with a control character 36 which requests a low speed data exchange. As shown, the 20 transmitting agent once again waits to receive a CTS packet from the receiving agent within the IFG period. In the event that a CTS packet is received within the IFG period, the transmitting agent generates and transmits a low speed data packet (see Figure 4) to the receiving agent. However, if a CTS packet is not received by the transmitting agent, despite the request for a low speed 25 communication, then the transmitting agent proceeds to execute a collision adjustment sequence of operations ~isclosed in U.S. patents '786 and '902.
Upon the successful transmission of the low speed communication, the data 82225.947 -1 4-JJE/~. .
transfer is complete, and the status table entry is set to low speed (i.e., low speed bit set and high speed bit clear). However, continued failures results in a seneral error condition (possibly the result of a broken cable rendering communication physically impossible), and the status table entry is set to s speed unknown (i.e., both low speed and high speed bits cleared). If the initial anempt to send at high speed succeeds, and the receiving agent retums a CTS, then the status table entry is set to high speed (high speed bit set, low speed bit clear) and the data packet is sent at the speed appropriate to the CTS.
0 Re~erring now to Figure 8, the sequence of operations completed by a receiving agent is illustrated in flow chart form. Assume for sake of example that PC 15 transmits an RTS packet (in accordance with the sequence of steps illustrated in Figure 7) to work station 16 (see Figure 1).
Upon receipt of the RTS packet transmitted by work station 16, the receiving agent (PC 15) examines control character 36 of the RTS packet to determine whether or not a high speed data transmission is requested. if the transmitting agent (work station 16) requests only low speed communication (presently represented by a control character of 84H), the receiving agent marks its statustable entry as low speed, and transmits a CTS packet having a control character 36 which represents an acknowledgement for low speed communication (presently an 85H). The receiving agent then awaits the receipt of a low speed d~ta packet (see Figure 4) within the IFG period, and if received, the data communication is completed. In the event that a low speed data packet is not received within the IFG period, the receiving agent recovers 2s and awaits the arrival of the next RTS. (See U.S. patents '786 and '902 for a description of the subsequent retry sequence of operations).
~7~.917 -1 6-~B/cmm ~ 338220 In the evsnt the RTS packet requests high speed data communi-cation, the receiving agent marks its status table entry as high speed, and determines whether or not it will receive at high speed. If the particular receiving agent is incapable of receiving and transmitting at high speed then 5 the RTS for high speed will be ignored. If the receiving agent is capable of transmitting and receiving at high speed, then the receiving agent determines ifthe slow down timer has been set. The present invention includes the use of a slow down timer which is set by the receiving agent for a period of X seconds after an error has occurred in the receipt of a previous data packet. For lO example, if receiving agent PC 15 experienced an error in the previous packetreceived from transmitting agent work station 16, the receiving agent sets an internal slow down timer which results in a low speed CTS packet being retumed for any RTS packets received within the predetermined time period. It will be appreciated, that the effect of the slow down timer is to force communication between transmitting agents and the particular receiving agent to be conducted at low speed during the predetermined time period.
In the event that the slow down timer has not been set, then the receiving agent (PC 15) transmits a CTS packet to the transmitting agent with the control character indicating that high speed communication is to proceed.
20 The receiving agent then waits to receive a high speed data packet (see Figure 5), which if successfully received within the IFG period, terminates the communication between ~he transmitting and receiving agents and the error history register is updated. In the event that a valid high speed data packet isnot received within the IFG period, or the packet received is in error, the 25 receiving agent updates the error history register 126, enables the low speedslow down timer, and compares the number of high speed errors in the last N
high speed packets to a threshold M. If the number exceeds the threshold, the ~ q17 -1 6-JJB/cmm status table entry for that agent is marked as use low speed (i.e., its low speed bit is set). The receiving agent then awaits the receipt of any subsequent RTS
packet.
Accordingly, apparatus and methods have been disclosed 5 having particular utility for use in a local area network to permit both high speed and low speed communication among a variety of agents. The present invention's methods and apparatus are compatible with existing local area networks such as the network described in U.S. Patents Nos. '786 and '902, but may be equally utilized in conjunction with other network protocols. Although 0 the present invention has been described with reference to Figures 1-8, it will be apparent to one skilled in the art that the present invention has utility far exceeding that disc~osed in the figures. It is contemplated that many changes and modifications may be made, by one of ordinary skill in the art, without departing from the spirit and scope of the invention as disclosed herein.
R~.917 JJB/cmm
Claims (46)
1. A method for transferring data on a data communication medium between a plurality of data processing devices, including a sending agent and a receiving agent, comprising the steps of:
said sending agent transmitting a first request to send RTS signal to said receiving agent coupled to said data communication medium at a first speed;
said receiving agent receiving said first signal and generating a second clear to send CTS signal, said second signal including an CTS control character corresponding to a speed for data transfer over said medium, said receiving agent transmitting said second signal on said medium to said sending agent;
said sending agent receiving said second signal and transmitting a data packet to said receiving agent at the speed which corresponds to said CTS control character;
whereby data is transferred between said sending and receiving agents coupled to said communication medium.
said sending agent transmitting a first request to send RTS signal to said receiving agent coupled to said data communication medium at a first speed;
said receiving agent receiving said first signal and generating a second clear to send CTS signal, said second signal including an CTS control character corresponding to a speed for data transfer over said medium, said receiving agent transmitting said second signal on said medium to said sending agent;
said sending agent receiving said second signal and transmitting a data packet to said receiving agent at the speed which corresponds to said CTS control character;
whereby data is transferred between said sending and receiving agents coupled to said communication medium.
2. The method as defined in claim 1, wherein said second signal is transmitted to said sending agent at said first speed.
3. The method as defined by claim 2, wherein said plurality of speeds includes a low and a high speed.
4. The method as defined by claim 3, wherein said first speed is said low speed.
5. The method as defined by claim 4, wherein said RTS
signal includes a RTS control character which corresponds to a requested speed for data transfer over said medium.
signal includes a RTS control character which corresponds to a requested speed for data transfer over said medium.
6. The method as defined by claim 5, wherein said RTS
control character in said RTS signal comprises a value corresponding to a high speed.
control character in said RTS signal comprises a value corresponding to a high speed.
7. The method as defined by claim 6, wherein if said receiving agent is capable of high speed data transfer, said CTS control character comprises a value corresponding to said high speed requested by said RTS control character.
8. The method as defined by claim 7, wherein if said receiving agent is only capable of said low speed, said CTS
control character comprises a value corresponding to said low speed despite said high speed requested by said RTS
control character.
control character comprises a value corresponding to said low speed despite said high speed requested by said RTS
control character.
9. The method as defined by claim 8, wherein said sending agent transmits said data packet to said receiving agent at said low speed.
10. The method as defined by claim 7, wherein said sending agent transmits said data packet to said receiving agent at said high speed.
11. The method as defined by claim 7, wherein each of said agents are assigned a unique address on said data communication medium.
12. The method as defined by claim 11, further including the step of said receiving agent maintaining a status table, said status table including at least one active bit, said active bit being set by said receiving agent upon its receipt of said RTS signal, the setting of said active bit indicating that said sending agent is active at its unique address on said medium.
13. The method as defined by claim 12, wherein said status table further includes at least one high speed bit and at least one low speed bit, said high speed bit being set by said receiving agent upon the receipt of said RTS
signal if said RTS signal includes a control character having a value corresponding to high speed, the setting of said high speed bit indicating that said sending agent is capable of high speed data communication.
signal if said RTS signal includes a control character having a value corresponding to high speed, the setting of said high speed bit indicating that said sending agent is capable of high speed data communication.
14. The method as defined by claim 13, wherein said low speed bit is set by said receiving agent upon the receipt of said RTS signal if said RTS signal includes a control character having a value corresponding to low speed, the setting of said low speed bit resulting in said sending and receiving agent communicating over said medium only at said low speed.
15. The method as defined by claim 14, wherein said status table further includes error history register means for storing a value corresponding to the number of errors in the last N data communications between said sending and receiving agents at said high speed.
16. The method as defined by claim 15, further including slow down timer means coupled to said receiving agent for setting a temporary use low speed bit for a predetermined time X in the event of an error in data communications between said sending and receiving agents, thereby resulting in all communications to said receiving agent being at low speed.
17. The method as defined by claim 15, further including aging timer means coupled to said receiving agent for clearing said active, high speed and low speed bits in the event said bits are not re-set after a predetermined aging period of time N, such that all entries older than time M are cleared from said status table.
18. The method as defined by claim 15, further including the step of setting said low speed bit if said error history register means has recorded more than a predetermined number of errors in the last N high speed data communications, said low speed bit remaining set until said number of successful high speed data communications between said sending and receiving agents exceeds said predetermined number.
19. The Method as defined by claim 3, wherein said low speed data packet, includes:
a flag byte;
a destination address corresponding to the address of said receiving agent on said medium;
a source address corresponding to the address of said sending agent on said medium;
a datacontrol character;
a plurality of data bytes;
a cyclic redundancy code for detecting errors a flag byte;
a abort byte.
a flag byte;
a destination address corresponding to the address of said receiving agent on said medium;
a source address corresponding to the address of said sending agent on said medium;
a datacontrol character;
a plurality of data bytes;
a cyclic redundancy code for detecting errors a flag byte;
a abort byte.
20. The method as defined by claim 3, wherein said high speed data packet includes: at least one first flag byte; a dummy destination address; a dummy source address; at least one second flag byte; a destination address corresponding to the address of said receiving agent; a source address corresponding to the address of said sending agent; a data control character; a plurality of data bytes; a cyclic redundancy code for detecting errors; a third flag byte; an abort byte.
21. The method as defined by claim 20, wherein said dummy destination and source addresses comprise non-existent address on said communication medium.
22. The method as defined by claim 20, wherein said at least one first flag byte, said dummy destination address, at least a portion of said dummy source address, and said abort byte are transmitted at said low speed.
23. The method as defined by claim 22, wherein said second flag byte, said source address, said destination address, said data control character, said plurality of data bytes, said cyclic redundancy code, and said third flag byte are transmitted at said high speed.
24. In a data communication system having a communications medium coupled between a plurality data processing devices, including a sending agent and a receiving agent, an apparatus for transferring data between said agents, comprising:
transmitting means coupled to each agent to permit said sending agent to transmit a first request to send RTS
signal at a first speed from said sending agent to said receiving agent coupled to said communications medium;
receiving means coupled to each agent to permit said receiving agent to receive said first signal and generate a second clear to send CTS signal, said second signal including an CTS control character corresponding to a speed for data transfer over said medium, said receiving agent transmitting said second signal on said medium to said sending agent;
data packet generation means coupled to each agent to permit said sending agent receiving said second signal to generate and transmit a data packet to said receiving agent at the speed which corresponds to said CTS control character;
whereby data is transferred between said sending and receiving agents coupled to said communication medium.
transmitting means coupled to each agent to permit said sending agent to transmit a first request to send RTS
signal at a first speed from said sending agent to said receiving agent coupled to said communications medium;
receiving means coupled to each agent to permit said receiving agent to receive said first signal and generate a second clear to send CTS signal, said second signal including an CTS control character corresponding to a speed for data transfer over said medium, said receiving agent transmitting said second signal on said medium to said sending agent;
data packet generation means coupled to each agent to permit said sending agent receiving said second signal to generate and transmit a data packet to said receiving agent at the speed which corresponds to said CTS control character;
whereby data is transferred between said sending and receiving agents coupled to said communication medium.
25. The apparatus as defined in claim 24, wherein said second signal is transmitted to said sending agent at said first speed.
26. The apparatus as defined by claim 25, wherein said plurality of speeds includes a low and a high speed.
27. The apparatus as defined by claim 26, wherein said first speed is said low speed.
28. The apparatus as defined by claim 27, wherein said RTS signal includes a RTS control character which corresponds to a requested speed for data transfer over said medium.
29. The apparatus as defined by claim 28, wherein said RTS control character in said RTS signal comprises a value corresponding to a high speed.
30. The apparatus as defined by claim 29, wherein if said receiving agent is capable of high speed data transfer, said CTS control character comprises a value corresponding to said high speed requested by said RTS control character.
31. The apparatus as defined by claim 30, wherein if said receiving agent is only capable of said low speed, said CTS control character comprises a value corresponding to said low speed despite said high speed requested by said RTS
control character.
control character.
32. The apparatus as defined by claim 31, wherein said sending agent transmits said data packet to said receiving agent at said low speed.
33. The apparatus as defined by claim 30, wherein said sending agent transmits said data packet to said receiving agent at said high speed.
34. The apparatus as defined by claim 30, wherein each of said agents are assigned a unique address on said data communication medium.
35. The apparatus as defined by claim 34, further including status table means coupled to said receiving agent for maintaining a status table, said status table including at least one active bit, said active bit being set by said receiving agent upon its receipt of said RTS signal, the setting of said active bit indicating that said sending agent is active at its unique address on said medium.
36. The apparatus as defined by claim 35, wherein said status table further includes at least one high speed bit and at least one low speed bit, said high speed bit being set by said receiving agent upon the receipt of said RTS
signal if said RTS signal includes a control character having a value corresponding to high speed, the setting of said high speed bit indicating that said sending agent is capable of high speed data communication.
signal if said RTS signal includes a control character having a value corresponding to high speed, the setting of said high speed bit indicating that said sending agent is capable of high speed data communication.
37. The apparatus as defined by claim 36, wherein said low speed bit is set by said receiving agent upon the receipt of said RTS signal if said RTS signal includes a control character having a value corresponding to low speed, the setting of said low speed bit resulting in said sending and receiving agent communicating over said medium only at said low speed.
38. The apparatus as defined by claim 37, wherein said status table means further includes error history register means for storing a value corresponding to the number of errors in the last N data communications between said sending and receiving agents at said high speed.
39. The apparatus as defined by claim 38, further including slow down timer means coupled to said receiving agent for setting a temporary use low speed bit for a predetermined time X in the event of an error in data communications between said sending and receiving agents, thereby resulting in all communications to said receiving agent being at low speed.
40. The apparatus as defined by claim 38, further including aging timer means coupled to said receiving agent for clearing said active, high speed and low speed bits in the event said bits are not re-set after a predetermined aging period of time M, such that all entries older than time M are cleared from said status table.
41. The apparatus as defined by claim 38, wherein said low speed bit is set if said error history register means has recorded more than a predetermined number of errors in the last N high speed data communications, said low speed bit remaining set until said number of successful high speed data communications between said sending and receiving agents exceeds said predetermined number.
42. The apparatus as defined by claim 26, wherein said low speed data packet includes:
a flag byte;
a destination address corresponding to the address of said receiving agent on said medium;
a source address corresponding to the address of said sending agent on said medium;
a data control character;
a plurality of data bytes;
a cyclic redundancy code for detecting errors;
a flag byte;
a abort byte.
a flag byte;
a destination address corresponding to the address of said receiving agent on said medium;
a source address corresponding to the address of said sending agent on said medium;
a data control character;
a plurality of data bytes;
a cyclic redundancy code for detecting errors;
a flag byte;
a abort byte.
43. The apparatus as defined by claim 26, wherein said high speed data packet includes:
at least one first flag byte;
a dummy destination address;
a dummy source address;
at least one second flag byte;
a destination address corresponding to the address of said receiving agent;
a source address corresponding to the address of said sending agent;
a data control character;
a plurality of data bytes;
a cyclic redundancy code for detecting errors;
a third flag byte;
an abort byte.
at least one first flag byte;
a dummy destination address;
a dummy source address;
at least one second flag byte;
a destination address corresponding to the address of said receiving agent;
a source address corresponding to the address of said sending agent;
a data control character;
a plurality of data bytes;
a cyclic redundancy code for detecting errors;
a third flag byte;
an abort byte.
44. The apparatus as defined by claim 43, wherein said dummy destination and source addresses comprise non-existent address on said communication medium.
45. The apparatus as defined by claim 43, wherein said at least one first flag byte, said dummy destination address, at least a portion of said dummy source address, and said abort byte are transmitted at said low speed.
46. The apparatus as defined by claim 45, wherein said second flag byte, said source address, said destination address, said data control character, said plurality of data bytes, said cyclic redundancy code, and said third flag byte are transmitted at said high speed.
Applications Claiming Priority (2)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| US230,180 | 1988-08-09 | ||
| US07/230,180 US4884266A (en) | 1988-08-09 | 1988-08-09 | Variable speed local area network |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CA1338220C true CA1338220C (en) | 1996-04-02 |
Family
ID=22864233
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CA000597735A Expired - Fee Related CA1338220C (en) | 1988-08-09 | 1989-04-25 | Variable speed local area network |
Country Status (3)
| Country | Link |
|---|---|
| US (1) | US4884266A (en) |
| JP (1) | JP2767710B2 (en) |
| CA (1) | CA1338220C (en) |
Families Citing this family (31)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US7537167B1 (en) * | 1993-08-31 | 2009-05-26 | Broadcom Corporation | Modular, portable data processing terminal for use in a radio frequency communication network |
| US5428636A (en) * | 1993-05-03 | 1995-06-27 | Norand Corporation | Radio frequency local area network |
| DE4008727A1 (en) * | 1990-03-19 | 1991-09-26 | Rheydt Kabelwerk Ag | METHOD FOR TRANSMITTING DIFFERENT RATE DATA |
| ATE127988T1 (en) * | 1990-03-23 | 1995-09-15 | Siemens Ag | METHOD FOR SETTING UP VIRTUAL CONNECTIONS IN EXCHANGE FACILITIES WORKING IN AN ASYNCHRONOUS TRANSFER MODE. |
| US5448591A (en) * | 1990-06-24 | 1995-09-05 | Next, Inc. | Method and apparatus for clock and data delivery on a bus |
| JP2511591B2 (en) * | 1990-10-29 | 1996-06-26 | インターナショナル・ビジネス・マシーンズ・コーポレイション | Wireless optical communication system operating method and optical communication system |
| US6374311B1 (en) | 1991-10-01 | 2002-04-16 | Intermec Ip Corp. | Communication network having a plurality of bridging nodes which transmit a beacon to terminal nodes in power saving state that it has messages awaiting delivery |
| US7558557B1 (en) | 1991-11-12 | 2009-07-07 | Broadcom Corporation | Low-power messaging in a network supporting roaming terminals |
| US6407991B1 (en) | 1993-05-06 | 2002-06-18 | Intermec Ip Corp. | Communication network providing wireless and hard-wired dynamic routing |
| US6084867A (en) * | 1991-10-01 | 2000-07-04 | Intermec Ip Corp. | Apparatus and method of routing data in a radio frequency local area network |
| US6400702B1 (en) * | 1991-10-01 | 2002-06-04 | Intermec Ip Corp. | Radio frequency local area network |
| EP1246404B1 (en) | 1991-10-01 | 2006-03-22 | Broadcom Corporation | A radio frequency local area network |
| USRE39395E1 (en) | 1992-11-02 | 2006-11-14 | Negotiated Data Solutions Llc | Data communication network with transfer port, cascade port and/or frame synchronizing signal |
| USRE39116E1 (en) | 1992-11-02 | 2006-06-06 | Negotiated Data Solutions Llc | Network link detection and generation |
| EP0596648A1 (en) | 1992-11-02 | 1994-05-11 | National Semiconductor Corporation | Network link endpoint capability detection |
| JP2750315B2 (en) * | 1993-05-14 | 1998-05-13 | インターナショナル・ビジネス・マシーンズ・コーポレイション | Method of specifying identifier and computer system |
| US5631897A (en) * | 1993-10-01 | 1997-05-20 | Nec America, Inc. | Apparatus and method for incorporating a large number of destinations over circuit-switched wide area network connections |
| US5632016A (en) * | 1994-09-27 | 1997-05-20 | International Business Machines Corporation | System for reformatting a response packet with speed code from a source packet using DMA engine to retrieve count field and address from source packet |
| US6055576A (en) * | 1996-05-20 | 2000-04-25 | Intel Corporation | Access control to packet transfer based on key match stored in cable modem hardware unit |
| US6111890A (en) * | 1997-03-25 | 2000-08-29 | Level One Communications, Inc. | Gigabuffer lite repeater scheme |
| GB9714215D0 (en) * | 1997-07-04 | 1997-09-10 | Amp Italia | Data transmission method |
| US6285659B1 (en) * | 1997-09-10 | 2001-09-04 | Level One Communications, Inc. | Automatic protocol selection mechanism |
| MY127940A (en) * | 1998-05-22 | 2007-01-31 | Canon Kk | Data communication apparatus and method |
| US6094441A (en) * | 1998-10-30 | 2000-07-25 | Advanced Micro Devices, Inc. | Apparatus and method for controlling transmission parameters of home network stations transmitting on a telephone line medium |
| US6622264B1 (en) * | 1999-10-28 | 2003-09-16 | General Electric Company | Process and system for analyzing fault log data from a machine so as to identify faults predictive of machine failures |
| US6643818B1 (en) * | 1999-11-19 | 2003-11-04 | International Business Machines Corporation | Storing and using the history of data transmission errors to assure data integrity |
| US7099352B1 (en) * | 2001-01-03 | 2006-08-29 | Juniper Networks, Inc. | System, apparatus, and method for increasing resiliency in communications |
| US6868466B2 (en) * | 2001-09-27 | 2005-03-15 | Intel Corporation | Apparatus and method for packet ingress interrupt moderation |
| US7296085B2 (en) * | 2002-07-26 | 2007-11-13 | Avago Technologies Fiber Ip (Singapore) Pte Ltd | Multiple protocol handshaking between systems |
| US8745668B2 (en) * | 2011-05-09 | 2014-06-03 | Lg Electronics Inc. | Service system and method of providing service in digital receiver thereof |
| US8991704B2 (en) * | 2011-12-14 | 2015-03-31 | Intermec Ip Corp. | Snap-on module for selectively installing receiving element(s) to a mobile device |
Family Cites Families (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JPS58164354A (en) * | 1982-03-25 | 1983-09-29 | Nippon Telegr & Teleph Corp <Ntt> | Speed matching communication system |
| JPS6125348A (en) * | 1984-07-16 | 1986-02-04 | Nec Corp | Method for deciding and notifying communication speed of data communication network |
| JPS61101146A (en) * | 1984-10-24 | 1986-05-20 | Ricoh Co Ltd | Document forming communication terminal device |
| DE3586758T2 (en) * | 1985-04-30 | 1993-04-22 | Ibm | MODEM FOR CONTROLLING A MODEM NETWORK. |
| JPS62299148A (en) * | 1986-06-18 | 1987-12-26 | Nec Corp | Matching system for transmission speed |
| US4747100A (en) * | 1986-08-11 | 1988-05-24 | Allen-Bradley Company, Inc. | Token passing network utilizing active node table |
-
1988
- 1988-08-09 US US07/230,180 patent/US4884266A/en not_active Expired - Lifetime
-
1989
- 1989-04-25 CA CA000597735A patent/CA1338220C/en not_active Expired - Fee Related
- 1989-08-07 JP JP1202943A patent/JP2767710B2/en not_active Expired - Fee Related
Also Published As
| Publication number | Publication date |
|---|---|
| JP2767710B2 (en) | 1998-06-18 |
| JPH0290752A (en) | 1990-03-30 |
| US4884266A (en) | 1989-11-28 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CA1338220C (en) | Variable speed local area network | |
| CA1244959A (en) | Local area network with self assigned address method | |
| CA1265257A (en) | Local area network with carrier sense collision avoidance | |
| EP1484876B1 (en) | Full duplex flow control for ethernet networks | |
| JP3248348B2 (en) | Communication method and communication device | |
| JP2009112042A (en) | Enhanced polling method for preventing deadlock in radio communication system | |
| GB2351884A (en) | Data transmission method | |
| JPH07312597A (en) | Radio local area network system | |
| US6741566B1 (en) | Remote management ethernet network and device | |
| KR19990030284A (en) | Communication method and communication device | |
| JP3497885B2 (en) | Wireless LAN media access method | |
| JPH04296140A (en) | Method for coding a plurality of data frame | |
| US5163054A (en) | Method for data transmission using a modified high level data link control protocal | |
| JP4220208B2 (en) | Deterministic fieldbus and method of managing such a bus | |
| EP1317823B1 (en) | Method and system for transmit data blocking in a wireless communications network | |
| JP2001136172A (en) | Communication control method in communication network system and communication network system, and recording medium with communication control processing program recorded thereon | |
| US6286048B1 (en) | System and method for discovering relative states of processors | |
| US6996124B1 (en) | Mechanism to strip LARQ header and regenerate FCS to support sleep mode wake up | |
| JP3999738B2 (en) | Data rate negotiation method using mean square error technique | |
| Cisco | Troubleshooting Token Ring | |
| JPH11275102A (en) | Network system by power line, data transmission method and recording medium | |
| US20030120800A1 (en) | Network layer protocol | |
| JP3027800B2 (en) | Transmission control method and transmission control device in wireless LAN | |
| US7164681B2 (en) | Mechanism to strip LARQ header and preserve LARQ header in status frame | |
| EP1065831B1 (en) | Early preamble transmission |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| MKLA | Lapsed |