CN108306717A - Data transmission method, server and storage medium - Google Patents
Data transmission method, server and storage medium Download PDFInfo
- Publication number
- CN108306717A CN108306717A CN201810089659.7A CN201810089659A CN108306717A CN 108306717 A CN108306717 A CN 108306717A CN 201810089659 A CN201810089659 A CN 201810089659A CN 108306717 A CN108306717 A CN 108306717A
- Authority
- CN
- China
- Prior art keywords
- network
- priority
- data
- system resource
- transmission
- 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
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
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L43/00—Arrangements for monitoring or testing data switching networks
- H04L43/08—Monitoring or testing based on specific metrics, e.g. QoS, energy consumption or environmental parameters
- H04L43/0805—Monitoring or testing based on specific metrics, e.g. QoS, energy consumption or environmental parameters by checking availability
- H04L43/0817—Monitoring or testing based on specific metrics, e.g. QoS, energy consumption or environmental parameters by checking availability by checking functioning
-
- 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/0078—Avoidance of errors by organising the transmitted data in a format specifically designed to deal with errors, e.g. location
- H04L1/0091—Avoidance of errors by organising the transmitted data in a format specifically designed to deal with errors, e.g. location arrangements specific to receivers, e.g. format detection
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L41/00—Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
- H04L41/06—Management of faults, events, alarms or notifications
- H04L41/0654—Management of faults, events, alarms or notifications using network fault recovery
- H04L41/0663—Performing the actions predefined by failover planning, e.g. switching to standby network elements
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L43/00—Arrangements for monitoring or testing data switching networks
- H04L43/16—Threshold monitoring
-
- 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
-
- 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/121—Shortest path evaluation by minimising delays
-
- 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
- H04L47/00—Traffic control in data switching networks
- H04L47/70—Admission control; Resource allocation
- H04L47/80—Actions related to the user profile or the type of traffic
- H04L47/805—QOS or priority aware
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L47/00—Traffic control in data switching networks
- H04L47/70—Admission control; Resource allocation
- H04L47/82—Miscellaneous aspects
- H04L47/822—Collecting or measuring resource availability data
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L47/00—Traffic control in data switching networks
- H04L47/70—Admission control; Resource allocation
- H04L47/82—Miscellaneous aspects
- H04L47/826—Involving periods of time
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L67/00—Network arrangements or protocols for supporting network services or applications
- H04L67/01—Protocols
- H04L67/10—Protocols in which an application is distributed across nodes in the network
- H04L67/1097—Protocols in which an application is distributed across nodes in the network for distributed storage of data in networks, e.g. transport arrangements for network file system [NFS], storage area networks [SAN] or network attached storage [NAS]
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Environmental & Geological Engineering (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The invention discloses a kind of data transmission method, server and storage medium, this method includes：The system resource of monitoring server and the current state of memory node；Judge whether system resource, the current state of memory node are normal；When system resource is normal, the current state of memory node is normal, a kind of Routing Algorithm is selected from preset Routing Algorithm, the Routing Algorithm according to selection will be by allocation of packets to corresponding network transmission to corresponding memory node.The present invention improves data transmission efficiency, promotes the transmission performance of storage system by building two groups of network systems.
Description
Technical field
It can the present invention relates to a kind of technical field of data transmission more particularly to data transmission method, server and computer
Read storage medium.
Background technology
Currently, in existing distributed memory system, only has one group of network to be used for data transmission between memory node, exist
The risk of single node network failure.Single transmission network be easy to cause data transfer delay in the case where transmitting mass data
Or system congestion even collapses delay machine.Meanwhile when unstable system or failure occurs in the single network for data transmission, no
Loss of data is only caused, can also cause the performance of entire distributed memory system to decline and even paralyse.
Invention content
In view of the foregoing, a kind of data transmission method of present invention offer, server and computer readable storage medium,
Main purpose is sharing data transformation task, improves network transmission efficiency, increases redundancy backup, improves system stability and can
By property.
To achieve the above object, the present invention provides a kind of data transmission method, and this method includes：
Monitoring step：The system resource of monitoring server and the current state of memory node；
Judgment step：Judge whether system resource, the current state of memory node are normal；
Select step：When system resource is normal, the current state of memory node is normal, selected from preset Routing Algorithm
A kind of Routing Algorithm is selected, the Routing Algorithm according to selection will be by allocation of packets to corresponding network transmission to corresponding storage section
Point, the preset Routing Algorithm include：
Polling algorithm：Two groups of network transmission packets are used in turn；
Optimal path algorithm：The quantity for the data packet that every group of network is transmitted in statistics preset time, is denoted as N respectively1、
N2, calculate N1-N2Absolute value, work as N1-N2Absolute value when being less than preset value, distribute identical priority to two groups of networks, make
Two groups of networks are given with polling algorithm distribution data packet, work as N1-N2Absolute value when being more than the preset value, to transmission in preset time
Network more than the quantity of the data packet of completion distributes the first priority, remaining network distributes the second priority, by the first ratio
Allocation of packets give the network transmission of first priority, the allocation of packets of the second ratio to the second priority network pass
Defeated, wherein the first priority is higher than the second priority, the first ratio is more than the second ratio；
Most short Queue Algorithm：The unfinished data packet number of every group of network transmission is counted, is denoted as N respectively1、N2, calculate N1-
N2Absolute value, work as N1-N2Absolute value when being less than predetermined threshold value, distribute identical priority to two groups of networks, calculated using poll
Method distributes data packet to two groups of networks, works as N1-N2Absolute value when being more than the predetermined threshold value, the data for giving current transmission unfinished
The network that the quantity of packet is few distributes the first priority, remaining network distributes the second priority, by the data packet of third ratio point
The network transmission of dispensing first priority, the allocation of packets of the 4th ratio give another article of network transmission, wherein first is preferential
Grade is higher than the second priority, and third ratio is more than the 4th ratio.
Preferably, the system resource includes：The utilization rate of local disk, memory usage, central processing unit
(Central Processing Unit, CPU) utilization rate.
Preferably, the preset judgment rule is：
According to the utilization rate of pre-set local disk, memory usage, the first predetermined threshold value of cpu busy percentage,
Two predetermined threshold values judge whether the current state of system resource is normal；
When the utilization rate for monitoring one of system resource is higher than corresponding second predetermined threshold value, system resource is judged
Anxiety judges that system resource is filled when the utilization rate for monitoring all system resources is respectively lower than corresponding first predetermined threshold value
Foot, when the utilization rate for monitoring all system resources is below the second predetermined threshold value, judges that system resource is currently at normally
State.
Preferably, this method further includes：
Switch step：When monitoring the system resource anxiety of server, the optimal path algorithm is switched to by data
Packet is distributed to corresponding network transmission and is switched to corresponding memory node when monitoring the system resource abundance of server
Allocation of packets is given corresponding network transmission to corresponding memory node by the polling algorithm, when the system for monitoring server
When resource is in normal condition, select most short Queue Algorithm by allocation of packets to corresponding network transmission to corresponding storage section
Point.
Preferably, this method further includes：
Calculate step：The average delay time of every group of network data transmission is calculated in real time, calculates prolonging for current transmission data
The difference of slow time and the network average delay time；
Set-up procedure：Whether the difference is judged more than the first preset value, and when the difference is more than the first preset value, reducing should
The priority of network redistributes data transfer task according to the current priority of two groups of networks.
Preferably, this method further includes：
Notifying process：When being more than the second preset value in the delay time of one group of network current transmission data, notice receives number
According to memory node it is current data transmission it is invalid, and ask another group of network transmit again the data give the memory node.
Preferably, this method further includes：
Given step：When having monitored memory node and having broken down, storage that specified one group of network is used to break down
The data reparation of node, another set network are used for the data transmission of other memory nodes.
In addition, the present invention also provides a kind of server, which includes：Memory and processor, on the memory
Data distributing program is stored, the data distributing program is executed by the processor, it can be achieved that following steps：
Monitoring step：The system resource of monitoring server and the current state of memory node；
Judgment step：Judge whether system resource, the current state of memory node are normal；
Select step：When system resource is normal, the current state of memory node is normal, selected from preset Routing Algorithm
A kind of Routing Algorithm is selected, the Routing Algorithm according to selection will be by allocation of packets to corresponding network transmission to corresponding storage section
Point, the preset Routing Algorithm include：
Polling algorithm：Two groups of network transmission packets are used in turn；
Optimal path algorithm：The quantity for the data packet that every group of network is transmitted in statistics preset time, is denoted as N respectively1、
N2, calculate N1-N2Absolute value, work as N1-N2Absolute value when being less than preset value, distribute identical priority to two groups of networks, make
Two groups of networks are given with polling algorithm distribution data packet, work as N1-N2Absolute value when being more than the preset value, to transmission in preset time
Network more than the quantity of the data packet of completion distributes the first priority, remaining network distributes the second priority, by the first ratio
Allocation of packets give the network transmission of first priority, the allocation of packets of the second ratio to the second priority network pass
Defeated, wherein the first priority is higher than the second priority, the first ratio is more than the second ratio；
Most short Queue Algorithm：The unfinished data packet number of every group of network transmission is counted, is denoted as N respectively1、N2, calculate N1-
N2Absolute value, work as N1-N2Absolute value when being less than predetermined threshold value, distribute identical priority to two groups of networks, calculated using poll
Method distributes data packet to two groups of networks, works as N1-N2Absolute value when being more than the predetermined threshold value, the data for giving current transmission unfinished
The network that the quantity of packet is few distributes the first priority, remaining network distributes the second priority, by the data packet of third ratio point
The network transmission of dispensing first priority, the allocation of packets of the 4th ratio give another article of network transmission, wherein first is preferential
Grade is higher than the second priority, and third ratio is more than the 4th ratio.
Preferably, the judgment step further includes：
According to the utilization rate of pre-set local disk, memory usage, the first predetermined threshold value of cpu busy percentage,
Two predetermined threshold values judge whether the current state of system resource is normal；
When the utilization rate for monitoring one of system resource is higher than corresponding second predetermined threshold value, system resource is judged
Anxiety judges that system resource is filled when the utilization rate for monitoring all system resources is respectively lower than corresponding first predetermined threshold value
Foot, when the utilization rate for monitoring all system resources is below the second predetermined threshold value, judges that system resource is currently at normally
State.
In addition, to achieve the above object, it is described computer-readable the present invention also provides a kind of computer readable storage medium
Storage medium includes data distributing program, it can be achieved that data as described above when the data distributing program is executed by processor
Arbitrary steps in transmission method.
Data transmission method, server and computer readable storage medium proposed by the present invention, by building two groups of networks,
According to the state of system resource, optimal Routing Algorithm is selected from preset Routing Algorithm using preset selection rule, it is right
The transmission of two groups of networks is allocated, and improves the stability and efficiency of transmission of system.
Description of the drawings
Fig. 1 is the application environment schematic diagram of data transmission method of the present invention；
Fig. 2 is the schematic diagram of server preferred embodiment of the present invention；
Fig. 3 is the module diagram of data distributing program preferred embodiment in Fig. 2；
Fig. 4 is the flow chart of data transmission method first embodiment of the present invention；
Fig. 5 is the flow chart of data transmission method second embodiment of the present invention.
The embodiments will be further described with reference to the accompanying drawings for the realization, the function and the advantages of the object of the present invention.
Specific implementation mode
It should be appreciated that described herein, specific examples are only used to explain the present invention, is not intended to limit the present invention.
As shown in Figure 1, being the application environment schematic diagram of data transmission method of the present invention.
In the present embodiment, the present invention provides a kind of distributed memory system, which includes server 1, memory node
2, two groups of networks --- network A and network B, and one or more clients 3.Client 3 sends out to storage to server and saves
The request of 2 read-write data of point.After server 1 receives the request of the read-write data of client 3, according to preset selection rule
One group of network is selected to read and write data to memory node from network A and network B from a kind of Routing Algorithm is selected.
Server 1 is additionally operable to the working condition and capacity of monitoring memory node 2.The network includes communication line and net
The transmission devices such as network interchanger.
As shown in Fig. 2, being the schematic diagram of 1 preferred embodiment of server of the present invention.
In the present embodiment, server 1 can be server, smart mobile phone, tablet computer, PC, portable calculating
Machine and other electronic equipments with calculation function.
The server 1 includes：Memory 11, processor 12, network interface 13 and communication bus 14.Wherein, network interface
13 may include optionally standard wireline interface and wireless interface (such as WI-FI interfaces).Communication bus 14 is for realizing these groups
Connection communication between part.
Memory 11 includes at least a type of readable storage medium storing program for executing.The readable storage medium storing program for executing of at least one type
It can be the non-volatile memory medium of such as flash memory, hard disk, multimedia card, card-type memory.In some embodiments, described to deposit
Reservoir 11 can be the internal storage unit of the server 1, such as the hard disk of the server 1.In further embodiments, institute
State the external memory unit that memory 11 can also be the server 1, such as the plug-in type being equipped on the server 1 is hard
Disk, intelligent memory card (Smart Media Card, SMC), secure digital (Secure Digital, SD) card, flash card
(Flash Card) etc..
In the present embodiment, the memory 11 can be not only used for the application software that storage is installed on the server 1
And Various types of data, such as data distributing program 10.
Processor 12 can be in some embodiments a central processing unit (Central Processing Unit,
CPU), microprocessor or other data processing chips, the program code for being stored in run memory 11 or processing data, example
Such as execute the monitoring of the current state of the computer program code of data distributing program 10, memory node and system resource.
Fig. 2 illustrates only the server 1 with component 11-14 and data distributing program 10, it should be understood that simultaneously
All components shown realistic are not applied, the implementation that can be substituted is more or less component.
Optionally, which can also include display, and display is properly termed as display screen or display unit.One
Display can be light-emitting diode display, liquid crystal display, touch-control liquid crystal display and Organic Light Emitting Diode in a little embodiments
(Organic Light-Emitting Diode, OLED) touches device etc..Display is for showing the letter handled in the server 1
It ceases and for showing visual working interface.
Optionally, which can also include user interface, and user interface may include input unit such as keyboard
(Keyboard), instantaneous speech power such as sound equipment, earphone etc., optionally user interface can also be connect including the wired of standard
Mouth, wireless interface.
In server example shown in Fig. 2, as storing data in a kind of memory 11 of computer storage media
The program code of program 10 is transmitted, when processor 12 executes the program code of data distributing program 10, realizes following steps：
Monitoring step：The system resource of monitoring server and the current state of memory node；
Judgment step：Judge whether system resource, the current state of memory node are normal；
Select step：When system resource is normal, the current state of memory node is normal, selected from preset Routing Algorithm
A kind of Routing Algorithm is selected, the Routing Algorithm according to selection will be by allocation of packets to corresponding network transmission to corresponding storage section
Point, the preset Routing Algorithm include：
Polling algorithm：Two groups of network transmission packets are used in turn；
Optimal path algorithm：The quantity for the data packet that every group of network is transmitted in statistics preset time, is denoted as N respectively1、
N2, calculate N1-N2Absolute value, work as N1-N2Absolute value when being less than preset value, distribute identical priority to two groups of networks, make
Two groups of networks are given with polling algorithm distribution data packet, work as N1-N2Absolute value when being more than the preset value, to transmission in preset time
Network more than the quantity of the data packet of completion distributes the first priority, remaining network distributes the second priority, by the first ratio
Allocation of packets give the network transmission of first priority, the allocation of packets of the second ratio to the second priority network pass
Defeated, wherein the first priority is higher than the second priority, the first ratio is more than the second ratio；
Most short Queue Algorithm：The unfinished data packet number of every group of network transmission is counted, is denoted as N respectively1、N2, calculate N1-
N2Absolute value, work as N1-N2Absolute value when being less than predetermined threshold value, distribute identical priority to two groups of networks, calculated using poll
Method distributes data packet to two groups of networks, works as N1-N2Absolute value when being more than the predetermined threshold value, the data for giving current transmission unfinished
The network that the quantity of packet is few distributes the first priority, remaining network distributes the second priority, by the data packet of third ratio point
The network transmission of dispensing first priority, the allocation of packets of the 4th ratio give another article of network transmission, wherein first is preferential
Grade is higher than the second priority, and third ratio is more than the 4th ratio.
Concrete principle please refer to following Fig. 3 about the module diagram of 10 preferred embodiment of data distributing program, Fig. 4 about
Introduction of the flow chart and Fig. 5 of data transmission method first embodiment about the flow chart of data transmission method second embodiment.
As shown in figure 3, being the module diagram of 10 preferred embodiment of data distributing program in Fig. 2.The so-called mould of the present invention
Block is the series of computation machine program instruction section for referring to complete specific function.
In the present embodiment, data distributing program 10 includes：Monitoring module 110, judgment module 120, selecting module 130,
Computing module 140, notification module 150, the functions or operations step that the module 110-150 is realized is similar as above, this
Place is no longer described in detail, illustratively, such as wherein：
Monitoring module 110, for the system resource of monitoring server and the current state of memory node.Monitoring module 110
Monitor the current state of memory node and system resource in real time.Wherein, the current state of the monitoring memory node refers to monitoring
Whether memory node breaks down.The system resource includes：The utilization rate of local disk, memory usage, cpu busy percentage
Deng.
Judgment module 120, for judging whether the current state of memory node is normal or judges the current shape of system resource
State and judge the difference of delay times of current transmission data and the network average delay time whether more than the first preset value.Sentence
Disconnected module 120 judges whether memory node has according to when the system resource of server and the current state of memory node that monitor
Whether failure, system resource are normal.When certain memory node breaks down, automatically specify one group of network to break down this deposit
It stores up node and carries out data reparation, another group of network is then used for other memory node transmission datas.The data reparation refers to depositing
When storage nodes break down leads to loss of data, to the means that the data in the memory node are repaired, wherein data reparation
Including：Copy data reparation, the reparation of regeneration code data, multi-node collaboration data reparation etc..When memory node is normal, mould is judged
Block 120 judges the current state of system resource.Wherein, the preset judgment method includes：According to pre-set earth magnetism
Utilization rate, memory usage, the first predetermined threshold value of cpu busy percentage, the second predetermined threshold value of disk, judge the current of system resource
Whether state is normal.When monitor one of system resource utilization rate be higher than corresponding second predetermined threshold value when, judge be
Resource of uniting is nervous, when the utilization rate for monitoring all system resources is respectively lower than corresponding first predetermined threshold value, judges system
Resource is sufficient, when the utilization rate for monitoring all system resources is below the second predetermined threshold value, judges that system resource is currently located
In normal condition.It is understood that the normal condition of the system resource includes system resource abundance, system resource abundance is only
For the normal special case of system resource.For example, the first predetermined threshold value of the utilization rate of setting local disk is 50%, second pre-
If threshold value is 80%, it is 70% that the first predetermined threshold value of memory usage, which is the 40%, second predetermined threshold value, the of cpu busy percentage
One predetermined threshold value is that the 40%, second predetermined threshold value is 60%, when the utilization rate of local disk is 82%, memory usage is
68%, cpu busy percentage 30% shows system resource anxiety, when the utilization rate of local disk is 40%, memory usage is
30%, cpu busy percentage 30% shows system resource abundance, when the utilization rate of local disk is 60%, memory usage is
68%, cpu busy percentage 30% shows that system resource is currently at normal condition.The delay time of current transmission data with it is flat
The specific judgment method of the difference of equal delay time please refers to flow charts of following Fig. 5 about data transmission method second embodiment
Introduction.
Selecting module 130, for when system resource is normal, the current state of memory node is normal, from preset routing
A kind of Routing Algorithm is selected in algorithm, allocation of packets will be given corresponding network transmission to accordingly by the Routing Algorithm according to selection
Memory node.In the present embodiment, when the current state of system resource is normal, selecting module 130 is from preset Routing Algorithm
A kind of middle Routing Algorithm of selection.Wherein, the preset Routing Algorithm includes：
Polling algorithm：Two groups of network transmission packets are used in turn.For example, server 1 will need the data packet transmitted point
At several parts, first part's data packet is transmitted using network A, and second part data packet is transmitted using network B, Part III data
Packet transmitted using network A, repeatedly cycle until by upload in need data packet end of transmission.
Optimal path algorithm：The quantity for the data packet that every group of network is transmitted in statistics preset time, is denoted as N respectively1、
N2, calculate N1-N2Absolute value, work as N1-N2Absolute value when being less than preset value, distribute identical priority to two groups of networks, make
Two groups of networks are given with polling algorithm distribution data packet, work as N1-N2Absolute value when being more than the preset value, to transmission in preset time
Network more than the quantity of the data packet of completion distributes the first priority, remaining network distributes the second priority, by the first ratio
Allocation of packets give the network transmission of first priority, the allocation of packets of the second ratio is given to the network of the second priority
Transmission, wherein the first priority is higher than the second priority, the first ratio is more than the second ratio.It is assumed that network A in the unit interval,
The data packet number that network B is transmitted is respectively 30,20, and the preset value of setting is 8, then distributes to the first priority
Network A, and the 60% of the data packet uploaded will be needed to distribute to network A, the second priority is distributed into network B, and will need
The 40% of the data packet of upload distributes to network B.
Most short Queue Algorithm：The unfinished data packet number of every group of network transmission is counted, is denoted as N respectively1、N2, calculate N1-
N2Absolute value, work as N1-N2Absolute value when being less than predetermined threshold value, distribute identical priority to two groups of networks, calculated using poll
Method distributes data packet to two groups of networks；Work as N1-N2Absolute value when being more than the predetermined threshold value, the data for giving current transmission unfinished
The network that the quantity of packet is few distributes the first priority, remaining network distributes the second priority, by the data packet of third ratio point
The network transmission of dispensing first priority gives the allocation of packets of the 4th ratio to another article of network transmission, wherein first is excellent
First grade is higher than the second priority, and third ratio is more than the 4th ratio.It is assumed that the number-of-packet that network A, network B are not transmitted
Amount is respectively 18,25, and the predetermined threshold value of setting is 6, then the first priority will be distributed to network A, and will need to upload
Data packet 60% distribute to network A, the second priority is distributed into network B, and the 40% of the data packet uploaded will be needed
Distribute to network B.
Specifically, in another embodiment, it also should include switch step：When the system resource for monitoring server is nervous
When, switch to the optimal path algorithm by allocation of packets to corresponding network transmission to corresponding memory node, work as monitoring
To server system resource abundance when, switch to the polling algorithm by allocation of packets to corresponding network transmission to accordingly
Memory node, when system resource is in normal condition, switch to most short Queue Algorithm by allocation of packets give corresponding net
Network is transferred to corresponding memory node.For example, when memory usage is higher than 70%, show that current system resource is nervous, automatically
Data packet is respectively allocated to network A, network B by selection optimal path algorithm.
Computing module 140, the average delay time for calculating every group of network data transmission in real time calculate current transmission number
According to delay time and the network average delay time difference.The delay time refers to that current transmission time is more than normal
The part of transmission time under state.For example, under normal condition, a data packet is transmitted to 2 used time 10 of memory node from client 3
Second, if transmission time is 16 seconds, delay time is 6 seconds.Every group of network is counted and calculated in cut-off current time, the institute of transmission
There are the average value of the delay time of data packet, as average delay time.Assuming that average delay time is 2 seconds, current transmission number
According to the difference of delay time and the network average delay time be 4 seconds.
Notification module 150, for when the delay time of one group of network current transmission data being more than the second preset value, notifying
The data transmission that the memory node of reception data is current is invalid, and asks another group of network to transmit the data again and give the storage section
Point.It is more than 20 when the delay time that network A transmits certain data to memory node 2 assuming that when the second preset value of setting is 20 seconds
When the second, the current data transmission of the transmission abort information notice memory node 2 of notification module 150 is invalid, and asks network B again
The data are transmitted to memory node 2.
As shown in figure 4, being the flow chart of data transmission method first embodiment of the present invention.
In the present embodiment, when processor 12 executes the computer program of the data distributing program 10 stored in memory 11
Realize that data transmission method includes：Step S10- steps S30：
Step S10, monitoring module 110 monitor the current state of memory node and system resource in real time.Wherein, the monitoring
The current state of memory node refers to whether monitoring memory node breaks down.The system resource includes：The profit of local disk
With rate, memory usage, cpu busy percentage etc..
Step S20, judgment module 120 judge the current state of system resource.Wherein, the preset judgment method packet
It includes：It is preset according to the utilization rate of pre-set local disk, memory usage, the first predetermined threshold value of cpu busy percentage, second
Threshold value judges whether the current state of system resource is normal.When the utilization rate for monitoring one of system resource is higher than accordingly
The second predetermined threshold value when, judge system resource anxiety, when the utilization rate for monitoring all system resources is respectively lower than corresponding
When the first predetermined threshold value, system resource abundance is judged, when the utilization rate for monitoring all system resources is below the second default threshold
When value, judge that system resource is currently at normal condition.It is understood that the normal condition of the system resource includes system
Resource is sufficient, and system resource abundance is only the normal special case of system resource.For example, the of the utilization rate of setting local disk
One predetermined threshold value is that the 50%, second predetermined threshold value is 80%, and the first predetermined threshold value of memory usage is the 40%, second default threshold
Value is 70%, and it is 60% that the first predetermined threshold value of cpu busy percentage, which is the 40%, second predetermined threshold value, when the utilization rate of local disk
For 82%, memory usage 68%, cpu busy percentage 30%, show system resource anxiety, when the utilization rate of local disk is
40%, memory usage 30%, cpu busy percentage 30% show system resource abundance, when the utilization rate of local disk is
60%, memory usage 68%, cpu busy percentage 30%, show that system resource is currently at normal condition.
Step S30, when system resource is normal, the current state of memory node is normal, selecting module 130 is from preset choosing
A kind of Routing Algorithm is selected in the algorithm of road, the Routing Algorithm according to selection will be by allocation of packets to corresponding network transmission to phase
The memory node answered.Wherein, the preset Routing Algorithm includes：
Polling algorithm：Two groups of network transmission packets are used in turn.For example, server 1 will need the data packet transmitted point
At several parts, first part's data packet is transmitted using network A, and second part data packet is transmitted using network B, Part III data
Packet transmitted using network A, repeatedly cycle until by upload in need data packet end of transmission.
Optimal path algorithm：The quantity for the data packet that every group of network is transmitted in statistics preset time, is denoted as N respectively1、
N2, calculate N1-N2Absolute value, work as N1-N2Absolute value when being less than preset value, distribute identical priority to two groups of networks, make
Two groups of networks are given with polling algorithm distribution data packet, work as N1-N2Absolute value when being more than the preset value, to transmission in preset time
Network more than the quantity of the data packet of completion distributes the first priority, remaining network distributes the second priority, by the first ratio
Allocation of packets give the network transmission of first priority, the allocation of packets of the second ratio is given to the network of the second priority
Transmission, wherein the first priority is higher than the second priority, the first ratio is more than the second ratio.It is assumed that network A in the unit interval,
The data packet number that network B is transmitted is respectively 30,20, and the preset value of setting is 8, then distributes to the first priority
Network A, and the 60% of the data packet uploaded will be needed to distribute to network A, the second priority is distributed into network B, and will need
The 40% of the data packet of upload distributes to network B.
Most short Queue Algorithm：The unfinished data packet number of every group of network transmission is counted, is denoted as N respectively1、N2, calculate N1-
N2Absolute value, work as N1-N2Absolute value when being less than predetermined threshold value, distribute identical priority to two groups of networks, calculated using poll
Method distributes data packet to two groups of networks；Work as N1-N2Absolute value when being more than the predetermined threshold value, the data for giving current transmission unfinished
The network that the quantity of packet is few distributes the first priority, remaining network distributes the second priority, by the data packet of third ratio point
The network transmission of dispensing first priority gives the allocation of packets of the 4th ratio to another article of network transmission, wherein first is excellent
First grade is higher than the second priority, and third ratio is more than the 4th ratio.It is assumed that the number-of-packet that network A, network B are not transmitted
Amount is respectively 18,25, and the predetermined threshold value of setting is 6, then the first priority will be distributed to network A, and will need to upload
Data packet 60% distribute to network A, the second priority is distributed into network B, and the 40% of the data packet uploaded will be needed
Distribute to network B.
Specifically, in another embodiment, it also should include switch step：When the system resource for monitoring server is nervous
When, switch to the optimal path algorithm by allocation of packets to corresponding network transmission to corresponding memory node, work as monitoring
To server system resource abundance when, switch to the polling algorithm by allocation of packets to corresponding network transmission to accordingly
Memory node, when system resource is in normal condition, switch to most short Queue Algorithm by allocation of packets give corresponding net
Network is transferred to corresponding memory node.For example, when memory usage is higher than 70%, show that current system resource is nervous, automatically
Data packet is respectively allocated to network A, network B by selection optimal path algorithm.
The data transmission method that above-described embodiment proposes, according to the current of the system resource of monitoring memory node and server
State selects a kind of Routing Algorithm using preset selection rule from preset Routing Algorithm, according to the Routing Algorithm of selection,
Allocation of packets is given to corresponding memory node to corresponding network transmission, improve data transmission efficiency, reduce data and transmitting
Loss in the process improves the stability and reliability of data transmission.
As shown in figure 5, being the flow chart of data transmission method second embodiment of the present invention.
In the present embodiment, data transmission method includes：Step S10- steps S80.Wherein step S10, step S40, step
Rapid S50 is roughly the same with the content in first embodiment, and which is not described herein again.
Step S20, judgment module 120 judges whether the current state of memory node is normal, when memory node breaks down
When, step S30 is executed, flow terminates, and when the current state of memory node is normal, thens follow the steps S40.Memory node occurs
When failure, the loss of data or damage of memory node storage are frequently can lead to, therefore, is damaged when monitoring certain memory node
When, the memory node to break down is repaired automatically.
Step S30, when memory node breaks down, what the specified one group of network of selecting module 130 was used to break down deposits
The data reparation of node is stored up, another set network is used for the data transmission of other memory nodes.For example, when monitoring certain storage section
When point breaks down, one group of network of distribution carries out data reparation to selecting module 130 to the memory node to break down automatically, separately
One group of network is then used for other memory node transmission datas.The data reparation refers to that memory node breaks down and leads to data
When loss, to the means that the data in the memory node are repaired, wherein data reparation includes：Copy data reparation, regeneration
The reparation of code data, multi-node collaboration data reparation etc..
Step S60, computing module 140 calculate the average delay time of every group of network data transmission in real time, and forward pass is worked as in calculating
The difference of the delay time of transmission of data and the network average delay time.Wherein, the delay time refers to current transmission one
The difference of time and the transmission time of the next data packet of normal condition used in data packet to memory node.For example, normal shape
Under state, from one data packet of transmission of client 3 to 7 seconds 2 used times of memory node, if transmission time is 16 seconds, delay time 9
Second.Every group of network is counted and calculated in cut-off current time, the average value of the delay time of all data packets of transmission is as flat
Equal delay time.Assuming that average delay time is 4 seconds, the delay time of current transmission data and the network average delay time
Difference is 5 seconds.
Step S70, judgment module 120 judge the difference whether more than the first preset value, when the difference is more than first default
When value, the priority of the network is reduced, data transfer task is redistributed according to the current priority of two groups of networks.It is assumed that setting
It is 4 seconds to set the first preset value, and average delay time is 4 seconds, if the delay time of one data packet of network A current transmission is 9 seconds,
Network A is then reduced to the second priority from the first priority.
Step S80 illustrates this group of network when the delay time of one group of network current transmission data being more than the second preset value
It blocks or data packet has been lost, the data transmission that the memory node of the notice reception data of notification module 150 is current is invalid, and asks
Another group of network transmits the data to the memory node again.Assuming that when the second preset value of setting is 20 seconds, when network A is transmitted
When the delay time of certain data to memory node 2 is more than 20 seconds, notification module 150 sends abort information notice memory node 2 and works as
Preceding data transmission is invalid, and network B is asked to transmit the data again to memory node 2.
The data transmission method that the present embodiment proposes is used for data transmission, according to storage by building two groups of transmission networks
The state of node and system resource selects different Routing Algorithms that will need in the allocation of packets to two groups of networks transmitted, increases
Add redundancy backup, prevent loss of data, improves the validity and reliability of data transmission.
In addition, the embodiment of the present invention also proposes a kind of computer readable storage medium, the computer readable storage medium
Include data distributing program 10, following operation is realized when the data distributing program 10 is executed by processor：
Monitoring step：The system resource of monitoring server and the current state of memory node；
Judgment step：Judge whether system resource, the current state of memory node are normal；
Select step：When system resource is normal, the current state of memory node is normal, selected from preset Routing Algorithm
A kind of Routing Algorithm is selected, the Routing Algorithm according to selection will be by allocation of packets to corresponding network transmission to corresponding storage section
Point, the preset Routing Algorithm include：
Polling algorithm：Two groups of network transmission packets are used in turn；
Optimal path algorithm：The quantity for the data packet that every group of network is transmitted in statistics preset time, is denoted as N respectively1、
N2, calculate N1-N2Absolute value, work as N1-N2Absolute value when being less than preset value, distribute identical priority to two groups of networks, make
Two groups of networks are given with polling algorithm distribution data packet, work as N1-N2Absolute value when being more than the preset value, to transmission in preset time
Network more than the quantity of the data packet of completion distributes the first priority, remaining network distributes the second priority, by the first ratio
Allocation of packets give the network transmission of first priority, the allocation of packets of the second ratio to the second priority network pass
Defeated, wherein the first priority is higher than the second priority, the first ratio is more than the second ratio；
Most short Queue Algorithm：The unfinished data packet number of every group of network transmission is counted, is denoted as N respectively1、N2, calculate N1-
N2Absolute value, work as N1-N2Absolute value when being less than predetermined threshold value, distribute identical priority to two groups of networks, calculated using poll
Method distributes data packet to two groups of networks, works as N1-N2Absolute value when being more than the predetermined threshold value, the data for giving current transmission unfinished
The network that the quantity of packet is few distributes the first priority, remaining network distributes the second priority, by the data packet of third ratio point
The network transmission of dispensing first priority, the allocation of packets of the 4th ratio give another article of network transmission, wherein first is preferential
Grade is higher than the second priority, and third ratio is more than the 4th ratio.
Preferably, the system resource includes：Utilization rate, memory usage, the central processing unit utilization rate of local disk.
Preferably, the preset judgment rule is：
According to the utilization rate of pre-set local disk, memory usage, the first predetermined threshold value of cpu busy percentage,
Two predetermined threshold values judge whether the current state of system resource is normal；
When the utilization rate for monitoring one of system resource is higher than corresponding second predetermined threshold value, system resource is judged
Anxiety judges that system resource is filled when the utilization rate for monitoring all system resources is respectively lower than corresponding first predetermined threshold value
Foot, when the utilization rate for monitoring all system resources is below the second predetermined threshold value, judges that system resource is currently at normally
State.
Preferably, this method further includes：
Switch step：When monitoring the system resource anxiety of server, the optimal path algorithm is switched to by data
Packet is distributed to corresponding network transmission and is switched to corresponding memory node when monitoring the system resource abundance of server
The polling algorithm gives allocation of packets to corresponding network, when the system resource for monitoring server is in normal condition,
The most short Queue Algorithm of selection gives allocation of packets to corresponding network.
Preferably, this method further includes：
Calculate step：The average delay time of every group of network data transmission is calculated in real time, calculates prolonging for current transmission data
The difference of slow time and the network average delay time；
Set-up procedure：Whether the difference is judged more than the first preset value, and when the difference is more than the first preset value, reducing should
The priority of network redistributes data transfer task according to the current priority of two groups of networks.
Preferably, this method further includes：
Notifying process：When being more than the second preset value in the delay time of one group of network current transmission data, notice receives number
According to memory node it is current data transmission it is invalid, and ask another group of network transmit again the data give the memory node.
Preferably, this method further includes：
Given step：When having monitored memory node and having broken down, storage that specified one group of network is used to break down
The data reparation of node, another set network are used for the data transmission of other memory nodes.
The specific implementation of the specific implementation mode of the computer readable storage medium of the present invention and above-mentioned data transmission method
Mode is roughly the same, and details are not described herein.
The embodiments of the present invention are for illustration only, can not represent the quality of embodiment.
Through the above description of the embodiments, those skilled in the art can be understood that above-described embodiment side
Method can add the mode of required general hardware platform to realize by software, naturally it is also possible to by hardware, but in many cases
The former is more preferably embodiment.Based on this understanding, technical scheme of the present invention substantially in other words does the prior art
Going out the part of contribution can be expressed in the form of software products, which is stored in one as described above
In storage medium (such as ROM/RAM, magnetic disc, CD), including some instructions use so that a station terminal equipment (can be mobile phone,
Computer, server or network equipment etc.) execute method described in each embodiment of the present invention.
It these are only the preferred embodiment of the present invention, be not intended to limit the scope of the invention, it is every to utilize this hair
Equivalent structure or equivalent flow shift made by bright specification and accompanying drawing content is applied directly or indirectly in other relevant skills
Art field, is included within the scope of the present invention.
Claims (10)
1. a kind of data transmission method is applied to server, server is connected by two groups of networks with client, and feature exists
In, the method includes：
Monitoring step：The system resource of monitoring server and the current state of memory node；
Judgment step：Judge whether system resource, the current state of memory node are normal；
Select step：When system resource is normal, the current state of memory node is normal, one is selected from preset Routing Algorithm
Kind of Routing Algorithm, according to selection Routing Algorithm will by allocation of packets to corresponding network transmission to corresponding memory node,
The preset Routing Algorithm includes：
Polling algorithm：Two groups of network transmission packets are used in turn；
Optimal path algorithm：The quantity for the data packet that every group of network is transmitted in statistics preset time, is denoted as N respectively1、N2, meter
Calculate N1-N2Absolute value, work as N1-N2Absolute value when being less than preset value, distribute identical priority to two groups of networks, use wheel
Algorithm distribution data packet is ask to two groups of networks, works as N1-N2Absolute value when being more than the preset value, to being transmitted in preset time
Data packet quantity more than network distribute the first priority, remaining network distribute the second priority, by the number of the first ratio
According to packet distribute to the network transmission of first priority, the allocation of packets of the second ratio to the second priority network transmission,
Wherein the first priority is higher than the second priority, and the first ratio is more than the second ratio；
Most short Queue Algorithm：The unfinished data packet number of every group of network transmission is counted, is denoted as N respectively1、N2, calculate N1-N2It is exhausted
To value, work as N1-N2Absolute value when being less than predetermined threshold value, distribute identical priority to two groups of networks, distributed using polling algorithm
Data packet gives two groups of networks, works as N1-N2Absolute value be more than the predetermined threshold value when, to current transmission do not complete data packet number
It measures few network and distributes the first priority, remaining network the second priority of distribution, the allocation of packets of third ratio is given should
The network transmission of first priority, the allocation of packets of the 4th ratio give another article of network transmission, wherein the first priority is higher than
Second priority, third ratio are more than the 4th ratio.
2. data transmission method according to claim 1, which is characterized in that the system resource includes：Local disk
Utilization rate, memory usage, cpu busy percentage.
3. data transmission method according to claim 2, which is characterized in that the judgment step further includes：
In advance according to the utilization rate of pre-set local disk, memory usage, the first predetermined threshold value of cpu busy percentage, second
If threshold value, judge whether the current state of system resource is normal；
When the utilization rate for monitoring one of system resource is higher than corresponding second predetermined threshold value, judge that system resource is tight
, when the utilization rate for monitoring all system resources is respectively lower than corresponding first predetermined threshold value, judge system resource abundance,
When the utilization rate for monitoring all system resources is below the second predetermined threshold value, judge that system resource is currently at normal shape
State.
4. data transmission method according to claim 1 or 3, which is characterized in that this method further includes：
Switch step：When monitoring the system resource anxiety of server, the optimal path algorithm is switched to by data packet point
The corresponding network transmission of dispensing is to corresponding memory node, when monitoring the system resource abundance of server, switches to described
Allocation of packets is given corresponding network transmission to corresponding memory node by polling algorithm, when the system resource for monitoring server
When in normal condition, select most short Queue Algorithm by allocation of packets to corresponding network transmission to corresponding memory node.
5. data transmission method according to claim 4, which is characterized in that this method further includes：
Calculate step：The average delay time of every group of network data transmission is calculated in real time, when calculating the delay of current transmission data
Between difference with the network average delay time；
Set-up procedure：Whether the difference is judged more than the first preset value, when the difference is more than the first preset value, reduces the network
Priority, data transfer task is redistributed according to the current priority of two groups of networks.
6. data transmission method according to claim 5, which is characterized in that this method further includes：
Notifying process：When being more than the second preset value in the delay time of one group of network current transmission data, notice receives data
The current data transmission of memory node is invalid, and another group of network is asked to transmit the data again to the memory node.
7. data transmission method according to claim 1, which is characterized in that this method further includes：
Given step：When having monitored memory node and having broken down, memory node that specified one group of network is used to break down
Data reparation, another set network be used for other memory nodes data transmission.
8. a kind of server, which is characterized in that the server includes：Memory and processor are stored on the memory
Data distributing program, the data distributing program are executed by the processor, it can be achieved that following steps：
Monitoring step：The system resource of monitoring server and the current state of memory node；
Judgment step：Judge whether system resource, the current state of memory node are normal；
Select step：When system resource is normal, the current state of memory node is normal, one is selected from preset Routing Algorithm
Kind of Routing Algorithm, according to selection Routing Algorithm will by allocation of packets to corresponding network transmission to corresponding memory node,
The preset Routing Algorithm includes：
Polling algorithm：Two groups of network transmission packets are used in turn；
Optimal path algorithm：The quantity for the data packet that every group of network is transmitted in statistics preset time, is denoted as N respectively1、N2, meter
Calculate N1-N2Absolute value, work as N1-N2Absolute value when being less than preset value, distribute identical priority to two groups of networks, use wheel
Algorithm distribution data packet is ask to two groups of networks, works as N1-N2Absolute value when being more than the preset value, to being transmitted in preset time
Data packet quantity more than network distribute the first priority, remaining network distribute the second priority, by the number of the first ratio
According to packet distribute to the network transmission of first priority, the allocation of packets of the second ratio to the second priority network transmission,
Wherein the first priority is higher than the second priority, and the first ratio is more than the second ratio；
Most short Queue Algorithm：The unfinished data packet number of every group of network transmission is counted, is denoted as N respectively1、N2, calculate N1-N2It is exhausted
To value, work as N1-N2Absolute value when being less than predetermined threshold value, distribute identical priority to two groups of networks, distributed using polling algorithm
Data packet gives two groups of networks, works as N1-N2Absolute value be more than the predetermined threshold value when, to current transmission do not complete data packet number
It measures few network and distributes the first priority, remaining network the second priority of distribution, the allocation of packets of third ratio is given should
The network transmission of first priority, the allocation of packets of the 4th ratio give another article of network transmission, wherein the first priority is higher than
Second priority, third ratio are more than the 4th ratio.
9. server according to claim 8, which is characterized in that the judgment step further includes：
In advance according to the utilization rate of pre-set local disk, memory usage, the first predetermined threshold value of cpu busy percentage, second
If threshold value, judge whether the current state of system resource is normal；
When the utilization rate for monitoring one of system resource is higher than corresponding second predetermined threshold value, judge that system resource is tight
, when the utilization rate for monitoring all system resources is respectively lower than corresponding first predetermined threshold value, judge system resource abundance,
When the utilization rate for monitoring all system resources is below the second predetermined threshold value, judge that system resource is currently at normal shape
State.
10. a kind of computer readable storage medium, which is characterized in that the computer readable storage medium includes data transmission
Program, it can be achieved that data pass as described in any one of claim 1 to 7 when the system data distributing program is executed by processor
The step of transmission method.
Priority Applications (2)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810089659.7A CN108306717B (en) | 2018-01-30 | 2018-01-30 | Data transmission method, server and storage medium |
| PCT/CN2018/089133 WO2019148716A1 (en) | 2018-01-30 | 2018-05-31 | Data transmission method, server, and storage medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810089659.7A CN108306717B (en) | 2018-01-30 | 2018-01-30 | Data transmission method, server and storage medium |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN108306717A true CN108306717A (en) | 2018-07-20 |
| CN108306717B CN108306717B (en) | 2019-03-15 |
Family
ID=62867410
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201810089659.7A Active CN108306717B (en) | 2018-01-30 | 2018-01-30 | Data transmission method, server and storage medium |
Country Status (2)
| Country | Link |
|---|---|
| CN (1) | CN108306717B (en) |
| WO (1) | WO2019148716A1 (en) |
Cited By (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110955728A (en) * | 2019-11-28 | 2020-04-03 | 深圳市恒泰能源科技有限公司 | Power consumption data transmission method, server and storage medium |
| CN111787349A (en) * | 2020-05-19 | 2020-10-16 | 视联动力信息技术股份有限公司 | Data caching method, device, equipment and medium |
| CN112737941A (en) * | 2020-12-21 | 2021-04-30 | 北京信而泰科技股份有限公司 | Network flow scheduling method, device and computer readable medium |
Families Citing this family (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110474811B (en) * | 2019-08-21 | 2022-09-23 | 杭州安恒信息技术股份有限公司 | Debugging method, debugging system and related device for network performance |
| CN114640680B (en) * | 2020-11-30 | 2024-04-05 | 南宁富联富桂精密工业有限公司 | Load balancing method, device and computer readable storage medium |
| CN113721265A (en) * | 2021-07-05 | 2021-11-30 | 广州南方卫星导航仪器有限公司 | Method, device, medium and product for scheduling transmission mode of differential data |
| CN113938428B (en) * | 2021-09-06 | 2023-06-16 | 锐捷网络股份有限公司 | Cross-chip data stream forwarding method and device |
Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102025638A (en) * | 2010-12-21 | 2011-04-20 | 福建星网锐捷网络有限公司 | Data transmission method and device based on priority level as well as network equipment |
| CN103368968A (en) * | 2013-07-22 | 2013-10-23 | 厦门市美亚柏科信息股份有限公司 | Data transmission method and system |
| CN103535014A (en) * | 2013-04-23 | 2014-01-22 | 华为技术有限公司 | A network storage system, data processing method and the client |
| CN107291390A (en) * | 2017-06-20 | 2017-10-24 | 郑州云海信息技术有限公司 | A kind of data classification storage and device |
| CN107612957A (en) * | 2017-07-13 | 2018-01-19 | 深圳天珑无线科技有限公司 | The method and system of channel transmission downlink data, client, server |
| US20180024884A1 (en) * | 2016-07-20 | 2018-01-25 | International Business Machines Corporation | Prioritizing rebuilding based on a longevity estimate of the rebuilt slice |
Family Cites Families (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101399746B (en) * | 2007-09-26 | 2011-03-16 | 华为技术有限公司 | Packet routing method, system, device and method, system for selecting backup resource |
| EP2237495A1 (en) * | 2009-03-31 | 2010-10-06 | BRITISH TELECOMMUNICATIONS public limited company | Path generation in a packet network |
| CN103841042B (en) * | 2014-02-19 | 2017-09-19 | 华为技术有限公司 | The method and apparatus that data are transmitted under high operational efficiency |
| CN105847137B (en) * | 2016-05-28 | 2019-02-26 | 国网安徽省电力公司六安供电公司 | A kind of link dual path method for building up for data center internet |
-
2018
- 2018-01-30 CN CN201810089659.7A patent/CN108306717B/en active Active
- 2018-05-31 WO PCT/CN2018/089133 patent/WO2019148716A1/en active Application Filing
Patent Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102025638A (en) * | 2010-12-21 | 2011-04-20 | 福建星网锐捷网络有限公司 | Data transmission method and device based on priority level as well as network equipment |
| CN103535014A (en) * | 2013-04-23 | 2014-01-22 | 华为技术有限公司 | A network storage system, data processing method and the client |
| CN103368968A (en) * | 2013-07-22 | 2013-10-23 | 厦门市美亚柏科信息股份有限公司 | Data transmission method and system |
| US20180024884A1 (en) * | 2016-07-20 | 2018-01-25 | International Business Machines Corporation | Prioritizing rebuilding based on a longevity estimate of the rebuilt slice |
| CN107291390A (en) * | 2017-06-20 | 2017-10-24 | 郑州云海信息技术有限公司 | A kind of data classification storage and device |
| CN107612957A (en) * | 2017-07-13 | 2018-01-19 | 深圳天珑无线科技有限公司 | The method and system of channel transmission downlink data, client, server |
Cited By (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110955728A (en) * | 2019-11-28 | 2020-04-03 | 深圳市恒泰能源科技有限公司 | Power consumption data transmission method, server and storage medium |
| CN111787349A (en) * | 2020-05-19 | 2020-10-16 | 视联动力信息技术股份有限公司 | Data caching method, device, equipment and medium |
| CN111787349B (en) * | 2020-05-19 | 2023-12-12 | 视联动力信息技术股份有限公司 | Data caching method, device, equipment and medium |
| CN112737941A (en) * | 2020-12-21 | 2021-04-30 | 北京信而泰科技股份有限公司 | Network flow scheduling method, device and computer readable medium |
Also Published As
| Publication number | Publication date |
|---|---|
| WO2019148716A1 (en) | 2019-08-08 |
| CN108306717B (en) | 2019-03-15 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN108306717B (en) | Data transmission method, server and storage medium | |
| CN107018175B (en) | Scheduling method and device of mobile cloud computing platform | |
| CN102369688B (en) | Method for adjusting resources dynamically and scheduling device | |
| CN102638849B (en) | Method, system and device for controlling service push | |
| CN104396215A (en) | Method and apparatus for bandwidth allocation and estimation | |
| CN105144110A (en) | Automatic configuration of external services based upon network activity | |
| CN103561049A (en) | Method for processing terminal scheduling request, system thereof and device thereof | |
| EP3076290B1 (en) | Method and device for remotely updating application program | |
| CN105187262A (en) | Router upgrading method and system | |
| CN111770157A (en) | Business processing method and device, electronic equipment and storage medium | |
| CN101582850A (en) | Method and system for realizing load balance | |
| CN109756417A (en) | Offline message distribution method, server and storage medium | |
| CN103795569A (en) | Server connection method and device based on connection pool | |
| CN112416969B (en) | Parallel task scheduling system in distributed database | |
| CN109618174A (en) | A kind of live data transmission method, device, system and storage medium | |
| CN109673061A (en) | A kind of method and apparatus of PDU Dialog processing | |
| CN104182282A (en) | Overload protection system and method for server | |
| CN109960575A (en) | A kind of computing capability sharing method, system and relevant device | |
| CN103650614A (en) | Resource distribution method, device and network side device | |
| CN109062681A (en) | A kind of execution method, system, device and the storage medium of periodic cycle task | |
| CN106254566A (en) | A kind of data download processing method and device | |
| CN109697117B (en) | Terminal control method, terminal control device and computer-readable storage medium | |
| CN110290009A (en) | A kind of data dispatching method, device and computer readable storage medium | |
| CN103299298A (en) | Service processing method and system | |
| CN109962941B (en) | Communication method, device and server |
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 |