CN104539407A - Computing method of redundancy link data transmission protocol - Google Patents
Computing method of redundancy link data transmission protocol Download PDFInfo
- Publication number
- CN104539407A CN104539407A CN201410824422.0A CN201410824422A CN104539407A CN 104539407 A CN104539407 A CN 104539407A CN 201410824422 A CN201410824422 A CN 201410824422A CN 104539407 A CN104539407 A CN 104539407A
- Authority
- CN
- China
- Prior art keywords
- link
- data
- base station
- jumping
- coffret
- 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.)
- Pending
Links
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L1/00—Arrangements for detecting or preventing errors in the information received
- H04L1/22—Arrangements for detecting or preventing errors in the information received using redundant apparatus to increase reliability
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Small-Scale Networks (AREA)
Abstract
Provided is a computing method of a redundancy link data transmission protocol. Multi-hop data transmission commonly used in an industrial field is single-direction transmission. Once a line or equipment fault happens, following data cannot be transmitted to an upper computer. The method comprises the steps that the upper computer, a transmission equipment group connected with the upper computer and a group of equipment for receiving and forwarding data are connected through communication electric cables to form a line-shaped or star-shaped network, and a redundancy data transmission link is established for data transmission through the network. The method is used for redundancy link data transmission protocol computing.
Description
technical field:
the present invention relates to a kind of computational methods of redundant link Data Transport Protocol.
background technology:
usual the adopted multi-hop data transmission of industry spot, be only one-way transmission, once circuit or equipment fault, data below just cannot be transferred to host computer.
summary of the invention:
the object of this invention is to provide a kind of computational methods of redundant link Data Transport Protocol.
above-mentioned object is realized by following technical scheme:
a kind of computational methods of redundant link Data Transport Protocol, host computer, the one group of transmission equipment be connected with host computer, one group of equipment receiving also forwarding data are become linear or star network by telecommunication cable connection establishment, sets up redundant data transmissions link by this network and carry out transfer of data.
the computational methods of described redundant link Data Transport Protocol, by the transmission equipment that is directly connected with host computer coffret, the data transmission link of the automatic Dynamic Establishing of each coffret oneself, coffret will be arranged in end that is linear or star network; Receiving the equipment of also forwarding data base station, base station is exactly transport network node; Initiate tissue by coffret and set up data transmission link, each coffret has unique data link number, and different transmission interfaces data link is number not identical, and the transfer of data jumping figure of coffret is 0; After coffret powers on, send link establishment instruction, content comprises link No., jumping figure, and the jumping figure after base station receives link establishment instruction in modify instruction is increasing 1, forwards this instruction afterwards; Preserve link No. and amended jumping figure simultaneously, when certain base station receives the link establishment instruction of the different link No.s that multiple coffret is sent, compare jumping figure, select the minimum link of jumping figure to be oneself present data transmission link; Link No. and jumping figure that different transmission interfaces sends will be preserved as reserve link during current ink fault in base station, and the port label receiving instruction is upstream data port by base station, and other port label are downlink port; Base station may receive the link establishment instruction of the different jumping figures of same link No., gets the data link that the little person of jumping figure is oneself; The minimum up data link of a jumping figure is only set up in each base station, and downlink data may have mulitpath; In data transmission network, when data upload, data always flow from the base station that link hop count is large to the base station that jumping figure is little, and each base station only has a uploading data link; During data down transmission, data flow from the base station that link hop count is little to the base station that jumping figure is large, may have multiple downlink path; Downlink data packet must comprise data link number and packet jumping figure, base station often forwards a packet, and jumping figure increases 1, and each base station is before forwarding uplink data, first judge whether data link is number consistent with self current adopted link No., just forwarding data time consistent; Each base station before converting downlink data, first judge data link number and packet jumping figure whether consistent with self current adopted link No. and link hop count, when the two is all consistent, just forwarding data; When in data transmission network because of certain base station or certain line fault and cannot forwarding data time, base station reserve link that jumping figure can be selected minimum is as the new data link of oneself, and uploading data again.
beneficial effect:
1. the present invention is applicable to the linear or star network of multi-hop, and apparatus structure is simple, comprises host computer, coffret and transmission base station; Certain circuit or equipment fault in this device, can not cause large area data transmission failure; The data transmission link of the automatic Dynamic Establishing of each coffret oneself, to guarantee transfer of data.
the link establishment instruction regularly sent by host computer or coffret, data transmission system can be set up or repair data transmission link automatically.
accompanying drawing illustrates:
accompanying drawing 1 is coffret workflow schematic diagram of the present invention.
accompanying drawing 2 is base station operation schematic flow sheets of the present invention.
embodiment:
embodiment 1:
a kind of computational methods of redundant link Data Transport Protocol, host computer, the one group of transmission equipment be connected with host computer, one group of equipment receiving also forwarding data are become linear or star network by telecommunication cable connection establishment, sets up redundant data transmissions link by this network and carry out transfer of data.
embodiment 2:
the computational methods of the redundant link Data Transport Protocol according to embodiment 1, by the transmission equipment that is directly connected with host computer coffret, the data transmission link of the automatic Dynamic Establishing of each coffret oneself, coffret will be arranged in end that is linear or star network; Receiving the equipment of also forwarding data base station, base station is exactly transport network node; Initiate tissue by coffret and set up data transmission link, each coffret has unique data link number, and different transmission interfaces data link is number not identical, and the transfer of data jumping figure of coffret is 0; After coffret powers on, send link establishment instruction, content comprises link No., jumping figure, and the jumping figure after base station receives link establishment instruction in modify instruction is increasing 1, forwards this instruction afterwards; Preserve link No. and amended jumping figure simultaneously, when certain base station receives the link establishment instruction of the different link No.s that multiple coffret is sent, compare jumping figure, select the minimum link of jumping figure to be oneself present data transmission link; Link No. and jumping figure that different transmission interfaces sends will be preserved as reserve link during current ink fault in base station, and the port label receiving instruction is upstream data port by base station, and other port label are downlink port; Base station may receive the link establishment instruction of the different jumping figures of same link No., gets the data link that the little person of jumping figure is oneself; The minimum up data link of a jumping figure is only set up in each base station, and downlink data may have mulitpath; In data transmission network, when data upload, data always flow from the base station that link hop count is large to the base station that jumping figure is little, and each base station only has a uploading data link; During data down transmission, data flow from the base station that link hop count is little to the base station that jumping figure is large, may have multiple downlink path; Downlink data packet must comprise data link number and packet jumping figure, base station often forwards a packet, and jumping figure increases 1, and each base station is before forwarding uplink data, first judge whether data link is number consistent with self current adopted link No., just forwarding data time consistent; Each base station before converting downlink data, first judge data link number and packet jumping figure whether consistent with self current adopted link No. and link hop count, when the two is all consistent, just forwarding data; When in data transmission network because of certain base station or certain line fault and cannot forwarding data time, base station reserve link that jumping figure can be selected minimum is as the new data link of oneself, and uploading data again.
Claims (2)
1. the computational methods of a redundant link Data Transport Protocol, it is characterized in that: host computer, the one group of transmission equipment be connected with host computer, one group of equipment receiving also forwarding data are become linear or star network by telecommunication cable connection establishment, sets up redundant data transmissions link by this network and carry out transfer of data.
2. the computational methods of redundant link Data Transport Protocol according to claim 1, it is characterized in that: by the transmission equipment that is directly connected with host computer coffret, the data transmission link of the automatic Dynamic Establishing of each coffret oneself, coffret will be arranged in end that is linear or star network; Receiving the equipment of also forwarding data base station, base station is exactly transport network node; Initiate tissue by coffret and set up data transmission link, each coffret has unique data link number, and different transmission interfaces data link is number not identical, and the transfer of data jumping figure of coffret is 0; After coffret powers on, send link establishment instruction, content comprises link No., jumping figure, and the jumping figure after base station receives link establishment instruction in modify instruction is increasing 1, forwards this instruction afterwards; Preserve link No. and amended jumping figure simultaneously, when certain base station receives the link establishment instruction of the different link No.s that multiple coffret is sent, compare jumping figure, select the minimum link of jumping figure to be oneself present data transmission link; Link No. and jumping figure that different transmission interfaces sends will be preserved as reserve link during current ink fault in base station, and the port label receiving instruction is upstream data port by base station, and other port label are downlink port; Base station may receive the link establishment instruction of the different jumping figures of same link No., gets the data link that the little person of jumping figure is oneself; The minimum up data link of a jumping figure is only set up in each base station, and downlink data may have mulitpath; In data transmission network, when data upload, data always flow from the base station that link hop count is large to the base station that jumping figure is little, and each base station only has a uploading data link; During data down transmission, data flow from the base station that link hop count is little to the base station that jumping figure is large, may have multiple downlink path; Downlink data packet must comprise data link number and packet jumping figure, base station often forwards a packet, and jumping figure increases 1, and each base station is before forwarding uplink data, first judge whether data link is number consistent with self current adopted link No., just forwarding data time consistent; Each base station before converting downlink data, first judge data link number and packet jumping figure whether consistent with self current adopted link No. and link hop count, when the two is all consistent, just forwarding data; When in data transmission network because of certain base station or certain line fault and cannot forwarding data time, base station reserve link that jumping figure can be selected minimum is as the new data link of oneself, and uploading data again.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201410824422.0A CN104539407A (en) | 2014-12-26 | 2014-12-26 | Computing method of redundancy link data transmission protocol |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201410824422.0A CN104539407A (en) | 2014-12-26 | 2014-12-26 | Computing method of redundancy link data transmission protocol |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN104539407A true CN104539407A (en) | 2015-04-22 |
Family
ID=52854880
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201410824422.0A Pending CN104539407A (en) | 2014-12-26 | 2014-12-26 | Computing method of redundancy link data transmission protocol |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN104539407A (en) |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102802173A (en) * | 2012-08-06 | 2012-11-28 | 中国矿业大学(北京) | System for underground communication and staff monitoring based on TD-LTE technology |
| CN102857992A (en) * | 2012-09-05 | 2013-01-02 | 江南大学 | ZigBee network based multi-gateway transmission system |
| CN103260211A (en) * | 2013-04-27 | 2013-08-21 | 北京交通大学 | Improved AOMDV routing method |
| CN103294011A (en) * | 2012-02-29 | 2013-09-11 | 江阴中科矿业安全科技有限公司 | Mine vehicle scheduling control system |
| CN104270828A (en) * | 2014-09-23 | 2015-01-07 | 中国民航大学 | Wireless transmission system of airport ground vehicle monitoring management |
-
2014
- 2014-12-26 CN CN201410824422.0A patent/CN104539407A/en active Pending
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103294011A (en) * | 2012-02-29 | 2013-09-11 | 江阴中科矿业安全科技有限公司 | Mine vehicle scheduling control system |
| CN102802173A (en) * | 2012-08-06 | 2012-11-28 | 中国矿业大学(北京) | System for underground communication and staff monitoring based on TD-LTE technology |
| CN102857992A (en) * | 2012-09-05 | 2013-01-02 | 江南大学 | ZigBee network based multi-gateway transmission system |
| CN103260211A (en) * | 2013-04-27 | 2013-08-21 | 北京交通大学 | Improved AOMDV routing method |
| CN104270828A (en) * | 2014-09-23 | 2015-01-07 | 中国民航大学 | Wireless transmission system of airport ground vehicle monitoring management |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US10958581B2 (en) | Data transmission method and communications apparatus | |
| MX2017004936A (en) | Communication between devices of a neighbor aware network. | |
| CN106470117B (en) | Transmission switching method, equipment and the system of LTE broadband cluster system | |
| US20200383020A1 (en) | Method and device for pscell switching | |
| CN101610535A (en) | Multilink direct continuous show scape guarantees the method, system and device of BFD conversation stability down | |
| CN104270309A (en) | Method for achieving multi-hop BFD under IP RAN equipment | |
| CN105282803A (en) | Communication interface and information transfer method and system based on the same | |
| CN108391324A (en) | Handle the device and method of dual link | |
| WO2019216652A3 (en) | Apparatus and method for providing service in wireless communication system | |
| EP2472793A1 (en) | Method, device and system for transmitting e1 bidirectional looped network data | |
| CN103036724B (en) | State information transmission method, the network equipment and unit equipment | |
| CN104168273B (en) | The method and system of TCP agent are realized under a kind of thin ap mode | |
| SG11201909799TA (en) | Communication method, access network device and terminal device | |
| CN206470580U (en) | safety programmable logic controller communication system | |
| CN101827419B (en) | Method, device and system for data transmission | |
| CN102811451B (en) | Method and device for controlling connection of control and provisioning of wireless access points (Capwap) tunnel | |
| CN105207824A (en) | SDN based automatic protection switching system and method | |
| CN105681225A (en) | Network resource acquisition method and device | |
| CN109218040A (en) | Track transportation industry communication system of data transmission and method based on LTE technology | |
| CN108540274A (en) | A kind of data transmission method and device based on NB-iot | |
| CN107612738A (en) | The uplink traffic fast switching system and method for VPLS dual-homed service models | |
| EP2573977A1 (en) | Subnet protection method and device for transport multi-protocol label switching (tmpls) network | |
| CN104539407A (en) | Computing method of redundancy link data transmission protocol | |
| CN104300681B (en) | A kind of station level device node state monitoring method of intelligent substation | |
| CN104618927A (en) | Evolved Node B reconfiguration method, user equipment, and evolved Node B |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| RJ01 | Rejection of invention patent application after publication | ||
| RJ01 | Rejection of invention patent application after publication |
Application publication date: 20150422 |