CN115361333A - 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 PDFInfo
- Publication number
- CN115361333A CN115361333A CN202211280039.4A CN202211280039A CN115361333A CN 115361333 A CN115361333 A CN 115361333A CN 202211280039 A CN202211280039 A CN 202211280039A CN 115361333 A CN115361333 A CN 115361333A
- 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.)
- Granted
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 based 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 searching 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
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 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 business 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 of introducing cloud computing into a communication network by definition, and the communication network is a technology of introducing cloud computing into the communication network. 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 the carrier network of an operator [ J ]. China New communication, 2022 (024-001) ], the application scene of cloud network fusion and the future prospect [ J ]. China industry and informatization, 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 information transmission problem of the 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 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 of obtaining 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; reading destination node of data to be transmitted from destination node information of data to be transmitted
。
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,
which indicates the size of the data to be transmitted,
represents to beThe available communication network bandwidth between the data transmission node and the destination node, that is, the bandwidth information at the current time between the link nodes in step 1, the time required for transmitting the data k to be transmitted is:
And step 3: determining a relay transmission path of data to be transmitted; the method comprises the following steps:
a 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
And destination node
；
Step 3-2, constructing a transmission topological graph under the current communication link condition
Wherein N denotes a transmission node, E denotes an edge in the figure, and denotes a node between transmission nodesA transmission relationship;
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
For data k to be transmitted at a node
And node
Time of inter-transmission:
wherein the content of the first and second substances,
representing nodes
And node
Available communication network bandwidth;
step 3-4, setting the transmission starting point of the data to be transmitted as a sending address
Destination address is terminal
Returning the starting point according to the Dijkstra algorithm
To the end point
Shortest path of (2)
Wherein
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
Comprises the following steps:
wherein the content of the first and second substances,
indicating the priority of the data k to be transmitted,
representing the effective remaining transmission time of the data k to be transmitted,
indicating the latest deadline by which the data k to be transmitted completes transmission,
which is indicative of the current time of day,
representing the time required for transmitting data k to be transmitted under the current bandwidth condition;
are respectively a function of priority
And effective remaining transmission time function
The influence factor of (c);
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
When using relay transmission, the calculation is made according to the following formula:
wherein the content of the first and second substances,
indicating a relay path
Middle node
And
the available bandwidth in between.
Said priority function
Indicates the priority of the data k to be transmitted, and the numerical values 1,2 and 3 indicate that the priority is lowMedium and high.
The influence factors of the priority function and the effective residual transmission time function
Determining the influence of each factor on the priority, and setting the influence to be 1;
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 timeliness requirements in time, and data transmission timeliness 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 ensured 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 per se 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 further 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 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 or not; 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 of obtaining 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; reading destination node of data to be transmitted from destination node information of data to be transmitted
。
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,
which indicates the size of the data to be transmitted,
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:
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
And destination node
；
Step 3-2, constructing a transmission topological graph under the current communication link condition
Wherein, N represents transmission nodes, E represents edges in the graph and represents the transmission relation between the transmission nodes;
3-3, selecting a weighting strategy for the E, and assigning the weight of the transmission relation to ensure the optimal relay path; setting weights based on data transmission time, setting edge weights
For data k to be transmitted at a node
And node
Time of inter-transmission:
wherein the content of the first and second substances,
representing nodes
And node
Available communication network bandwidth;
step 3-4, setting the transmission starting point of the data to be transmitted as the sending address
Destination address is terminal
Returning the starting point according to Dijkstra algorithm
To the end point
Shortest path of (2)
In which
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
Comprises the following steps:
wherein the content of the first and second substances,
indicating the priority of the data k to be transmitted,
representing the effective remaining transmission time of the data k to be transmitted,
indicating the latest deadline by which the data k to be transmitted completes transmission,
which is indicative of the current time of day,
representing the time required for transmitting data k to be transmitted under the current bandwidth condition;
are respectively a function of priority
And effective remaining transmission time function
The influence factor of (c);
representing the spreading 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
When using relay transmission, the following formula is followedAnd (3) calculating:
wherein, the first and the second end of the pipe are connected with each other,
indicating a relay path
Middle node
And
the available bandwidth in between.
Said priority function
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
Determining the influence of each factor on the priority, and setting the influence to be 1;
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
And t represents the amount of data to be transmitted in the task queue.
And 6: selecting data to be transmitted in task queue
And judging whether the data k to be transmitted needs relay transmission or not.
Rule 6.1: by using
Which indicates the size of the data to be transmitted,
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:
Rule 6.2: and (7) if the data k to be transmitted needs to adopt relay transmission, executing step 7, otherwise, executing step 8.
And 7: searching feasible relay paths by adopting a relay path searching algorithm and returning to the shortest path
As a result of the relay path search, wherein
Indicating the address of the task-sending node,
which indicates the final destination address of the transmission,
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
Generating all data priority to be transmitted
。
Step 10: selecting data to be transmitted with highest priority
。
Step 11: determining data to be transmitted
Whether to employ relay transmission.
Rule 11.1: if data is to be transmitted
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
And if relay transmission is not adopted, 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
And destination node
；
(2) Constructing transmission topological graph under current communication link condition
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, wherein the weight of the transmission relation needs to be specified to ensure the optimal relay path. The present invention sets a weight based on a data transmission time, considering that the shorter the time required for data transmission, the better, and thus, sets an edge weight
For data k to be transmitted at a node
、
Time of inter-transmission:
wherein the content of the first and second substances,
representing nodes
、
To the available communication network bandwidth.
(4) Setting message transmission starting point as sending address
Destination address is terminal
Calling Dijkstra algorithm to return to starting point
To the end point
Shortest path of (2)
Wherein
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
Comprises the following steps:
wherein the content of the first and second substances,
the priority of data k to be transmitted is represented by numerical values 1,2 and 3, which represent low, medium and high priority, respectively.
Representing the effective remaining transmission time of the data k to be transmitted,
indicating the latest deadline by which the data k to be transmitted completes transmission,
which is indicative of the current time of day,
indicating the time required to transmit packet k under the current bandwidth conditions.
Are respectively a function of priority
And effective remaining transfer time function
Influence factors, which determine the influence of each factor on the priority, are provided in the present application
Are all set to 1.
The function representing the spreading factor of influence, which describes the specific constraint requirements of a particular service transmission, can be set as desired, and will be used in this case
Is set to 0.
It should be noted that when relay transmission is used, the time required to transmit the packet k is
The calculation is performed according to the following formula:
wherein, the first and the second end of the pipe are connected with each other,
indicating a relay path
Middle node
、
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 obvious 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 invention provides a thought and a method of a network cloud fusion information transmission method based on QoS edge adaptation, and a plurality of methods and ways for specifically implementing the technical scheme are provided. All the components not specified in this embodiment can be implemented by the prior art.
Claims (10)
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;
and 2, step: 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 3, 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: and transmitting the data according to the priority of the data to be transmitted, and feeding back a transmission result.
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 link nodes by sending a link bandwidth sensing heartbeat detection signal or receiving link bandwidth information reported by 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 the destination node of the data to be transmitted from the destination node information of the data to be transmitted
。
4. The method for transmitting network cloud convergence information based on QoS edge adaptation according to claim 3, wherein the method for judging whether the data to be transmitted needs relay transmission in step 2 comprises:
calculating whether the data to be transmitted needs to adopt relay transmission or not, expressing the data to be transmitted by k,
which indicates the size of the data to be transmitted,
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:
5. The method for transmitting the QoS edge adaptive network cloud convergence information according to claim 4, 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
And destination node
；
Step 3-2, constructing a transmission topological graph under the current communication link condition
Wherein, N represents transmission nodes, E represents edges in the graph and represents the transmission relation between 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
For data k to be transmitted at a node
And node
Time of inter-transmission:
wherein the content of the first and second substances,
representing nodes
And node
The available communication network bandwidth between, i and j represent the node number;
step 3-4, setting the transmission starting point of the data to be transmitted as the sending address
Destination address is the end point
Returning the starting point according to the Dijkstra algorithm
To the end point
Shortest path of (2)
Wherein
Indicating the relay node address and m indicating the number of relay nodes.
6. The QoS edge adaptive based network cloud convergence information transmission method according to claim 5, wherein the method for calculating the priority of the data to be transmitted in step 4 comprises:
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.
7. The QoS edge adaptive-based network cloud convergence information transmission method according to claim 6, wherein the specific method for calculating the priority of the data to be transmitted in step 4 comprises the following steps:
given data k to be transmitted, its priority
Comprises the following steps:
wherein, the first and the second end of the pipe are connected with each other,
indicating the priority of the data k to be transmitted,
representing the effective remaining transmission time of the data k to be transmitted,
indicating the latest deadline by which the data k to be transmitted completes transmission,
which is indicative of the current time of day,
representing the time required for transmitting data k to be transmitted under the current bandwidth condition;
are respectively a function of priority
And effective remaining transmission time function
The influence factor of (c);
representing the spreading factor function.
8. The QoS edge adaptive-based network cloud convergence information transmission method according to claim 7, wherein the time required for transmitting the data k to be transmitted under the current bandwidth condition in the step 4 is
When using relay transmission, the calculation is made according to the following formula:
wherein the content of the first and second substances,
indicating a relay path
9. The QoS edge adaptive-based network cloud convergence information transmission method according to claim 8, wherein the priority function in step 4
Indicating the priority of the data k to be transmitted, with the values 1,2 and 3 indicating low, medium and high priority, respectively.
10. According to claim9, the method for transmitting the network cloud fusion information based on the QoS edge self-adaptation is characterized in that the influence factors of the priority function and the effective residual transmission time function in the step 4
Determining the influence of each factor on the priority, and setting the influence to be 1;
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 true CN115361333A (en) | 2022-11-18 |
| CN115361333B 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) |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN117880244A (en) * | 2024-03-13 | 2024-04-12 | 中国电子科技集团公司第二十八研究所 | Edge communication optimization method and system suitable for high-mobility environment |
| CN117955979A (en) * | 2024-03-27 | 2024-04-30 | 中国电子科技集团公司第五十四研究所 | Cloud network fusion edge information service method based on mobile communication node |
Citations (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101815032A (en) * | 2010-03-16 | 2010-08-25 | 中国电子科技集团公司第三十研究所 | Method for classifying and isolating information based on integrated network security service architecture |
| CN105245451A (en) * | 2015-10-16 | 2016-01-13 | 哈尔滨工业大学深圳研究生院 | Time diffusion route search method of satellite DTN (Delay/Disrupt-Tolerant Networking) network |
| CN109347902A (en) * | 2018-08-27 | 2019-02-15 | 西北大学 | The data collaborative transmission method of priority and fairness is taken into account in edge calculations network |
| CN110139319A (en) * | 2019-05-25 | 2019-08-16 | 西南电子技术研究所（中国电子科技集团公司第十研究所） | High dynamic time-delay network propagation delay time minimizes method for routing |
| CN111836329A (en) * | 2019-04-19 | 2020-10-27 | 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 |
| CN113840257A (en) * | 2021-11-25 | 2021-12-24 | 中国电子科技集团公司第二十八研究所 | Multi-unmanned aerial vehicle communication relay method in urban environment |
-
2022
- 2022-10-19 CN CN202211280039.4A patent/CN115361333B/en active Active
Patent Citations (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101815032A (en) * | 2010-03-16 | 2010-08-25 | 中国电子科技集团公司第三十研究所 | Method for classifying and isolating information based on integrated network security service architecture |
| CN105245451A (en) * | 2015-10-16 | 2016-01-13 | 哈尔滨工业大学深圳研究生院 | Time diffusion route search method of satellite DTN (Delay/Disrupt-Tolerant Networking) network |
| CN109347902A (en) * | 2018-08-27 | 2019-02-15 | 西北大学 | The data collaborative transmission method of priority and fairness is taken into account in edge calculations network |
| CN111836329A (en) * | 2019-04-19 | 2020-10-27 | Oppo广东移动通信有限公司 | Data transmission method and related device |
| CN110139319A (en) * | 2019-05-25 | 2019-08-16 | 西南电子技术研究所（中国电子科技集团公司第十研究所） | High dynamic time-delay network propagation delay time minimizes method for routing |
| RU2749444C1 (en) * | 2020-11-17 | 2021-06-10 | Юрий Иванович Стародубцев | Method for modeling virtual communication network on remaining resources of physical network |
| CN113840257A (en) * | 2021-11-25 | 2021-12-24 | 中国电子科技集团公司第二十八研究所 | Multi-unmanned aerial vehicle communication relay method in urban environment |
Non-Patent Citations (1)
| Title |
|---|
| 柳静: "基于Dijkstra算法的测距最短路径选取方法", 《电脑知识与技术》 * |
Cited By (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN117880244A (en) * | 2024-03-13 | 2024-04-12 | 中国电子科技集团公司第二十八研究所 | Edge communication optimization method and system suitable for high-mobility environment |
| CN117880244B (en) * | 2024-03-13 | 2024-05-14 | 中国电子科技集团公司第二十八研究所 | Edge communication optimization method and system suitable for high-mobility environment |
| CN117955979A (en) * | 2024-03-27 | 2024-04-30 | 中国电子科技集团公司第五十四研究所 | Cloud network fusion edge information service method based on mobile communication node |
Also Published As
| Publication number | Publication date |
|---|---|
| CN115361333B (en) | 2023-03-24 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN115361333B (en) | Network cloud fusion information transmission method based on QoS edge self-adaption | |
| CN113079218B (en) | Service-oriented power network system, working method and storage medium | |
| 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 | |
| US9143456B2 (en) | Transmission priority paths in mesh networks | |
| CN110177054B (en) | Port queue scheduling method, device, network controller and storage medium | |
| CN109548052B (en) | Data transmission method and device, electronic equipment and readable storage medium | |
| CN109614215A (en) | Stream scheduling method, device, equipment and medium based on deeply study | |
| CN109088829A (en) | A kind of data dispatching method, device, storage medium and equipment | |
| CN101123576A (en) | A mobile self-organized network path selection method based on bandwidth restraint and minimum load | |
| CN109699089A (en) | A kind of channel access method and device | |
| CN103916329A (en) | Named data network transmission control method and system | |
| CN113300861B (en) | Network slice configuration method, device and storage medium | |
| CN100466593C (en) | Method of implementing integrated queue scheduling for supporting multi service | |
| CN108667746A (en) | A method of it is delayed in tolerant network in deep space and realizes service priority | |
| CN106464670A (en) | Network entity and service policy management method | |
| CN111740922B (en) | Data transmission method, device, electronic equipment and medium | |
| CN108696455A (en) | Method and device for processing service flow | |
| CN115175265A (en) | Transmission path determination method and device, computer equipment and storage medium | |
| Zhuang et al. | Adaptive and robust network routing based on deep reinforcement learning with lyapunov optimization | |
| CN117579543B (en) | Data stream segmentation method, device, equipment and computer readable storage medium | |
| CN113765805B (en) | Calling-based communication method, device, storage medium and equipment | |
| Tao et al. | Congestion aware routing algorithm for delay-disruption tolerance networks | |
| CN107509216B (en) | Wireless network scheduling method and device |
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 |