US20050157699A1 - Data communications device, data communications system, data communications method, data communications computer program, and computer-readable storage medium containing computer program - Google Patents

Data communications device, data communications system, data communications method, data communications computer program, and computer-readable storage medium containing computer program Download PDF

Info

Publication number
US20050157699A1
US20050157699A1 US11/037,193 US3719305A US2005157699A1 US 20050157699 A1 US20050157699 A1 US 20050157699A1 US 3719305 A US3719305 A US 3719305A US 2005157699 A1 US2005157699 A1 US 2005157699A1
Authority
US
United States
Prior art keywords
data
data communications
transceiver
node
received
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.)
Abandoned
Application number
US11/037,193
Other languages
English (en)
Inventor
Koji Sakai
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Sharp Corp
Original Assignee
Sharp Corp
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by Sharp Corp filed Critical Sharp Corp
Assigned to SHARP KABUSHIKI KAISHA reassignment SHARP KABUSHIKI KAISHA ASSIGNMENT OF ASSIGNORS INTEREST (SEE DOCUMENT FOR DETAILS). Assignors: SAKAI, KOJI
Publication of US20050157699A1 publication Critical patent/US20050157699A1/en
Abandoned legal-status Critical Current

Links

Images

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N21/00—Selective content distribution, e.g. interactive television or video on demand [VOD]
    • H04N21/40—Client devices specifically adapted for the reception of or interaction with content, e.g. set-top-box [STB]; Operations thereof
    • H04N21/43—Processing of content or additional data, e.g. demultiplexing additional data from a digital video stream; Elementary client operations, e.g. monitoring of home network or synchronising decoder's clock; Client middleware
    • H04N21/436—Interfacing a local distribution network, e.g. communicating with another STB or one or more peripheral devices inside the home
    • H04N21/43615—Interfacing a Home Network, e.g. for connecting the client to a plurality of peripherals
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04J—MULTIPLEX COMMUNICATION
    • H04J3/00—Time-division multiplex systems
    • H04J3/02—Details
    • H04J3/08—Intermediate station arrangements, e.g. for branching, for tapping-off
    • H04J3/085—Intermediate station arrangements, e.g. for branching, for tapping-off for ring networks, e.g. SDH/SONET rings, self-healing rings, meashed SDH/SONET networks
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N21/00—Selective content distribution, e.g. interactive television or video on demand [VOD]
    • H04N21/20—Servers specifically adapted for the distribution of content, e.g. VOD servers; Operations thereof
    • H04N21/21—Server components or server architectures
    • H04N21/214—Specialised server platform, e.g. server located in an airplane, hotel, hospital
    • H04N21/2146—Specialised server platform, e.g. server located in an airplane, hotel, hospital located in mass transportation means, e.g. aircraft, train or bus

Definitions

  • the present invention relates to data communications devices, data communications systems, data communications methods, data communications computer programs, and computer-readable storage media containing such computer programs, which are capable of preventing an entire data communications system from being unusable in case of trouble with a channel or data communications device in the data communications system.
  • MOST Media Oriented Systems Transport
  • MOST Media Oriented Systems Transport
  • MOST is a protocol for POF (plastic optical fiber)-based networks, interconnecting nodes of audio, television, navigation, and telephone systems. MOST offers various advantages to users. MOST reduces not only negative effects of the weight and noise of wire harnesses connecting various components, but also workload of system development engineers. Also, it ultimately provides the user a means of collectively controlling a variety of devices.
  • POF plastic optical fiber
  • One of MOST's features is its capability to deliver three types of data over a network of a single, low-cost optical fiber in the following manner:
  • Synchronized data real time transfer (streaming) of audio and video signals.
  • Non-synchronized data packet transfer in accessing the Internet and databases.
  • Control data transfer of control messages and other data for controlling the entire network.
  • control data is managed block by block. One block is made of 16 frames.
  • MOST a network delay detecting function is specified.
  • a 2-frame delay occurs with synchronized data delivered via a node. Detecting the delay on the network will thus reveal how many active nodes exist between a given data source and a receiving node.
  • An available physical topology is a ring topology which basically consists of one ring. This topology requires no hub or switch in adding a node. Another advantage is that communications lines (here, optical fibers) are not concentrated around a particular device, which eliminates unnecessary routing of fibers.
  • the topology is also suited to, for example, the networking of electronics in vehicles in terms of installation. Further, the optical fiber network is immune to electromagnetic radiation noise and ground loop. Therefore, the ring topology is a typical topology for optical fiber networks and suitable for MOST technology.
  • the ring topology incurs no cost as to hubs or switches.
  • the node count dictates the cost.
  • the topology is inexpensive.
  • All source data (e.g., digitized audio) is available at all nodes.
  • FIG. 6 An example of a MOST network in a ring topology is shown in FIG. 6 .
  • the MOST is based on an optical fiber network and connects various devices in a ring topology.
  • a controller, a car navigation system, a CD player, speakers, a CD changer, and a television set function as nodes.
  • a conventional node has two transceivers. Data is acquired through one of the transceivers. If the data is for use at that particular node, a data processor section implements a predetermined process (for example, adding a flag indicating the completion of the reception). The resultant data is then transmitted from the other transceiver. Meanwhile, if the received data is not for use at the node, the acquired data is repeated and sent to an adjacent node from the other transceiver without processing the data.
  • a predetermined process for example, adding a flag indicating the completion of the reception
  • Conventional nodes are assumed to be connected forming a ring topology to achieve communications as shown in FIG. 8 .
  • Data transmitted from one of the transceivers of a node is either processed at a node on the ring path or repeated over the ring back to the original node at the other transceiver, to complete the data communications.
  • the data transmitting node can detect a normal termination of a data transmission when the node receives over the ring the data which originated at that node, but has been processed by a destination node. Therefore, as shown in FIG. 9 , if the node on the ring topology is not working or there is a break along a communications line, the data flow stops there. Since the data transmitting node cannot receive the data transferred back over the ring, the node cannot completes the data communications, which causes inconveniences.
  • the whole data communications system goes down if the communications line, or a channel, is cut off even at a single point.
  • the whole system goes down if even a single node on the network breaks down and becomes unable to transmit or receive data.
  • the whole system goes down similarly if the optical transceiver section coupled to a node breaks.
  • the whole system goes down again if the optical connector coupled to the optical transceiver section of a node falls of due to an external force.
  • the data communications are shown in FIG. 8 and FIG. 9 as taking place only in one direction. Data communications in the opposite direction are also possible and susceptible to the same problems.
  • Japanese published patent application 11-313098/1999 discloses an optical LAN device based on a set of double branch optical couplers provided along a channel.
  • the structure secures a minimum level of communications, preventing the entire system from going down.
  • the Tokukaihei 11-313098 optical LAN device still has a problem that a breakdown of the coupler brings down the whole data communications system.
  • the whole data communications system goes down also if a fiber connecting a node to an adjacent one, that is, a fiber linking one double branch coupler to another, is cut off.
  • the present invention has an objective to provide a data communications device, a data communications system, a data communications method, a data communications computer program, and a storage medium containing the computer program, which are capable of preventing an entire data communications system from being unusable in case of trouble with a channel, data communications device, or other part of the data communications system.
  • a data communications device in accordance with the present invention has two transceivers one of which receives data and the other of which transmits data.
  • the data communications device includes: a determiner section for determining whether data communications are possible between the two transceivers and a first data communications device and a second data communications device which perform direct data communications with the respective transceivers; and a switching section for switching whether data received from one of the transceivers is returned from that transceiver or transmitted from the other transceiver.
  • the switching section Upon the determiner section determining that data communications are impossible between the data communications device at issue and either one of the first and second data communications devices, the switching section returns the data received from one of the transceivers connected to the other data communications device via the connected transceiver to the other data communications device.
  • the switch section if the determine section has determined that communications with the first data communications device are not possible (impossible), the switch section returns the data received from the second data communications device to the second data communications device via the transceiver which performs data communications with the second data communications device. On the other hand, if the determine section has determined that communications with the second data communications device are not possible (impossible), the switch section returns the data received from the first data communications device to the first data communications device via the transceiver which performs data communications with the first data communications device.
  • the data received from the other data communications device can be returned to the other data communications device.
  • return is used because the incoming data through one of the transceivers is output via the same transceiver.
  • the data communications device in accordance with the present invention can return data. Therefore, when the data communications device in accordance with the present invention is a part of a network, even if a communications line breaks, a data communications device immediately before the broken communications line can return the data. Thus, the whole system is prevented from going down due to non-transferable data. Therefore, the data communications device in accordance with the present invention can make up a data communications system which, even if a communications line breaks somewhere, does not entirely go down and allows communications between those data communications devices between which communications are possible.
  • the data communications device in accordance with the present invention is a part of a network, even if, for example, a data communications device breaks, another data communications device immediately before the data communications device can return the data.
  • a transceiver of a data communications device breaks, the data can be returned via the operational transceiver.
  • a system can be built in which communications are possible between data communications device between which communications are possible even if a disruption occurs on the system.
  • the remaining data communications devices can still function as a daisy chain.
  • data communications is not interrupted.
  • the transceiver does not need to be exchanged.
  • the data communications device can still return the data received from the operational transceiver via the operational transceiver.
  • the data communications device can be continuously used without any modification or replacement at all. The overall cost of the system can be reduced.
  • the data communications devices do not need to be reconnected. They can still function as a daisy chain for data communications, because the data communications device immediately before the broken data communications device can return the data.
  • FIG. 1 is a diagram showing a data communications device in accordance with the present invention.
  • FIG. 2 is a drawing showing a condition of a system involving the data communications device.
  • FIG. 3 is a drawing showing a data flow in a system when the system is in the FIG. 2 condition.
  • FIG. 4 is a drawing showing a different condition of a system involving the data communications device from the FIG. 2 condition.
  • FIG. 5 is a drawing showing a data flow in a system when the system is in the FIG. 4 condition.
  • FIG. 6 is a drawing showing an example of a MOST network.
  • FIG. 7 is a drawing showing a data flow in a conventional data communications device.
  • FIG. 8 is a drawing showing a data flow in a system involving conventional nodes.
  • FIG. 9 is a drawing showing a system involving conventional nodes when the system cannot transfer data.
  • the embodiment will describe the data communications devices of the present invention acting as nodes. Accordingly, the data communications device of the present embodiment will be referred to as the node 100 .
  • the node 100 has two transceivers. Each transceiver receives data and feeds it to a control circuit in the node. If the data is for use at that particular node, the received data is subjected a predetermined process and sent out via the other transceiver. In the present embodiment, assume that the node 100 transmits and receives data by full duplex optical transmission and also that the communications lines are optical fibers. These are however mere assumptions and by no means limiting the nodes and communications lines.
  • the node 100 contains a data processor section 101 , a dummy node (delay time provision means) 102 , a multiplexer 103 , a the multiplexer 104 , a multiplexer 105 , a the multiplexer 106 , a data comparator section (determiner means) 107 , a data comparator section (determiner means) 108 , a control section (switching means) 109 , a transceiver 110 , a transceiver 111 , a channel 112 , a channel 113 , a channel 114 , a channel 115 , a storage section 116 , and a storage section 117 .
  • the data processor section 101 executes a predetermined process on data received from the multiplexer 103 and transmits the resultant data to the multiplexers 105 , 106 . Further, in response to an instruction from the control section 109 , the data processor section 101 transmits required transfer data (user data) to the multiplexers 105 , 106 .
  • the dummy node 102 receives data from the multiplexer 104 and holds the data for a time as if there exists a receiving node (node where data is subjected to a process), before transmitting the resultant data to the multiplexers 105 , 106 .
  • the dummy node 102 so functions that data unprocessed in the node 100 can be output at the same timing as processed data. So, the node 100 can output return data at the same timing no matter whether or not the return data is processed by the node 100 . This prevents the development of an output timing discrepancy and possible interruption of communications.
  • the multiplexer 103 switchably feeds the data received from the transceiver 110 or the data received from the transceiver 111 to the data processor section 101 .
  • the multiplexer is a switching circuit selecting one output from many inputs (two inputs in the present embodiment).
  • the multiplexer 104 switchably feeds the data received from the transceiver 110 or the data received from the transceiver 111 to the dummy node 102 .
  • the multiplexer 105 switchably feeds the data received from the data processor section 101 or the data received from the dummy node 102 to the transceiver 110 .
  • the multiplexer 106 switchably feeds the data received from the data processor section 101 or the data received from the dummy node 102 to the transceiver 111 .
  • the data comparator section 107 compares the data transmitted from the transceiver 110 with the data received by the transceiver 110 for a certain (predetermined) time. Based on the comparison, the data comparator section 107 determines whether communications with an adjacent node are possible and sends a signal indicative of a result of the determination to the control section 109 . In the comparison, the data comparator section 107 retrieves the data transmitted from the transceiver 110 from the storage section 116 .
  • the data comparator section 108 compares the data transmitted from the transceiver 111 with the data received by the transceiver 111 for a certain (predetermined) time. Based on the comparison, the data comparator section 108 determines whether communications with an adjacent node are possible and sends a signal indicative of a result of the determination to the control section 109 . In the comparison, the data comparator section 108 retrieves the data transmitted from the transceiver 111 from the storage section 117 .
  • the storage section 116 records data transmitted from the transceiver 110 .
  • the storage section 117 records data transmitted from the transceiver 111 .
  • the control section 109 sends control signals to the multiplexers 103 , 104 , 105 , and 106 according to the signals indicative of the comparison results from the data comparator section 107 and the data comparator section 108 .
  • the control section 109 Upon receiving a signal from the data comparator section 107 indicating that data communications with the node adjacent to the transceiver 110 are impossible and a signal from the data comparator section 108 indicating that data communications with the node adjacent to the transceiver 111 are possible, the control section 109 has the data received from the transceiver 111 transmitted via the multiplexer 106 , not via the multiplexer 105 .
  • control section 109 switches to cause the data received from the transceiver 111 to be returned (transmitted) from the transceiver 111 , instead of being transmitted from the transceiver 110 .
  • the control section 109 upon receiving a signal from the data comparator section 108 indicating that data communications with the node adjacent to the transceiver 111 are impossible and a signal from the data comparator section 107 indicating the data communications with the node adjacent to the transceiver 110 are possible, the control section 109 has the data received from the transceiver 110 transmitted via the multiplexer 105 , not via the multiplexer 106 .
  • control section 109 switches to cause the data received from the transceiver 110 to be returned (transmitted) from the transceiver 110 , instead of being transmitted from the transceiver 111 .
  • return is used because the incoming data through one of the transceivers is output via the same transceiver.
  • the transceiver 110 transmits the data received from another node (node adjacent to the transceiver 110 ; not shown) with which the transceiver 110 performs direct data communications over the channel 114 to the multiplexer 103 and the multiplexer 104 .
  • the transceiver 110 transmits the data received from the multiplexer 105 over the channel 112 to a node adjacent to the transceiver 110 .
  • the transceiver 111 transmits the data received from another node (node adjacent to the transceiver 111 ; not shown) with which the transceiver 111 performs direct data communications over the channel 115 to the multiplexer 103 and the multiplexer 104 . In addition, the transceiver 111 transmits the data received from the multiplexer 106 over the channel 113 to a node adjacent to the transceiver 111 .
  • the channel 112 and the channel 114 form a single communications line connected to the transceiver 110 . Over the channel 112 is transmitted data to another node adjacent to the transceiver 110 . Over the channel 114 is received data from a node adjacent to the transceiver 110 .
  • the channel 113 and the channel 115 form a single communications line connected to the transceiver 111 . Over the channel 113 is transmitted data to another data adjacent to the transceiver 111 . Over the channel 115 is received data from another node adjacent to the transceiver 111 .
  • the channel 112 and the channel 114 are assumed to form a full duplex channel on which data can be simultaneously transmitted in two directions.
  • the channel 113 and the channel 115 are assumed to form a full duplex channel on which data can be simultaneously transmitted in two directions.
  • a simultaneous bidirectional transmission capability increases the information transfer rate a maximum of about two fold, allowing a large size of data can be transferred quickly.
  • the simultaneous bidirectional data transmission capability is not essential.
  • either the channels 112 , 114 or the channels 113 , 115 may be constructed from a cable containing two optical fibers.
  • An extended length of the double-fiber optical cable is fabricable and preferred for use in a data communications system especially for transmissions over long distances.
  • the double-fiber optical cable gives a dedicated communications line for each direction, facilitating installation. This is by no means limiting the embodiment.
  • the channels 112 , 114 or the channels 113 , 115 may be constructed from a cable containing a single optical fiber.
  • a single-fiber optical cable is readily routable.
  • the single-fiber optical cable requires a small installation area and can be readily mounted to a compact device.
  • the channels may be not constructed from an optical fiber cable at all.
  • the node 100 determines whether communications with an adjacent node are possible. It will also be described how the node 100 switchably transmits the data received from one of the transceivers via the other transceiver or returns the data via one of the transceivers.
  • the node performing direct data communications with the node 100 will be referred to as the first and second nodes (neither shown).
  • the node performing direct data communications with the transceiver 110 (node adjacent to the transceiver 110 ) will be referred to as the first node (first data communications device).
  • the node performing direct data communications with the transceiver 111 (node adjacent to the transceiver 111 ) will be referred to as the second node (second data communications device).
  • the channel 112 connects to the first node, and the channel 113 connects to the second node.
  • the data processor section 101 Before starting data communications, the data processor section 101 checks that no input data is coming from the transceiver 110 or the transceiver 111 by monitoring input data from the multiplexer 103 . Having confirmed that no input data is coming from the transceiver 110 or the transceiver 111 for a certain time, the data processor section 101 transmits authentication data for determining whether communications are possible (connection status authentication data, or hereinafter simply “data”) from the transceiver 110 to the channel 112 via the multiplexer 105 . In addition, the data processor section 101 similarly transmits authentication data from the transceiver 111 to the channel 113 via the multiplexer 106 .
  • connection status authentication data or hereinafter simply “data”
  • the authentication data transmitted from the transceiver 110 is recorded in the storage section 116
  • the authentication data transmitted from the transceiver 111 is recorded in the storage section 117 .
  • the storage section 116 may be provided inside of outside the data comparator section 107 .
  • the storage section 117 may be provided inside or outside the data comparator section 108 .
  • the data comparator section 107 compares the data transmitted from the transceiver 110 with the data received by the transceiver 110 for a certain (predetermined) time. Then, the data comparator section 107 determines whether communications with the first adjacent node are possible based on a result of the comparison (determination step) and transmits a signal indicative of a result of the determination to the control section 109 . In the comparison, the data comparator section 107 retrieves the authentication data transmitted from the transceiver 110 from the storage section 116 .
  • the data comparator section 108 similarly compares the data transmitted from the transceiver 111 with the data received by the transceiver 111 for a certain (predetermined) time. Then, the data comparator section 108 determines whether communications with the second adjacent node are possible based on a result of the comparison (determination step) and transmits a signal indicative of a result of the determination to the control section 109 . In the comparison, the data comparator section 108 retrieves the authentication data transmitted from the transceiver 111 from the storage section 117 .
  • the node 100 of the present embodiment contains the separate data comparator sections 107 and 108 which may be integrated into a single section.
  • the data comparator section 107 determines whether the transceiver 110 can perform data communications with the first node in three parts: (1) to (3).
  • the data comparator section 107 receives data in less time than a minimum time taken by the transceiver 110 to receive data via the first node. Upon recognizing that the received data is identical to the authentication data transmitted from the transceiver 110 as recorded in the storage section 116 , the data comparator section 107 determines that the received data is the authentication data which has traveled back.
  • back traveling refers to a phenomenon in a transmission in optical communications based on an optical fiber where an outgoing ray of light emitted from a light emitting section finds a path back to a light receiving section where the outgoing ray is undesirably received.
  • the back traveling of the data indicates that data communications with the first node are impossible.
  • the data comparator section 107 determines that data communications with the first node are impossible if the transceiver 110 has received data in less time than the minimum time taken by the data reception via the first node and the received data has been recognized to be identical to the authentication data transmitted from the transceiver 110 .
  • the minimum time taken by the data reception via the first node refers to the time taken by the data transmitted from the transceiver 110 to be returned from the first node and received by the transceiver 110 .
  • the description here discusses a transmission from the transceiver 110 . So, the minimum time taken by the data to be received via the first node is designated the minimum reception time.
  • the minimum reception time refers to a time taken by data transmitted from a transceiver to be returned from another node performing direct data communications with the transceiver (node adjacent to the transceiver) and reach the transceiver (received by the transceiver).
  • the node network is MOST-compliant.
  • Data transferred passing through an adjacent node contains a two-frame delay. That is, in this case, the minimum reception time is equal to two frames. It is therefore possible to determine whether a node is receiving a reflection of data transmitted from that node itself. That is, data which has been received before the two-frame delay and identical to the transmitted data can be determined to be the data which has been reflected back.
  • Whether the time taken to receive data is less than the minimum reception time can be determined by, for example, measuring time from the transmission of the authentication data from the data comparator section 107 to the reception of data.
  • the data comparator section 107 determines that data communications with the first node are impossible. Alternatively, the data comparator section 107 may compare the data transmitted from the transceiver 110 with void data.
  • the certain time is too short, the determination as to whether communications are possible becomes inaccurate. If the time is too long, the start of actual data communications following the determination as to whether communications are possible is delayed.
  • the time is preferably specified considering these factors. For example, it is preferable if the time is a total of repeat delays equivalent to several nodes (e.g., a maximum number of connected nodes as specified by the standards).
  • the certain time is specified longer than the minimum reception time to distinguish between the data which has traveled back and the data which returned without being processed (e.g. a case where the authentication data transmitted from the transceiver 110 has not reached the node designated as its destination, but returned to the transceiver 110 from a connected node which can return the data).
  • the data comparator section 107 determines that communications are impossible because no data is received. This is a correct determination. Thus, the data comparator section 107 can always make a correct determination even when the first node is not connected. In addition, determining that communications with the first node are possible entails determining that the first node is connected.
  • the data comparator section 107 determines that communications with the first node are possible.
  • the data comparator section 107 determines that data communications are possible. Thus, a correct determination is made.
  • the authentication data transmitted from the transceiver 110 has not reached the node designated as its destination, but returned to the transceiver 110 from a connected node which is configured to be able to return the data.
  • the received data is identical to the transmitted data; however, the reception takes time more than or equal to the minimum reception time. At least it is determined that the data has been received via the first node. Therefore, the data comparator section 107 can determine that data communications with the first node are possible.
  • the data transmitted from the transceiver 111 is received by the transceiver 110 after being processed.
  • the data comparator section 107 can determine that data communications with the first node are possible. For your information, if data is compared in this case, it is different data from the transmitted data that has been received.
  • the authentication data transmitted from the transceiver 110 is processed at a connected node designated as its destination which is connected, and resultant data is received by the transceiver 110 .
  • the reception again takes time more than or equal to the minimum reception time.
  • the data comparator section 107 can hence determine that data communications with the first node are possible. For your information, if data is compared in this case, it is different data from transmitted data that has been received.
  • the data comparator section 107 determines that data communications with the first node are possible. For your information, if data is compared in this case, it is different data from the transmitted data that has been received.
  • the data comparator section 107 determines that data communications with the first node are possible. Thus, if data is received in the minimum reception time or more, the transmitted data and the received data may be compared, but may not be compared.
  • the data comparator section 107 can make a correct determination as to whether data communications with the first node are possible to perform direct data communications with the transceiver 110 .
  • the data comparator section 108 also makes a similar determination to the data comparator section 107 as to whether data communications are possible between the transceiver 111 and the second node. Detailed description is therefore omitted. In any case, the data comparator section 108 can make a correct determination as to whether data communications with the second node are possible to perform direct data communications with the transceiver 111 .
  • the data may be sent to the data processor section 101 to make a determination in the section 101 .
  • the data comparator section 107 and the data comparator section 108 respectively send the results of the determinations as to whether communications are possible to the control section 109 , and the results of the determinations indicate, for example, that communications with the first node are impossible whilst data communications with the second node are possible, data is transferred in the following manner. If the data received from the transceiver 111 is the data to be processed by the node 100 , the data is sent via the multiplexer 103 , processed by the data processor section 101 , sent via the multiplexer 106 , and transmitted from the transceiver 111 .
  • the data is sent via the multiplexer 104 , temporarily buffered for timing adjustment by the dummy node 102 as if there existed a repeat node, sent via the multiplexer 106 , and transmitted from the transceiver 111 . That is, the dummy node 102 is configured to be able to output unprocessed data at the same timing as processed data.
  • control section 109 controls the data received from the transceiver 111 so that the data travels not via the multiplexer 105 , but via the multiplexer 106 .
  • control section 109 switches to return (transmit) the data received from the transceiver 111 not from the transceiver 110 , but from the transceiver 111 (switching step).
  • return is used because the incoming data through one of the transceivers is output via the same transceiver.
  • control section 109 does the reverse to the foregoing. In other words, the data received from the transceiver 110 is switched so that data returns from the transceiver 110 .
  • the control section 109 Upon receiving data from the transceiver 111 , if the received data is data to be processed at the node 100 , the data is sent via the multiplexer 103 , processed by the data processor section 101 , sent via the multiplexer 105 , and transmitted from the transceiver 110 .
  • the data is sent via the multiplexer 104 , temporarily buffered for timing adjustment by the dummy node 102 as if there existed a repeat node, sent via the multiplexer 105 , and transmitted from the transceiver 110 .
  • the data is sent via the multiplexer 103 , processed by the data processor section 101 , sent via the multiplexer 106 , and transmitted from the transceiver 111 .
  • the data is sent via the multiplexer 104 , temporarily buffered for timing adjustment by the dummy node 102 as if there existed a repeat node, sent via the multiplexer 106 , and transmitted from the transceiver 111 .
  • control section 109 having received a result from the data comparator section 107 may control the multiplexer 103 so that the data processor section 101 can acquire the data received by the transceiver 110 . Having acquired the received data from the transceiver 110 , the data processor section 101 may determine whether the received data is a result of processing of the authentication data transmitted from the transceiver 111 . Alternatively, having received a result from the data comparator section 108 , the control section 109 may control the multiplexer 103 so that the data processor section 101 can acquire the data received by the transceiver 111 . Having acquired the received data from the transceiver 111 , the data processor section 101 may determine whether the data is a result of processing of the authentication data transmitted from the transceiver 110 .
  • the data received from one of the transceivers is a result of processing of the data transmitted from the other transceiver, it could be understood that the current connection condition is a ring topology.
  • the data processor section 101 is assumed to be able to determine whether the data received from one of the transceivers is a result of processing of the data transmitted from the other transceiver.
  • the two transceivers are assumed to send different authentication data so as to distinguish between the data which has been transmitted from one of the transceivers, processed, and returned from another node and the data which has been transmitted from the other transceiver, processed, and received.
  • the determination as to whether the data received by one of the transceivers is the data which has been transmitted from the other transceiver and processed may be made by, for example, the data comparator section 107 or the data comparator section 108 .
  • another member may be provided to the node 100 to make the determination.
  • control section 109 may control the multiplexer 105 and the multiplexer 106 so that data communications take place only in such directions that data is received from the transceiver 110 and transmitted from the transceiver 111 or in opposite directions. Such communications in single directions reduces electric power consumption.
  • the data communications device (node 100 ) of the present invention to the data communications system in a ring topology will be described.
  • the present invention is by no means limited by the description and applicable to other data communications systems.
  • Each node has the aforementioned configuration and operates in the aforementioned manner.
  • the three nodes are positioned to adjacent to each other to form a data communications system.
  • the system may of course involve two or four or more of such nodes.
  • nodes are connected to form a ring.
  • the three nodes are however now daisy chained as shown in FIG. 2 due to trouble with a channel or a node (“condition 1”).
  • Each node has the same configuration as the node 100 .
  • the same structural members have the same functions as those in the node 100 .
  • their reference numbers are suffixed with “a,” “b,” and “c.” That is, the three nodes are referred to as the node 100 a , the node 100 b , and the node 100 c .
  • control section of the node 100 a which corresponds to the control section 109 of the node 100 is referred to as the control section 109 a , with the same suffix attached to the reference number of the structural member as the node.
  • These structural members correspond to the structural members of the node 100 bearing the same reference numbers.
  • the node 100 a has two transceivers 110 a , 111 a to transmit and receive data by full duplex optical transmission.
  • the transceiver 110 a is a full duplex transceiver receiving data from the channel 114 a and transmitting data to the channel 112 a .
  • the transceiver 111 a is a full duplex transceiver receiving data from the channel 115 a and transmitting data to the channel 113 a.
  • the node 100 b has two transceivers 110 b , 111 b to transmit and receive data by full duplex optical transmission.
  • the transceiver 110 b is a full duplex transceiver receiving data from the channel 114 b and transmitting data to the channel 112 b .
  • the transceiver 111 b is a full duplex transceiver receiving data from the channel 115 b and transmitting data to the channel 113 b.
  • the node 100 c has two transceivers 110 c , 111 c to transmit and receive data by full duplex optical transmission.
  • the transceiver 110 c is a full duplex transceiver receiving data from the channel 114 c and transmitting data to the channel 112 c .
  • the transceiver 111 c is a full duplex transceiver receiving data from the channel 115 c and transmitting data to the channel 113 c.
  • the channel 115 a of the node 100 a is connected to the channel 112 b of the node 100 b .
  • the channel 113 a of the node 100 a is connected to the channel 114 b of the node 100 b .
  • the channel 115 b of the node 100 b is connected to the channel 112 c of the node 100 c .
  • the channel 113 b of the node 100 b is connected to the channel 114 c of the node 100 c .
  • the channels 114 a , 112 a of the node 100 a and the channels 115 a , 113 c of the node 100 c are all open. That is, the node 100 a is connected to the node 100 b , the node 100 b is connected to the node 100 c , and the node 100 a is not connected to the node 100 c.
  • the node 100 a is assumed to be a transmission node transmitting authentication data and have initiated a data transmission. However, this is by no means limiting the present invention. Another node may initiate a data transmission.
  • the data B transmitted from the transceiver 110 a is recorded in the storage section 116 a
  • the data A transmitted from the transceiver 111 a is recorded in the storage section 117 a .
  • the data A, B is assumed to be bound for the node 100 c , in other words, be processed by the node 100 c.
  • the data A transmitted from the transceiver 111 b is recorded in the storage section 117 b .
  • the data A received by the transceiver 110 c is processed by the data processor section 101 c to produce post-processing data C.
  • the data C transmitted from the transceiver 111 c at time T t 2 .
  • the data C transmitted from the transceiver 111 c is recorded in the storage section 117 c.
  • the data comparator section 107 a determines that communications with the node adjacent to the node 110 a are impossible and sends the result to the control section 109 a .
  • a pair of short, joined arrows indicates a data communications condition determined by a node.
  • data cannot be transmitted in a direction indicated by an arrow marked with a “x.”
  • Data can be transmitted in a direction indicated by an arrow with no “x” mark.
  • FIG. 5 The same display method applies to FIG. 5 .
  • the control section 109 b controls the multiplexer 105 b to return the data A received from the transceiver 110 b from the transceiver 110 b .
  • the node 100 b is only known to be communicable with the node 100 a.
  • the data comparator section 108 a therefore determines that communications are possible between the transceiver 111 a and its adjacent node 100 b , and sends to the control section 109 a .
  • control section 109 a causes the data received from the transceiver 111 a to be returned from the transceiver 111 a.
  • a time more than the minimum reception time has elapsed.
  • the data comparator section 108 b therefore determines that communications are possible between the transceiver 111 b and its adjacent node 100 c , and sends to the he control section 109 b .
  • data communications are possible between the node 100 b and the nodes 100 a , 100 c.
  • the reception of the post-processing data C for the data A transmitted from the node 100 a is assumed to end the authentication data communications.
  • the data comparator section 107 determines that the transceiver 110 cannot connect to its adjacent node.
  • the data comparator section 108 determines that the transceiver 111 cannot connect to its adjacent node. Since the minimum reception time is specified less than the certain time, even when the transceivers 110 , 111 receive data which has traveled back, a correct determine can be made.
  • the control section 109 a causes the data received by the transceiver 111 a to be returned from the transceiver 111 a .
  • the control section 109 c causes the data received by the transceiver 110 c to be returned from the transceiver 110 c .
  • control section 109 b cause the data received by the transceiver 110 b to be transmitted from the transceiver 111 b and that the data received by the transceiver 111 b is transmitted from the transceiver 110 b . It could be understood that these actions data communications are possible between nodes between communications are possible.
  • connection status of the nodes is determined by means of the authentication data, data communications are performed as in ordinary data communications.
  • the node 100 b is a transmission node
  • communications between the nodes 100 a , 100 c are determined to be impossible after the certain time.
  • data is returned from the transceiver 111 a of the node 100 a and the transceiver 110 c of the node 100 c
  • communications between the nodes 100 a , 100 c are determined to be possible.
  • the node 100 a if data is received by the transceiver 111 a from the node 100 b and no data is received at all from the node 110 a even after the certain time, communications with the node 100 b are determined to be possible.
  • the connections of the nodes are correctly determined from no matter which node identification data is transmitted (no matter which node is the transmission node). Then, data communications are performed between nodes between which communications are possible.
  • the connections of the nodes are correctly determined. For example, two non-adjacent nodes are broken in a system of multiple nodes connected in a ring topology can be viewed as two daisy chain node systems. In these cases, the connections of the nodes are again correctly determined, allowing communications between working nodes.
  • condition 1 in which three nodes 100 of the present embodiment are connected in reference to FIGS. 4, 5 .
  • condition 2 the three nodes are assumed to be connected to form a ring as shown in FIG. 4 with no trouble with the channels or nodes (“condition 2”).
  • Each node has the same configuration as the node 100 .
  • the same structural members have the same functions as those in the node 100 . That is, all the three nodes are similar to condition 1, with the only difference being the connection status.
  • the nodes are referred to as the node 100 a , the node 100 b , and the node 100 c .
  • the structural members of each node are again similar to condition 1.
  • the node 100 a , node 10 b , and node 100 c each have two transceivers to transmit and receive data by full duplex optical transmission.
  • all the transceivers are full duplex transceivers.
  • the node 100 a has two transceivers 110 a , 111 a to transmit and receive data by full duplex optical transmission.
  • the transceiver 110 a is a full duplex transceiver receiving data from the channel 114 a and transmitting data to the channel 112 a .
  • the transceiver 111 a is a full duplex transceiver receiving data from the channel 115 a and transmitting data to the channel 113 a.
  • the node 100 b has two transceivers 110 b , 111 b to transmit and receive data by full duplex optical transmission.
  • the transceiver 110 b is a full duplex transceiver receiving data from the channel 114 b and transmitting data to the channel 112 b .
  • the transceiver 111 b is a full duplex transceiver receiving data from the channel 115 b and transmitting data to the channel 113 b.
  • the node 100 c has two transceivers 110 c , 111 c to transmit and receive data by full duplex optical transmission.
  • the transceiver 110 c is a full duplex transceiver receiving data from the channel 114 c and transmitting data to the channel 112 c .
  • the transceiver 111 c is a full duplex transceiver receiving data from the channel 115 c and transmitting data to the channel 113 c.
  • the channel 114 a of the node 100 a is connected to the channel 113 c of the node 100 c .
  • the channel 112 a of the node 100 a is connected to the channel 115 c of the node 100 c .
  • the channel 115 a of the node 100 a is connected to the channel 112 b of the node 100 b .
  • the channel 113 a of the node 100 a is connected to the channel 114 b of the node 100 b .
  • the channel 115 b of the node 100 b is connected to the channel 112 c of the node 100 c .
  • the channel 113 b of the node 100 b is connected to the channel 114 c of the node 100 c.
  • condition 1 the channels 114 a , 112 a of the node 100 a and the channels 115 a , 113 c of the node 100 c were all open.
  • condition 2 differences lie where the channel 114 a of the node 100 a is connected to the channel 113 c of the node 100 c , and similarly, the channel 112 a of the node 100 a is connected to the channel 115 c of the node 100 c . That is, in condition 1, the node 100 a was connected to the node 10 b , the node 100 b was connected to the node 100 c , and the node 100 a was not connected to the node 100 c . In condition 2, the node 100 a is connected to the node 100 b , the node 100 b is connected to the node 100 c , and the node 100 c is connected to the node 100 a.
  • the node 100 a is assumed to be a transmission node transmitting authentication data and have initiated a data transmission. However, this is by no means limiting the present invention. Another node may initiate a data transmission.
  • the data B transmitted from the transceiver 110 a is recorded in the storage section 116 a
  • the data A transmitted from the transceiver 111 a is recorded in the storage section 117 a .
  • the data A, B is assumed to be bound for the node 100 c , in other words, be processed by the node 100 c.
  • the data A transmitted from the transceiver 111 b is recorded in the storage section 117 b .
  • the data D transmitted from the transceiver 110 c is recorded in the storage section 116 c.
  • the data A received by the transceiver 110 c is processed by the data processor section 101 c to produced post-processing data C.
  • the data C transmitted from the transceiver 111 c recorded in the storage section 117 c .
  • the data D transmitted from the transceiver 110 c at time T t 1 received by the transceiver 111 b .
  • the data D received by the transceiver 111 b is given a delay time from the dummy node 102 b and transmitted from the transceiver 110 b , because its destination is not that node.
  • the data D transmitted from the transceiver 110 b is recorded in the storage section 116 b.
  • the data comparator section 107 a retrieves data B from the storage section 116 a and compares it with the data C received from the transceiver 110 a . Since the comparison has shown that the data is different, it is determined that communications with the adjacent node 100 c are possible, and the result is sent to the control section 109 a .
  • the data comparator section 108 a retrieves the data A from the storage section 117 a and compares it with the data D received from the transceiver 111 a .
  • the data comparator section 107 a determines whether communications with an adjacent node are possible.
  • the data comparator section 107 a determines that data communications are possible.
  • the data comparator section 108 a determines that data communications are possible.
  • the data comparator section 107 and the data comparator section 108 of other nodes upon data reception, also determined whether communications are possible. The section 107 , 108 may make such a determination after the certain time similarly to the node 110 a.
  • the data comparator section 107 b determines that communications are possible between the transceiver 110 b and its adjacent node 100 a , and sends the result to the control section 109 b .
  • the transceiver 111 b receives the data D. That is, after a data transmission, the reception takes place in less time than a maximum reception time.
  • the data comparator section 108 b knows that the received data D differs from the data A retrieved from the storage section 117 b , thus determines data communications with the adjacent node 100 c are possible, and sends the result to the control section 109 b .
  • the control section 109 b it could be understood that data communications are possible between the node 100 b and the nodes 100 a , 100 c.
  • the data comparator section 107 determines that the transceiver 110 cannot connect to its adjacent node.
  • the data comparator section 108 determines that the transceiver 111 cannot connect to its adjacent node. Since the minimum reception time is specified less than the certain time, even when the transceivers 110 , 111 receive data which has traveled back, a correct determination can be made.
  • a pair of short, joined arrows indicates a data communications condition determined by a node.
  • the arrows indicate that the nodes 1 , 2 , 3 can handle bidirectional data communications.
  • the control section 109 a causes the data received by the transceiver 110 a to be transmitted from the transceiver 111 a and the data received by the transceiver 111 a to be transmitted from the transceiver 110 a .
  • the control section 109 b causes the data received by the transceiver 110 b to be transmitted from the transceiver 111 b and the data received by the transceiver 111 b to be transmitted from the transceiver 110 b .
  • the control section 109 c causes the data received by the transceiver 110 c to be transmitted from the transceiver 111 c and the data received by the transceiver 111 c to be transmitted from the transceiver 110 c.
  • connection status of the nodes is determined by means of the authentication data as in the foregoing, data communications are performed as in ordinary data communications.
  • the control section 109 a having received the result from the data comparator section 107 a may control the multiplexer 103 a and causes the data processor section 101 a to acquire the data C received by the transceiver 110 a .
  • the data processor section 101 a may determine whether the received data is a result of processing of the data A transmitted from the transceiver 111 a .
  • control section 109 a having received the result from the data comparator section 108 a may control the multiplexer 103 a and causes the data processor section 101 a to acquire the data D received by the transceiver 111 a .
  • the data processor section 101 a may determine whether the data is a result of processing of the data B transmitted from the transceiver 110 a.
  • the current connection condition is a ring topology.
  • the determination was made based on a result from the data comparator section 107 a or the data comparator section 108 a ; the determination may be made based on results from the both data comparator sections.
  • control section 109 may control the multiplexer 105 and the multiplexer 106 so that data communications take place only in such directions that data is received from the transceiver 110 and transmitted from the transceiver 111 at any node.
  • control section 109 may control the multiplexer 105 and the multiplexer 106 so that data communications take place only in such directions that data is received from the transceiver 111 and transmitted from the transceiver 110 .
  • Such communications in single directions reduces electric power consumption.
  • the connections of the nodes are correctly determined similarly to the node 100 a.
  • node 100 of the present embodiment can return the data received from the other node through this node.
  • the node 100 of the present embodiment is part of a network, when, for example, a communications line is broken somewhere, the node immediately before the broken communications line can return the data. This prevents the whole system from going down due to a failure in data transfer.
  • the system can be configured so that communications are possible between nodes between which communications are possible and that even when a communications line is broken somewhere, the whole data communications system does not go down.
  • the node 100 of the present embodiment is part of a network
  • when, for example, a node breaks the node immediately before the broken node can return the data.
  • a transceiver of a node breaks, the other, operational transceiver can return the data.
  • the system can be configured so that even when a node or its transceiver fails, communications are still possible between nodes between which communications are possible.
  • the node 100 of the present embodiment allows the system to be configured so that communications are possible between nodes between which communications are possible even if a part of the system fails to function.
  • the remaining nodes can still function as a daisy chain.
  • data communications is not interrupted.
  • the transceiver does not need to be replaced.
  • the node can still return the data received from the operational transceiver via the operational transceiver.
  • the node can be continuously used without any modification or replacement at all. The overall cost of the system can be reduced.
  • the nodes do not need to be reconnected. They can still function as a daisy chain for data communications, because the node immediately before the broken node can return the data.
  • the members of the nodes and the processing steps of the embodiment can be realized by a CPU or other computing means executing a computer program contained in a ROM (Read Only Memory), RAM, or other storage means to control a keyboard or like input means, a display or like output means, or an interface circuit or like communications means. Therefore, the various functions and processes of the node of the present embodiment can be realized if a computer equipped with these means simply reads a storage medium containing the program and executing the program. In addition, if the program is contained in a removable storage medium, the various functions and processes can be realized on any given computer.
  • ROM Read Only Memory
  • Such a computer program storage medium may be a memory (not shown), such as a ROM, so that the process is executable on a microcomputer.
  • a program medium may be used which can be read by inserting the storage medium in an external storage device (program reader device; not shown).
  • the contained program is accessible to a microprocessor which will execute the program. Further, it is preferable if the program is read, and the program is then downloaded to a program storage area of a microcomputer where the program is executed. Assume that the program for download is stored in a main body device in advance.
  • the program medium is a storage medium arranged so that it can be separated from the main body.
  • Examples of such a program medium include a tape, such as a magnetic tape and a cassette tape; a magnetic disk, such as a flexible disk and a hard disk; a disc, such as a CD/MO/MD/DVD; a card, such as an IC card (inclusive of a memory card); and a semiconductor memory, such as a mask ROM, an EPROM (erasable programmable read only memory), an EEPROM (electrically erasable programmable read only memory), or a flash ROM. All these storage media hold a program in a fixed manner.
  • the node 100 may be configured so that it can connect to a communications network.
  • a communications network is not limited in any particular manner and may be the Internet, intranet, extranet, LAN, ISDN, VAN, CATV communications network, virtual private network, telephone line network, mobile communications network, and satellite communications network.
  • the transmission medium providing the communications network is not limited in any particular manner and may be those complying with the IEEE 1394 or USB standards, an electric power line, cable TV line, telephone line, ADSL line, or another wired medium.
  • Wireless alternatives include an IrDA or like infrared-based remote control system, Bluetooth (registered trademark), 802.11 wireless, HDR, mobile phone network, satellite line, and terrestrial digital network.
  • the present invention may be realized in the form of computer data signals which is an embodiment of the program code embodied by an electronic transmission and embedded in a carrier wave.
  • the program for download is stored in a main body device in advance or installed from another storage medium.
  • a data communications device in accordance with the present invention has two transceivers one of which receives data and the other of which transmits data.
  • the data communications device includes: determiner means for determining whether data communications are possible between the two transceivers and a first data communications device and a second data communications device which perform direct data communications with the respective transceivers; and switching means for switching whether data received from one of the transceivers is returned from that transceiver or transmitted from the other transceiver.
  • the switching means Upon the determiner means determining that data communications are impossible between the data communications devices at issue and either one of the first and second data communications devices, the switching means returns the data received from one of the transceivers connected to the other data communications device via the connected transceiver to the other data communications device.
  • the data communications device in accordance with the present invention further includes a storage section for recording transmitted data.
  • a storage section for recording transmitted data.
  • the determiner means may determine that data communications are impossible between that transceiver which has received no data and one of the first and second data communications device which performs direct data communications with that transceiver.
  • the minimum time taken by the data reception via one of the first and second data communications devices which performs direct data communications with the transceiver refers to the time taken by the data transmitted from the transceiver to be returned by another transceiver performing direct data communications with that transceiver and reach the transceiver.
  • minimum reception time refers to the time taken by the data transmitted from the transceiver to be returned by another transceiver performing direct data communications with that transceiver and reach the transceiver.
  • Data being returned without reaching the data communications device performing direct data communications with the transceiver indicates that data communications are impossible with the data communications device.
  • the mere fact that data is received in less time than the minimum reception time may indicate that data was transmitted from the first data communications device substantially simultaneously with the data transmission from the transceiver, and the data was received by the transceiver. Therefore, it cannot be correctly determined whether data communications are possible with the data communications device performing direct data communications with the transceiver.
  • the mere fact that the received data is identical to the transmitted data may indicate that data did not reach the data communications device designated as the destination and returned by a data communications device which was connected and can return the data. Therefore, it cannot be correctly determined whether data communications are possible with the data communications device performing direct data communications with the transceiver.
  • the data communications device in accordance with the present invention can correctly determine whether data communications are possible with the data communications device performing direct data communications with the transceiver.
  • the determiner means determines that data communications are impossible.
  • the predetermined time is too short, the determination as to whether communications are possible becomes inaccurate. If the time is too long, the start of data communications following the determination as to data whether communications are possible is delayed.
  • the time is preferably specified considering these factors. Incidentally, to distinguish between the data which has traveled back and the data which returned without being processed, the predetermined time needs to be specified longer than the minimum reception time.
  • the determiner means determines that data communications are possible. For example, if data was transmitted from the first data communications device substantially simultaneously with a data transmission from the transceiver, and the data is received by the transceiver, the determiner means determines that data communications are possible, because the received data is different although the data is received in less time than the minimum reception time. Thus, a correct determination can be made.
  • determining whether data communications with the first and second data communications devices performing direct data communications are possible entails determining whether the first and second data communications devices are connected. That is, if no data communications device performing direct data communications is connected, since no data is received, the determiner means determines that communications are impossible, which is a correct determination. Thus, the determiner means can always correct determine even if no data communications device performing direct data communications is connected.
  • data communications being possible entails that the data communications device performing direct data communications being connected.
  • Data communications with the data communications device for direct communications are impossible when a data communications device performing direct data communications with the data communications device at issue is not operational; when a communications line between the data communications device at issue and the data communications device performing direct data communications is not operational; when a transceiver of the data communications device at issue is not operational; and when there exists no data communications device for direct communications.
  • the data communications device in accordance with the present invention may produce a delay time so that when the data received from one of the transceivers connected to either one of the first and second data communications devices is returned from that transceiver from which the data is received, if the received data is not data to be processed by the data communications device at issue, the received data can be output at an identical timing as if the received data was processed. The data is thereafter returned.
  • the return data can be output at the same timing no matter whether the data received is processed or not by the data communications device at issue. This prevents the development of an output timing discrepancy and possible interruption of communications.
  • the data communications device in accordance with the present invention may perform data communications with the first and second data communications devices by full duplex optical communications.
  • full duplex is bidirectional communications in which data can be transmitted and received simultaneously in both directions.
  • bidirectional communications can be carried out simultaneously, allowing a maximum of about a two-fold increase in information transfer rate. A large size of data can thus be transferred at high speed.
  • the data communications device in accordance with the present invention may perform data communications with the first and second data communications devices over a cable containing a single optical fiber.
  • the cable containing a single optical fiber can be installed easily.
  • the cable requires a small installation area and can be readily mounted to a compact device.
  • the data communications device in accordance with the present invention may perform data communications with the first and second data communications devices over a cable containing two optical fibers.
  • the cable, or communications line can be fabricated in extended length and preferred for use in a data communications system especially for transmissions over long distances.
  • the cable gives a dedicated data communications line for each direction, facilitating installation.
  • the data communications device in accordance with the present invention may perform data communications in only one direction such that data is transmitted from one of the transceiver device and data is received from the other transceiver device and not perform data communications in the opposite direction such that data is transmitted from the other transceiver device and data is received from one of the transceiver device.
  • the data communications device in accordance with the present invention may be used for a multimedia device.
  • a multimedia device refers to a device where computer information processing technology is incorporated into an information medium and bidirectional information exchange is performed.
  • the data communications device of the present invention is applicable to on-board electronics, such as car navigation, car audio, and mobile phone systems. These are by no means limiting the multimedia device.
  • Other examples include home electronic appliances.
  • the data communications device in accordance with the present invention is applicable to home electronic appliances, etc.
  • Another data communications system in accordance with the present invention is a data communications system including a network of a plurality of the data communications devices.
  • each data communications device in the system even if communications become impossible between the data communications device at issue and either one of the two data communications devices which perform direct data communications with the data communications device at issue, returns the data received from the other one of the data communications devices to the data communications device.
  • the data communications device immediately before the broken communications line returns the data. This prevents the whole system from going down due to a failure in data transfer. Communications become possible between data communications devices between which communications are possible.
  • the data communications device immediately before that broken data communications device returns data.
  • a transceiver of the data communications device at issue breaks down, the data can be returned via the operational transceiver. Therefore, even when the data communications device or its transceiver is broken, communications are possible between data communications devices between which communications are possible.
  • communications are possible between data communications devices between which communications are possible even if a disruption occurs on the system.
  • a data communications method in accordance with the present invention is a data communications method for a data communications device having two transceivers one of which receives data and the other of which transmits data.
  • the method is characterized by involving the determination step of determiner means determining whether data communications are possible between the two transceivers and a first data communications device and a second data communications device which perform direct data communications with the respective transceivers; and the switching step of the switching means switching whether data received from one of the transceivers is returned from that transceiver or transmitted from the other transceiver.
  • the switching means in the switching step returns the data received from one of the transceivers connected to the other data communications device via the transceiver to the other data communications device.
  • the data received from the other data communications device can be returned to the other data communications device.
  • the data communications method in accordance with the present invention enables communications between data communications devices between which communications are possible without letting the whole data communications system going down even if the communications line breaks down somewhere.
  • the data communications device immediately before the broken data communications device can return the data.
  • a transceiver of the data communications device at issue breaks down, the data can be returned via the operational transceiver. Therefore, according to the data communications method in accordance with the present invention, even when the data communications device or its transceiver is broken, communications are possible between data communications devices between which communications are possible.
  • the data communications device may be realized by a computer, in which case, a data communications computer program realizing the data communications device by a computer by causing the computer to operate as the means and a computer-readable storage medium containing such a data communications computer program also falls within the scope of the present invention.
  • the present invention detailed so far can prevent the whole data communications system from being unusable even if a disruption occurs on the data communications system. Therefore, the invention is preferably applicable to a data communications device and data communications system. It is also preferably applicable to multimedia devices, such as on-board electronics and intelligent home appliances.

Landscapes

  • Engineering & Computer Science (AREA)
  • Signal Processing (AREA)
  • Multimedia (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Aviation & Aerospace Engineering (AREA)
  • Small-Scale Networks (AREA)
  • Mobile Radio Communication Systems (AREA)
  • Optical Communication System (AREA)
US11/037,193 2004-01-21 2005-01-19 Data communications device, data communications system, data communications method, data communications computer program, and computer-readable storage medium containing computer program Abandoned US20050157699A1 (en)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
JP2004-013095 2004-01-21
JP2004013095A JP4166708B2 (ja) 2004-01-21 2004-01-21 データ通信装置、データ通信システム、データ通信方法、データ通信プログラム並びにこのプログラムを記録した記録媒体

Publications (1)

Publication Number Publication Date
US20050157699A1 true US20050157699A1 (en) 2005-07-21

Family

ID=34747348

Family Applications (1)

Application Number Title Priority Date Filing Date
US11/037,193 Abandoned US20050157699A1 (en) 2004-01-21 2005-01-19 Data communications device, data communications system, data communications method, data communications computer program, and computer-readable storage medium containing computer program

Country Status (3)

Country Link
US (1) US20050157699A1 (ja)
JP (1) JP4166708B2 (ja)
CN (1) CN100382535C (ja)

Cited By (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20070211689A1 (en) * 2006-03-07 2007-09-13 Campero Richard J Network control
WO2009082742A1 (en) * 2007-12-21 2009-07-02 Vue Technology, Inc. Rfid network control and redundancy
US20090168753A1 (en) * 2006-03-07 2009-07-02 Richard John Campero Rfid network control and redundancy
US20120286967A1 (en) * 2009-12-28 2012-11-15 Laurent Alteirac Downhole Data Transmission System
US20170211378A1 (en) * 2014-06-23 2017-07-27 Evolution Engineering Inc. Optimizing downhole data communication with at bit sensors and nodes
US20210073212A1 (en) * 2018-01-17 2021-03-11 Geeq Corporation Blockchain methods, nodes, systems and products

Families Citing this family (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JP4894494B2 (ja) * 2006-12-13 2012-03-14 日本電気株式会社 リング型ネットワークおよびリング型ネットワークのフェアネス実行プログラム
US9654434B2 (en) * 2012-10-01 2017-05-16 Sharp Kabushiki Kaisha Message originating server, message orginating method, terminal, electric appliance control system, and electric appliance

Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US6615362B1 (en) * 1998-04-27 2003-09-02 Cisco Technology, Inc. System and method for fault recovery for two line bi-directional ring network
US6879558B1 (en) * 1999-12-27 2005-04-12 Fujitsu Limited Switching method for bidirectional line switched ring and node apparatus used in the ring
US6961306B2 (en) * 2002-07-10 2005-11-01 I/O Controls Corporation Fiber optic control network and related method
US7002968B1 (en) * 1999-09-17 2006-02-21 Nippon Telegraph And Telephone Corporation Transport system and transport method
US7209488B2 (en) * 2000-12-18 2007-04-24 Harman Becker Automotive Systems Gmbh Method for assigning a data channel to multiple data links for simultaneous data transmission via a single data channel

Family Cites Families (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN100346588C (zh) * 2001-10-29 2007-10-31 上海贝尔有限公司 用于波分复用光网的双纤双向通道/复用段倒换环系统
CN100361099C (zh) * 2004-01-15 2008-01-09 武汉理工大学 一种光纤can总线自愈环网接口装置

Patent Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US6615362B1 (en) * 1998-04-27 2003-09-02 Cisco Technology, Inc. System and method for fault recovery for two line bi-directional ring network
US7002968B1 (en) * 1999-09-17 2006-02-21 Nippon Telegraph And Telephone Corporation Transport system and transport method
US6879558B1 (en) * 1999-12-27 2005-04-12 Fujitsu Limited Switching method for bidirectional line switched ring and node apparatus used in the ring
US7209488B2 (en) * 2000-12-18 2007-04-24 Harman Becker Automotive Systems Gmbh Method for assigning a data channel to multiple data links for simultaneous data transmission via a single data channel
US6961306B2 (en) * 2002-07-10 2005-11-01 I/O Controls Corporation Fiber optic control network and related method

Cited By (12)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20070211689A1 (en) * 2006-03-07 2007-09-13 Campero Richard J Network control
US20090168753A1 (en) * 2006-03-07 2009-07-02 Richard John Campero Rfid network control and redundancy
US8138891B2 (en) * 2006-03-07 2012-03-20 Sensormatic Electronics, LLC RFID network control and redundancy
US8497762B2 (en) 2006-03-07 2013-07-30 Tyco Fire & Security Gmbh Network control
WO2009082742A1 (en) * 2007-12-21 2009-07-02 Vue Technology, Inc. Rfid network control and redundancy
US20120286967A1 (en) * 2009-12-28 2012-11-15 Laurent Alteirac Downhole Data Transmission System
US9284834B2 (en) * 2009-12-28 2016-03-15 Schlumberger Technology Corporation Downhole data transmission system
US20170211378A1 (en) * 2014-06-23 2017-07-27 Evolution Engineering Inc. Optimizing downhole data communication with at bit sensors and nodes
US10119393B2 (en) * 2014-06-23 2018-11-06 Evolution Engineering Inc. Optimizing downhole data communication with at bit sensors and nodes
US10280741B2 (en) 2014-06-23 2019-05-07 Evolution Engineering Inc. Optimizing downhole data communication with at bit sensors and nodes
US20210073212A1 (en) * 2018-01-17 2021-03-11 Geeq Corporation Blockchain methods, nodes, systems and products
US11468046B2 (en) * 2018-01-17 2022-10-11 Geeq Corporation Blockchain methods, nodes, systems and products

Also Published As

Publication number Publication date
CN1645833A (zh) 2005-07-27
JP2005210286A (ja) 2005-08-04
JP4166708B2 (ja) 2008-10-15
CN100382535C (zh) 2008-04-16

Similar Documents

Publication Publication Date Title
US20050157699A1 (en) Data communications device, data communications system, data communications method, data communications computer program, and computer-readable storage medium containing computer program
US8041832B2 (en) Network data distribution system and method
US7177325B2 (en) Operations, administration and maintenance (OAM) systems and methods for packet switched data networks
US6587904B1 (en) Method and apparatus for preventing loops in a full-duplex bus
US7440443B2 (en) Integrated universal network adapter
US9065760B2 (en) Priority data transmission using Fibre Channel over Ethernet
Lee et al. The principles and performance of Hubnet: A 50 Mbit/s glass fiber local area network
US7466917B2 (en) Method and system for establishing transmission priority for optical light-trails
US7706256B2 (en) Protection switching method and apparatus for nodes in a resilient packet ring network
JP3860215B2 (ja) 単一チャンネル双方向無線通信用半二重ｕａｒｔ制御
US20110145433A1 (en) Ethernet network component
US6141349A (en) Network system
CN114679415B (zh) 一种满足AXI5-Lite协议标准的无阻塞banyan网络
US20100034214A1 (en) Access point device, communication device and method for access to communication media
US6999460B1 (en) Arbitrated loop port switching
US6112072A (en) Method for entering and leaving a power-saving operation of a subscriber in an annular communication network
US20060045106A1 (en) Repeater apparatus for supporting a plurality of protocols, and a method for controlling protocol conversion in the repeater apparatus
KR102046358B1 (ko) 적응적 광무선 통신 방법 및 장치
US10687129B2 (en) Data center network
JP7456603B2 (ja) スイッチ装置
KR100226781B1 (ko) 노드(node)인식(recognition)방법
JP2003143206A (ja) 光通信網およびプログラムおよび記録媒体
JP2002209014A (ja) 情報伝送装置
JPH11187023A (ja) データ通信システム及びその方法
US20020127969A1 (en) Wireless network storage device and method

Legal Events

Date Code Title Description
AS Assignment

Owner name: SHARP KABUSHIKI KAISHA, JAPAN

Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNOR:SAKAI, KOJI;REEL/FRAME:016199/0233

Effective date: 20050106

STCB Information on status: application discontinuation

Free format text: ABANDONED -- FAILURE TO RESPOND TO AN OFFICE ACTION