CN115361333B - Network cloud fusion information transmission method based on QoS edge self-adaption - Google Patents

Network cloud fusion information transmission method based on QoS edge self-adaption Download PDF

Info

Publication number
CN115361333B
CN115361333B CN202211280039.4A CN202211280039A CN115361333B CN 115361333 B CN115361333 B CN 115361333B CN 202211280039 A CN202211280039 A CN 202211280039A CN 115361333 B CN115361333 B CN 115361333B
Authority
CN
China
Prior art keywords
data
transmitted
transmission
priority
relay
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
Application number
CN202211280039.4A
Other languages
Chinese (zh)
Other versions
CN115361333A (en
Inventor
严潇波
葛光富
郑华利
施晓东
朱峰
朱江
汪磊
陈健
闫浩
薛科婷
靳朝
杨闯
吴鹏
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
CETC 28 Research Institute
Original Assignee
CETC 28 Research Institute
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by CETC 28 Research Institute filed Critical CETC 28 Research Institute
Priority to CN202211280039.4A priority Critical patent/CN115361333B/en
Publication of CN115361333A publication Critical patent/CN115361333A/en
Application granted granted Critical
Publication of CN115361333B publication Critical patent/CN115361333B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

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
    • 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/02—Topology update or discovery
    • 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/302—Route determination based on requested QoS
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00—Traffic control in data switching networks
    • H04L47/10—Flow control; Congestion control
    • H04L47/24—Traffic characterised by specific attributes, e.g. priority or QoS
    • H04L47/2458—Modification of priorities while in transit
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00—Traffic control in data switching networks
    • H04L47/50—Queue scheduling
    • H04L47/62—Queue scheduling characterised by scheduling criteria
    • H04L47/625—Queue scheduling characterised by scheduling criteria for service slots or service orders
    • H04L47/6275—Queue scheduling characterised by scheduling criteria for service slots or service orders based on priority

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Data Exchanges In Wide-Area Networks (AREA)

Abstract

The invention discloses a QoS edge self-adaptive network cloud fusion information transmission method which is characterized in that the bandwidth condition of a network link at the current moment is sensed, and a heuristic search algorithm is adopted to search an optimal relay path under the current communication condition as a data transmission path. And comprehensively considering the self priority of the data and the effective residual transmission time of the data packet for all the data to be transmitted, setting the comprehensive priority of the data, and finishing the data transmission in order according to the set data priority by the communication network. The invention designs a path search technology based on Dijkstra algorithm, which is easy to realize, occupies small resources, and has the characteristics of high solving speed and low time complexity. Meanwhile, a data priority setting method comprehensively considering the data priority and the effective residual transmission time of the data packet is designed, so that the data transmission cannot be completed in the effective time due to the randomly distributed transmission sequence of the data with the same service priority, and the self-adaptive transmission of the data is realized.

Description

Network cloud fusion information transmission method based on QoS edge self-adaption
Technical Field
The invention relates to an information transmission method, in particular to a network cloud fusion information transmission method based on QoS edge self-adaptation.
Background
With the development of technologies such as cloud computing, edge computing, big data, 5G, network cloud integration and the like, more and more applications are deployed at the cloud end to improve the resource allocation efficiency and reduce the information construction cost. The network is an important precondition for ensuring the realization of the application cloud, and at present, a QoS (quality of service) quality guarantee technology is generally adopted to provide better communication network support for the cloud, so that the communication efficiency of the network in the problems of delay, blockage and the like is improved. The QoS service quality assurance technology ensures data stream transmission by using various priority forwarding technical strategies, congestion avoidance and other mechanisms provided by equipment, effectively allocates network bandwidth and more reasonably utilizes network resources. Common QoS strategies such as a best effort model, a comprehensive service model, a differentiated service model and the like, wherein the best effort model transmits data according to the maximum available bandwidth of a current channel and does not differentiate the data; the comprehensive service model reserves a certain bandwidth to ensure data communication, but the configuration is more complex to realize and the bandwidth utilization rate is lower; the differentiated service model sets different priorities for the data, and ensures the communication quality of the key service data.
Network cloud convergence is a novel communication guarantee scheme at present, namely cloud computing, and a network communication network. The network cloud convergence is a technology for introducing cloud computing into a communication network in terms of definition, and the communication network is a technology for introducing cloud computing. However, in practice, the network is gradually clouded, functions such as network hardware and management control are gradually separated, the cloud computing processes the communication network management control, the network is only responsible for hardware functions such as transmission, and the most typical is a 5G network, and all services of a core network of the network are constructed in cloud computing technologies such as a virtual machine and a container. Through network cloud integration, the cloud can master and control the network, the resources of the network are better utilized, and the efficiency of data communication transmission is improved.
The current QoS service quality assurance technology (refer to ethernet QoS technology research and practice [ J ]. Electronic technology and software engineering, 2022 (000-011) ] and IP networks and their QoS technology development research [ J ]. Telecommunication science, 2005, 21 (5): 5.) mainly considers a relatively stable network communication environment, lacks a coping method and a communication mode when communication is interfered, and in practical application scenarios such as military, disaster relief, communication, extreme environment, etc., the environment is complicated and changeable, there may be a plurality of communication shelters or signal interference situations, the cloud communication signal will be very unstable, and the transmission delay is high and low. In order to ensure the transmission efficiency of cloud data in a narrow-band weak connection environment, a network cloud fusion technology (refer to the research on the cloud network fusion development idea of a carrier network of an operator [ J ]. New communication in china, 2022 (024-001) ], the application scene of cloud network fusion and future prospect [ J ]. Industry and informatization in china, 2021, 000 (004): p.18-24 ]) needs to be used for reference, link communication bandwidth information fed back by a network is utilized, a transmission strategy is adjusted, and the problem of information transmission of cloud data under an unstable network condition is solved.
Disclosure of Invention
The purpose of the invention is as follows: the invention aims to solve the technical problem of providing a network cloud fusion information transmission method based on QoS edge self-adaptation aiming at the defects of the prior art.
In order to solve the technical problem, the invention discloses a network cloud fusion information transmission method based on QoS edge self-adaptation, which comprises the following steps:
step 1: determining the bandwidth condition of a network link at the current moment; the method for determining the bandwidth condition of the network link at the current moment comprises the following steps: and acquiring the current time bandwidth information between the link nodes by sending a link bandwidth sensing heartbeat detection signal or receiving link bandwidth information reported by the network communication equipment.
Step 2: reading all data to be transmitted in a task queue, and judging whether the data to be transmitted needs relay transmission; if the data to be transmitted needs relay transmission, executing step 3, and if the data does not need relay transmission, executing step 4;
the basis for judging whether the data to be transmitted needs relay transmission comprises the following steps:
the method comprises the steps that data volume of data to be transmitted, transmission time requirements of the data to be transmitted and destination node information of the data to be transmitted are obtained; reading destination node of data to be transmitted from destination node information of data to be transmitted
Figure DEST_PATH_IMAGE001
。
The method for judging whether the data to be transmitted needs relay transmission comprises the following steps:
calculating whether the data to be transmitted needs to adopt relay transmission or not, expressing the data to be transmitted by k,
Figure DEST_PATH_IMAGE002
represents the size of the data to be transmitted, and/or>
Figure DEST_PATH_IMAGE003
And (2) representing the available communication network bandwidth between the data node to be transmitted and the destination node, namely the bandwidth information at the current moment between the link nodes in the step 1, wherein the time required for transmitting the data k to be transmitted is as follows:
Figure DEST_PATH_IMAGE004
Figure DEST_PATH_IMAGE005
indicating the required transmission time of the data k to be transmitted, the time required for transmitting the data k to be transmitted
Figure DEST_PATH_IMAGE006
If the current direct connection communication link does not support the transmission requirement, the data k to be transmitted needs to be transmitted by adopting a relay; if the time required for the transmission of the data k to be transmitted is greater than or equal to>
Figure DEST_PATH_IMAGE007
If so, the current direct connection communication link is considered to support the transmission requirement, and the data k to be transmitted does not need to adopt relay transmission.
And step 3: determining a relay transmission path of data to be transmitted; the method comprises the following steps:
the Dijkstra shortest relay path searching algorithm is adopted to search the relay path and return the best path meeting the transmission condition, and the Dijkstra shortest relay path searching algorithm comprises the following specific steps:
step 3-1, defining the starting node
Figure DEST_PATH_IMAGE008
And destination node->
Figure DEST_PATH_IMAGE009
；
Step 3-2, constructing a transmission topological graph under the current communication link condition
Figure DEST_PATH_IMAGE010
Wherein, N represents transmission nodes, E represents edges in the graph and represents transmission relations among the transmission nodes;
3-3, selecting a weighting strategy for the E, and assigning the weight of the transmission relation for ensuring the optimal relay path; setting weights based on data transmission time, setting edge weights
Figure DEST_PATH_IMAGE011
At node->
Figure DEST_PATH_IMAGE012
And node->
Figure DEST_PATH_IMAGE013
Time of inter-transmission:
Figure DEST_PATH_IMAGE014
wherein the content of the first and second substances,
Figure DEST_PATH_IMAGE015
represents node->
Figure 264736DEST_PATH_IMAGE012
And node->
Figure 572090DEST_PATH_IMAGE013
Available communication network bandwidth;
step 3-4, setting the transmission starting point of the data to be transmitted as a sending address
Figure DEST_PATH_IMAGE016
The destination address is the terminal point->
Figure DEST_PATH_IMAGE017
Returning the start point based on the Dijkstra algorithm>
Figure 148565DEST_PATH_IMAGE016
To the end point->
Figure 684719DEST_PATH_IMAGE017
Shortest path of
Figure DEST_PATH_IMAGE018
Wherein->
Figure DEST_PATH_IMAGE019
Indicating the relay node address and m indicating the number of relay nodes.
And 4, step 4: calculating the priority of data to be transmitted; the specific method for calculating the priority of the data to be transmitted comprises the following steps:
given data k to be transmitted, its priority
Figure DEST_PATH_IMAGE020
Comprises the following steps:
Figure DEST_PATH_IMAGE021
wherein the content of the first and second substances,
Figure DEST_PATH_IMAGE022
represents the priority of the data k to be transmitted, and->
Figure DEST_PATH_IMAGE023
Represents a valid remaining transmission time, based on the data k to be transmitted>
Figure DEST_PATH_IMAGE024
Indicates the latest deadline at which the data k to be transmitted completes transmission, is asserted>
Figure DEST_PATH_IMAGE025
Indicates the current time, is>
Figure DEST_PATH_IMAGE026
Representing the time required for transmitting data k to be transmitted under the current bandwidth condition; />
Figure DEST_PATH_IMAGE027
Are respectively a function of priority
Figure 656349DEST_PATH_IMAGE022
And a valid remaining transfer time function>
Figure 744390DEST_PATH_IMAGE023
The influence factor of (c); />
Figure DEST_PATH_IMAGE028
Representing the spread impact factor function.
The method for calculating the priority of the data to be transmitted comprises the following steps:
the priority of the data to be transmitted comprehensively considers the self priority of the data to be transmitted and the effective residual transmission time of a data packet of the data to be transmitted; the higher the priority of the data to be transmitted, the more preferential the transmission of the data to be transmitted, and the smaller the effective remaining transmission time of the data packet of the data to be transmitted, the more preferential the transmission of the data packet.
The time required for transmitting the data k to be transmitted under the current bandwidth condition
Figure DEST_PATH_IMAGE029
When using relay transmission, the following formula is calculated:
Figure DEST_PATH_IMAGE030
wherein the content of the first and second substances,
Figure DEST_PATH_IMAGE031
indicates relay path pick>
Figure DEST_PATH_IMAGE032
Middle node->
Figure 339320DEST_PATH_IMAGE012
And &>
Figure 803799DEST_PATH_IMAGE013
The available bandwidth in between.
Said priority function
Figure 738257DEST_PATH_IMAGE022
Indicating the priority of the data k to be transmitted, with the values 1,2 and 3 indicating low, medium and high priority, respectively. />
The influence factors of the priority function and the effective residual transmission time function
Figure 997200DEST_PATH_IMAGE027
Determining the influence of each factor on the priority, and setting the influence to be 1;
Figure 643207DEST_PATH_IMAGE028
represents an expansion impact factor function, is used for describing special limit requirements of specific service transmission, is set according to requirements, and is used for judging whether the special limit exists or not>
Figure 645798DEST_PATH_IMAGE028
Is set to 0.
And 5: and transmitting the data according to the priority of the data to be transmitted, and feeding back a transmission result.
Has the advantages that:
(1) The network communication situation is mastered in real time by accessing the network link bandwidth condition, timeliness evaluation is carried out on transmission data by combining the real-time network bandwidth, relay transmission is adopted for the data which does not meet the timeliness requirement in time, and the timeliness of data transmission is guaranteed;
(2) And a communication relay strategy is set, and when the current transmission channel bandwidth cannot effectively transmit data, other alternative transmission paths are selected for relay transmission, so that the problem of information transmission under an unstable network condition can be effectively solved.
(3) The relay path search algorithm adopts heuristic algorithms such as Dijkstra and the like, and has the characteristics of high solving speed and low time complexity compared with global optimal search methods such as depth-first search, breadth-first search and the like.
(4) By introducing a data priority mechanism, the high-priority data is guaranteed to be transmitted preferentially. Compared with the traditional data priority setting method, the data transmission priority setting method comprehensively considers the data priority and the effective residual transmission time of the data packet. The basic principle is that data with higher priority of the data itself is transmitted with higher priority, and data packets with smaller effective remaining transmission time of the data packets are transmitted with higher priority. The data transmission of the same service priority can not be completed in effective time due to the randomly distributed transmission sequence, and the self-adaptive transmission of the data is realized.
Drawings
The foregoing and/or other advantages of the invention will become more apparent from the following detailed description of the invention when taken in conjunction with the accompanying drawings.
FIG. 1 is a flow chart of the implementation steps of the present invention.
Fig. 2 is a flowchart of the steps of the relay path search algorithm of the present invention.
FIG. 3 is a flow chart of the data prioritization algorithm steps of the present invention.
Detailed Description
The technical solution for realizing the purpose of the invention is as follows: and evaluating data to be transmitted by sensing the bandwidth condition of the network link at the current moment, judging whether the current bandwidth meets the data transmission requirement, if not, searching the optimal relay path under the current communication condition by adopting a relay transmission technology and a heuristic relay path search algorithm, returning a search result, and taking the optimal relay path as the data transmission path. On the basis, the priority of the data and the effective residual transmission time of the data packet are comprehensively considered for all the data to be transmitted, the comprehensive priority of the data is set, and the communication network finishes data transmission orderly according to the set priority of the data, and the method specifically comprises the following steps:
step 1: determining the bandwidth condition of a network link at the current moment; the method for determining the bandwidth condition of the network link at the current moment comprises the following steps: and acquiring the current time bandwidth information between link nodes by sending a link bandwidth sensing heartbeat detection signal or receiving link bandwidth information reported by network communication equipment.
Step 2: reading all data to be transmitted in a task queue, and judging whether the data to be transmitted needs relay transmission; if the data to be transmitted needs relay transmission, executing step 3, and if the data does not need relay transmission, executing step 4;
the basis for judging whether the data to be transmitted needs relay transmission comprises the following steps:
the method comprises the steps that data volume of data to be transmitted, transmission time requirements of the data to be transmitted and destination node information of the data to be transmitted are obtained; reading destination node of data to be transmitted from destination node information of data to be transmitted
Figure DEST_PATH_IMAGE033
。
The method for judging whether the data to be transmitted needs relay transmission comprises the following steps:
calculating whether the data to be transmitted needs to adopt relay transmission or not, expressing the data to be transmitted by k,
Figure DEST_PATH_IMAGE034
represents the size of the data to be transmitted, and/or>
Figure DEST_PATH_IMAGE035
And (2) representing the available communication network bandwidth between the data node to be transmitted and the destination node, namely the bandwidth information at the current moment between the link nodes in the step 1, wherein the time required for transmitting the data k to be transmitted is as follows:
Figure DEST_PATH_IMAGE036
Figure DEST_PATH_IMAGE037
indicating the required transmission time of the data k to be transmitted, the time required for transmitting the data k to be transmitted
Figure DEST_PATH_IMAGE038
If the current direct connection communication link does not support the transmission requirement, the data k to be transmitted needs to be transmitted by adopting a relay; if the time required for the transmission of the data k to be transmitted is greater than or equal to>
Figure DEST_PATH_IMAGE039
If so, the current direct connection communication link is considered to support the transmission requirement, and the data k to be transmitted does not need to adopt relay transmission.
And step 3: determining a relay transmission path of data to be transmitted; the method comprises the following steps:
the method comprises the following steps of searching for a relay path and returning an optimal path meeting transmission conditions by adopting a Dijkstra shortest relay path search algorithm (refer to Zhang Fuhao, liuji and Liqingyuan), a shortest path optimization algorithm [ J ] based on the Dijkstra algorithm, 2004 (2): 4.), wherein the Dijkstra shortest relay path search algorithm comprises the following specific steps:
step 3-1, defining the starting node
Figure 28238DEST_PATH_IMAGE016
And destination node->
Figure 723662DEST_PATH_IMAGE017
；
Step 3-2, constructing a transmission topological graph under the current communication link condition
Figure DEST_PATH_IMAGE040
Wherein, N represents transmission nodes, E represents edges in the graph and represents transmission relations among the transmission nodes;
3-3, selecting a weighting strategy for the E, and assigning the weight of the transmission relation for ensuring the optimal relay path; setting weights based on data transmission time, setting edge weights
Figure DEST_PATH_IMAGE041
In node for data k to be transmitted>
Figure DEST_PATH_IMAGE042
And node &>
Figure DEST_PATH_IMAGE043
Time of inter-transmission:
Figure DEST_PATH_IMAGE044
wherein the content of the first and second substances,
Figure 434129DEST_PATH_IMAGE015
represents node->
Figure 709252DEST_PATH_IMAGE012
And node &>
Figure 244401DEST_PATH_IMAGE013
Available communication network bandwidth;
step 3-4, setting the transmission starting point of the data to be transmitted as a sending address
Figure 845147DEST_PATH_IMAGE016
Destination address is terminal
Figure 839648DEST_PATH_IMAGE017
Returning the start point based on the Dijkstra algorithm>
Figure 184041DEST_PATH_IMAGE016
To the end point->
Figure 822964DEST_PATH_IMAGE017
Shortest path of (2)
Figure 860190DEST_PATH_IMAGE018
Wherein->
Figure 76408DEST_PATH_IMAGE019
Indicating the relay node address and m indicating the number of relay nodes.
And 4, step 4: the method for calculating the priority of the data to be transmitted comprises the following steps:
given data k to be transmitted, its priority
Figure 224493DEST_PATH_IMAGE020
Comprises the following steps:
Figure 967189DEST_PATH_IMAGE021
wherein the content of the first and second substances,
Figure 909738DEST_PATH_IMAGE022
represents the priority of the data k to be transmitted, and->
Figure 613252DEST_PATH_IMAGE023
Represents a valid remaining transmission time, based on the data k to be transmitted>
Figure 299448DEST_PATH_IMAGE024
Indicates the latest deadline for the completion of a transfer of data k to be transferred, is exceeded>
Figure 37597DEST_PATH_IMAGE025
Indicates the current time, is>
Figure 291992DEST_PATH_IMAGE026
Representing the time required for transmitting data k to be transmitted under the current bandwidth condition; />
Figure 482801DEST_PATH_IMAGE027
Are respectively a function of priority
Figure 972689DEST_PATH_IMAGE022
And a valid remaining transfer time function>
Figure 299765DEST_PATH_IMAGE023
The influence factor of (c); />
Figure 475793DEST_PATH_IMAGE028
Representing the spread impact factor function.
The method for calculating the priority of the data to be transmitted comprises the following steps:
the priority of the data to be transmitted comprehensively considers the self priority of the data to be transmitted and the effective residual transmission time of a data packet of the data to be transmitted; the data to be transmitted with higher priority of the data to be transmitted is transmitted with higher priority, and the data packets with smaller effective residual transmission time of the data packets of the data to be transmitted are transmitted with higher priority.
The time required for transmitting the data k to be transmitted under the current bandwidth condition
Figure 153899DEST_PATH_IMAGE029
When using relay transmission, the following formula is calculated:
Figure 447478DEST_PATH_IMAGE030
wherein the content of the first and second substances,
Figure 894639DEST_PATH_IMAGE031
indicates relay path pick>
Figure 84312DEST_PATH_IMAGE032
Middle node->
Figure 125081DEST_PATH_IMAGE012
And &>
Figure 956770DEST_PATH_IMAGE013
The available bandwidth in between.
Said priority function
Figure 524018DEST_PATH_IMAGE022
Indicating the priority of the data k to be transmitted, with the values 1,2 and 3 indicating low, medium and high priority, respectively.
The influence factors of the priority function and the effective residual transmission time function
Figure 150171DEST_PATH_IMAGE027
Determining the influence of each factor on the priority, and setting the influence to be 1;
Figure 927503DEST_PATH_IMAGE028
represents an expansion impact factor function, is used for describing special limit requirements of specific service transmission, is set according to requirements, and is used for judging whether the special limit exists or not>
Figure 562884DEST_PATH_IMAGE028
Is set to 0.
And 5: and transmitting data according to the priority of the data to be transmitted, and feeding back a transmission result.
Example (b):
with reference to fig. 1, according to an embodiment of the present invention, a QoS edge adaptive-based network cloud convergence information transmission method includes the following steps:
step 1: and sending a link bandwidth sensing heartbeat detection signal or receiving link bandwidth information reported by the network communication equipment.
Step 2: and judging whether to acquire communication link feedback.
Rule 2.1: if the feedback of the communication link is not received, the data transmission is degraded to be data transmission by adopting a preset traditional QoS strategy, and the process is ended.
Rule 2.2: and if the communication link feedback is received, executing the step 3.
And step 3: and acquiring the bandwidth condition of the network link.
Step 4: and reading the task queue.
Rule 4.1: if the task queue is empty, the process flow will block until a new task arrives.
And 5: traversing data to be transmitted in task queue
Figure DEST_PATH_IMAGE045
And t represents the amount of data to be transmitted in the task queue.
Step 6: selecting data to be transmitted in task queue
Figure DEST_PATH_IMAGE046
And judging whether the data k to be transmitted needs relay transmission or not.
Rule 6.1: by using
Figure DEST_PATH_IMAGE047
Represents the size of the data to be transmitted, and/or>
Figure DEST_PATH_IMAGE048
When the available communication network bandwidth between the data node to be transmitted and the destination node is represented, the time required for transmitting the data packet k is as follows:
Figure DEST_PATH_IMAGE049
Figure DEST_PATH_IMAGE050
represents the requested transmission time of the data k to be transmitted, if the time required for transmitting the data packet k is->
Figure DEST_PATH_IMAGE051
If the current direct connection communication link does not support the transmission requirement, the data k to be transmitted needs to be transmitted by adopting the relay. If the time required for transmitting a data packet k is greater than or equal to>
Figure DEST_PATH_IMAGE052
If the current direct connection communication link supports the transmission requirement, the data k to be transmitted does not need to adopt relay transmission.
Rule 6.2: and if the data k to be transmitted needs to adopt relay transmission, executing the step 7, otherwise, executing the step 8.
And 7: searching feasible relay paths by adopting a relay path searching algorithm and returning to the shortest path
Figure DEST_PATH_IMAGE053
As a result of the relay path search, wherein>
Figure DEST_PATH_IMAGE054
Indicates the address of the task-sending node, </or>
Figure DEST_PATH_IMAGE055
Indicates the final transfer destination address, and->
Figure DEST_PATH_IMAGE056
Indicates the relay node address, and m indicates the number of relay nodes, step 8 is performed.
And 8: and calculating the priority of the data k to be transmitted by comprehensively considering the priority of the data and the effective residual transmission time of the data packet.
And step 9: traversing data to be transmitted in task queue
Figure DEST_PATH_IMAGE057
Generates all data to be transmitted with priority->
Figure DEST_PATH_IMAGE058
。
Step 10: selecting data to be transmitted with highest priority
Figure DEST_PATH_IMAGE059
。
Step 11: determining data to be transmitted
Figure 548420DEST_PATH_IMAGE059
Whether to employ relay transmission.
Rule 11.1: if data is to be transmitted
Figure 735688DEST_PATH_IMAGE059
And if the relay transmission is adopted, data transmission is carried out according to a relay path. The flow ends.
Rule 11.2: if data is to be transmitted
Figure 610103DEST_PATH_IMAGE059
And if the relay transmission is not adopted, the data transmission is directly carried out. The flow ends.
In step 7, the relay path search algorithm aims at searching for a feasible communication relay path under the current communication link condition, and can adopt global search algorithms such as depth-first search and breadth-first search, and can also adopt a heuristic algorithm to accelerate the search speed and reduce the time complexity. The invention combines the actual use requirement, selects Dijkstra algorithm as the relay path searching algorithm, and the specific steps are shown in figure 2:
(1) Unambiguous starting node
Figure DEST_PATH_IMAGE060
And destination node->
Figure DEST_PATH_IMAGE061
；
(2) Constructing a transmission topological graph under the current communication link condition
Figure DEST_PATH_IMAGE062
Wherein, N represents transmission nodes, E represents edges in the graph and represents the transmission relation between the transmission nodes;
(3) And selecting a weighting strategy for E, and assigning the weight of the transmission relation to ensure the optimal relay path. The present invention sets the weight on the basis of the data transmission time, considering that the shorter the time required for data transmission, the better, and therefore, sets the edge weight
Figure DEST_PATH_IMAGE063
At node->
Figure DEST_PATH_IMAGE064
、/>
Figure DEST_PATH_IMAGE065
Time of inter-transmission:
Figure DEST_PATH_IMAGE066
wherein the content of the first and second substances,
Figure DEST_PATH_IMAGE067
represents node->
Figure 409694DEST_PATH_IMAGE064
、/>
Figure 685954DEST_PATH_IMAGE065
The available communication network bandwidth.
(4) Setting message transmission starting point as sending address
Figure 919490DEST_PATH_IMAGE060
The destination address is the terminal point->
Figure 156567DEST_PATH_IMAGE061
Invoking the Dijkstra algorithm returns the origin->
Figure 133750DEST_PATH_IMAGE060
To the end point->
Figure 264517DEST_PATH_IMAGE061
Shortest path of
Figure 668954DEST_PATH_IMAGE053
Wherein->
Figure 642595DEST_PATH_IMAGE056
Indicating the relay node address and m indicating the number of relay nodes.
As shown in fig. 3, the data priority setting in step 8 needs to consider the priority of the data itself and the effective remaining transmission time of the data packet. The basic principle is that data with higher priority of the data itself is transmitted with higher priority, and data packets with smaller effective remaining transmission time of the data packets are transmitted with higher priority. In particular, given data k to be transmitted, its data priority
Figure DEST_PATH_IMAGE068
Comprises the following steps: />
Figure 423469DEST_PATH_IMAGE021
Wherein, the first and the second end of the pipe are connected with each other,
Figure DEST_PATH_IMAGE069
the priority of the data k to be transmitted is represented, and the low, medium and high priority can be represented by numerical values 1,2 and 3 respectively. />
Figure DEST_PATH_IMAGE070
Represents a valid remaining transmission time, based on the data k to be transmitted>
Figure DEST_PATH_IMAGE071
Indicates the latest deadline at which the data k to be transmitted completes transmission, is asserted>
Figure DEST_PATH_IMAGE072
Indicates the current time, is>
Figure DEST_PATH_IMAGE073
Indicating the time required to transmit packet k under the current bandwidth conditions. />
Figure DEST_PATH_IMAGE074
Are respectively a priority function->
Figure 503683DEST_PATH_IMAGE069
And effective remaining transfer time function
Figure 79021DEST_PATH_IMAGE070
Influence factors, which determine the influence of each factor on the priority, are provided in the present application
Figure 415324DEST_PATH_IMAGE074
Are all set to 1./>
Figure DEST_PATH_IMAGE075
Represents an extended impact factor function describing the particular restriction requirements for a particular traffic transmission, which can be set as desired, in this case will->
Figure 734310DEST_PATH_IMAGE075
Is set to 0.
It should be noted that when relay transmission is used, the time required to transmit the packet k is
Figure DEST_PATH_IMAGE076
The calculation is performed according to the following formula:
Figure DEST_PATH_IMAGE077
wherein the content of the first and second substances,
Figure DEST_PATH_IMAGE078
indicates relay path pick>
Figure DEST_PATH_IMAGE079
Middle node->
Figure 901986DEST_PATH_IMAGE064
、/>
Figure 648225DEST_PATH_IMAGE065
To the available bandwidth.
In a specific implementation, the present application provides a computer storage medium and a corresponding data processing unit, where the computer storage medium is capable of storing a computer program, and the computer program may run the inventive content of the QoS edge adaptive-based network cloud convergence information transmission method and some or all of the steps in each embodiment provided by the present invention when executed by the data processing unit. The storage medium may be a magnetic disk, an optical disk, a read-only memory (ROM), a Random Access Memory (RAM), or the like.
It is clear to those skilled in the art that the technical solutions in the embodiments of the present invention can be implemented by means of a computer program and its corresponding general-purpose hardware platform. Based on such understanding, the technical solutions in the embodiments of the present invention may be embodied in the form of a computer program, that is, a software product, which may be stored in a storage medium and includes several instructions to enable a device (which may be a personal computer, a server, a single chip, an MUU, or a network device) including a data processing unit to execute the method in each embodiment or some parts of the embodiments of the present invention.
The present invention provides a method and a concept for a network cloud convergence information transmission method based on QoS edge adaptation, and a method and a way for implementing the technical scheme are many, and the above description is only a preferred embodiment of the present invention, and it should be noted that, for those skilled in the art, a plurality of improvements and decorations can be made without departing from the principle of the present invention, and these improvements and decorations should also be regarded as the protection scope of the present invention. All the components not specified in the present embodiment can be realized by the prior art.

Claims (8)

1. A network cloud fusion information transmission method based on QoS edge self-adaptation is characterized by comprising the following steps:
step 1: determining the bandwidth condition of a network link at the current moment;
step 2: reading all data to be transmitted in a task queue, and judging whether the data to be transmitted needs relay transmission; if the data to be transmitted needs relay transmission, executing step 3, and if the data does not need relay transmission, executing step 4;
and step 3: determining a relay transmission path of data to be transmitted;
and 4, step 4: calculating the priority of data to be transmitted;
and 5: transmitting data according to the priority of the data to be transmitted, and feeding back a transmission result;
the method for judging whether the data to be transmitted needs relay transmission in the step 2 comprises the following steps:
calculating whether the data to be transmitted needs to adopt relay transmission or not
Figure 434065DEST_PATH_IMAGE001
Which represents the data to be transmitted and,
Figure 430881DEST_PATH_IMAGE002
which indicates the size of the data to be transmitted,
Figure 255617DEST_PATH_IMAGE003
indicating the available communication network bandwidth between the data node to be transmitted and the destination node, i.e. the current time bandwidth information between the link nodes, the data to be transmitted is transmitted
Figure 499517DEST_PATH_IMAGE001
The required time is as follows:
Figure 282665DEST_PATH_IMAGE004
Figure 746270DEST_PATH_IMAGE005
representing data to be transmitted
Figure 109118DEST_PATH_IMAGE001
If data to be transmitted is transmitted
Figure 207524DEST_PATH_IMAGE001
Required time of day
Figure 895994DEST_PATH_IMAGE006
If the current direct connection communication link does not support the transmission requirement, the data to be transmitted is considered
Figure 843965DEST_PATH_IMAGE001
Relay transmission is required; if data to be transmitted is transmitted
Figure 10504DEST_PATH_IMAGE001
Required time of
Figure 25734DEST_PATH_IMAGE007
If the current direct connection communication link supports the transmission requirement, the data to be transmitted
Figure 120991DEST_PATH_IMAGE001
Relay transmission is not needed;
the method for calculating the priority of the data to be transmitted in the step 4 comprises the following steps:
the priority of the data to be transmitted comprehensively considers the self priority of the data to be transmitted and the effective residual transmission time of a data packet of the data to be transmitted; the higher the priority of the data to be transmitted, the more preferential the transmission of the data to be transmitted, and the smaller the effective remaining transmission time of the data packet of the data to be transmitted, the more preferential the transmission of the data packet.
2. The method for transmitting the QoS edge adaptive network cloud convergence information according to claim 1, wherein the method for determining the network link bandwidth condition at the current time in step 1 includes: and acquiring the current time bandwidth information between the link nodes by sending a link bandwidth sensing heartbeat detection signal or receiving link bandwidth information reported by the network communication equipment.
3. The method according to claim 2, wherein the step 2 of determining whether the data to be transmitted needs relay transmission includes:
the method comprises the steps that data volume of data to be transmitted, transmission time requirements of the data to be transmitted and destination node information of the data to be transmitted are obtained; reading destination node of data to be transmitted from destination node information of data to be transmitted
Figure 588882DEST_PATH_IMAGE008
。
4. The method for transmitting QoS edge adaptive-based network cloud convergence information according to claim 3, wherein the method for determining the relay transmission path in step 3 includes:
the Dijkstra shortest relay path searching algorithm is adopted to search the relay path and return the best path meeting the transmission condition, and the Dijkstra shortest relay path searching algorithm comprises the following specific steps:
step 3-1, defining the starting node
Figure 824691DEST_PATH_IMAGE009
And destination node
Figure 897689DEST_PATH_IMAGE008
；
Step 3-2, constructing a transmission topological graph under the current communication link condition
Figure 160918DEST_PATH_IMAGE010
Wherein, in the process,
Figure 584946DEST_PATH_IMAGE011
which represents the transmission node or nodes, respectively,
Figure 93288DEST_PATH_IMAGE012
representing edges in the graph, representing transmission relationships between transmission nodes;
step 3-3 is
Figure 286372DEST_PATH_IMAGE012
Selecting a weighting strategy, and assigning the weight of a transmission relation for ensuring the optimal relay path; setting weights based on data transmission time, setting edge weights
Figure 989011DEST_PATH_IMAGE013
For data to be transmitted
Figure 634756DEST_PATH_IMAGE001
At a node
Figure 946788DEST_PATH_IMAGE014
And node
Figure 994379DEST_PATH_IMAGE015
Time of inter-transmission:
Figure 599410DEST_PATH_IMAGE016
wherein, the first and the second end of the pipe are connected with each other,
Figure 732451DEST_PATH_IMAGE017
representing nodes
Figure 848175DEST_PATH_IMAGE018
And node
Figure 750272DEST_PATH_IMAGE015
The available communication network bandwidth in between, i and j represent the node numbers;
step 3-4, setting the transmission starting point of the data to be transmitted as a sending address
Figure 591451DEST_PATH_IMAGE009
Destination address is the end point
Figure 946209DEST_PATH_IMAGE008
Returning the starting point according to the Dijkstra algorithm
Figure 865623DEST_PATH_IMAGE009
To the end point
Figure 855183DEST_PATH_IMAGE008
Shortest path of
Figure 834640DEST_PATH_IMAGE019
Wherein
Figure 942273DEST_PATH_IMAGE020
Indicating the address of the relay node or nodes,
Figure 399800DEST_PATH_IMAGE021
indicating the number of relay nodes.
5. The QoS edge self-adaptive based network cloud convergence information transmission method according to claim 4, wherein the specific method for calculating the priority of the data to be transmitted in the step 4 comprises the following steps:
given data to be transmitted
Figure 246795DEST_PATH_IMAGE022
Priority of which
Figure 397154DEST_PATH_IMAGE023
Comprises the following steps:
Figure 726504DEST_PATH_IMAGE024
wherein the content of the first and second substances,
Figure 722142DEST_PATH_IMAGE025
indicating the priority of the data to be transmitted,
Figure 951873DEST_PATH_IMAGE026
representing the effective remaining transmission time of the data to be transmitted,
Figure 273132DEST_PATH_IMAGE027
indicating the latest deadline by which the data to be transmitted completes transmission,
Figure 620937DEST_PATH_IMAGE028
which is indicative of the current time of day,
Figure 685845DEST_PATH_IMAGE029
representing the time required for transmitting the data to be transmitted under the current bandwidth condition;
Figure 773012DEST_PATH_IMAGE030
are respectively a function of priority
Figure 999594DEST_PATH_IMAGE025
And effective remaining transmission time function
Figure 303536DEST_PATH_IMAGE026
The influence factor of (c);
Figure 906556DEST_PATH_IMAGE031
representing the spread impact factor function.
6. The QoS edge adaptive-based network cloud convergence information transmission method according to claim 5, wherein the time required for transmitting the data to be transmitted under the current bandwidth condition in the step 4 is
Figure 845300DEST_PATH_IMAGE029
When using relay transmission, the calculation is made according to the following formula:
Figure 508362DEST_PATH_IMAGE032
wherein the content of the first and second substances,
Figure 34022DEST_PATH_IMAGE033
indicating a relay path
Figure 440732DEST_PATH_IMAGE019
Middle node
Figure 502491DEST_PATH_IMAGE034
The available bandwidth in between.
7. The QoS edge adaptive-based network cloud convergence information transmission method according to claim 6, wherein the priority function in step 4
Figure 70876DEST_PATH_IMAGE025
Representing data to be transmitted
Figure 552673DEST_PATH_IMAGE001
The priorities of (1), (2) and (3) are indicated by low, medium and high priorities, respectively.
8. The QoS edge adaptive-based network cloud convergence information transmission method according to claim 7, wherein the influence factors of the priority function and the effective remaining transmission time function in step 4
Figure 497495DEST_PATH_IMAGE030
Determining the influence of each factor on the priority, and setting the influence to be 1;
Figure 410831DEST_PATH_IMAGE031
the function of the expansion impact factor is expressed, is used for describing the special restriction requirements of specific service transmission, is set according to requirements, and is not limited when the special restriction is not provided
Figure 150117DEST_PATH_IMAGE031
Is set to 0.
CN202211280039.4A 2022-10-19 2022-10-19 Network cloud fusion information transmission method based on QoS edge self-adaption Active CN115361333B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202211280039.4A CN115361333B (en) 2022-10-19 2022-10-19 Network cloud fusion information transmission method based on QoS edge self-adaption

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202211280039.4A CN115361333B (en) 2022-10-19 2022-10-19 Network cloud fusion information transmission method based on QoS edge self-adaption

Publications (2)

Publication Number Publication Date
CN115361333A CN115361333A (en) 2022-11-18
CN115361333B true CN115361333B (en) 2023-03-24

Family

ID=84008098

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202211280039.4A Active CN115361333B (en) 2022-10-19 2022-10-19 Network cloud fusion information transmission method based on QoS edge self-adaption

Country Status (1)

Country Link
CN (1) CN115361333B (en)

Families Citing this family (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN117880244B (en) * 2024-03-13 2024-05-14 中国电子科技集团公司第二十八研究所 Edge communication optimization method and system suitable for high-mobility environment
CN117955979B (en) * 2024-03-27 2024-06-18 中国电子科技集团公司第五十四研究所 Cloud network fusion edge information service method based on mobile communication node

Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN105245451A (en) * 2015-10-16 2016-01-13 哈尔滨工业大学深圳研究生院 Time diffusion route search method of satellite DTN (Delay/Disrupt-Tolerant Networking) network
CN110139319A (en) * 2019-05-25 2019-08-16 西南电子技术研究所（中国电子科技集团公司第十研究所） High dynamic time-delay network propagation delay time minimizes method for routing

Family Cites Families (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101815032B (en) * 2010-03-16 2012-08-22 中国电子科技集团公司第三十研究所 Method for classifying and isolating information based on integrated network security service architecture
CN109347902B (en) * 2018-08-27 2020-05-19 西北大学 Data cooperative transmission method giving consideration to priority and fairness in edge computing network
CN111836329B (en) * 2019-04-19 2022-04-22 Oppo广东移动通信有限公司 Data transmission method and related device
RU2749444C1 (en) * 2020-11-17 2021-06-10 Юрий Иванович Стародубцев Method for modeling virtual communication network on remaining resources of physical network
CN113840257B (en) * 2021-11-25 2022-03-11 中国电子科技集团公司第二十八研究所 Multi-unmanned aerial vehicle communication relay method in urban environment

Patent Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN105245451A (en) * 2015-10-16 2016-01-13 哈尔滨工业大学深圳研究生院 Time diffusion route search method of satellite DTN (Delay/Disrupt-Tolerant Networking) network
CN110139319A (en) * 2019-05-25 2019-08-16 西南电子技术研究所（中国电子科技集团公司第十研究所） High dynamic time-delay network propagation delay time minimizes method for routing

Also Published As

Publication number Publication date
CN115361333A (en) 2022-11-18

Similar Documents

Publication Publication Date Title
CN115361333B (en) Network cloud fusion information transmission method based on QoS edge self-adaption
US9185047B2 (en) Hierarchical profiled scheduling and shaping
CN103346922B (en) The controller of determination network state based on SDN and determine method
CN112346854B (en) In-network resource scheduling method and system for hierarchical collaborative decision and storage medium
CN108353029A (en) For managing the method and system for calculating the data service in network
CN101714947B (en) Extensible full-flow priority dispatching method and system
CN109548052B (en) Data transmission method and device, electronic equipment and readable storage medium
KR20200074431A (en) System and method for selecting optimal path in multi-media multi-path network
CN109614215A (en) Stream scheduling method, device, equipment and medium based on deeply study
CN110708260A (en) Data packet transmission method and related device
CN109617806B (en) Data traffic scheduling method and device
CN109699089A (en) A kind of channel access method and device
CN103916329A (en) Named data network transmission control method and system
CN111211996B (en) Flow scheduling method
CN105262534B (en) A kind of method for routing and device suitable for satellite communication network
CN100466593C (en) Method of implementing integrated queue scheduling for supporting multi service
CN115766592A (en) Flow rate limiting method based on priority, DPU message forwarding method and device
CN111740922B (en) Data transmission method, device, electronic equipment and medium
CN109150760B (en) Network resource reservation method and device
CN106464670A (en) Network entity and service policy management method
CN112737940A (en) Data transmission method and device
CN108696455A (en) Method and device for processing service flow
CN109039896A (en) Method for routing and device suitable for Information Network
CN115175265A (en) Transmission path determination method and device, computer equipment and storage medium
CN114095431A (en) Queue management method and network equipment

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