CN102065005A - Method for realizing function of sharing Ethernet of reverse bi-directional 2M ring - Google Patents
Method for realizing function of sharing Ethernet of reverse bi-directional 2M ring Download PDFInfo
- Publication number
- CN102065005A CN102065005A CN2010105473130A CN201010547313A CN102065005A CN 102065005 A CN102065005 A CN 102065005A CN 2010105473130 A CN2010105473130 A CN 2010105473130A CN 201010547313 A CN201010547313 A CN 201010547313A CN 102065005 A CN102065005 A CN 102065005A
- Authority
- CN
- China
- Prior art keywords
- node
- center
- loop
- bandwidth
- vid
- 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.)
- Granted
Links
Images
Landscapes
- Small-Scale Networks (AREA)
Abstract
The invention relates to a method for realizing the function of sharing Ethernet of a reverse bi-directional 2M ring. The prior art mainly refers to an application using each timeslot as a unit of, an application in a sharing mode or an application combining the two modes. The method provided by the invention adopts a time slice scheduling mode to realize application and allocation of Ethernet bandwidth for each node on the 2M ring on the basis that the 2M ring is divided into three independent data flows, namely, uplink data flow, downlink data flow and network administration data flow on a logic channel of the reverse bi-directional 2M ring so that each node can share the Ethernet bandwidth function of the loop. Through the invention, communication between the nodes and a center on the 2M logic channel can be realized in an Ethernet data frame format, and each node only can communicate with the center, thereby theoretically avoiding Ethernet broadcast storm.
Description
Technical field
The invention belongs to the communications field, the transmission method that relates to a kind of Ethernet service, be specially when using the time slice scheduling mode and realizing converse two-way 2M ring networking ring and go up the application of Ethernet bandwidth and the distribution of each node, thereby realize that each node can share the function of loop Ethernet bandwidth.
Background technology
In the base station information transformation and rotating ring monitoring project of operator, be in the transmission group net mode of medium at present, under the situation of the nervous relatively requirement again of 2M resource monitoring independent transmission networking, often adopt 2M ring networking mode with 2M under the SDH (synchronous transmission system).In the networking of 2M ring, to use 2M between center and node and be connected with each other, the shared 2M bandwidth of each node generally needs to gather serial data and ether data.The method for designing of 2M ring has the Ethernet switch of the employing method of switch type layer by layer, the method that adopts the 2M time slot to be sub-divided into loop node equipment is arranged, also has converse two-way 2M ring method for designing, wherein converse two-way 2M ring possesses the function of monocycle networking, topology tracking, concurrent choosing receipts, can realize real dicyclo networking, have advantage aspect reliability, cost and the construction maintenance.In the design of converse two-way 2M ring, all TX directions of 2M connected to one another and RX direction have logically formed converse each other annular logical channel between Centroid and base-station node, according to time slot segmentation mode 2M is divided into up, descending, three kinds of independent data stream of webmaster on any logical channel, the center of can realizing is realized data communication and webmaster with node by non-consistent routing mode; Independently up, downlink bandwidth can with the communication mode of webmaster expense matching design different business kind, different transmission methods, be the application of unit with the time slot, with the application of sharing mode, perhaps dual mode in conjunction with using etc.
Summary of the invention
The present invention is directed to the deficiencies in the prior art, a kind of method that realizes converse two-way 2M ring shared ethernet function is provided, this method is 2M to be divided on the basis of up, descending, three kinds of independent data streams of webmaster in converse two-way 2M ring logical channel, use the time slice scheduling mode and realize the application of Ethernet bandwidth and the distribution of each node on the 2M ring, thereby realize that each node can share the function of the Ethernet bandwidth of loop.
For achieving the above object, the technology path of employing is as follows:
It is that unit is divided into three parts with the time slot that converse two-way 2M encircles its arbitrary 2M logical channel, and promptly webmaster is descending and up.Uplink and downlink take different time slots respectively, are descending with the center to node definition, and node is defined as up to the center.Upper and lower provisional capital communicates according to form in order to netting index too.Descending Ethernet data adopts the center forms of broadcasting to issue, adopt the timeslice application and the method for salary distribution to realize communicating by letter of center and node at up direction, concrete sport technique segment comprises and at first shines upon empty ID application and allotment bandwidth then, contains closed loop and open loop allocation strategy in the application and allotment bandwidth again.
The empty ID method of described mapping is:
The TVID value that step 5. node will receive loop broadcasting compares with the VID value that obtains from network management path, if equal then mapping relations have been set up at node and center;
Step 6. is as the numerical value change of TVID, and then the VID value equals node and the center foundation mapping of TVID, all the other nodes cancellation mapping relations, and as the center TVID numerical value being filled out is 0, then cancels the mapping relations that all nodes and center are set up.
Described application and allotment bandwidth method is:
VID has separately been determined by network management path in each node of step a. loop and center;
Each node of step b. loop produces Ethernet upstream bandwidth demand, and each node uploads to the center with bandwidth application position separately by network management path;
The bandwidth application position of each node is received at the step c center, according to the VID size sequence, at the 0th time slot of odd number sequence 2M frame 0～4 inserts the VID value one by one, promptly to loop broadcasting TVID, each TVID continues the regular hour, mapping is alternately set up with each loop node in the realization center, and this method is referred to as time slice scheduling;
In the time that steps d .TVID continues, set up the node of mapping with the center and monopolize the loop upstream bandwidth, and in this upstream bandwidth, Ethernet data is sent to the center, after mapping is switched, stop to send;
Step e. center is extracted the Ethernet data of each node respectively and is sent to external network in the upstream bandwidth of each node;
Step f. repeating step c～step e is not sending bandwidth application position to the center by network management path up to each node.
Closed loop and open loop allocation strategy comprise open loop allocation strategy and closed loop allocation strategy.
Described open loop allocation strategy is meant the bandwidth application position of center monitors node and distributes timeslice to node that the size of all timeslices is changeless.
Described closed loop allocation strategy is meant the bandwidth application position of center monitors node and distributes timeslice to node, the size of timeslice is dynamically adjusted, if reaching not end of ethernet data frame in limited time on the timeslice, then continue to increase timeslice, finish up to Frame; If reaching on the timeslice in limited time not too that net data frame is being uploaded then concluding time sheet immediately.
Adopt the present invention to design 2M logical channel shared ethernet bandwidth and have following effect:
Description of drawings
Fig. 1 is 2M ring networking logic diagram;
Fig. 2 is a VID mapping mechanism schematic diagram.
Embodiment
Below in conjunction with accompanying drawing the present invention is further detailed:
Figure 1 shows that converse two-way 2M ring logic networking diagram, by the 2M interconnection, can find out obviously that the TX of all 2M and RX constitute an independently logical channel respectively between center and base station A, B, the C.Shown in the according to the form below, arbitrary logical channel is divided into up, descending, three kinds of independent data streams of webmaster also have the 0th time slot of 2M to do synchronous usefulness according to standard G.704 in addition.Uplink and downlink take different time slots respectively, are descending with the center to node definition, and node is defined as up to the center.Upper and lower provisional capital communicates according to form in order to netting index too.
| |
|
Time slot N～30 (descending) | Time slot 31 |
Descending Ethernet data adopts the center forms of broadcasting to issue, and adopts the timeslice application and the method for salary distribution to realize communicating by letter of center and node at up direction, and concrete sport technique segment comprises and shines upon empty ID, application and allotment bandwidth, closed loop and open loop allocation strategy.
Shine upon empty ID specifically:
31st time slot of Centroid on the 2M loop is that unit sets up self-defined short frame with 16 bytes, and every 16 continuous short frames are a node period T
1, every 32 continuous node cycles are a loop cycle T
2, by the time of a byte transmission be that a 2M frame period is 125us, node period T then
1=16 * 125 μ s * 16=32ms, a loop cycle T
2=32 * T
1=1024ms, the sequence number in the node cycle that it comprises is 0～31, the short frame number in each node cycle is 0～15.
Sequence number is that No. 0 short frame in node cycle of 0～30 is that network configuration is obtained frame, is used to obtain the node ID and the state of network configuration; No. 8 short frame is used for node control, comprises the id information and the control information of Be Controlled node; The 1st～No. 7 short frame and the 9th～No. 15 short frame are used for the self-defined expense of loop node.
Sequence number is that No. 0 short frame and No. 8 short frame in node cycle of 31 is used for system broadcasts, realizes the control of whole loop consistency operation; The 1st～No. 7 short frame and the 9th～No. 15 short frame are used for the self-defined expense of loop node.
In a loop cycle, node is a route successively, and the node of route process all uploads to No. 0 short frame in node cycle with this node ID and state information, and is provided with and uploads flag bit, guarantees not repeat in the same loop cycle to upload.The center is mapped the ID of each node device on the loop that obtains and is referred to as both VID of empty ID with the node cycle sequence number of uploading this ID, mapping method, VID equate in proper order with the route of node, also equal node cycle sequence number and add 1.
According to above-mentioned corresponding method, the VID at the 1st station on the loop is that the VID at 1, the 2 station is 2, and the rest may be inferred, and maximum is 31 among the VID that can obtain, and minimum value is 1.The 8th short frame of the mapping relations of VID and ID by the node cycle both node control frame is delivered to node on the loop, by the uniqueness of ID, then can set up one-to-one relationship between ID and VID.
According to standard G.704, the 0th time slot of 2M is that synchronization overhead is used, and wherein even number sequence 2M frame the 0th time slot transmits sync bit 0x1b, leaves home communications usefulness for, can freely use for the designer for 0～4 of odd number sequence 2M frame the 0th time slot.0～4 maximum that can express of odd number sequence the 0th time slot is 31, and minimum value is 0, can transmit VID information fully, also has remaining value 0.With the VID information definition of odd number sequence transmission is TVID, and the TVID scope is between 0～31.
Fig. 2 is VID mapping and allocated bandwidth schematic diagram, particularly TVID and upstream node bandwidth have been set up mapping, when the TVID information that node parses from the 0th time slot is identical with self VID information, then continuous two the pairing upstream bandwidth 2N of 2M frame bytes for this node all.If TVID continues m 2M frame period, then the bandwidth obtained of respective nodes is m * 2N byte.Just mean the switching of loop bandwidth mapping when TVID changes, when TVID was 0, all nodes on the loop all can not obtain bandwidth.
The step of the empty ID of concrete mapping is:
The node of step 1. loop route process is uploaded this node ID and state information, and guarantees that each node does not repeat to upload in the loop cycle;
Insert VID numerical value for 0～4 of the 0th time slot of step 4. odd number sequence 2M frame and be referred to as TVID, be used for the broadcasting of mind-set loop and use;
The TVID value that step 5. node receives loop broadcasting compares with the VID value that obtains from network management path, if equal then mapping relations have been set up at node and center;
Step 6. is as the numerical value change of TVID, and then the VID value equals node and the center foundation mapping of TVID, all the other nodes cancellation mapping relations, and as the center TVID numerical value being filled out is 0, then cancels the mapping relations that all nodes and center are set up.
Bandwidth application and allotment mechanism
Bandwidth application and allotment mechanism is to have utilized the self-defined expense content of 1～7 and 9～15 short frames in node cycle, designs the upstream bandwidth distribution mechanism of each node of loop in conjunction with the TVID switching wheel flow distribution timeslice method at center.Any one short frame all has effective expense of 12 bytes, and the present invention has utilized 4 bytes wherein to use to the center uplink bandwidth application as node.The bit wide of 4 bytes is the 32bit position, and its bit sequence is 0～31, has comprised the scope of node VID, is defined as bandwidth application position.When certain node has Ethernet upstream bandwidth demand, node can will be identical in 1～7 and 9～15 short frames in all node cycles with VID bandwidth application location 1, as shown in Figure 2, the bandwidth application position of each node of center monitors, and utilize switching TVID that different nodes are distributed upstream bandwidths.
The performing step that bandwidth application and allotment mechanism is concrete is as follows:
VID has separately been determined by network management path in each node of step a. loop and center;
Each node of step b. loop produces Ethernet upstream bandwidth demand, and each node uploads to the center with bandwidth application position separately by network management path;
The bandwidth application position of each node is received at the step c center, according to the VID size sequence, at the 0th time slot of odd number sequence 2M frame 0～4 inserts the VID value one by one, promptly to loop broadcasting TVID, each TVID continues the regular hour, mapping is alternately set up with each loop node in the realization center, and this method is referred to as time slice scheduling;
In the time that steps d .TVID continues, set up the node of mapping with the center and monopolize the loop upstream bandwidth, and in this upstream bandwidth, Ethernet data is sent to the center, after mapping is switched, stop to send;
Step e. center is extracted the Ethernet data of each node respectively and is sent to external network in the upstream bandwidth of each node;
Step f. continues step c～step e and is not sending bandwidth application position to the center by network management path up to each node.
Closed loop and open loop allocation strategy
The open loop allocation strategy is meant the bandwidth application sign of center monitors node and to node distribution timeslice, the size of timeslice is changeless, and as 2000 bytes, the open loop allocation strategy need not be analyzed the data that node returns.
The 2M ring is based on the annular networking under the SDH, and data return the certain route time of whole route needs at center through the 2M logical loops from the center, be defined as T
3, T in general
3Less than 4ms.
Node can be uploaded in the bandwidth that timeslice limits the ether data behind the time of receipt (T of R) sheet immediately, and the Ethernet data frames message is between 64 bytes and 1518 bytes, and a complete message is indivisible.Because the timeslice size is limited, so just faces such problem, both last Ether frame had exceeded the determined bandwidth upper limit of timeslice.For addressing this problem, on timeslice, set last Ethernet net data frame embarkation point, after the ethernet data frame that assurance is uploaded was at last uploaded and finished, timeslice finished as yet.Definition time sheet size is Y, and then embarkation point theoretical maximum X is: X=Y-1518
That is to say that ethernet data frame was uploaded arbitrarily before the X point, in case but surpassed the X point then can only after this frame is uploaded end, stop to upload.Adopt the open loop control strategy, the relation between its timeslice size Y and the embarkation point X has determined the service efficiency of timeslice, and 1518 byte average utilizations between the Y-X are 50% for a long time, its efficient Z
1Can be designed to: Z
1=(X+1518/2)/Y=1-759/Y
Visual efficiency Z
1Be directly proportional with Y, Y is big more, and then efficient is high more, but owing on a loop a lot of nodes are arranged, so Y is too big, and then the transmission time of single timeslice will correspondingly prolong, all the other node time sheet assignment response speed can be influenced when competition takes place, and promptly the handoff response time is inversely proportional to Y.Therefore can be according to the size of the number design Y of loop node, when guaranteeing efficiency of transmission and satisfy the needs of handoff response time.Adopt the open loop allocation strategy to distribute timeslice can produce certain bandwidth waste, but the reliability of data transmission of each node and loop route time T
3Irrelevant, T no matter
3Time how long, timeslice carrying ethernet data frame total energy route be gone back to the center.
The closed loop allocation strategy is meant the bandwidth application sign of center monitors node and distributes timeslice to node, the size of timeslice is dynamically adjusted, need analyze the data that node returns, if reaching not end of ethernet data frame in limited time on the timeslice, then continue to increase timeslice, finish up to Frame; If reaching on the timeslice in limited time not too that net data frame is being uploaded then concluding time sheet immediately.
Set the allocation of parameters N=20 of loop upstream and downstream bandwidth, behavior 20 bytes on each 2M frame then, the timeslice of 2000 bytes is passed through the time T of node fully
4For: T
4=2000/20 * 125 μ s=12ms.
Because whether open loop allocation strategy center has ethernet data frame to upload when wanting the monitoring time sheet to finish, and so just requires timeslice timeslice when getting back to the center through a route cycle of default size also not assign, and both requires: T
3＜T
4
Employing closed loop allocation strategy node ethernet data frame loading point in theory is the upper limit of default size timeslice, the average bandwidth utilance Z of each node on the ring
2For: Z
2=(T
4-T
3)/T
4=1-T
3/ T
4
By above-mentioned formula, T
4Big more, both timeslice was big more, efficiency of transmission Z
2High more, this point is consistent with the closed loop strategy, but the closed loop allocation strategy is relevant with loop time delay, when a loop time delay hour employing closed loop allocation strategy can obtain high efficiency of transmission.
Claims (2)
1. a method that realizes converse two-way 2M ring shared ethernet function is characterized in that this method comprises: shine upon empty ID and application and allotment bandwidth;
The empty ID method of described mapping is:
Step 1. is uploaded the ID and the state information of the node of loop route process, and guarantees that each node does not repeat to upload in the loop cycle;
Corresponding relation is set up in proper order with each node ID of loop route acquisition and the route of each node in step 2. center, is designated as VID, and the value of VID is identical with the route order of each node on loop;
Step 3. utilizes network management path that the corresponding relation of VID and ID is sent to each node in loop cycle, makes each node know the pairing VID of self ID;
Step 4. is according to standard G.704, and 0～4 of the 0th time slot of odd number sequence 2M frame is inserted VID numerical value, is designated as TVID, and TVID is used for mind-set loop broadcasting usefulness;
The TVID value that step 5. node will receive loop broadcasting compares with the VID value that obtains from network management path, if equal then mapping relations have been set up at node and center;
Step 6. is as the numerical value change of TVID, and then the VID value equals node and the center foundation mapping of TVID, all the other nodes cancellation mapping relations, and as the center TVID numerical value being filled out is 0, then cancels the mapping relations that all nodes and center are set up;
Described application and allotment bandwidth method is:
VID has separately been determined by network management path in each node of step a. loop and center;
Each node of step b. loop produces Ethernet upstream bandwidth demand, and each node uploads to the center with bandwidth application position separately by network management path;
The bandwidth application position of each node is received at the step c center, according to the VID size sequence, 0～4 at the 0th time slot of odd number sequence 2M frame inserts the VID value one by one, promptly to loop broadcasting TVID, each TVID continues the time of setting, and the realization center replaces and each loop node is set up mapping;
Steps d. in the time that TVID continues, set up the node of mapping with the center and monopolize the loop upstream bandwidth, and in this upstream bandwidth, Ethernet data is sent to the center, after mapping is switched, stop to send;
Step e. center is extracted the Ethernet data of each node respectively and is sent to external network in the upstream bandwidth of each node;
Step f. repeating step c, steps d and step e are not sending bandwidth application position to the center by network management path up to each node.
2. a method that realizes converse two-way 2M ring shared ethernet function is characterized in that: described application and allotment bandwidth method employing open loop allocation strategy and closed loop allocation strategy;
Described open loop allocation strategy is meant the bandwidth application position of center monitors node and distributes timeslice to node that the size of all timeslices is changeless;
Described closed loop allocation strategy is meant the bandwidth application position of center monitors node and distributes timeslice to node, the size of timeslice is dynamically adjusted, if reaching not end of ethernet data frame in limited time on the timeslice, then continue to increase timeslice, finish up to Frame; If reaching on the timeslice in limited time not too that net data frame is being uploaded then concluding time sheet immediately.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2010105473130A CN102065005B (en) | 2010-11-16 | 2010-11-16 | Method for realizing function of sharing Ethernet of reverse bi-directional 2M ring |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2010105473130A CN102065005B (en) | 2010-11-16 | 2010-11-16 | Method for realizing function of sharing Ethernet of reverse bi-directional 2M ring |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN102065005A true CN102065005A (en) | 2011-05-18 |
| CN102065005B CN102065005B (en) | 2012-08-15 |
Family
ID=44000111
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN2010105473130A Expired - Fee Related CN102065005B (en) | 2010-11-16 | 2010-11-16 | Method for realizing function of sharing Ethernet of reverse bi-directional 2M ring |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN102065005B (en) |
Cited By (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104486810A (en) * | 2015-01-06 | 2015-04-01 | 无锡儒安科技有限公司 | Wireless sensor network routing loop prediction method based on multi-dimensional states |
| CN108449285A (en) * | 2018-03-01 | 2018-08-24 | 中国航空无线电电子研究所 | Fraction dispatching method applied to shared Ethernet |
| CN109471834A (en) * | 2018-11-15 | 2019-03-15 | 上海联影医疗科技有限公司 | Synchronous ring structure, synchronous method, medical image system, equipment and storage medium |
| CN112463705A (en) * | 2020-11-27 | 2021-03-09 | 中国兵器装备集团自动化研究所 | Serial port dual-ring network redundant communication method |
Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1728674A (en) * | 2004-07-29 | 2006-02-01 | 中兴通讯股份有限公司 | Method and device for implementing upper ring and lower ring of flexible gruoping ring |
| CN101127706A (en) * | 2007-09-21 | 2008-02-20 | 烽火通信科技股份有限公司 | A dynamic bandwidth allocation and control system based on multi-service transmission platform |
-
2010
- 2010-11-16 CN CN2010105473130A patent/CN102065005B/en not_active Expired - Fee Related
Patent Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1728674A (en) * | 2004-07-29 | 2006-02-01 | 中兴通讯股份有限公司 | Method and device for implementing upper ring and lower ring of flexible gruoping ring |
| CN101127706A (en) * | 2007-09-21 | 2008-02-20 | 烽火通信科技股份有限公司 | A dynamic bandwidth allocation and control system based on multi-service transmission platform |
Cited By (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104486810A (en) * | 2015-01-06 | 2015-04-01 | 无锡儒安科技有限公司 | Wireless sensor network routing loop prediction method based on multi-dimensional states |
| CN108449285A (en) * | 2018-03-01 | 2018-08-24 | 中国航空无线电电子研究所 | Fraction dispatching method applied to shared Ethernet |
| CN109471834A (en) * | 2018-11-15 | 2019-03-15 | 上海联影医疗科技有限公司 | Synchronous ring structure, synchronous method, medical image system, equipment and storage medium |
| CN109471834B (en) * | 2018-11-15 | 2022-04-15 | 上海联影医疗科技股份有限公司 | Sync ring structure, synchronization method, medical imaging system, apparatus, and storage medium |
| CN112463705A (en) * | 2020-11-27 | 2021-03-09 | 中国兵器装备集团自动化研究所 | Serial port dual-ring network redundant communication method |
Also Published As
| Publication number | Publication date |
|---|---|
| CN102065005B (en) | 2012-08-15 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN102802266B (en) | Implementation method of high dynamic self-organization network high efficiency TDMA (time division multiple address) protocol | |
| CN103023822B (en) | Fixed-length time slot based dynamic channel allocation method for time division duplex/time division multiple access | |
| CN102196578B (en) | Cross timeslot allocation method for wireless sensor network | |
| CN102065005B (en) | Method for realizing function of sharing Ethernet of reverse bi-directional 2M ring | |
| CN108270652B (en) | High-speed real-time bus system and data processing method thereof | |
| CN102752040A (en) | Hybrid networking and communication method based on wireless and power line carrier | |
| CN103441960B (en) | The real-time multi-service data communication of power system multiplexing method | |
| CN102904836B (en) | Real-time service time slot encapsulating method for multi-frequency time-division multiple-address access system | |
| CN111836399A (en) | Channel access protocol design method and time slot allocation method for broadband carrier communication network | |
| CN105573193A (en) | Network assembly and method for prioritization of real time messages in a convergent network | |
| CN103118433B (en) | Efficient TDD/TDMA channel dynamic allocation method | |
| CN103166896B (en) | Divide the transmission method realizing two-way communication based on subchannel in ofdm system | |
| CN103841605A (en) | Method and device for achieving coprocessing of baseband signal among multipe BBU devices | |
| US10869222B2 (en) | Data frame transmission method and apparatus for virtual elastic CPRI interface | |
| CN100488175C (en) | Serial tandem connection bus up flow control method and node equipment | |
| CN102271403B (en) | Multi-channel multiplexing method of super-high-speed wireless personal area network | |
| CN103269318B (en) | A kind of method of OTN Web broadcast IP multicast signal | |
| CN104917562A (en) | Data self-healing ring network organizing system based on optical fiber transmission | |
| CN102572907A (en) | Wireless communication mode of industrial information corridor | |
| CN204652392U (en) | Based on the data self-healing looped network network device of Optical Fiber Transmission | |
| CN105530205A (en) | Device and method for microwave equipment aggregation | |
| CN109429347A (en) | Slot allocation method and device | |
| CN101577732B (en) | Multi-node communication link and asynchronous serial communication method thereof | |
| US9130730B1 (en) | Apparatus and methods for aggregation of communication bandwidth over multiple wireless communication links | |
| CN101686159B (en) | Power environment monitoring system |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| C14 | Grant of patent or utility model | ||
| GR01 | Patent grant | ||
| C41 | Transfer of patent application or patent right or utility model | ||
| TR01 | Transfer of patent right |
Effective date of registration: 20160524 Address after: Hangzhou City, Zhejiang Province, Binjiang District Puyan street 310053 Albert Road No. 1 Building 5 floor Room 102 Patentee after: Hangzhou Xin Ke Information Technology Co., Ltd. Address before: 310053, building 5, hi tech software park, 1 Weiye Road, Hangzhou, Zhejiang, Binjiang District Patentee before: Hangzhou CNCR-IT Co., Ltd. |
|
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20120815 Termination date: 20201116 |
|
| CF01 | Termination of patent right due to non-payment of annual fee |