Abstract:
Data communication stations 10, 12, 14 are connected by way of a shared bus 15 common to all the communication stations. When two stations attempt to access the shared bus simultaneously, a conflict resolution method if used to determine which of the two stations is allowed access to the bus 15. Each station seeking access to the bus 15 serially transmits its address. The priority of the stations is determined, and the station with priority is given access to the bus 15.

Description:
This is a continuation of application Ser. No. 08/278,293, filed Jul. 21 1994 now abandoned. 
    
    
     TECHNICAL FIELD 
     This application relates to the field of data communication. 
     BACKGROUND OF THE INVENTION 
     In a peer-to-peer communication system, data communication equipment (DCE) are connected by way of a shared bus. A shared bus is common to all the communication devices. When a device desires to send data to another device on the shared bus, the device must wait until the shared bus is available. 
     It is possible that two devices will attempt to send data on the bus at the same time. An attempt to send data simultaneously is a &#34;contention&#34;. When data from two devices is in fact sent simultaneously, then a &#34;collision&#34; occurs. When that happens, the contention must be resolved. 
     One method of resolving the contention is the Carrier Sense Multiple Access with Collision Detection protocol, defined in the Institute of Electrical Engineers Standard (IEEE Std) 802.3. The IEEE Std. 802.3 facilitates common network access through transmission requirements, collision detection and a collision resolution procedure. 
     The IEEE Std. 802.3 requires that calls for devices with colliding transmission packets to wait for a random period of time. After the wait, the two devices begin transmitting again. 
     This method of collision avoidance has at least three problems. First, there is a possibility of recurring collisions, since no device is inhibited from transmitting during a collision. Second, since messages may be stopped in the middle of transmission, the messages may be corrupted. Third, there may be a delay in transmitting messages if a number of collisions occur. 
     A method of doing contention resolution eliminating recurring collisions and data corruption is thus highly desirable. 
    
    
     BRIEF DESCRIPTION OF DRAWINGS 
     FIG. 1 is a diagram of a communication system. 
     FIG. 2 is a flow chart showing the operation of a communication system. 
    
    
     DESCRIPTION OF THE PREFERRED EMBODIMENT 
     FIG. 1 shows an arrangement of a plurality of stations 10, 12, 14 (named DCE S 1 , DCE S 2  and DCE S n , respectively) coupled to a bus 15. Stations 10, 12, 14 could be, for example, analog modems, digital modems or an ISDN (integrated digital network) terminal adapter. Bus 15 has a data line 16, a bus available line 18, and a clock line 20. Stations 10, 12, 14 are connected to each line of the bus 15. 
     Data line 16 carries messages (i.e., DATA) between the stations 10, 12, 14. The data line 16 may act as an address line. A separate address line could be provided. Bus available line 18 carries a BUS AVAILABLE signal indicating whether a station 10, 12, 14 may transmit a message. Clock line 20 carries a CLOCK signal which provides a timing reference by which stations 10, 12, 14 read and write signals to data line 16. 
     Both the data line 16 and the bus available line 18 have an &#34;active&#34; state and an &#34;idle&#34; state. If any stations holds the signal in the active state, the line is active. The line is idle if no device holds the line active. Typically, the active state is a &#34;0&#34; and the idle state is &#34;1&#34;. Obviously, the implementation of these states could be reversed. 
     For the bus available line 18, the active state is the &#34;false&#34; state. Thus if any device holds the bus available &#34;active&#34;, then the bus available line 18 will be false. 
     The procedure by which the stations transmit messages is shown in FIG. 2. 
     When a station 10, 12, 14 desires to transmit a message (40), the station accesses the bus available line 18 (42). If the BUS AVAILABLE signal is false, then the station waits and continues to test the bus available line 18. 
     If the BUS AVAILABLE signal is TRUE, indicating an idle condition for a predetermined time period t 0 , the station then transmits its address to the data line of the bus one bit at a time. (&#34;Idle&#34; means that the bus is inactive. If the bus is busy, the bus is considered &#34;active&#34;.) The bus available line 18 is set to FALSE to indicate that the bus is busy (44). A counter i is set to zero (46). The first bit of the address is A 0 , and successive bits are A i . 
     The address bit A i  is sent to the data line 16 (48). The station then reads a number from the data line 16 (50) and compares it to A i  (52). 
     If the data line 16 does equal A i , then no collision is indicated. The station then compares i to n (54), where n is the total number of bits of the address of the station. If i is not equal to n, then i is incremented by 1 (56), and the next address bit of the station address is sent to the data line, and the process is repeated. The process is repeated until i equals n. When i equals n, the entire address has been sent to the data line 16 with no indication of a collision. Therefore, the station has sole transmission access to the bus 15 and transmits the message on data line 16. When the message has been sent, the bus available line 18 is set to TRUE. 
     If the data line 16 does not equal A i , then a collision is indicated. That is, two or more stations are trying to send a message at the same time. Further, since the data line does not equal A i , another station sending a message has priority. 
     The station then releases the bus 15 by setting the bus available line 18 to TRUE (62). The station then waits until the bus 15 has been idle (i.e., BUS AVAILABLE=TRUE) for a predetermined time t 1 , where t 1  is less than predetermined time t 0  (64) before attempting to send the message again (44). 
     The predetermined times t 0  and t 1  may consist of waiting for a predetermined number of clock cycles, m 0  and m 1 , respectively. Thus, m 0  would be greater than m. For example, t 0  could be 1 clock cycle while t 1  could be 2 clock cycles. 
     The process thus described provides a simplified method for collision detection and collision resolution. If two stations attempt to send messages simultaneously, one of the stations will succeed unimpeded, thus resulting in less delay. Data is not lost, and there is no problem with establishing synchronicity between the station sending the message and the station receiving the message. 
     A station that did not succeed in sending the message due to a collision detection has a shorter wait time than a station that has not encountered a collision. Thus, the messages are sent in the order in which they were generated. 
     Further, priority between stations can be easily managed. If the system is configured such that a &#34;1&#34; has priority on the data line 16 (that is, if a&#34;1&#34; and a &#34;0&#34; are sent simultaneously, the data line 16 becomes &#34;1&#34;), then a station with the highest priority can have its address set to &#34;111&#34; while a station with the lowest priority can have its address set to &#34;000&#34;.