CN107682264B - Data transmission method and system based on real-time active path planning - Google Patents
Data transmission method and system based on real-time active path planning Download PDFInfo
- Publication number
- CN107682264B CN107682264B CN201710885042.1A CN201710885042A CN107682264B CN 107682264 B CN107682264 B CN 107682264B CN 201710885042 A CN201710885042 A CN 201710885042A CN 107682264 B CN107682264 B CN 107682264B
- Authority
- CN
- China
- Prior art keywords
- node
- routing
- path
- data
- information
- 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.)
- Active
Links
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/12—Shortest path evaluation
- H04L45/124—Shortest path evaluation using a combination of metrics
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/22—Alternate routing
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/70—Routing based on monitoring results
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The embodiment of the present invention provides a kind of data transmission method and system based on real-time active path planning.Method includes：Start node timing obtains the routing information that data are transmitted from routing scheduling center on demand, and start node is the starting point of data transmission, and routing information includes optimal path information and alternative path information；Routing information of the start node according to acquisition, the logical links of creation data transmission, and transmission data and routing iinformation are packaged into data block, destination node is sent to by the routing function of relay node；Since routing scheduling center can receive the transmission link congestion information of the whole network, and instant optimal path and alternative path are issued accordingly to each node, the logical links that each node can be transmitted according to newest optimal path dynamic adjusting data, therefore, technical solution provided in an embodiment of the present invention can evaluate network congestion situation from global angle, improve the accuracy and timeliness of routing iinformation, and then improve data transfer efficiency.
Description
Technical field
The present embodiments relate to field of communication technology more particularly to a kind of data biographies based on real-time active path planning
Transmission method and system.
Background technique
Shortest path first is common routing algorithm, which can be used for determining in network start node to terminal node
Shortest path.Software defined network (software defined network, SDN), be occur in recent years one kind it is novel
Transmission via net framework is a kind of implementation of network virtualization, a kind of core technology OpenFlow (new network interchange mode
Type) by the way that network equipment control plane is separated with data surface, to realize the flexible control of network flow, make network
Become more intelligent for pipeline.
But the core of this technology needs the support of routing hardware, can not put into a short time practical.Therefore, each at present
Between corporate server node generally use is that TCP or other custom protocols are communicated, dependent on being based on TCP/
The routing device that the operator of IP agreement race provides is routed.And the routing algorithm of the routing device based on TCP/IP only base
It is adjusted in partial result, can not consider optimal path from the overall situation, may cause the delay of data communication.
Summary of the invention
The embodiment of the present invention provides a kind of data transmission method and system based on real-time active path planning, to from
Global angle evaluates network congestion situation, improves the accuracy and timeliness of routing iinformation, and then improve data transfer efficiency.
In order to achieve the above objectives, the embodiment of the present invention adopts the following technical scheme that：
In a first aspect, the embodiment of the present invention provides a kind of data transmission method based on real-time active path planning, including：
Start node timing obtains the routing information that data are transmitted from routing scheduling center on demand, and the start node is
The starting point of data transmission, the routing information includes optimal path information and alternative path information；
Routing information of the start node according to acquisition, the logical links of creation data transmission；
Start node will transmit data and routing iinformation is packaged into data block, according to routing iinformation, be sent to next node,
The next node is relay node or destination node, and the relay node is to have routing function in data transfer path
Transit node, the destination node be data transmission terminal.
With reference to first aspect, in the first possible implementation of the first aspect, when data transfer path generation is different
Chang Shi, start node is by sending instant unexpected message to routing scheduling center, and from routing scheduling center, routing iinformation is worked as in acquisition,
And the information work returned according to routing scheduling center judges, selects the logic chain of current optimal path dynamic adjusting data transmission
Road.
Second aspect, the embodiment of the present invention provide a kind of data transmission method based on real-time active path planning, including：
Relay node receives the data block that adjacent node is sent, and the relay node is to have road in data transfer path
By the transit node of function；
Data block is delivered to next node by the logical link information that relay node includes according to data block header.
In conjunction with second aspect, in the first possible implementation of the second aspect, further include：
Link information between relay node collector node, and it is reported to routing scheduling center, the link information includes phase
Round-trip delay RTT, the packet loss of adjacent internode, and the upstream and downstream bandwidth utilization rate and load of relay node itself.
The third aspect, the embodiment of the present invention provide a kind of data transmission method based on real-time active path planning, including：
Routing scheduling center passes through the link information between relay node collector node；
Routing scheduling center is according to the link information between the node of collection, routine weight value between weighted calculation node, and raw
At the optimal path and alternative path of node-to-node；
The optimal path of node-to-node and alternative path are sent to each start node by the timing of routing scheduling center, or
Person sends current optimal path when receiving the instant unexpected message of node transmission, to node.
Fourth aspect, the embodiment of the present invention provide a kind of data transmission system based on real-time active path planning, including：
Start node, relay node and routing scheduling center, which is characterized in that the start node is adjusted for timing or on demand from routing
Degree center obtains the routing information of data transmission, and the start node is the starting point of data transmission, and the routing information includes most
Shortest path information and alternative path information；
The start node is also used to the routing information according to acquisition, the logical links of creation data transmission；
The start node is also used to transmit data and routing iinformation is packaged into data block, according to routing iinformation, sends
To next node, the next node is relay node or destination node, and the relay node is in data transfer path
Transit node with routing function, the destination node are the terminal of data transmission.
In conjunction with fourth aspect, in the first possible implementation of the fourth aspect, when data transfer path generation is different
Chang Shi, the start node are also used to obtain by sending instant unexpected message to routing scheduling center from routing scheduling center
Current optimal path information, and the logical links transmitted according to current optimal path dynamic adjusting data.
In conjunction with the possible implementation of the first of fourth aspect or fourth aspect, in second of possible implementation
In, the relay node is used to receive the data block of adjacent node transmission, and the relay node is the tool in data transfer path
There is the transit node of routing function；
The relay node is also used to the logical link information for including according to data block header, data block is delivered to next
A node.
Second in conjunction with the possible implementation of the first of fourth aspect or fourth aspect or fourth aspect is possible
Implementation, in the third possible implementation, the relay node are also used to the link information between collector node, and on
Offer routing scheduling center, the link information include adjacent internode round-trip delay RTT, packet loss and relay node from
The upstream and downstream bandwidth utilization rate of body and load.
Second in conjunction with the possible implementation of the first of fourth aspect or fourth aspect or fourth aspect is possible
The possible implementation of the third of implementation or fourth aspect, in the fourth possible implementation, the routing are adjusted
Degree center is used for through the link information between relay node collector node；
The routing scheduling center is also used to the link information between the node according to collection, the path between weighted calculation node
Weight, and generate the optimal path and alternative path of node-to-node；
The routing scheduling center is also used to periodically be sent to the optimal path of node-to-node and alternative path each
Start node, or when receiving the instant unexpected message of node transmission, current optimal path is sent to node.
Technical solution provided in an embodiment of the present invention, start node periodically or on demand obtain data biography from routing scheduling center
Defeated routing information, start node are the starting point of data transmission, and routing information includes optimal path information and alternative path information；
Routing information of the start node according to acquisition, the logical links of creation data transmission, and will transmission data and routing iinformation encapsulation
At data block, destination node is sent to by the routing function of relay node；Since routing scheduling center can receive the transmission of the whole network
Link congestion information, and instant optimal path and alternative path are issued accordingly to each node, each node can be according to newest optimal
The logical links of path dynamic adjusting data transmission, therefore, technical solution provided in an embodiment of the present invention can be from global angles
Degree evaluation network congestion situation, improves the accuracy and timeliness of routing iinformation, and then improve data transfer efficiency.
Detailed description of the invention
In order to illustrate the technical solution of the embodiments of the present invention more clearly, below will be in embodiment or description of the prior art
Required attached drawing is briefly described, it should be apparent that, the accompanying drawings in the following description is only some realities of the invention
Example is applied, it for those of ordinary skill in the art, without creative efforts, can also be according to these attached drawings
Obtain other attached drawings.
Fig. 1 is that the present invention is based on the data transmission network schematic diagrames of real-time active path planning；
Fig. 2 is that the present invention is based on the data transmission procedure schematic diagrames of real-time active path planning；
Fig. 3 A is that the present invention is based on the flow charts of the data transmission method embodiment one of real-time active path planning；
Fig. 3 B is that the present invention is based on the flow charts of the data transmission method embodiment two of real-time active path planning；
Fig. 3 C is that the present invention is based on the flow charts of the data transmission method embodiment three of real-time active path planning；
Fig. 4 is the structural representation of the data transmission system provided in an embodiment of the present invention based on real-time active path planning
Figure.
Specific embodiment
Following will be combined with the drawings in the embodiments of the present invention, and technical solution in the embodiment of the present invention carries out clear, complete
Site preparation description, it is clear that described embodiments are only a part of the embodiments of the present invention, instead of all the embodiments.It is based on
Embodiment in the present invention, it is obtained by those of ordinary skill in the art without making creative efforts every other
Embodiment shall fall within the protection scope of the present invention.
Fig. 1 is that the present invention is based on the data transmission network schematic diagrames of real-time active path planning.Refering to what is shown in Fig. 1, this hair
The increased logical network of the SDN of bright embodiment individually abstracts the unconcerned data transmission problems of business, by network
Feedback network congestion information is calculated to routing scheduling center, routing scheduling center according to current network conditions each node in real time
The optimal path being connected between egress, then each node being handed down in network.Network-feedback processing based on this centralization
Logic evaluates network congestion situation from global angle, and the routing iinformation calculated will be more accurate and timely, with this
To control the indices of overall network data transmission.
Fig. 2 is that the present invention is based on the data transmission procedure schematic diagrames of real-time active path planning.Refering to what is shown in Fig. 2, logic
Transmitting of the network based on data block, the information of real-time collecting chain road simultaneously report global Routing Service, for specifying terminal
An access in logic, and the routing infrastructure that can be issued according to global Routing Service can be set up, a reality is selected
When situation optimal logic transfer path.
The node of logical network can be divided into two kinds according to role：Start-stop node and relay node.
Start-stop node (End Node)：It is only used as the beginning and end of data transmission, is periodically obtained from routing scheduling center
Current optimal path information, and data are transmitted using which paths according to the information decision.
Relay node (Re lay Node)：The transit node being only used as in data path, when receiving data packet according to head
The path that portion has planned is delivered to next node；In addition, be responsible for collector node between link information and be reported to routing adjust
Degree center.
Routing scheduling center (Route Center)：The information of each link is collected by relay node in routing scheduling center
And the optimal routing of each start node is calculated, periodically it is handed down to each start node.
Fig. 3 A is that the present invention is based on the flow charts of the data transmission method embodiment one of real-time active path planning.Such as Fig. 3 A
Shown, the method for the present embodiment may include the following contents.
S101, start node timing obtain the routing information that data are transmitted, start node from routing scheduling center on demand
For the starting point of data transmission, routing information includes optimal path information and alternative path information.
The optimal path is the shortest path obtained by delay, packet loss etc., or is the applied field with operation layer
The adaptable path of scape.
The routing information of S102, start node according to acquisition, the logical links of creation data transmission.
Start node can carry out dynamic adjustment according to current best link after creating transmission path.
S103, start node will transmit data and routing iinformation is packaged into data block, according to routing iinformation, is sent to next
Node, next node are relay node or destination node, and relay node is in data transfer path with routing function
Transit node, destination node are the terminal of data transmission.
Method as described above, wherein when data transfer path is abnormal, start node passes through into routing scheduling
The heart sends instant unexpected message, obtains current optimal path information from routing scheduling center, and return according to routing scheduling center
Information work judge, select the logical links of current optimal path dynamic adjusting data transmission.
There are many situations for the condition for the judgement that data transfer path is abnormal, and can be by start node or relaying
Node is reported to routing scheduling center, is also possible to what routing scheduling center judged according to newest routing iinformation.
Fig. 3 B is that the present invention is based on the flow charts of the data transmission method embodiment two of real-time active path planning.Such as Fig. 3 B
Shown, the method for the present embodiment may include the following contents.
S201, relay node receive the data block that adjacent node is sent, and relay node is having in data transfer path
The transit node of routing function.
Data block is delivered to next section by the logical link information that S202, relay node include according to data block header
Point.
Method as described above further includes：
Link information between relay node collector node, and it is reported to routing scheduling center, link information includes adjacent segments
Between round-trip delay RTT, packet loss, and the upstream and downstream bandwidth utilization rate and load of relay node itself.
In the specific application process, can also be by the link information between independent probe node collector node, and it can be with
By this kind of probe node together with relay node, start node, destination node deployment.Relay node and probe node are to routing
The information that control centre reports can also include other for influencing internodal data transmission other than the link information between node
Key factor information.
Fig. 3 C is that the present invention is based on the flow charts of the data transmission method embodiment three of real-time active path planning.Such as Fig. 3 C
Shown, the method for the present embodiment may include the following contents.
S301, routing scheduling center pass through the link information between relay node collector node.
S302, routing scheduling center are according to the link information between the node of collection, routine weight value between weighted calculation node,
And generate the optimal path and alternative path of node-to-node.
The optimal path of node-to-node and alternative path are sent to each starting and saved by S303, the timing of routing scheduling center
Point, or when receiving the instant unexpected message of node transmission, current optimal path is sent to node.
The generation of routing issues and includes with the process of decision：
1) the relay node moment detects adjacent node connection, and continues to count RTT (Round-Trip Time, when round-trip
Prolong), the information such as packet loss；
2) relay node finds global routing scheduling service by service discovery, and keeps long connection；
3) relay node timing reports the RTT counted on, packet loss and itself upstream and downstream bandwidth utilization rate, the letter such as load
Breath；
If 4) it is unreachable to detect adjacent node for relay node, can immediate feedback give routing scheduling center, so as to quickly extensive
It is multiple；
5) after routing scheduling central collection to every terms of information, every terms of information weighted calculation internode path is weighed according to formula
Value, and generate the optimal path and alternative path of node-to-node；
6) routing scheduling center is triggered periodically or when node reports instant exception issues current optimal path to each
Beginning node；
7) optimal path and alternative path that the starting point of data transmission is issued according to routing scheduling center are initiated, creates one
Logical links, midway through the path that is passed over according to starting point of relay node execute forwarding, until reaching home；
8) when global routing scheduling center issues instant optimal path every time, current optimal path and currently in use is compared
Path, the toggle path if the percent value for differing by more than setting；
9) when starting point realizes that transmission path is abnormal, according to current routing information (optimal and alternative path) selection one
The path replacement current path that item is more suitable for.
Therefore, the present embodiment has following beneficial effect：
1, network central control logic and mathematical logic are separated, data is collected by network node, determined by routing center control
Plan；
2, the routing algorithm of routing center can do decision from global angle, and adjustment effect is more accurate, can control great efforts；
3, the routing algorithm of routing center can update upgrading at any time, and network node does not need to change.
In conclusion technical solution provided in an embodiment of the present invention, by start node timing or on demand from routing scheduling
Center obtains the routing information of data transmission, and start node is the starting point of data transmission, and routing information includes optimal path information
With alternative path information, start node creates the logical links of data transmission according to the routing information of acquisition, and will transmit data
It is packaged into data block with routing iinformation, is sent to next node, next node is relay node or destination node；Relay node
The data block that adjacent node is sent is received, data block is delivered to next by the logical link information for including according to data block header
A node；In addition, since the optimal path of node-to-node and alternative path are periodically sent to each by routing scheduling center
Beginning node, or when receiving the instant unexpected message of node transmission, current optimal path is sent to node, therefore, the present invention
The data transmission method based on real-time active path planning and system that embodiment provides can evaluate network from global angle
Congestion condition improves the accuracy and timeliness of routing iinformation, and then improve data transfer efficiency.
Fig. 4 is the structural representation of the data transmission system provided in an embodiment of the present invention based on real-time active path planning
Figure.As shown in figure 4, the data transmission system provided in an embodiment of the present invention based on real-time active path planning includes：Starting section
Point, relay node and routing scheduling center.
The routing information that data are transmitted is obtained from routing scheduling center for timing or on demand specifically, playing start node,
Start node is the starting point of data transmission, and routing information includes optimal path information and alternative path information；Start node is also used
In the routing information according to acquisition, the logical links of data transmission is created；Start node is also used to transmit data and routing letter
Breath is packaged into data block, according to routing iinformation, is sent to next node, and next node is relay node or destination node, in
After the transit node with routing function that node is in data transfer path, destination node is the terminal of data transmission.
When data transfer path is abnormal, start node is also used to immediately abnormal by sending to routing scheduling center
Message obtains current optimal path information from routing scheduling center, and the information work returned according to routing scheduling center judges, selects
Select out the logical links of current optimal path dynamic adjusting data transmission.
Relay node is used to receive the data block of adjacent node transmission, and relay node is to have road in data transfer path
By the transit node of function；Relay node is also used to the logical link information for including according to data block header, and data block is delivered
To next node.
Relay node is also used to the link information between collector node, and is reported to routing scheduling center, and link information includes
Round-trip delay RTT, the packet loss of adjacent internode, and the upstream and downstream bandwidth utilization rate and load of relay node itself.
Routing scheduling center is used for through the link information between relay node collector node；Routing scheduling center is also used to root
According to the link information between the node of collection, routine weight value between weighted calculation node, and generate the optimal path of node-to-node
And alternative path；Routing scheduling center is also used to timing and the optimal path of node-to-node and alternative path is sent to each
Beginning node, or when receiving the instant unexpected message of node transmission, current optimal path is sent to node.
The data transmission system based on real-time active path planning of the embodiment of the present invention can be used for executing Fig. 3 A, figure
The method of embodiment of the method shown in 3B, Fig. 3 C has corresponding functional module, realization principle and technical effect to be achieved
Similar, details are not described herein.
Finally it should be noted that：The above embodiments are merely illustrative of the technical solutions of the present invention, rather than its limitations；Although
Present invention has been described in detail with reference to the aforementioned embodiments, those skilled in the art should understand that：It still may be used
To modify the technical solutions described in the foregoing embodiments or equivalent replacement of some of the technical features；
And these are modified or replaceed, the range for technical solution of various embodiments of the present invention that it does not separate the essence of the corresponding technical solution.
Claims (8)
1. a kind of data transmission method based on real-time active path planning, which is characterized in that including：
Start node timing obtains the routing information that data are transmitted from routing scheduling center on demand, and the start node is data
The starting point of transmission, the routing information include optimal path information and alternative path information；
Routing information of the start node according to acquisition, the logical links of creation data transmission；
Start node will transmit data and routing iinformation is packaged into data block, according to routing iinformation, be sent to next node, described
Next node is relay node or destination node, and the relay node is having in routing function in data transfer path
Trochanterion, the destination node are the terminal of data transmission；
Wherein, when data transfer path is abnormal, start node by sending instant unexpected message to routing scheduling center,
Current routing information is obtained from routing scheduling center, and the information work returned according to routing scheduling center judges, selects current
The logical links of optimal path dynamic adjusting data transmission.
2. the data transmission method according to claim 1 based on real-time active path planning, which is characterized in that the base
Further include in the data transmission method of real-time active path planning：
Relay node receives the data block that adjacent node is sent, and the relay node is to have routing function in data transfer path
The transit node of energy；
Data block is delivered to next node by the routing iinformation that relay node includes according to data block header.
3. according to the method described in claim 2, it is characterized in that, the transmission side data based on real-time active path planning
Method further includes：
Link information between relay node collector node, and it is reported to routing scheduling center, the link information includes adjacent segments
Between round-trip delay RTT, packet loss, and the upstream and downstream bandwidth utilization rate and load of relay node itself.
4. the data transmission method according to any one of claim 1-3 based on real-time active path planning, feature
It is, the data transmission method based on real-time active path planning further includes：
Routing scheduling center passes through the link information between relay node collector node；
Routing scheduling center is according to the link information between the node of collection, routine weight value between weighted calculation node, and generates section
Point arrives the optimal path and alternative path of node；
The optimal path of node-to-node and alternative path are sent to each start node, Huo Zhe by the timing of routing scheduling center
When receiving the instant unexpected message of node transmission, current optimal path is sent to node.
5. a kind of data transmission system based on real-time active path planning, including：Start node, relay node and routing scheduling
Center, which is characterized in that the start node obtains the path letter that data are transmitted for timing or on demand from routing scheduling center
Breath, the start node are the starting point of data transmission, and the routing information includes optimal path information and alternative path information；
The start node is also used to the routing information according to acquisition, the logical links of creation data transmission；
The start node is also used to transmit data and routing iinformation is packaged into data block, according to routing iinformation, is sent to down
One node, the next node are relay node or destination node, and the relay node is having in data transfer path
The transit node of routing function, the destination node are the terminal of data transmission；
Wherein, when data transfer path is abnormal, the start node is also used to by sending i.e. to routing scheduling center
When unexpected message, obtain current optimal path information from routing scheduling center, and make according to the information that routing scheduling center returns
The logical links of current optimal path dynamic adjusting data transmission is selected in judgement.
6. system according to claim 5, which is characterized in that the relay node is used to receive the number of adjacent node transmission
According to block, the relay node is the transit node with routing function in data transfer path；
The relay node is also used to the logical link information for including according to data block header, and data block is delivered to next section
Point.
7. system according to claim 5, which is characterized in that the relay node is also used to the letter of the link between collector node
Breath, and it is reported to routing scheduling center, the link information includes round-trip delay RTT, the packet loss of adjacent internode, and relaying
The upstream and downstream bandwidth utilization rate of node itself and load.
8. the system according to any one of claim 5-7, which is characterized in that the routing scheduling center is in passing through
Link information between node collector node；
The routing scheduling center is also used to the link information between the node according to collection, the path power between weighted calculation node
Value, and generate the optimal path and alternative path of node-to-node；
The routing scheduling center is also used to timing and the optimal path of node-to-node and alternative path is sent to each starting
Node, or when receiving the instant unexpected message of node transmission, current optimal path is sent to node.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710885042.1A CN107682264B (en) | 2017-09-26 | 2017-09-26 | Data transmission method and system based on real-time active path planning |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710885042.1A CN107682264B (en) | 2017-09-26 | 2017-09-26 | Data transmission method and system based on real-time active path planning |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN107682264A CN107682264A (en) | 2018-02-09 |
| CN107682264B true CN107682264B (en) | 2018-11-16 |
Family
ID=61136293
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201710885042.1A Active CN107682264B (en) | 2017-09-26 | 2017-09-26 | Data transmission method and system based on real-time active path planning |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN107682264B (en) |
Families Citing this family (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN112134763B (en) * | 2020-09-25 | 2022-08-02 | 北京浪潮数据技术有限公司 | Method, system, equipment and medium for transmitting layered messages among cluster nodes |
| CN115022230B (en) * | 2022-05-31 | 2023-11-24 | 中国人民解放军国防科技大学 | Communication path planning method and device |
| CN115514651B (en) * | 2022-09-16 | 2023-08-15 | 山东省计算中心（国家超级计算济南中心） | Cloud edge data transmission path planning method and system based on software-defined stacked network |
| CN118041857A (en) * | 2022-11-08 | 2024-05-14 | 中兴通讯股份有限公司 | Data transmission processing method and device, storage medium and electronic device |
Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101068227A (en) * | 2007-06-01 | 2007-11-07 | 广东中大讯通软件科技有限公司 | System for protecting QoS system based on family gateway and reservation band width technique and method thereof |
| CN103139075A (en) * | 2013-03-13 | 2013-06-05 | 杭州华三通信技术有限公司 | Message transmission method and device |
Family Cites Families (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US8228804B2 (en) * | 2007-07-18 | 2012-07-24 | Opnet Technologies, Inc. | Tuning routing metrics to reduce maximum link utilization or provide failure resiliency |
| KR101787867B1 (en) * | 2013-06-08 | 2017-10-18 | 후아웨이 테크놀러지 컴퍼니 리미티드 | Route forwarding method, apparatus and system |
| CN104506435B (en) * | 2014-12-12 | 2018-05-18 | 杭州华为数字技术有限公司 | Shortest path in SDN controllers and SDN determines method |
| CN104683244B (en) * | 2015-03-09 | 2017-11-03 | 东北大学 | It is a kind of that tactful multicast route method is driven based on path node |
| CN105722150A (en) * | 2016-02-02 | 2016-06-29 | 浪潮软件集团有限公司 | Wireless network |
| CN105721307A (en) * | 2016-02-19 | 2016-06-29 | 华为技术有限公司 | Multipath message forwarding method and device |
| CN105743614B (en) * | 2016-04-01 | 2019-05-24 | 网宿科技股份有限公司 | The transmission method and device of data |
-
2017
- 2017-09-26 CN CN201710885042.1A patent/CN107682264B/en active Active
Patent Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101068227A (en) * | 2007-06-01 | 2007-11-07 | 广东中大讯通软件科技有限公司 | System for protecting QoS system based on family gateway and reservation band width technique and method thereof |
| CN103139075A (en) * | 2013-03-13 | 2013-06-05 | 杭州华三通信技术有限公司 | Message transmission method and device |
Also Published As
| Publication number | Publication date |
|---|---|
| CN107682264A (en) | 2018-02-09 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN107682264B (en) | Data transmission method and system based on real-time active path planning | |
| Qi et al. | Traffic differentiated clustering routing in DSRC and C-V2X hybrid vehicular networks | |
| CN108600102B (en) | Flexible data transmission system based on intelligent cooperative network | |
| CN105471764B (en) | A kind of method of end-to-end QoS guarantee in SDN network | |
| CN101065677B (en) | Router configured for outputting update messages specifying a detected attribute change of a connected active path according to a prescribed routing protocol | |
| Li et al. | OpenFlow based load balancing for fat-tree networks with multipath support | |
| JP3546764B2 (en) | Load balancing server provided in network and node including load balancing server | |
| CN107959633A (en) | A kind of load balance method based on price mechanism in industry real-time network | |
| CN108512760A (en) | The method for routing of QoS of survice is ensured based on SDN | |
| CN105897575A (en) | Path computing method based on multi-constrained path computing strategy under SDN | |
| US20100123572A1 (en) | Alarm reordering to handle alarm storms in large networks | |
| CN101605278B (en) | Method for realizing adaptive signaling in distributed control collaborative optical networks | |
| CN101001200B (en) | Flow engineering full network counting method and system between regions | |
| CN106209669A (en) | Towards SDN data center network maximum of probability path stream scheduling method and device | |
| JPH1065733A (en) | High-speed routing control system | |
| CN111416655A (en) | Low-orbit satellite routing improvement method based on virtual topology | |
| CN108833279A (en) | The method of Multi-constraint QoS paths based on business classification in software defined network | |
| CN111130928B (en) | Network measurement method based on in-band detection in wide area network | |
| CN103618677A (en) | Network flow regulation method and system | |
| CN105071947A (en) | Link optimization method for SDN network | |
| CN107800624A (en) | A kind of optimal circuitous path selection new method of regional protection key message | |
| CN102427596B (en) | Routing method and scheduling method of node mobile network assisted by positioning information | |
| CN104883304A (en) | Method for routing part entangled quantum pair bridging communication network | |
| Cheng et al. | Characterizing routing with radio-to-router information in a heterogeneous airborne network | |
| Suraki et al. | FCLCC: fuzzy cross-layer congestion control in mobile ad hoc networks |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |