CN112511433A - Traffic transmission method, server and storage medium - Google Patents
Traffic transmission method, server and storage medium Download PDFInfo
- Publication number
- CN112511433A CN112511433A CN202011331050.XA CN202011331050A CN112511433A CN 112511433 A CN112511433 A CN 112511433A CN 202011331050 A CN202011331050 A CN 202011331050A CN 112511433 A CN112511433 A CN 112511433A
- Authority
- CN
- China
- Prior art keywords
- node
- next hop
- hop information
- end node
- sending
- 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.)
- Pending
Links
- 238000000034 method Methods 0.000 title claims abstract description 53
- 230000005540 biological transmission Effects 0.000 title claims abstract description 44
- 238000004590 computer program Methods 0.000 claims description 4
- 239000000126 substance Substances 0.000 claims 1
- 230000006870 function Effects 0.000 description 7
- 238000001514 detection method Methods 0.000 description 5
- 238000004364 calculation method Methods 0.000 description 2
- 238000004891 communication Methods 0.000 description 2
- 238000013461 design Methods 0.000 description 2
- 238000010586 diagram Methods 0.000 description 2
- 238000012986 modification Methods 0.000 description 2
- 230000004048 modification Effects 0.000 description 2
- 230000002093 peripheral effect Effects 0.000 description 2
- 238000012545 processing Methods 0.000 description 2
- 230000003287 optical effect Effects 0.000 description 1
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/38—Flow based 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/74—Address processing for routing
Abstract
The embodiment of the invention relates to the technical field of networks, and discloses a traffic transmission method, a server and a storage medium. In the invention, a call request which is sent by a sending end node and used for communicating with a receiving end node is received, and a second internet protocol address of the receiving end node is inquired; wherein, the call request includes the first internet protocol address of the sending end node; determining each node for transmitting traffic between the sender node and the receiver node according to the first internet protocol address and the second internet protocol address; and constructing next hop information of each node according to the information of each node, and sending each next hop information to each corresponding node for each node to transmit the flow between the sending end node and the receiving end node according to the next hop information, so that when the flow is transmitted between the sending end node and the receiving end node, the flow can be transmitted only by calling each node, and the flow is not required to pass through a media service platform to realize the decentralized of the flow.
Description
Technical Field
The embodiment of the invention relates to the technical field of networks, in particular to a traffic transmission method, a server and a storage medium.
Background
For traditional media communication, when audio or video call is carried out, the transmission of media flow among users is realized by a centralized media service platform; however, since some users are far away from the media service platform, long-distance transmission increases communication delay and packet loss risk, which affects the conversation experience of these users. In order to improve user experience, manufacturers can construct a dedicated bandwidth line through a software-defined wide area network, and schedule media traffic needing long-distance transmission onto the dedicated bandwidth line to ensure the call quality between a dialing party and a answering party. The inventor finds that at least the following problems exist in the prior art: in the process of transmitting through the dedicated bandwidth line, the media traffic still needs to pass through the media service platform, and the media service platform bears a larger media traffic pressure.
Disclosure of Invention
An object of the embodiments of the present invention is to provide a traffic transmission method, so that when traffic is transmitted, decentralized traffic can be implemented.
In order to solve the above technical problem, an embodiment of the present invention provides a traffic transmission method, including: receiving a call request which is sent by a sending end node and used for communicating with a receiving end node, and inquiring a second internet protocol address of the receiving end node; wherein the call request includes a first internet protocol address of the sender node; determining each intermediate node for transmitting traffic between the sender node and the receiver node according to the first internet protocol address and the second internet protocol address; constructing next hop information of each node according to the information of each node, and sending each next hop information to each corresponding node, so that each node can transmit the flow between the sending end node and the receiving end node according to the next hop information corresponding to each node; wherein the nodes comprise the sender node, the receiver node and the intermediate nodes.
The embodiment of the invention also provides a flow transmission method, which comprises the following steps: sending a call request for carrying out a call with a receiving end node to a dispatching service system, wherein the call request comprises a first internet protocol address of a sending end node, the second internet protocol address of the receiving end node is inquired by the dispatching service system, each intermediate node used for transmitting the flow between the sending end node and the receiving end node is determined according to the first internet protocol address and the second internet protocol address, and next hop information of each node is constructed according to the information of each node; wherein said nodes comprise said sender node, said receiver node and said intermediate nodes; receiving next hop information corresponding to the sending end node sent by the scheduling service system; and transmitting the flow between the sender node and the receiver node according to the next hop information corresponding to the sender node.
The embodiment of the invention also provides a flow transmission method, which comprises the following steps: receiving next hop information corresponding to a receiving end node sent by a scheduling service system; and transmitting the flow between the sending end node and the receiving end node according to the next hop information corresponding to the receiving end node.
The embodiment of the invention also provides a flow transmission method, which comprises the following steps: receiving next hop information corresponding to an intermediate node sent by a scheduling service system; and transmitting the flow between the sending end node and the receiving end node according to the next hop information corresponding to the intermediate node.
Compared with the prior art, the embodiment of the invention receives the call request which is sent by the sending end node and used for communicating with the receiving end node, and inquires the second internet protocol address of the receiving end node; wherein, the call request includes the first internet protocol address of the sending end node; determining each node for transmitting traffic between the sender node and the receiver node according to the first internet protocol address and the second internet protocol address; each node comprises a transmitting end node, a receiving end node and at least one intermediate node; and constructing next hop information of each node according to the information of each node, and sending each next hop information to each corresponding node for each node to transmit the flow between the sending end node and the receiving end node according to the next hop information, so that when the flow is transmitted between the sending end node and the receiving end node, the flow can be transmitted only by calling each node, and the flow is not required to pass through a media service platform to realize the decentralized of the flow.
Additionally, the determining each intermediate node for transmitting traffic between the sender node and the receiver node according to the first internet protocol address and the second internet protocol address comprises: judging whether the sender node and the receiver node are located in the same region or not according to the first internet protocol address and the second internet protocol address; if the nodes are located in the same region, inquiring edge nodes of the region, and using the edge nodes as intermediate nodes for transmitting the flow between the sending end nodes and the receiving end nodes; if the nodes are located in different regions, inquiring a first edge node corresponding to the sending end node and a second edge node corresponding to the receiving end node, acquiring available paths passing through the first edge node and the second edge node, selecting one path from the available paths as a target path, and determining each intermediate node for transmitting the flow between the sending end node and the receiving end node according to the target path. Since the sender node and the receiver node may be located in the same region or in different regions, the intermediate nodes for transmitting traffic between the sender node and the receiver node are determined in different manners for different situations.
In addition, the selecting one of the available paths as a target path includes: and selecting one path from the available paths as a target path according to the network state information of the nodes in the available paths. When the target path is determined, the network state information of the nodes in the path is considered, so that the determined target path is a better path, and the packet loss rate in the transmission process can be reduced when the flow transmission is realized through each intermediate node.
Additionally, said determining whether said sender node and said receiver node are located in the same geographic area based on said first internet protocol address and said second internet protocol address comprises: determining a first physical address of the sender node according to the first internet protocol address and a second physical address of the receiver node according to the second internet protocol address; and determining whether the sender node and the receiver node are located in the same region according to the first physical address and the second physical address. Whether the sending end node and the receiving end node are located in the same region can be more accurately determined according to the physical address.
In addition, the constructing next hop information of each node according to the information of each node and sending each next hop information to each corresponding node includes: determining each next hop information corresponding to each node according to the information of each node; constructing each next hop information of each intermediate node according to a preset private protocol, and sending each next hop information of each intermediate node to each corresponding intermediate node; constructing next hop information corresponding to the sending end node according to a protocol describing a session, and sending the next hop information corresponding to the sending end node; and constructing next hop information corresponding to the receiving end node according to a protocol describing the session, and sending the next hop information corresponding to the receiving end node. Because different nodes correspond to different protocols and the fields specified by the different protocols are different, the next hop information can be successfully constructed according to the different protocols by the method.
In addition, the constructing each next hop information of each intermediate node according to a preset private protocol, and sending each next hop information of each intermediate node to each corresponding intermediate node includes: constructing next hop information of each intermediate node according to a private protocol; encrypting the next hop information of each intermediate node; and sending the encrypted next hop information of each intermediate node to the corresponding intermediate node. By encrypting the next hop information of each intermediate node, the security of the next hop information of each intermediate node can be improved.
In addition, after the constructing next hop information of each node according to the information of each node and transmitting each next hop information to each corresponding node, the method further includes: and receiving the acknowledgement message returned by the sending end node and/or receiving the acknowledgement message returned by the receiving end node. In this way, it can be further confirmed that the sender node and/or the receiver node has received the next hop information.
Drawings
One or more embodiments are illustrated by way of example in the accompanying drawings, which correspond to the figures in which like reference numerals refer to similar elements and which are not to scale unless otherwise specified.
Fig. 1 is a flowchart of a traffic transmission method according to a first embodiment of the present invention;
FIG. 2 is a flow chart of a specific implementation of step 102 in a first embodiment of the invention;
FIG. 3 is a flow chart showing a specific implementation of step 103 according to a first embodiment of the present invention;
fig. 4 is a flowchart of a traffic transmission method according to a second embodiment of the present invention;
fig. 5 is a flowchart of a traffic transmission method according to a third embodiment of the present invention;
fig. 6 is a flowchart of a traffic transmission method according to a fourth embodiment of the present invention;
fig. 7 is a schematic configuration diagram of a server in a fifth embodiment according to the present invention.
Detailed Description
In order to make the objects, technical solutions and advantages of the embodiments of the present invention more apparent, the embodiments of the present invention will be described in detail with reference to the accompanying drawings. However, it will be appreciated by those of ordinary skill in the art that in various embodiments of the invention, numerous technical details are set forth in order to provide a better understanding of the present application. However, the technical solution claimed in the present application can be implemented without these technical details and various changes and modifications based on the following embodiments. The following embodiments are divided for convenience of description, and should not constitute any limitation to the specific implementation manner of the present invention, and the embodiments may be mutually incorporated and referred to without contradiction.
The first embodiment of the invention relates to a flow transmission method, which is applied to a scheduling service system. The specific process is shown in fig. 1, and comprises the following steps:
Specifically, the internet protocol address refers to an IP (internet protocol) address, the sending end node sends a call request for making a call with the receiving end node to the scheduling service system, the call request includes a first IP address of the sending end node, and the scheduling service system queries a second IP address of the receiving end node according to a locally stored correspondence between the terminal node and the IP address after receiving the call request.
Specifically, the intermediate node is a point-of-presence (pop) node, and the edge pop node is a pop node closest to the end node. Generally, terminal nodes located in the same area share one edge pop node, so that after acquiring a first IP address and a second IP address, a scheduling service system determines an area corresponding to the IP address according to the IP address, and then determines an edge pop node of the area corresponding to the IP address according to a correspondence between the area and the edge pop node, thereby determining each intermediate node for transmitting traffic between a sender node and a receiver node.
In one example, a flow diagram for determining intermediate nodes for transmitting traffic between a sender node and a receiver node based on a first internet protocol address and a second internet protocol address is shown in fig. 2 and includes:
Specifically, if the terminal nodes located in the same province share one edge pop node, the terminal nodes located in the same region are located in the same province; if the terminal nodes located in the same city share one edge pop node, the terminal nodes located in the same area are located in the same city, and the like, the same area may be predefined according to actual needs, and this embodiment is not particularly limited. After the scheduling service system acquires the first IP address and the second IP address, the region where the first IP address is located and the region where the second IP address is located are determined according to the corresponding relation between the IP addresses and the regions, so that whether the first IP address and the second IP address are located in the same region can be judged.
In one example, determining whether the sender node and the receiver node are located in the same region based on the first internet protocol address and the second internet protocol address comprises: determining a first physical address of the sender node based on the first internet protocol address and a second physical address of the receiver node based on the second internet protocol address; and determining whether the sending end node and the receiving end node are located in the same region according to the first physical address and the second physical address. Specifically, the scheduling service system queries a corresponding relationship between an internet protocol address and a physical address according to the address detection service function, determines a first physical address of a sender node according to a first IP address, determines a second physical address of a receiver node according to a second IP address, and determines a region where the first physical address is located and a region where the second physical address is located according to a corresponding relationship between the physical address and the region, so that whether the first physical address and the second physical address are located in the same region can be determined. By such a method, whether the sending end node and the receiving end node are located in the same region can be more accurately determined according to the physical address.
In step 1022, the edge nodes of the region are queried as intermediate nodes for transmitting traffic between the sender node and the receiver node.
Specifically, if it is determined that the sending end node and the receiving end node are located in the same region, it is determined that the sending end node and the receiving end node share one pop node, the edge pop node of the region is queried according to the correspondence between the region and the edge pop node, and the edge pop node is used as an intermediate node for transmitting traffic between the sending end node and the receiving end node.
Specifically, if the sending end node and the receiving end node are judged to be located in different regions, a first edge pop node corresponding to the region where the sending end node is located and a second edge pop node corresponding to the region where the receiving end node is located are inquired according to the corresponding relation between the regions and the edge pop nodes; and acquiring available paths passing through the first pop node and the second pop node according to different pre-stored paths, wherein if a plurality of available paths exist, one path needs to be selected from the available paths through a path calculation service function to serve as a target path, pop nodes except a sending end node and a receiving end node in the target path are determined, and the determined pop nodes are intermediate nodes for transmitting traffic between the sending end node and the receiving end node.
In one example, selecting a path from the available paths as a target path includes: and selecting one path from the available paths as a target path according to the network state information of the nodes in the available paths.
Specifically, each pop node may detect network state information such as a delay rate and a packet loss rate through a Control Message Protocol (ICMP) by using its own network detection service function, and send a detection result to the scheduling service system, and the scheduling service system may process the received detection result in real time or according to a preset period through the network detection service function to obtain current network state information of each node, and dynamically update the stored network state information of each node, for example: mean value processing can be carried out to obtain the current network state information of each node; after the scheduling service system acquires the available paths, the current network state information of the nodes in the available paths is inquired, the shortest paths are calculated through the path calculation service function, and the calculated shortest paths are selected from the available paths to serve as target paths. By the method, the network state information of the nodes in the path is considered when the target path is determined, so that the determined target path is a better path, and the packet loss rate in the transmission process can be reduced when the traffic is transmitted through each node.
103, constructing next hop information of each node according to the information of each node, and sending each next hop information to each corresponding node, so that each node can transmit the flow between a sending end node and a receiving end node according to the next hop information corresponding to each node; wherein each node comprises a sender node, a receiver node and each intermediate node.
Specifically, the next hop information includes, but is not limited to, information such as the number of channels, IP address, port number, etc. of the next node, where the port numbers include left port number and right port number, and include port numbers for transmitting audio traffic and port numbers for transmitting video traffic. The scheduling service system constructs the next hop information of each node according to the information of each node and sends the next hop information to each corresponding node, and each node analyzes the next hop information when receiving the next hop information to know the specific content, so that each node can transmit the flow to the corresponding next node according to the next hop information, and the flow between the sending end node and the receiving end node can be completed. For example: b, C for transmitting the flow between the transmitting end node and the receiving end node, A for the transmitting end node, D for the receiving end node, the next hop information of A is the relevant information of B, the next hop information of B is the relevant information of A and C, the next hop information of C is the relevant information of B and D, the next hop information of D is the relevant information of C, if the transmitting end node transmits the flow to the receiving end node, A transmits the flow to B according to the next hop information, B transmits the flow to C according to the next hop information, C transmits the flow to D according to the next hop information, thereby completing the transmission of the flow from the transmitting end node to the receiving end node, if the transmitting end node transmits the flow to the receiving end node, D transmits the flow to C according to the next hop information, C transmits the flow to B according to the next hop information, and B transmits the flow to A according to the next hop information, thereby completing the flow transmission from the receiving end node to the transmitting end node.
In one example, a specific flowchart of constructing next hop information of each node according to information of each node and sending each next hop information to corresponding each node is shown in fig. 3, and includes:
and step 1031, determining each next hop information corresponding to each node according to the information of each node.
And 1032, constructing each next hop information of each intermediate node according to a preset private protocol, and sending each next hop information of each intermediate node to each corresponding intermediate node.
And 1033, constructing next hop information corresponding to the sending end node according to the protocol describing the session, and sending the next hop information corresponding to the sending end node.
Specifically, the protocol between the scheduling service system and each node is a preset private protocol, the protocol between the scheduling service system and the sender node and the receiver node is a protocol describing a session, that is, different nodes correspond to different protocols, and fields specified by different protocols are different, so that it is necessary to construct next hop information according to the protocol and send the constructed next hop information to the corresponding node. There is no order restriction between step 1032, step 1033, and step 1034.
In one example, constructing each next hop information of each intermediate node according to a preset private protocol, and sending each next hop information of each intermediate node to each corresponding intermediate node includes: constructing next hop information of each intermediate node according to a private protocol; encrypting next hop information of each intermediate node; and sending the encrypted next hop information of each intermediate node to the corresponding intermediate node. Specifically, the dispatch service system may encrypt each next hop information of each intermediate node according to an Advanced Encryption Standard (AES), and send each encrypted next hop information of each intermediate node to each corresponding intermediate node. By encrypting the next hop information of each intermediate node, the security of the next hop information of each intermediate node can be improved.
In one example, after each intermediate node receives corresponding next hop information, the intermediate node constructs a virtual channel according to the next hop information, when traffic is transmitted between the sender node and the receiver node, the sender node transmits the traffic to the receiver node through the virtual channel, and the receiver node transmits the traffic to the sender node through the virtual channel. By the method, when the traffic is transmitted, the traffic transmission can be finished directly according to the pre-constructed virtual channel without inquiring the next hop information, and the traffic transmission time is shortened.
In one example, after constructing next hop information of each node according to information of each node and sending each next hop information to corresponding nodes, the method further includes: and receiving the acknowledgement message returned by the sending end node and/or receiving the acknowledgement message returned by the receiving end node. Specifically, after receiving the next hop information corresponding to the sending end node, the sending end node returns an acknowledgement message (ACK) to the scheduling service system, and/or after receiving the corresponding next hop information sent by the receiving end node, the receiving end node returns an ACK message to the scheduling service system. Thereafter, each node can transmit traffic to a corresponding next node according to the next hop information, and thus, the traffic between the sender node and the receiver node can be completed.
In the embodiment, a call request which is sent by a sending end node and used for communicating with a receiving end node is received, and a second internet protocol address of the receiving end node is inquired; wherein, the call request includes the first internet protocol address of the sending end node; determining each node for transmitting traffic between the sender node and the receiver node according to the first internet protocol address and the second internet protocol address; each node comprises a transmitting end node, a receiving end node and at least one intermediate node; and constructing next hop information of each node according to the information of each node, and sending each next hop information to each corresponding node for each node to transmit the flow between the sending end node and the receiving end node according to the next hop information, so that when the flow is transmitted between the sending end node and the receiving end node, the flow can be transmitted only by calling each node, and the flow is not required to pass through a media service platform to realize the decentralized of the flow.
A second embodiment of the present invention relates to a traffic transmission method applied to a sender node. The specific flow chart is shown in fig. 4, and includes:
and step 203, transmitting the flow between the sender node and the receiver node according to the next hop information corresponding to the sender node.
The third embodiment of the present invention relates to a traffic transmission method applied to a receiver node. The specific flow chart is shown in fig. 5, and includes:
And step 302, transmitting the flow between the sending end node and the receiving end node according to the next hop information corresponding to the receiving end node.
A fourth embodiment of the present invention relates to a traffic transmission method applied to an intermediate node. The specific flow chart is shown in fig. 6, and includes:
And step 402, transmitting the flow between the sending end node and the receiving end node according to the next hop information corresponding to the intermediate node.
In one example, transmitting traffic between a sender node and a receiver node according to next hop information corresponding to an intermediate node comprises: constructing a virtual channel according to the next hop information corresponding to the intermediate node; the virtual channel is also constructed by other intermediate nodes according to the next hop information corresponding to the other intermediate nodes; and transmitting the traffic between the sending end node and the receiving end node according to the virtual channel.
The steps of the above methods are divided for clarity, and the implementation may be combined into one step or split some steps, and the steps are divided into multiple steps, so long as the same logical relationship is included, which are all within the protection scope of the present patent; it is within the scope of the patent to add insignificant modifications to the algorithms or processes or to introduce insignificant design changes to the core design without changing the algorithms or processes.
A fifth embodiment of the invention is directed to a server, as shown in fig. 7, comprising at least one processor 502; and a memory 501 communicatively coupled to the at least one processor 502; the memory 501 stores instructions executable by the at least one processor 502, where the instructions are executed by the at least one processor to enable the at least one processor to perform embodiments of the traffic transmission method described above.
Where the memory and processor are connected by a bus, the bus may comprise any number of interconnected buses and bridges, the buses connecting together one or more of the various circuits of the processor and the memory. The bus may also connect various other circuits such as peripherals, voltage regulators, power management circuits, and the like, which are well known in the art, and therefore, will not be described any further herein. A bus interface provides an interface between the bus and the transceiver. The transceiver may be one element or a plurality of elements, such as a plurality of receivers and transmitters, providing a means for communicating with various other apparatus over a transmission medium. The data processed by the processor is transmitted over a wireless medium via an antenna, which further receives the data and transmits the data to the processor.
The processor is responsible for managing the bus and general processing and may also provide various functions including timing, peripheral interfaces, voltage regulation, power management, and other control functions. And the memory may be used to store data used by the processor in performing operations.
A sixth embodiment of the present invention relates to a computer-readable storage medium storing a computer program. The computer program realizes the above-described method embodiments when executed by a processor.
That is, as can be understood by those skilled in the art, all or part of the steps in the method for implementing the embodiments described above may be implemented by a program instructing related hardware, where the program is stored in a storage medium and includes several instructions to enable a device (which may be a single chip, a chip, or the like) or a processor (processor) to execute all or part of the steps of the method described in the embodiments of the present application. And the aforementioned storage medium includes: a U-disk, a removable hard disk, a Read-Only Memory (ROM), a Random Access Memory (RAM), a magnetic disk or an optical disk, and other various media capable of storing program codes.
It will be understood by those of ordinary skill in the art that the foregoing embodiments are specific embodiments for practicing the invention, and that various changes in form and details may be made therein without departing from the spirit and scope of the invention in practice.
Claims (13)
1. A method for transmitting traffic, comprising:
receiving a call request which is sent by a sending end node and used for communicating with a receiving end node, and inquiring a second internet protocol address of the receiving end node; wherein the call request includes a first internet protocol address of the sender node;
determining each intermediate node for transmitting traffic between the sender node and the receiver node according to the first internet protocol address and the second internet protocol address;
constructing next hop information of each node according to the information of each node, and sending each next hop information to each corresponding node, so that each node can transmit the flow between the sending end node and the receiving end node according to the next hop information corresponding to each node; wherein the nodes comprise the sender node, the receiver node and the intermediate nodes.
2. The traffic transmission method according to claim 1, wherein the determining each intermediate node for transmitting the traffic between the sender node and the receiver node according to the first internet protocol address and the second internet protocol address comprises:
judging whether the sender node and the receiver node are located in the same region or not according to the first internet protocol address and the second internet protocol address;
if the nodes are located in the same region, inquiring edge nodes of the region, and using the edge nodes as intermediate nodes for transmitting the flow between the sending end nodes and the receiving end nodes;
if the nodes are located in different regions, inquiring a first edge node corresponding to the sending end node and a second edge node corresponding to the receiving end node, acquiring available paths passing through the first edge node and the second edge node, selecting one path from the available paths as a target path, and determining each intermediate node for transmitting the flow between the sending end node and the receiving end node according to the target path.
3. The traffic transmission method according to claim 2, wherein the selecting one of the available paths as a target path comprises:
and selecting one path from the available paths as a target path according to the network state information of the nodes in the available paths.
4. The traffic transmission method according to claim 2, wherein said determining whether the sender node and the receiver node are located in the same region according to the first internet protocol address and the second internet protocol address comprises:
determining a first physical address of the sender node according to the first internet protocol address and a second physical address of the receiver node according to the second internet protocol address;
and determining whether the sender node and the receiver node are located in the same region according to the first physical address and the second physical address.
5. The traffic transmission method according to claim 1, wherein the constructing next hop information of each node according to the information of each node and sending each next hop information to the corresponding node comprises:
determining each next hop information corresponding to each node according to the information of each node;
constructing each next hop information of each intermediate node according to a preset private protocol, and sending each next hop information of each intermediate node to each corresponding intermediate node;
constructing next hop information corresponding to the sending end node according to a protocol describing a session, and sending the next hop information corresponding to the sending end node;
and constructing next hop information corresponding to the receiving end node according to a protocol describing the session, and sending the next hop information corresponding to the receiving end node.
6. The traffic transmission method according to claim 5, wherein the constructing of the next hop information of each intermediate node according to a preset private protocol and the sending of the next hop information of each intermediate node to the corresponding intermediate node comprises:
constructing next hop information of each intermediate node according to a private protocol;
encrypting the next hop information of each intermediate node;
and sending the encrypted next hop information of each intermediate node to the corresponding intermediate node.
7. The traffic transmission method according to claim 1, wherein after the constructing next hop information of each node according to the information of each node and sending each next hop information to the corresponding node, the method further comprises:
and receiving the acknowledgement message returned by the sending end node and/or receiving the acknowledgement message returned by the receiving end node.
8. A method for transmitting traffic, comprising:
sending a call request for carrying out a call with a receiving end node to a dispatching service system, wherein the call request comprises a first internet protocol address of a sending end node, the second internet protocol address of the receiving end node is inquired by the dispatching service system, each intermediate node used for transmitting the flow between the sending end node and the receiving end node is determined according to the first internet protocol address and the second internet protocol address, and next hop information of each node is constructed according to the information of each node; wherein said nodes comprise said sender node, said receiver node and said intermediate nodes;
receiving next hop information corresponding to the sending end node sent by the scheduling service system;
and transmitting the flow between the sender node and the receiver node according to the next hop information corresponding to the sender node.
9. A method for transmitting traffic, comprising:
receiving next hop information corresponding to a receiving end node sent by a scheduling service system;
and transmitting the flow between the sending end node and the receiving end node according to the next hop information corresponding to the receiving end node.
10. A method for transmitting traffic, comprising:
receiving next hop information corresponding to an intermediate node sent by a scheduling service system;
and transmitting the flow between the sending end node and the receiving end node according to the next hop information corresponding to the intermediate node.
11. The traffic transmission method according to claim 10, wherein said transmitting the traffic between the sender node and the receiver node according to the next hop information corresponding to the intermediate node comprises:
constructing a virtual channel according to the next hop information corresponding to the intermediate node; the virtual channel is also constructed by other intermediate nodes according to next hop information corresponding to the other intermediate nodes;
and transmitting the traffic between the sender node and the receiver node according to the virtual channel.
12. A server, comprising:
at least one processor; and the number of the first and second groups,
a memory communicatively coupled to the at least one processor; wherein the content of the first and second substances,
the memory stores instructions executable by the at least one processor to enable the at least one processor to perform a traffic transmission method as claimed in any one of claims 1 to 7, the server being applied to a dispatch service system, or to perform a traffic transmission method as claimed in claim 8, the server being applied to a sender node, or to perform a traffic transmission method as claimed in claim 9, the server being applied to a receiver node, or to perform a traffic transmission method as claimed in any one of claims 10 to 11, the server being applied to an intermediate node.
13. A computer-readable storage medium, storing a computer program, wherein the computer program, when executed by a processor, implements the traffic transmission method of any one of claims 1 to 7, or implements the traffic transmission method of claim 8, or implements the traffic transmission method of claim 9, or implements the traffic transmission method of any one of claims 10 to 11.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202011331050.XA CN112511433A (en) | 2020-11-24 | 2020-11-24 | Traffic transmission method, server and storage medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202011331050.XA CN112511433A (en) | 2020-11-24 | 2020-11-24 | Traffic transmission method, server and storage medium |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN112511433A true CN112511433A (en) | 2021-03-16 |
Family
ID=74958283
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202011331050.XA Pending CN112511433A (en) | 2020-11-24 | 2020-11-24 | Traffic transmission method, server and storage medium |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN112511433A (en) |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2015183328A1 (en) * | 2014-05-30 | 2015-12-03 | Fastly Inc. | Communication continuation during content node failover |
| CN106452963A (en) * | 2016-10-18 | 2017-02-22 | 北京东土科技股份有限公司 | Network path sensing method and system |
| CN109428819A (en) * | 2017-08-28 | 2019-03-05 | 阿里巴巴集团控股有限公司 | Transmit method, networking component, equipment and the computer storage medium of data |
| CN109995659A (en) * | 2017-12-29 | 2019-07-09 | 阿里巴巴集团控股有限公司 | A kind of network communication method and device |
| CN110677343A (en) * | 2019-09-27 | 2020-01-10 | 中国联合网络通信集团有限公司 | Data transmission method and system, electronic equipment and storage medium |
-
2020
- 2020-11-24 CN CN202011331050.XA patent/CN112511433A/en active Pending
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2015183328A1 (en) * | 2014-05-30 | 2015-12-03 | Fastly Inc. | Communication continuation during content node failover |
| CN106452963A (en) * | 2016-10-18 | 2017-02-22 | 北京东土科技股份有限公司 | Network path sensing method and system |
| CN109428819A (en) * | 2017-08-28 | 2019-03-05 | 阿里巴巴集团控股有限公司 | Transmit method, networking component, equipment and the computer storage medium of data |
| CN109995659A (en) * | 2017-12-29 | 2019-07-09 | 阿里巴巴集团控股有限公司 | A kind of network communication method and device |
| CN110677343A (en) * | 2019-09-27 | 2020-01-10 | 中国联合网络通信集团有限公司 | Data transmission method and system, electronic equipment and storage medium |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US10637794B2 (en) | Resource subscription method, resource subscription apparatus, and resource subscription system | |
| JP2020511083A (en) | Service quality control method and device, SMF, UPF, UE, PCF and AN | |
| US20030211860A1 (en) | System and method for connecting multicast or broadcast control information to mobile stations | |
| JP2010081603A (en) | Method and node for implementing virtual network | |
| CN113596191A (en) | Data processing method, network element equipment and readable storage medium | |
| US11153207B2 (en) | Data link layer-based communication method, device, and system | |
| CN110808948B (en) | Remote procedure calling method, device and system | |
| CN110708694A (en) | Method, system, storage medium and electronic device for realizing simultaneous online public and private networks | |
| US11075993B2 (en) | Data transmission between an application server and at least one internet-of-things communication device using a mobile communication network | |
| KR20110039564A (en) | Communication control system, communication system and communication control method | |
| US20210007161A1 (en) | Method for Establishing Tunnel Between Local Gateways, and Gateway | |
| CN106027599B (en) | Data transmission channel establishing method, system and server | |
| WO2017139921A1 (en) | Communication method, apparatus and system based on stream control transmission protocol (sctp) | |
| US9391890B2 (en) | Network-initiated method and system for establishing data communication using IP with a wireless terminal | |
| WO2016119269A1 (en) | Service data stream data packet processing method and device | |
| US8099075B2 (en) | Method and apparatus for session establishment for emergency VoIP calls | |
| CN112511433A (en) | Traffic transmission method, server and storage medium | |
| CN105052239B (en) | Policy control method, related device and system | |
| US11503164B2 (en) | Media interaction method in DECT network cluster | |
| CN105992166B (en) | Wireless communication device and method for selecting optimal access device | |
| CN109495918B (en) | Data transmission method and device | |
| CN113543238B (en) | Data transmission method and base station | |
| CN108650179B (en) | Method for configuring forwarding table, forwarding device and computer readable storage medium | |
| CN113542343A (en) | Apparatus and method for G3-PLC bootstrapping in hybrid networks | |
| US20170311135A1 (en) | Control Signaling Transmission Method in MCPTT Architecture and Related 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 | ||
| RJ01 | Rejection of invention patent application after publication | ||
| RJ01 | Rejection of invention patent application after publication |
Application publication date: 20210316 |