CN116208544A - Message sending method, system, device, equipment and storage medium - Google Patents

Abstract

The disclosure provides a method, a system, a device, equipment and a storage medium for sending a message, which are used for obtaining source node information and end node information of the message, and then determining all message sending paths between a source node and an end node according to the source node information and the end node information. And then giving a message sending path to determine a merging node and a splitting node, and configuring a corresponding BSID for the message based on the identifiers of the merging node and the splitting node. Therefore, the message can determine the path through which the message passes based on the BSID, and the efficiency of message transmission is improved.

Description

Message sending method, system, device, equipment and storage medium

Technical Field

The present disclosure relates to the field of wireless communications, and in particular, to a method, a system, an apparatus, a device, and a storage medium for sending a message.

Background

IPv 6-based segment routing (Segment Routing IPv, SRv 6), which is a segment-by-segment routing forwarding as the name implies, is designed based on the source routing concept, SRv6 is implemented by inserting a routing extension header (Segment Routing Header, SRH) into an IPv6 packet, pushing an explicit IPv6 address stack into the SRH, and continuously performing operations of updating the destination address and offset address stack by the intermediate node, similar to the forwarding process of MPLS.

In the transmission process of SRv, since each node for transmission needs to be known, BSID information is configured based on each node information, which results in complicated message transmission based on SRv.

Disclosure of Invention

The disclosure provides a method, a system, a device, equipment and a storage medium for sending a message, which at least overcome the problem that the current message transmission based on SRv6 is complicated to a certain extent.

Other features and advantages of the present disclosure will be apparent from the following detailed description, or may be learned in part by the practice of the disclosure.

According to one aspect of the present disclosure, there is provided a method for sending a message, including:

acquiring source node information and end node information sent by a message;

determining all message transmission paths between the source node and the end node according to the source node information and the end node information;

determining a merging node and split nodes based on the message sending paths, wherein the merging node is a node with the number of message sending paths of an entering node being larger than that of message sending paths of an exiting node, and the split nodes are nodes with the number of message sending paths of the entering node being smaller than that of message sending paths of the exiting node;

And configuring a corresponding base station identification code (BSID) for the message based on the identification of the merging node and the splitting node, so that the message is sent to the end node from the source node through the merging node and the splitting node based on the BSID.

In one embodiment of the present disclosure, the method further comprises:

acquiring traffic load information of a message sending path leaving the split node;

determining weight information of a message sending path leaving the split node based on traffic load information of the message sending path leaving the split node;

and sending the weight information to the split node so that the split node sends the message on a message sending path based on the weight information.

In one embodiment of the present disclosure, the method further comprises:

acquiring user-defined weight information of a message sending path leaving the split node;

and sending the weight information to the split node so that the split node sends the message on a message sending path based on the weight information.

In one embodiment of the present disclosure, determining all message transmission paths located before a source node and a destination node according to the source node and the destination node includes:

and determining all message sending paths positioned in front of the source node and the final node based on the traversal algorithm, the source node information and the final node information.

In one embodiment of the present disclosure, obtaining source node information and end node information sent by a message includes:

and obtaining source node information and end node information sent by the message through a worm algorithm.

According to another aspect of the present disclosure, there is provided a messaging system, including:

control equipment, a source node and a final node;

the control equipment is used for acquiring source node information sent by the source node and end node information sent by the end node, and determining all message sending paths between the source node and the end node according to the source node information and the end node information; determining a merging node and split nodes based on the message sending paths, wherein the merging node is a node with the number of message sending paths of an entering node being larger than that of message sending paths of an exiting node, and the split nodes are nodes with the number of message sending paths of the entering node being smaller than that of message sending paths of the exiting node;

configuring a corresponding base station identification code (BSID) for the message based on the identification of the merging node and the splitting node, so that the message is sent to a final node from a source node through the merging node and the splitting node based on the BSID;

the source node is used for sending source node information to the control equipment;

And the end node is used for sending end node information to the control equipment.

In one embodiment of the present disclosure, the messaging system further includes: splitting the node;

and the split node is used for receiving the weight information of the message transmission path sent by the control equipment, and the weight information is determined by the control equipment based on the traffic load information of the message transmission path leaving the split node.

According to still another aspect of the present disclosure, there is provided a message transmitting apparatus including:

the first acquisition module is used for acquiring source node information and end node information sent by the message;

the first determining module is used for determining all message sending paths between the source node and the end node according to the source node information and the end node information;

the second determining module is used for determining merging nodes and splitting nodes based on the message sending paths, wherein the merging nodes are nodes with the number of message sending paths of the entering nodes being larger than that of message sending paths of the leaving nodes, and the splitting nodes are nodes with the number of message sending paths of the entering nodes being smaller than that of the message sending paths of the leaving nodes;

and the configuration module is used for configuring a corresponding base station identification code (BSID) for the message based on the identifications of the merging node and the splitting node so that the message is sent to the end node from the source node through the merging node and the splitting node based on the BSID.

In one embodiment of the present disclosure, the apparatus further comprises:

the second acquisition module is used for acquiring traffic load information of a message sending path leaving the split node;

the third determining module is used for determining weight information of the message sending path leaving the split node based on traffic load information of the message sending path leaving the split node;

and the first sending module is used for sending the weight information to the split node so that the split node sends the message on the message sending path based on the weight information.

In one embodiment of the present disclosure, the apparatus further comprises:

the third acquisition module is used for acquiring the weight information of the user-defined message transmission path leaving the split node;

and the second sending module is used for sending the weight information to the split node so that the split node sends the message on the message sending path based on the weight information.

In one embodiment of the present disclosure, the first determining module includes:

and the determining unit is used for determining all message sending paths positioned before the source node and the final node based on the traversal algorithm, the source node information and the final node information.

In one embodiment of the present disclosure, a first acquisition module includes:

The obtaining unit is used for obtaining the source node information and the final node information sent by the message through a worm algorithm.

According to still another aspect of the present disclosure, there is provided an electronic apparatus including: a processor; and a memory for storing executable instructions of the processor; wherein the processor is configured to perform the above-described messaging method via execution of the executable instructions.

According to yet another aspect of the present disclosure, there is provided a computer readable storage medium having stored thereon a computer program which, when executed by a processor, implements the above-described messaging method.

According to the message sending method provided by the embodiment of the disclosure, the source node information and the end node information of the message sending are obtained, and then all message sending paths between the source node and the end node are determined according to the source node information and the end node information. And then giving a message sending path to determine a merging node and a splitting node, and configuring a corresponding BSID for the message based on the identifiers of the merging node and the splitting node. Therefore, the message can determine the path through which the message passes based on the BSID, the problem of complicated message transmission caused by the need of acquiring all node information on the message transmission path before the message is transmitted is avoided, and the efficiency of message transmission is improved.

It is to be understood that both the foregoing general description and the following detailed description are exemplary and explanatory only and are not restrictive of the disclosure.

Drawings

The accompanying drawings, which are incorporated in and constitute a part of this specification, illustrate embodiments consistent with the disclosure and together with the description, serve to explain the principles of the disclosure. It will be apparent to those of ordinary skill in the art that the drawings in the following description are merely examples of the disclosure and that other drawings may be derived from them without undue effort.

FIG. 1 illustrates a diagram of a messaging system architecture in an embodiment of the present disclosure;

FIG. 2 illustrates another messaging system architecture diagram in an embodiment of the present disclosure;

FIG. 3 is a flow chart of a method for sending messages in an embodiment of the disclosure;

FIG. 4 is a flowchart of another method for sending messages in an embodiment of the disclosure;

FIG. 5 is a schematic diagram of a message transmission in an embodiment of the disclosure;

FIG. 6 is a flowchart of another method for sending a message according to an embodiment of the disclosure;

FIG. 7 is a flowchart of another method for sending messages according to an embodiment of the present disclosure;

fig. 8 is a schematic diagram of a message sending device in an embodiment of the disclosure;

Fig. 9 shows a block diagram of an electronic device in an embodiment of the disclosure.

Detailed Description

Example embodiments will now be described more fully with reference to the accompanying drawings. However, the exemplary embodiments may be embodied in many forms and should not be construed as limited to the examples set forth herein; rather, these embodiments are provided so that this disclosure will be thorough and complete, and will fully convey the concept of the example embodiments to those skilled in the art. The described features, structures, or characteristics may be combined in any suitable manner in one or more embodiments.

Furthermore, the drawings are merely schematic illustrations of the present disclosure and are not necessarily drawn to scale. The same reference numerals in the drawings denote the same or similar parts, and thus a repetitive description thereof will be omitted. Some of the block diagrams shown in the figures are functional entities and do not necessarily correspond to physically or logically separate entities. These functional entities may be implemented in software or in one or more hardware modules or integrated circuits or in different networks and/or processor devices and/or microcontroller devices.

It should be understood that the various steps recited in the method embodiments of the present disclosure may be performed in a different order and/or performed in parallel. Furthermore, method embodiments may include additional steps and/or omit performing the illustrated steps. The scope of the present disclosure is not limited in this respect.

It should be noted that the terms "first," "second," and the like in this disclosure are merely used to distinguish between different devices, modules, or units and are not used to define an order or interdependence of functions performed by the devices, modules, or units.

It should be noted that references to "one", "a plurality" and "a plurality" in this disclosure are intended to be illustrative rather than limiting, and those of ordinary skill in the art will appreciate that "one or more" is intended to be understood as "one or more" unless the context clearly indicates otherwise.

In order to solve the above problems, embodiments of the present disclosure provide a method, a system, an apparatus, a device, and a storage medium for sending a message.

For ease of understanding, the embodiments of the present disclosure first describe a messaging system.

Fig. 1 shows a diagram of a messaging system architecture in an embodiment of the present disclosure.

As shown in fig. 1, the messaging system 10 may include:

Control device 102, source node 104, and end node 106;

the control device 102 is configured to obtain source node information sent by the source node 104 and end node information sent by the end node 106, and determine all message sending paths between the source node and the end node according to the source node information and the end node information; determining a merging node and a splitting node based on the message sending paths, wherein the merging node is a node with the number of message sending paths of an entering node being larger than that of message sending paths of an exiting node, the splitting node is a node with the number of message sending paths of the entering node being smaller than that of message sending paths of the exiting node, and a corresponding base station identification code (BSID) is configured for a message based on the identifiers of the merging node and the splitting node, so that the message is sent to a final node 106 from a source node 104 through the merging node and the splitting node based on the BSID;

a source node 104 for transmitting source node information to the control device 102;

end node 106 is configured to send end node information to control device 102.

It should be noted that the control device 102 may be a terminal device or a server.

In one embodiment, the terminal device may be a variety of electronic devices including, but not limited to, smartphones, tablets, laptop portable computers, desktop computers, wearable devices, augmented reality devices, virtual reality devices, and the like.

In one embodiment, the server may be a server providing various services, such as a background management server providing support for devices operated by users using terminal devices. The background management server may analyze and process the received data such as the request.

Optionally, the server may be an independent physical server, a server cluster or a distributed system formed by a plurality of physical servers, or a cloud server providing cloud services, cloud databases, cloud computing, cloud functions, cloud storage, network services, cloud communication, middleware services, domain name services, security services, CDNs (Content Delivery Network, content delivery networks), basic cloud computing services such as big data and artificial intelligence platforms, and the like. The terminal can be a smart phone, a tablet computer, a notebook computer, a desktop computer, a smart speaker, a smart watch, etc.

In one embodiment, the control device may perform data transmission with the source node and the end node through a wired network or a wireless network.

In one embodiment, the wireless network or wired network described above uses standard communication techniques and/or protocols. The network is typically the Internet, but may be any network including, but not limited to, a local area network (Local Area Network, LAN), metropolitan area network (Metropolitan Area Network, MAN), wide area network (Wide Area Network, WAN), mobile, wired or wireless network, private network, or any combination of virtual private networks. In some embodiments, data exchanged over a network is represented using techniques and/or formats including HyperText Mark-up Language (HTML), extensible markup Language (Extensible MarkupLanguage, XML), and the like. All or some of the links may also be encrypted using conventional encryption techniques such as secure sockets layer (Secure Socket Layer, SSL), transport layer security (Transport Layer Security, TLS), virtual private network (Virtual Private Network, VPN), internet protocol security (Internet ProtocolSecurity, IPsec), etc. In other embodiments, custom and/or dedicated data communication techniques may also be used in place of or in addition to the data communication techniques described above.

According to the message sending system provided by the embodiment of the disclosure, the source node information and the end node information of the message sending are obtained, and then all message sending paths between the source node and the end node are determined according to the source node information and the end node information. And then giving a message sending path to determine a merging node and a splitting node, and configuring a corresponding BSID for the message based on the identifiers of the merging node and the splitting node. Therefore, the message can determine the path through which the message passes based on the BSID, the problem of complicated message transmission caused by the need of acquiring all node information on the message transmission path before the message is transmitted is avoided, and the efficiency of message transmission is improved.

FIG. 2 illustrates an analysis system architecture diagram in an embodiment of the present disclosure.

As shown in fig. 2, the analysis system 20 may include:

splitting node 202;

the split node 202 is configured to receive weight information of a packet transmission path sent by the control device, where the weight information is determined by the control device based on traffic load information of the packet transmission path leaving the split node.

In one embodiment, split node 202 may comprise a network element capable of data transmission. Illustratively, classification node 202 may include a router, a signal forwarding device, or the like.

According to the message sending system provided by the embodiment of the disclosure, the source node information and the end node information of the message sending are obtained, and then all message sending paths between the source node and the end node are determined according to the source node information and the end node information. And then giving a message sending path to determine a merging node and a splitting node, and configuring a corresponding BSID for the message based on the identifiers of the merging node and the splitting node. Therefore, the message can determine the path through which the message passes based on the BSID, the problem that message transmission is complicated because all node information on the message transmission path needs to be acquired before the message is transmitted is avoided, the efficiency of message transmission is improved, and the balance of traffic load of the message transmission path can be avoided by configuring the corresponding weight for the message transmission path of the split node for transmitting the message, and the efficiency of message transmission is improved.

Fig. 3 shows a flowchart of a method for sending a message in an embodiment of the disclosure.

As shown in fig. 3, the method for sending a message may include:

s310, source node information and end node information sent by the message are obtained.

In one embodiment, the source node information includes a source node identification and the end node information includes an end node identification.

In one embodiment, information of all nodes may be acquired in advance, and then source node information and end node information may be determined based on the all node information.

In one embodiment, the source node information and the end node information of the message transmission may be determined based on a worm algorithm.

S320, determining all message sending paths between the source node and the end node according to the source node information and the end node information.

In one embodiment, the overall messaging path between the source node and the end node may be determined based on a traversal method.

For example, the determination of the path to cause a message to be sent from the source node to the end node may be made in different ways. And then counting different paths to obtain all message transmission paths between the source node and the end node.

S330, determining a merging node and a splitting node based on the message sending paths, wherein the merging node is a node with the number of message sending paths of the entering node being larger than that of message sending paths of the leaving node, and the splitting node is a node with the number of message sending paths of the entering node being smaller than that of message sending paths of the leaving node.

In one embodiment, a node may be determined to be a merge node or a split node based on a path into the node and a path out of the node.

In one embodiment, the path into the node and the path out of the node may be determined based on the direction of message transmission. Aiming at different message transmission directions, the same node can be a merging node or a splitting node.

S340, configuring a corresponding base station identification code BSID for the message based on the identification of the merging node and the splitting node, so that the message is sent to the end node from the source node through the merging node and the splitting node based on the BSID.

In one embodiment, after determining the merge node and the split node, the corresponding BSID code may be configured for the message based on the identity of the merge node and the split node.

In one embodiment, after configuring the corresponding BSID code for the message, the message may be routed to the merging node and the splitting node according to the identification of the merging node and the splitting node 5

Reaching the end node.

In one embodiment, the split node and the merge node may be assigned BSID codes, with the other nodes being assigned normal SID codes. Then determining the transmission paths of the split node and the merging node as one section

The transmission paths are then organized into Segment lists based on the segmented transmission paths. And then the Segment List is issued to the Segment 0 split node and the merging node. Then report based on Segment List

And (5) transmitting the text. According to the message sending method provided by the embodiment of the disclosure, the source node information and the end node information of the message sending are obtained, and then all message sending paths between the source node and the end node are determined according to the source node information and the end node information. Then give the message transmission path determination

The merge node and the split node, and then configure 5 the corresponding BSID for the message based on the identity of the merge node and the split node. This allows the message to determine the path that the message will traverse based on the BSID,

the problem that message transmission is complicated because all node information on a message transmission path needs to be acquired before the message is transmitted is avoided, and the efficiency of message transmission is improved.

Fig. 4 is a flowchart illustrating another method for sending a message in an embodiment of the disclosure.

As shown in fig. 4, the method for sending a message may include:

0S410, acquiring source node information and end node information sent by a message;

s420, determining the position of the source node and the end node according to the source node information and the end node information

All message transmission paths between the two;

s430, determining a merging node and a splitting node based on the message sending path, wherein the merging node

The point is 5 nodes with the number of message sending paths of the entering node being greater than the number of message sending paths of the leaving node, and the split node is used for sending messages with the number of message sending paths of the entering node being smaller than the number of message sending paths of the leaving node

Nodes of the number of paths;

s440, obtaining the traffic load information of the message sending path leaving the split node.

In one embodiment, the traffic load capability information and the traffic load information of different message transmission paths are different.

0S450, determining weight information of the message transmission path leaving the split node based on traffic load information of the message transmission path leaving the split node.

In one embodiment, all the packet transmission paths leaving the split node may be determined, and then the traffic load information of the packet transmission paths may be determined. And then determining the weight of each message sending path based on the sum of the traffic load information of each message sending path and the traffic load information of all the message sending paths.

S460, the weight information is sent to the split node, so that the split node sends the message on the message sending path based on the weight information.

Fig. 5 shows a message sending schematic diagram in an embodiment of the disclosure.

As shown in fig. 5, the message is sent from the source node PEI to the end node PE2 via multiple node transmissions. Then nodes P1, P3 are determined as split nodes, nodes P6, P8 are determined as merge nodes, and then different weights W1 and W2 of paths between P1 and P2 and paths between P1 and P3 are determined based on traffic load information of the paths. Similarly, the weight W21 of the path between P3 and P4 and the weight W22 of the path between P3 and P5 are determined. The BSID code may then be determined based on the split node and the merge node.

In one embodiment, different packets may be sent in different proportions by different packet sending paths based on different weights.

S470, configuring a corresponding base station identification code (BSID) for the message based on the identifications of the merging node and the splitting node, so that the message is sent to the end node from the source node through the merging node and the splitting node based on the BSID.

According to the message sending method provided by the embodiment of the disclosure, the source node information and the end node information of the message sending are obtained, and then all message sending paths between the source node and the end node are determined according to the source node information and the end node information. And then giving a message sending path to determine a merging node and a splitting node, and configuring a corresponding BSID for the message based on the identifiers of the merging node and the splitting node. Therefore, the message can determine the path through which the message passes based on the BSID, the problem of complicated message transmission caused by the need of acquiring all node information on the message transmission path before the message is transmitted is avoided, and the efficiency of message transmission is improved. Meanwhile, different weights are configured for different message sending paths based on traffic load information of different message sending paths leaving the split node, so that the message quantity transmitted by the different message sending paths is different, and the loads of the different message sending paths are balanced.

Fig. 6 is a flowchart illustrating another method for sending a message in an embodiment of the disclosure.

As shown in fig. 6, the method for sending a message may include:

s610, obtaining source node information and end node information sent by the message through a worm algorithm.

In one embodiment, in addition to obtaining the source node information and the end node information of the message transmission through the worm algorithm, the source node and the end node information of the message transmission can also be obtained based on user input.

S620, determining all message transmission paths between the source node and the end node according to the source node information and the end node information;

s630, determining a merging node and split nodes based on the message sending paths, wherein the merging node is a node with the number of message sending paths of an entering node being larger than that of message sending paths of an exiting node, and the split nodes are nodes with the number of message sending paths of the entering node being smaller than that of message sending paths of the exiting node;

and S640, configuring a corresponding base station identification code (BSID) for the message based on the identifications of the merging node and the splitting node, so that the message is sent to the end node from the source node through the merging node and the splitting node based on the BSID.

According to the message sending method provided by the embodiment of the disclosure, the source node information and the end node information of the message sending are obtained, and then all message sending paths between the source node and the end node are determined according to the source node information and the end node information. And then giving a message sending path to determine a merging node and a splitting node, and configuring a corresponding BSID for the message based on the identifiers of the merging node and the splitting node. Therefore, the message can determine the path through which the message passes based on the BSID, the problem of complicated message transmission caused by the need of acquiring all node information on the message transmission path before the message is transmitted is avoided, and the efficiency of message transmission is improved.

Fig. 7 is a flowchart illustrating yet another method for sending a message in an embodiment of the disclosure.

As shown in fig. 7, the method for sending a message may include:

s710, acquiring source node information and end node information sent by a message;

s720, determining all message transmission paths positioned in front of the source node and the final node based on a traversal algorithm, the source node information and the final node information;

s730, determining a merging node and a splitting node based on the message sending paths, wherein the merging node is a node with the number of message sending paths of an entering node being larger than that of message sending paths of an exiting node, and the splitting node is a node with the number of message sending paths of the entering node being smaller than that of message sending paths of the exiting node;

s740, configuring corresponding base station identification code for message based on the identification of merging node and splitting node

BSID so that the message is sent from the source node to the end node via the merge node and the split node based on BSID.

According to the message sending method provided by the embodiment of the disclosure, the source node 5 information and the end node information of the message sending are obtained, and then the position of the source node is determined according to the source node information and the end node information

All message transmission paths between the point and the end node. And then giving a message sending path to determine a merging node and a splitting node, and configuring a corresponding BSID for the message based on the identifiers of the merging node and the splitting node. Therefore, the message can determine the path of the message based on the BSID, and the message is prevented from passing through

The problem that message 0 is complicated to send because all node information on a message sending path needs to be obtained before sending the message is solved, and the efficiency of sending the message is improved.

Based on the same inventive concept, the embodiments of the present disclosure also provide a message sending device, as follows. Since the principle of solving the problem of the embodiment of the device is similar to that of the embodiment of the method, the implementation of the embodiment of the device can be referred to the implementation of the embodiment of the method, and the repetition is omitted.

Fig. 5 is a schematic diagram of a message sending device in an embodiment of the disclosure.

As shown in fig. 8, the message sending apparatus 800 may include:

a first obtaining module 810, configured to obtain source node information and end node information sent by a message;

a first determining module 820 for determining whether the node is located at the source according to the source node information and the end node information

All message transmission paths between the nodes and the end nodes;

0 a second determining module 830 for determining the merging node and the splitting node based on the message transmission path

The node is divided into nodes, wherein the number of message sending paths of the entering node is smaller than that of the leaving node;

A configuration module 840 for configuring the base station identifier BSID corresponding to 5 for the message based on the identifiers of the merging node and the splitting node, so that the message passes through the merging node and the splitting node based on the BSID

The node sends to the end node.

The message sending device provided by the embodiment of the disclosure obtains the source node information and the end node information sent by the message, and then determines that the message is positioned in the source node according to the source node information and the end node information

All message transmission paths between the point and the end node. And then giving a message sending path to determine a merging node 0 and a splitting node, and configuring a corresponding BSID for the message based on the identifiers of the merging node and the splitting node. Therefore, the message can determine the path through which the message passes based on the BSID, the problem of complicated message transmission caused by the need of acquiring all node information on the message transmission path before the message is transmitted is avoided, and the efficiency of message transmission is improved.

In one embodiment of the present disclosure, the apparatus further comprises:

the second acquisition module is used for acquiring traffic load information of a message sending path leaving the split node;

the third determining module is used for determining weight information of the message sending path leaving the split node based on traffic load information of the message sending path leaving the split node;

And the first sending module is used for sending the weight information to the split node so that the split node sends the message on the message sending path based on the weight information.

In one embodiment of the present disclosure, the apparatus further comprises:

the third acquisition module is used for acquiring the weight information of the user-defined message transmission path leaving the split node;

and the second sending module is used for sending the weight information to the split node so that the split node sends the message on the message sending path based on the weight information.

In one embodiment of the present disclosure, the first determining module includes:

and the determining unit is used for determining all message sending paths positioned before the source node and the final node based on the traversal algorithm, the source node information and the final node information.

In one embodiment of the present disclosure, a first acquisition module includes:

the obtaining unit is used for obtaining the source node information and the final node information sent by the message through a worm algorithm.

Those skilled in the art will appreciate that the various aspects of the present disclosure may be implemented as a system, method, or program product. Accordingly, various aspects of the disclosure may be embodied in the following forms, namely: an entirely hardware embodiment, an entirely software embodiment (including firmware, micro-code, etc.) or an embodiment combining hardware and software aspects may be referred to herein as a "circuit," module "or" system.

An electronic device 900 according to such an embodiment of the present disclosure is described below with reference to fig. 9. The electronic device 900 shown in fig. 9 is merely an example and should not be construed to limit the functionality and scope of use of embodiments of the present disclosure in any way.

As shown in fig. 9, the electronic device 900 is embodied in the form of a general purpose computing device. Components of electronic device 900 may include, but are not limited to: the at least one processing unit 910, the at least one storage unit 920, and a bus 930 connecting the different system components (including the storage unit 920 and the processing unit 910).

Wherein the storage unit stores program code that is executable by the processing unit 910 such that the processing unit 910 performs steps according to various exemplary embodiments of the present disclosure described in the above-described "exemplary methods" section of the present specification. For example, the processing unit 910 may perform the following steps of the method embodiment described above:

acquiring source node information and end node information sent by a message;

determining all message transmission paths between the source node and the end node according to the source node information and the end node information;

determining a merging node and split nodes based on the message sending paths, wherein the merging node is a node with the number of message sending paths of an entering node being larger than that of message sending paths of an exiting node, and the split nodes are nodes with the number of message sending paths of the entering node being smaller than that of message sending paths of the exiting node;

And configuring a corresponding base station identification code (BSID) for the message based on the identification of the merging node and the splitting node, so that the message is sent to the end node from the source node through the merging node and the splitting node based on the BSID.

The storage unit 920 may include readable media in the form of volatile storage units, such as Random Access Memory (RAM) 9201 and/or cache memory 9202, and may further include Read Only Memory (ROM) 9203.

The storage unit 920 may also include a program/utility 9204 having a set (at least one) of program modules 9205, such program modules 9205 include, but are not limited to: an operating system, one or more application programs, other program modules, and program data, each or some combination of which may include an implementation of a network environment.

The bus 930 may be one or more of several types of bus structures including a memory unit bus or memory unit controller, a peripheral bus, an accelerated graphics port, a processing unit, or a local bus using any of a variety of bus architectures.

The electronic device 900 may also communicate with one or more external devices 940 (e.g., keyboard, pointing device, bluetooth device, etc.), one or more devices that enable a user to interact with the electronic device 900, and/or any devices (e.g., routers, modems, etc.) that enable the electronic device 900 to communicate with one or more other computing devices. Such communication may occur through an input/output (I/O) interface 950. Also, electronic device 900 may communicate with one or more networks such as a Local Area Network (LAN), a Wide Area Network (WAN), and/or a public network, such as the Internet, through network adapter 960. As shown, the network adapter 960 communicates with other modules of the electronic device 900 over the bus 930. It should be appreciated that although not shown, other hardware and/or software modules may be used in connection with electronic device 900, including, but not limited to: microcode, device drivers, redundant processing units, external disk drive arrays, RAID systems, tape drives, data backup storage systems, and the like.

From the above description of embodiments, those skilled in the art will readily appreciate that the example embodiments described herein may be implemented in software, or may be implemented in software in combination with the necessary hardware. Thus, the technical solution according to the embodiments of the present disclosure may be embodied in the form of a software product, which may be stored in a non-volatile storage medium (may be a CD-ROM, a U-disk, a mobile hard disk, etc.) or on a network, including several instructions to cause a computing device (may be a personal computer, a server, a terminal device, or a network device, etc.) to perform the method according to the embodiments of the present disclosure.

In an exemplary embodiment of the present disclosure, a computer-readable storage medium, which may be a readable signal medium or a readable storage medium, is also provided. On which a program product is stored which enables the implementation of the method described above of the present disclosure. In some possible implementations, various aspects of the disclosure may also be implemented in the form of a program product comprising program code for causing a terminal device to carry out the steps according to the various exemplary embodiments of the disclosure as described in the "exemplary methods" section of this specification, when the program product is run on the terminal device.

More specific examples of the computer readable storage medium in the present disclosure may include, but are not limited to: an electrical connection having one or more wires, a portable computer diskette, a hard disk, a Random Access Memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or flash memory), an optical fiber, a portable compact disc read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the foregoing.

In this disclosure, a computer readable storage medium may include a data signal propagated in baseband or as part of a carrier wave, with readable program code embodied therein. Such a propagated data signal may take any of a variety of forms, including, but not limited to, electro-magnetic, optical, or any suitable combination of the foregoing. A readable signal medium may also be any readable medium that is not a readable storage medium and that can communicate, propagate, or transport a program for use by or in connection with an instruction execution system, apparatus, or device.

Alternatively, the program code embodied on a computer readable storage medium may be transmitted using any appropriate medium, including but not limited to wireless, wireline, optical fiber cable, RF, etc., or any suitable combination of the foregoing.

In particular implementations, the program code for carrying out operations of the present disclosure may be written in any combination of one or more programming languages, including an object oriented programming language such as Java, C++ or the like and conventional procedural programming languages, such as the "C" programming language or similar programming languages. The program code may execute entirely on the user's computing device, partly on the user's device, as a stand-alone software package, partly on the user's computing device, partly on a remote computing device, or entirely on the remote computing device or server. In the case of remote computing devices, the remote computing device may be connected to the user computing device through any kind of network, including a Local Area Network (LAN) or a Wide Area Network (WAN), or may be connected to an external computing device (e.g., connected via the Internet using an Internet service provider).

It should be noted that although in the above detailed description several modules or units of a device for action execution are mentioned, such a division is not mandatory. Indeed, the features and functionality of two or more modules or units described above may be embodied in one module or unit in accordance with embodiments of the present disclosure. Conversely, the features and functions of one module or unit described above may be further divided into a plurality of modules or units to be embodied.

Furthermore, although the steps of the methods in the present disclosure are depicted in a particular order in the drawings, this does not require or imply that the steps must be performed in that particular order or that all illustrated steps be performed in order to achieve desirable results. Additionally or alternatively, certain steps may be omitted, multiple steps combined into one step to perform, and/or one step decomposed into multiple steps to perform, etc.

From the description of the above embodiments, those skilled in the art will readily appreciate that the example embodiments described herein may be implemented in software, or may be implemented in software in combination with the necessary hardware. Thus, the technical solution according to the embodiments of the present disclosure may be embodied in the form of a software product, which may be stored in a non-volatile storage medium (may be a CD-ROM, a U-disk, a mobile hard disk, etc.) or on a network, including several instructions to cause a computing device (may be a personal computer, a server, a mobile terminal, or a network device, etc.) to perform the method according to the embodiments of the present disclosure.

Other embodiments of the disclosure will be apparent to those skilled in the art from consideration of the specification and practice of the disclosure disclosed herein. This disclosure is intended to cover any adaptations, uses, or adaptations of the disclosure following the general principles of the disclosure and including such departures from the present disclosure as come within known or customary practice within the art to which the disclosure pertains. It is intended that the specification and examples be considered as exemplary only, with a true scope and spirit of the disclosure being indicated by the following claims.

Claims (10)

1. A method for sending a message, comprising:

acquiring source node information and end node information sent by a message;

determining all message sending paths between the source node and the end node according to the source node information and the end node information;

determining merging nodes and splitting nodes based on the message sending paths, wherein the merging nodes are nodes with the number of message sending paths of entering nodes being larger than that of message sending paths of leaving nodes, and the splitting nodes are nodes with the number of message sending paths of entering nodes being smaller than that of message sending paths of leaving nodes;

and configuring a corresponding base station identification code (BSID) for the message based on the identification of the merging node and the splitting node, so that the message is sent to the tail node from the source node through the merging node and the splitting node based on the BSID.

2. The method for sending a message according to claim 1, further comprising:

acquiring traffic load information of a message sending path leaving the split node;

determining weight information of a message sending path leaving the split node based on traffic load information of the message sending path leaving the split node;

And sending the weight information to the splitting node so that the splitting node sends the message on the message sending path based on the weight information.

3. The method for sending a message according to claim 1, further comprising:

acquiring user-defined weight information of a message sending path leaving the split node;

and sending the weight information to the splitting node so that the splitting node sends the message on the message sending path based on the weight information.

4. The method for sending a message according to claim 1, wherein determining all message sending paths located before the source node and the end node according to the source node and the end node comprises:

and determining all message sending paths positioned before the source node and the end node based on a traversal algorithm, the source node information and the end node information.

5. The method for sending a message according to claim 1, wherein the obtaining source node information and end node information sent by the message includes:

and obtaining source node information and end node information sent by the message through a worm algorithm.

6. A messaging system, comprising: control equipment, a source node and a final node;

the control device is configured to obtain source node information sent by the source node and end node information sent by the end node, and determine all message sending paths between the source node and the end node according to the source node information and the end node information; determining merging nodes and splitting nodes based on the message sending paths, wherein the merging nodes are nodes with the number of message sending paths of entering nodes being larger than that of message sending paths of leaving nodes, and the splitting nodes are nodes with the number of message sending paths of entering nodes being smaller than that of message sending paths of leaving nodes; configuring a corresponding base station identification code (BSID) for the message based on the identification of the merging node and the splitting node, so that the message is sent to the end node from the source node through the merging node and the splitting node based on the BSID;

the source node is used for sending source node information to the control equipment;

and the end node is used for sending end node information to the control equipment.

7. The messaging system of claim 6, wherein the messaging system further comprises: splitting the node;

the split node is configured to receive weight information of a packet transmission path sent by the control device, where the weight information is determined by the control device based on traffic load information of the packet transmission path leaving the split node.

8. A message transmitting apparatus, comprising:

the acquisition module is used for acquiring source node information and end node information sent by the message;

the first determining module is used for determining all message sending paths between the source node and the end node according to the source node information and the end node information;

the second determining module is configured to determine a merging node and a splitting node based on the packet sending paths, where the merging node is a node with a number of packet sending paths entering the node being greater than a number of packet sending paths leaving the node, and the splitting node is a node with a number of packet sending paths entering the node being less than a number of packet sending paths leaving the node;

and the configuration module is used for configuring a corresponding base station identification code (BSID) for the message based on the identification of the merging node and the splitting node, so that the message is sent to the end node from the source node through the merging node and the splitting node based on the BSID.

9. An electronic device, comprising:

a processor; and

a memory for storing executable instructions of the processor;

wherein the processor is configured to perform the messaging method of any of claims 1-5 via execution of the executable instructions.

10. A computer readable storage medium having stored thereon a computer program, which when executed by a processor implements the messaging method of any of claims 1-5.

Images