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

By determining the message sending path and configuring the BSID, the SRv6 message transmission process is simplified, the cumbersome transmission problem is solved, and efficiency and path balance are improved.

CN116208544BActive Publication Date: 2024-11-19CHINA TELECOM CORP LTD
View PDF 0 Cites 0 Cited by

Patent Information

Application Number
CN202211734597.3
Authority / Receiving Office
CN · China
Patent Type
Patents(China)
Current Assignee / Owner
Filing Date
2022-12-30
Publication Date
2024-11-19
Estimated Expiration
2042-12-30

AI Technical Summary

Technical Problem

SRv6-based packet transmission is relatively cumbersome, and it is necessary to obtain information from each node to configure BSID, resulting in complex processes.

Method used

By obtaining the information of the source node and the last node, the message sending path is determined, and the merge node and the split node are determined according to the path, the corresponding base station identification code BSID is configured, so that the message is sent from the source node to the last node through the merge node and the split node , and adjust the weight according to the traffic load information to optimize the path.

Benefits of technology

The message sending process is simplified, the efficiency is improved, and the tedious steps of obtaining all node information before sending are avoided, ensuring the balance of message paths.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN116208544B_ABST
    Figure CN116208544B_ABST
Patent Text Reader

Abstract

The present disclosure provides a message sending method, system, device, equipment and storage medium, which obtains the source node information and the end node information of the message sending, and then determines all the message sending paths between the source node and the end node according to the source node information and the end node information. Then, the message sending path is given to determine the merging node and the splitting node, and then the corresponding BSID is configured for the message based on the identification of the merging node and the splitting node. In this way, the message can determine the path through which the message passes based on the BSID, and the present disclosure improves the efficiency of message sending.
Need to check novelty before this filing date? Find Prior Art

Description

Background Art

[0002] Segment Routing IPv6 (SRv6), as the name implies, is segment-by-segment routing forwarding. It is designed based on the concept of source routing. SRv6 inserts a Segment Routing Header (SRH) into the IPv6 message, pushes an explicit IPv6 address stack into the SRH, and the intermediate nodes continuously update the destination address and offset address stack to complete hop-by-hop forwarding, which is similar to the forwarding process of MPLS.

[0003] During the SRv6 transmission process, since it is necessary to know each node used for transmission and configure BSID information based on each node information, the SRv6-based message transmission is relatively cumbersome. Summary of the invention

[0004] The present disclosure provides a message sending method, system, apparatus, device and storage medium, which at least to some extent overcome the problem that the current SRv6 message transmission is relatively complicated.

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

[0006] According to one aspect of the present disclosure, a message sending method is provided, including:

[0007] Obtain the source node information and end node information of the message;

[0008] Determine all message sending paths between the source node and the end node according to the source node information and the end node information;

[0009] Determine a merge node and a split node based on the message sending path, wherein the merge node is a node where the number of message sending paths entering the node is greater than the number of message sending paths leaving the node, and the split node is a node where the number of message sending paths entering the node is less than the number of message sending paths leaving the node;

[0010] The corresponding base station identification code BSID is configured for the message based on the identifiers of the merging node and the splitting node, so that the message is sent from the source node to the end node through the merging node and the splitting node based on the BSID.

[0011] In one embodiment of the present disclosure, the method further includes:

[0012] Obtaining traffic load information of the message sending path leaving the split node;

[0013] Determine 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;

[0014] 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.

[0015] In one embodiment of the present disclosure, the method further includes:

[0016] Obtain the user-defined weight information of the message sending path leaving the split node;

[0017] 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.

[0018] In one embodiment of the present disclosure, determining all message sending paths located before the source node and the end node according to the source node and the end node includes:

[0019] Based on the traversal algorithm, source node information and end node information, all message sending paths located before the source node and the end node are determined.

[0020] In one embodiment of the present disclosure, obtaining source node information and end node information of a message includes:

[0021] The source node information and the end node information of the message are obtained through the worm algorithm.

[0022] According to another aspect of the present disclosure, a message sending system is provided, comprising:

[0023] Control devices, source nodes, and end nodes;

[0024] A control device, used to obtain source node information sent by a source node and end node information sent by an end node, determine all message sending paths between the source node and the end node according to the source node information and the end node information; determine a merging node and a splitting node based on the message sending paths, wherein a merging node is a node whose number of message sending paths entering the node is greater than the number of message sending paths leaving the node, and a splitting node is a node whose number of message sending paths entering the node is less than the number of message sending paths leaving the node;

[0025] Based on the identifiers of the merging node and the splitting node, a corresponding base station identification code BSID is configured for the message, so that the message is sent from the source node to the end node through the merging node and the splitting node based on the BSID;

[0026] A source node, used to send source node information to a control device;

[0027] The end node is used to send the end node information to the control device.

[0028] In one embodiment of the present disclosure, the message sending system further includes: a split node;

[0029] The split node is used to receive weight information of a message sending path sent by a control device, where the weight information is determined by the control device based on traffic load information of the message sending path leaving the split node.

[0030] According to another aspect of the present disclosure, a message sending device is provided, comprising:

[0031] The first acquisition module is used to acquire the source node information and the end node information of the message;

[0032] A first determination module, used to determine all message sending paths between the source node and the end node according to the source node information and the end node information;

[0033] A second determination module is used to determine a merging node and a splitting node based on the message sending path, wherein the merging node is a node where the number of message sending paths entering the node is greater than the number of message sending paths leaving the node, and the splitting node is a node where the number of message sending paths entering the node is less than the number of message sending paths leaving the node;

[0034] The configuration module is used to configure the corresponding base station identification code BSID for the message based on the identifiers of the merging node and the splitting node, so that the message is sent from the source node to the end node through the merging node and the splitting node based on the BSID.

[0035] In one embodiment of the present disclosure, the device further includes:

[0036] A second acquisition module, used to acquire traffic load information of a message sending path leaving the split node;

[0037] A third determination module, configured to determine 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;

[0038] The first sending module is used to send weight information to the split node, so that the split node sends the message on the message sending path based on the weight information.

[0039] In one embodiment of the present disclosure, the device further includes:

[0040] A third acquisition module is used to obtain user-defined weight information of a message sending path leaving the split node;

[0041] The second sending module is used to send 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.

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

[0043] The determination unit is used to determine all message sending paths located before the source node and the end node based on the traversal algorithm, the source node information and the end node information.

[0044] In one embodiment of the present disclosure, the first acquisition module includes:

[0045] The acquisition unit is used to acquire the source node information and the terminal node information of the message through the worm algorithm.

[0046] According to another aspect of the present disclosure, an electronic device is provided, comprising: a processor; and a memory for storing executable instructions of the processor; wherein the processor is configured to execute the above-mentioned message sending method by executing the executable instructions.

[0047] According to another aspect of the present disclosure, a computer-readable storage medium is provided, on which a computer program is stored, and when the computer program is executed by a processor, the above-mentioned message sending method is implemented.

[0048] The message sending method provided by the embodiment of the present disclosure obtains the source node information and the end node information of the message sending, and then determines the entire message sending path between the source node and the end node according to the source node information and the end node information. Then, the merge node and the split node are determined according to the message sending path, and then the corresponding BSID is configured for the message based on the identifiers of the merge node and the split node. In this way, the message can determine the path through which the message passes based on the BSID, avoiding the problem of cumbersome message sending caused by the need to obtain all node information on the message sending path before sending the message, and improving the efficiency of message sending.

[0049] It is to be understood that the foregoing general description and the following detailed description are exemplary and explanatory only and are not restrictive of the present disclosure. BRIEF DESCRIPTION OF THE DRAWINGS

[0050] The accompanying drawings herein are incorporated into the specification and constitute a part of the specification, illustrate embodiments consistent with the present disclosure, and together with the specification are used to explain the principles of the present disclosure. Obviously, the accompanying drawings described below are only some embodiments of the present disclosure, and for ordinary technicians in this field, other accompanying drawings can be obtained based on these accompanying drawings without creative work.

[0051] Figure 1 A diagram showing an architecture of a message sending system in an embodiment of the present disclosure is shown;

[0052] Figure 2Another system architecture diagram for sending messages in an embodiment of the present disclosure is shown;

[0053] Figure 3 A flow chart of a message sending method in an embodiment of the present disclosure is shown;

[0054] Figure 4 Another method for sending a message according to an embodiment of the present disclosure is shown in the flowchart;

[0055] Figure 5 A schematic diagram of message sending in an embodiment of the present disclosure is shown;

[0056] Figure 6 A flow chart of another message sending method in an embodiment of the present disclosure is shown;

[0057] Figure 7 A flow chart of another message sending method in an embodiment of the present disclosure is shown;

[0058] Figure 8 A schematic diagram of a message sending device in an embodiment of the present disclosure is shown;

[0059] Fig. 9 A structural block diagram of an electronic device in an embodiment of the present disclosure is shown. DETAILED DESCRIPTION

[0060] Example embodiments will now be described more fully with reference to the accompanying drawings. However, example embodiments can be implemented in a variety of forms and should not be construed as limited to the examples set forth herein; rather, these embodiments are provided so that the disclosure will be more comprehensive and complete and to fully convey the concepts 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.

[0061] In addition, the accompanying drawings are only schematic illustrations of the present disclosure and are not necessarily drawn to scale. The same reference numerals in the figures represent the same or similar parts, and their repeated description will be omitted. Some of the block diagrams shown in the accompanying drawings are functional entities and do not necessarily correspond to physically or logically independent entities. These functional entities can be implemented in software form, or implemented in one or more hardware modules or integrated circuits, or implemented in different networks and / or processor devices and / or microcontroller devices.

[0062] It should be understood that the various steps described in the method embodiments of the present disclosure may be performed in different orders and / or in parallel. In addition, the method embodiments may include additional steps and / or omit the steps shown. The scope of the present disclosure is not limited in this respect.

[0063] It should be noted that the concepts such as "first" and "second" mentioned in the present disclosure are only used to distinguish different devices, modules or units, and are not used to limit the order or interdependence of the functions performed by these devices, modules or units.

[0064] It should be noted that the modifications of "one" and "plurality" mentioned in the present disclosure are illustrative rather than restrictive, and those skilled in the art should understand that unless otherwise clearly indicated in the context, it should be understood as "one or more".

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

[0066] For ease of understanding, the embodiment of the present disclosure first describes a message sending system.

[0067] Figure 1 A diagram showing the architecture of a message sending system in an embodiment of the present disclosure is shown.

[0068] like Figure 1 As shown, the message sending system 10 may include:

[0069] Control device 102, source node 104 and end node 106;

[0070] The control device 102 is used to obtain source node information sent by the source node 104 and end node information sent by the end node 106, determine all message sending paths between the source node and the end node according to the source node information and the end node information; determine a merging node and a splitting node based on the message sending paths, wherein the merging node is a node whose number of message sending paths entering the node is greater than the number of message sending paths leaving the node, and the splitting node is a node whose number of message sending paths entering the node is less than the number of message sending paths leaving the node, and configure a corresponding base station identification code BSID for the message based on the identifiers of the merging node and the splitting node, so that the message is sent from the source node 104 to the end node 106 through the merging node and the splitting node based on the BSID;

[0071] The source node 104 is used to send source node information to the control device 102;

[0072] The end node 106 is used to send the end node information to the control device 102 .

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

[0074] In one embodiment, the terminal device may be various electronic devices, including but not limited to smart phones, tablet computers, laptop computers, desktop computers, wearable devices, augmented reality devices, virtual reality devices, etc.

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

[0076] Optionally, the server can be an independent physical server, or a server cluster or distributed system composed of multiple physical servers, or a cloud server that provides basic cloud computing services such as cloud services, cloud databases, cloud computing, cloud functions, cloud storage, network services, cloud communications, middleware services, domain name services, security services, CDN (Content Delivery Network), and big data and artificial intelligence platforms. The terminal can be a smart phone, tablet computer, laptop computer, desktop computer, smart speaker, smart watch, etc.

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

[0078] In one embodiment, the wireless network or wired network described above uses standard communication technology and / or protocol. The network is usually the Internet, but it can also be any network, including but not limited to a local area network (LAN), a metropolitan area network (MAN), a wide area network (WAN), a mobile, wired or wireless network, a dedicated network or any combination of a virtual private network). In some embodiments, technologies and / or formats including Hyper Text Mark-up Language (HTML), Extensible Markup Language (XML), etc. are used to represent data exchanged through the network. In addition, conventional encryption technologies such as Secure Socket Layer (SSL), Transport Layer Security (TLS), Virtual Private Network (VPN), Internet Protocol Security (IPsec) can also be used to encrypt all or some links. In other embodiments, customized and / or dedicated data communication technologies can also be used to replace or supplement the above data communication technologies.

[0079] The message sending system provided by the embodiment of the present disclosure obtains the source node information and the end node information of the message sending, and then determines the entire message sending path between the source node and the end node according to the source node information and the end node information. Then, the message sending path is given to determine the merging node and the splitting node, and then the corresponding BSID is configured for the message based on the identifiers of the merging node and the splitting node. In this way, the message can determine the path through which the message passes based on the BSID, avoiding the problem of cumbersome message sending caused by the need to obtain all node information on the message sending path before sending the message, thereby improving the efficiency of message sending.

[0080] Figure 2 An analysis system architecture diagram in an embodiment of the present disclosure is shown.

[0081] like Figure 2 As shown, the analysis system 20 may include:

[0082] Split node 202;

[0083] The split node 202 is used to receive weight information of a message sending path sent by a control device, where the weight information is determined by the control device based on traffic load information of the message sending path leaving the split node.

[0084] In one embodiment, the splitting node 202 may include a network element capable of data transmission. Exemplarily, the splitting node 202 may include a router, a signal forwarding device, and the like.

[0085] The message sending system provided by the embodiment of the present disclosure obtains the source node information and the end node information of the message sending, and then determines all the message sending paths between the source node and the end node according to the source node information and the end node information. Then, the message sending path is given to determine the merging node and the splitting node, and then the corresponding BSID is configured for the message based on the identifiers of the merging node and the splitting node. In this way, the message can determine the path through which the message passes based on the BSID, avoiding the problem of cumbersome message sending caused by the need to obtain all node information on the message sending path before sending the message, improving the efficiency of message sending, and by configuring the corresponding weight for the message sending path that sends the message to the split node, it is possible to avoid the balance of the traffic carrying capacity of the message sending path, thereby improving the efficiency of message sending.

[0086] Figure 3 A flow chart of a message sending method in an embodiment of the present disclosure is shown.

[0087] like Figure 3 As shown, the message sending method may include:

[0088] S310, obtaining source node information and end node information of the message.

[0089] In one embodiment, the source node information includes a source node identifier, and the end node information includes an end node identifier.

[0090] 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 information of all nodes.

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

[0092] S320: Determine all message sending paths between the source node and the end node according to the source node information and the end node information.

[0093] In one embodiment, all message sending paths between a source node and an end node may be determined based on a traversal method.

[0094] Exemplarily, the message can be sent from the source node to the end node according to different paths, and then the different paths are counted to obtain all message sending paths between the source node and the end node.

[0095] S330, determining a merge node and a split node based on the message sending path, wherein a merge node is a node where the number of message sending paths entering the node is greater than the number of message sending paths leaving the node, and a split node is a node where the number of message sending paths entering the node is less than the number of message sending paths leaving the node.

[0096] In one embodiment, a node may be determined to be a merge node or a split node based on a path entering the node and a path leaving the node.

[0097] In one embodiment, the path entering the node and the path leaving the node can be determined based on the direction of message transmission. For different message transmission directions, the same node can be a merge node or a split node.

[0098] S340: Based on the identifiers of the merging node and the splitting node, a corresponding base station identification code BSID is configured for the message, so that the message is sent from the source node to the end node through the merging node and the splitting node based on the BSID.

[0099] In one embodiment, after the merging node and the splitting node are determined, a corresponding BSID code may be configured for the message based on the identifiers of the merging node and the splitting node.

[0100] In one embodiment, after the above message is configured with the corresponding BSID code, the message can pass through the above merging node and splitting node according to the identification of the merging node and the splitting node and finally reach

[0101] Reach the final node.

[0102] In one embodiment, the BSID code can be assigned to the split node and the merge node, and the normal SID code can be assigned to other nodes. Then the transmission path of the split node and the merge node is determined as a segment.

[0103] The transmission path is then organized into a Segment List based on the segmented transmission path. The Segment List is then sent to the split node and the merge node.

[0104] The message sending method provided in the embodiment of the present disclosure obtains the source node information and the end node information of the message sending, and then determines all the message sending paths between the source node and the end node according to the source node information and the end node information. Then, the message sending path is determined.

[0105] Merge nodes and split nodes, and then configure corresponding BSIDs for messages based on the identifiers of the merged nodes and split nodes. This allows the message to determine the path it passes through based on the BSID.

[0106] This avoids the cumbersome problem of message sending caused by the need to obtain information about all nodes on the message sending path before sending the message, thereby improving the efficiency of message sending.

[0107] Figure 4 A flow chart of another message sending method in an embodiment of the present disclosure is shown.

[0108] like Figure 4 As shown, the message sending method may include:

[0109] 0S410, obtain the source node information and the end node information of the message;

[0110] S420, according to the source node information and the end node information, determine the location between the source node and the end node

[0111] All message sending paths between

[0112] S430, determining a merge node and a split node based on the message sending path, wherein the merge node

[0113] The point is the node where the number of message sending paths entering the node is greater than the number of message sending paths leaving the node, and the split node is the node where the number of message sending paths entering the node is less than the number of message sending paths leaving the node.

[0114] The number of nodes on the path;

[0115] S440: Obtain traffic load information of a message sending path leaving the split node.

[0116] In one embodiment, different message sending paths have different traffic load capacity information and traffic load information.

[0117] 0S450, determine 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.

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

[0119] S460: Send 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.

[0120] Figure 5 A schematic diagram of message sending in an embodiment of the present disclosure is shown.

[0121] like Figure 5 As shown, the message is sent from the source node PEI to the end node PE2 through multiple nodes. Then nodes P1 and P3 are determined as split nodes, and nodes P6 and P8 are determined as merge nodes. Then, based on the different traffic load information of the path between P1 and P2 and the path between P1 and P3, the different weights W1 and W2 of the above paths are determined. Similarly, the weight W21 of the path between P3 and P4 and the weight W22 of the path between P3 and P5 are determined. Then, the BSID code can be determined based on the above split nodes and merge nodes.

[0122] In one embodiment, different message sending paths may send messages of different proportions based on different weights.

[0123] S470: Based on the identifiers of the merging node and the splitting node, a corresponding base station identification code BSID is configured for the message, so that the message is sent from the source node to the end node through the merging node and the splitting node based on the BSID.

[0124] The message sending method provided by the embodiment of the present disclosure obtains the source node information and the end node information of the message sending, and then determines all the message sending paths between the source node and the end node according to the source node information and the end node information. Then, the message sending path is given to determine the merging node and the splitting node, and then the corresponding BSID is configured for the message based on the identifiers of the merging node and the splitting node. In this way, the message can determine the path through which the message passes based on the BSID, avoiding the problem of cumbersome message sending caused by the need to obtain all node information on the message sending path before sending the message, thereby improving the efficiency of message sending. At the same time, different weights are configured for different message sending paths based on the traffic load information of different message sending paths leaving the splitting node, so that different message sending paths transmit different amounts of messages, so that the loads of different message sending paths are balanced with each other.

[0125] Figure 6 A flow chart of another message sending method in an embodiment of the present disclosure is shown.

[0126] like Figure 6 As shown, the message sending method may include:

[0127] S610, obtaining source node information and end node information of a message through a worm algorithm.

[0128] In one embodiment, in addition to obtaining the source node information and the end node information of the message sent by the worm algorithm, the source node and the end node information of the message sent may also be obtained based on user input.

[0129] S620, determining all message sending paths between the source node and the end node according to the source node information and the end node information;

[0130] S630, determining a merge node and a split node based on the message sending path, wherein the merge node is a node where the number of message sending paths entering the node is greater than the number of message sending paths leaving the node, and the split node is a node where the number of message sending paths entering the node is less than the number of message sending paths leaving the node;

[0131] S640: Based on the identifiers of the merging node and the splitting node, a corresponding base station identification code BSID is configured for the message, so that the message is sent from the source node to the end node through the merging node and the splitting node based on the BSID.

[0132] The message sending method provided by the embodiment of the present disclosure obtains the source node information and the end node information of the message sending, and then determines the entire message sending path between the source node and the end node according to the source node information and the end node information. Then, the merge node and the split node are determined according to the message sending path, and then the corresponding BSID is configured for the message based on the identifiers of the merge node and the split node. In this way, the message can determine the path through which the message passes based on the BSID, avoiding the problem of cumbersome message sending caused by the need to obtain all node information on the message sending path before sending the message, and improving the efficiency of message sending.

[0133] Figure 7 A flow chart of another message sending method in an embodiment of the present disclosure is shown.

[0134] like Figure 7 As shown, the message sending method may include:

[0135] S710, obtaining source node information and end node information of the message;

[0136] S720, determining all message sending paths located before the source node and the end node based on the traversal algorithm, the source node information, and the end node information;

[0137] S730, determining a merge node and a split node based on the message sending path, wherein the merge node is a node where the number of message sending paths entering the node is greater than the number of message sending paths leaving the node, and the split node is a node where the number of message sending paths entering the node is less than the number of message sending paths leaving the node;

[0138] S740: Configure a corresponding base station identification code for the message based on the identification of the merged node and the split node

[0139] BSID, so that the message is sent from the source node to the end node through the merging node and the splitting node based on the BSID.

[0140] The message sending method provided in the embodiment of the present disclosure obtains the source node 5 information and the end node information of the message, and then determines the source node according to the source node information and the end node information.

[0141] The entire message sending path between the first node and the last node. Then the message sending path is given to determine the merging node and the splitting node, and then the corresponding BSID is configured for the message based on the identification of the merging node and the splitting node. In this way, the message can determine the path through which the message passes based on the BSID, avoiding

[0142] The problem of cumbersome message sending caused by the need to obtain all node information on the message sending path before sending the message is solved, and the efficiency of message sending is improved.

[0143] Based on the same inventive concept, the present disclosure also provides a message sending device in the following embodiments. Since the principle of solving the problem in the device embodiment is similar to that in the above method embodiment, the implementation of the device embodiment can refer to the implementation of the above method embodiment, and the repeated parts will not be repeated.

[0144] 5 Figure 8 A schematic diagram of a message sending device in an embodiment of the present disclosure is shown.

[0145] like Figure 8 As shown, the message sending device 800 may include:

[0146] The first acquisition module 810 is used to acquire the source node information and the end node information of the message;

[0147] The first determining module 820 is used to determine the source node according to the source node information and the end node information.

[0148] All message sending paths between nodes and end nodes;

[0149] The second determination module 830 is used to determine the merge node and the split node based on the message sending path.

[0150] Points, where a merge node is a node where the number of message sending paths entering the node is greater than the number of message sending paths leaving the node, and a split node is a node where the number of message sending paths entering the node is less than the number of message sending paths leaving the node;

[0151] Configuration module 840, configured to configure the 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 passes through the merging node and the splitting node from the source

[0152] The node sends to the end node.

[0153] The message sending device provided in the embodiment of the present disclosure obtains the source node information and the end node information of the message sending, and then determines the source node according to the source node information and the end node information.

[0154] The entire message sending path between the first node and the last node. Then the message sending path is given to determine the merge node 0 and the split node, and then the corresponding BSID is configured for the message based on the identifiers of the merge node and the split node. In this way, the message can determine the path through which the message passes based on the BSID, avoiding the problem of cumbersome message sending caused by the need to obtain all node information on the message sending path before sending the message, and improving the efficiency of message sending.

[0155] In one embodiment of the present disclosure, the device further includes:

[0156] A second acquisition module, used to acquire traffic load information of a message sending path leaving the split node;

[0157] A third determination module, configured to determine 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;

[0158] The first sending module is used to send weight information to the split node, so that the split node sends the message on the message sending path based on the weight information.

[0159] In one embodiment of the present disclosure, the device further includes:

[0160] A third acquisition module is used to obtain user-defined weight information of a message sending path leaving the split node;

[0161] The second sending module is used to send 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.

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

[0163] The determination unit is used to determine all message sending paths located before the source node and the end node based on the traversal algorithm, the source node information and the end node information.

[0164] In one embodiment of the present disclosure, the first acquisition module includes:

[0165] The acquisition unit is used to acquire the source node information and the terminal node information of the message through the worm algorithm.

[0166] Those skilled in the art will appreciate that various aspects of the present disclosure may be implemented as systems, methods or program products. Therefore, various aspects of the present disclosure may be specifically implemented in the following forms, namely: complete hardware implementation, complete software implementation (including firmware, microcode, etc.), or a combination of hardware and software, which may be collectively referred to herein as "circuits", "modules" or "systems".

[0167] Refer to the following Fig. 9 The electronic device 900 according to this embodiment of the present disclosure is described. Fig. 9 The electronic device 900 shown is merely an example and should not bring any limitation to the functions and scope of use of the embodiments of the present disclosure.

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

[0169] The storage unit stores program codes, which can be executed by the processing unit 910, so that the processing unit 910 performs the steps of various exemplary embodiments of the present disclosure described in the above “Exemplary Method” section of this specification. For example, the processing unit 910 can perform the following steps of the above method embodiment:

[0170] Obtain the source node information and end node information of the message;

[0171] Determine all message sending paths between the source node and the end node according to the source node information and the end node information;

[0172] Determine a merge node and a split node based on the message sending path, wherein the merge node is a node where the number of message sending paths entering the node is greater than the number of message sending paths leaving the node, and the split node is a node where the number of message sending paths entering the node is less than the number of message sending paths leaving the node;

[0173] The corresponding base station identification code BSID is configured for the message based on the identifiers of the merging node and the splitting node, so that the message is sent from the source node to the end node through the merging node and the splitting node based on the BSID.

[0174] The storage unit 920 may include a readable medium in the form of a volatile storage unit, such as a random access storage unit (RAM) 9201 and / or a cache storage unit 9202 , and may further include a read-only storage unit (ROM) 9203 .

[0175] 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 including but not limited to: an operating system, one or more application programs, other program modules, and program data, each of which or some combination may include an implementation of a network environment.

[0176] Bus 930 may represent 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.

[0177] The electronic device 900 may also communicate with one or more external devices 940 (e.g., keyboards, pointing devices, Bluetooth devices, etc.), may also communicate with one or more devices that enable a user to interact with the electronic device 900, and / or may communicate with any device that enables the electronic device 900 to communicate with one or more other computing devices (e.g., routers, modems, etc.). Such communication may be performed via an input / output (I / O) interface 950. Furthermore, the electronic device 900 may also communicate with one or more networks (e.g., local area networks (LANs), wide area networks (WANs), and / or public networks, such as the Internet) via a network adapter 960. As shown, the network adapter 960 communicates with other modules of the electronic device 900 via a bus 930. It should be understood that, although not shown in the figure, other hardware and / or software modules may be used in conjunction with the electronic device 900, including but not limited to: microcode, device drivers, redundant processing units, external disk drive arrays, RAID systems, tape drives, and data backup storage systems, etc.

[0178] Through the description of the above implementation, it is easy for those skilled in the art to understand that the example implementation described here can be implemented by software, or by software combined with necessary hardware. Therefore, the technical solution according to the implementation of the present disclosure can be embodied in the form of a software product, which can be stored in a non-volatile storage medium (which can be a CD-ROM, a USB flash drive, a mobile hard disk, etc.) or on a network, including several instructions to enable a computing device (which can be a personal computer, a server, a terminal device, or a network device, etc.) to execute the method according to the implementation of the present disclosure.

[0179] In an exemplary embodiment of the present disclosure, a computer-readable storage medium is also provided, which may be a readable signal medium or a readable storage medium. A program product capable of implementing the above method of the present disclosure is stored thereon. In some possible implementations, various aspects of the present disclosure may also be implemented in the form of a program product, which includes a program code, and when the program product is run on a terminal device, the program code is used to enable the terminal device to execute the steps according to various exemplary implementations of the present disclosure described in the above “Exemplary Method” section of this specification.

[0180] More specific examples of computer-readable storage media in the present disclosure may include, but are not limited to, an electrical connection having one or more conductors, a portable computer disk, a hard disk, a random access memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or flash memory), optical fiber, a portable compact disk read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the foregoing.

[0181] In the present disclosure, a computer readable storage medium may include a data signal propagated in baseband or as part of a carrier wave, wherein a readable program code is carried. Such propagated data signals may take a variety of forms, including but not limited to electromagnetic signals, optical signals, or any suitable combination of the above. A readable signal medium may also be any readable medium other than a readable storage medium, which may send, propagate, or transmit a program for use by or in conjunction with an instruction execution system, apparatus, or device.

[0182] Alternatively, the program code contained on the computer-readable storage medium may be transmitted using any appropriate medium, including but not limited to wireless, wired, optical cable, RF, etc., or any suitable combination of the foregoing.

[0183] In a specific implementation, the program code for performing the operations of the present disclosure may be written in any combination of one or more programming languages, including object-oriented programming languages ​​such as Java, C++, etc., and conventional procedural programming languages ​​such as "C" or similar programming languages. The program code may be executed entirely on the user computing device, partially on the user device, as a separate software package, partially on the user computing device and partially on a remote computing device, or entirely on a remote computing device or server. In the case of a remote computing device, the remote computing device may be connected to the user computing device through any type 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., using an Internet service provider to connect through the Internet).

[0184] It should be noted that, although several modules or units of the device for action execution are mentioned in the above detailed description, this division is not mandatory. In fact, according to the embodiments of the present disclosure, the features and functions of two or more modules or units described above can be embodied in one module or unit. On the contrary, the features and functions of one module or unit described above can be further divided into multiple modules or units to be embodied.

[0185] In addition, although the steps of the method in the present disclosure are described in a specific order in the drawings, this does not require or imply that the steps must be performed in this specific order, or that all the steps shown must be performed to achieve the desired results. Additionally or alternatively, some steps may be omitted, multiple steps may be combined into one step, and / or one step may be decomposed into multiple steps, etc.

[0186] Through the description of the above implementation, it is easy for those skilled in the art to understand that the example implementation described here can be implemented by software, or by software combined with necessary hardware. Therefore, the technical solution according to the implementation of the present disclosure can be embodied in the form of a software product, which can be stored in a non-volatile storage medium (which can be a CD-ROM, a USB flash drive, a mobile hard disk, etc.) or on a network, including several instructions to enable a computing device (which can be a personal computer, a server, a mobile terminal, or a network device, etc.) to execute the method according to the implementation of the present disclosure.

[0187] Those skilled in the art will readily appreciate other embodiments of the present disclosure after considering the specification and practicing the invention disclosed herein. The present disclosure is intended to cover any variations, uses or adaptations of the present disclosure, which follow the general principles of the present disclosure and include common knowledge or customary techniques in the art that are not disclosed in the present disclosure. The description and examples are intended to be exemplary only, and the true scope and spirit of the present disclosure are indicated by the appended claims.

Claims

1. A message sending method, It is characterized in that include: Obtain the source node information and end node information of the message; Determine all message sending paths between the source node and the end node according to the source node information and the end node information; Determine a merging node and a splitting node based on the message sending path, wherein the merging node is a node where the number of message sending paths entering the node is greater than the number of message sending paths leaving the node, and the splitting node is a node where the number of message sending paths entering the node is less than the number of message sending paths leaving the node; A corresponding base station identification code BSID is configured for the message based on the identifiers of the merging node and the splitting node, so that the message is sent from the source node to the end node through the merging node and the splitting node based on the BSID.

2. The message sending method according to claim 1, It is characterized in that The method further comprises: Acquire traffic load information of a message sending path leaving the split node; 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; 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.

3. The message sending method according to claim 1, It is characterized in that The method further comprises: Obtaining user-defined weight information of a message sending path leaving the split node; 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.

4. The message sending method according to claim 1, It is characterized in that The determining, according to the source node and the end node, all message sending paths located before the source node and the end node comprises: All message sending paths located before the source node and the end node are determined based on the traversal algorithm, the source node information and the end node information.

5. The message sending method according to claim 1, It is characterized in that The acquiring of the source node information and the end node information of the message includes: The source node information and the end node information of the message are obtained through the worm algorithm.

6. A message sending system, It is characterized in that include: Control devices, source nodes, and end nodes; The control device is used to obtain source node information sent by the source node and end node information sent by the end node, determine all message sending paths between the source node and the end node according to the source node information and the end node information; determine a merging node and a splitting node based on the message sending paths, wherein the merging node is a node where the number of message sending paths entering the node is greater than the number of message sending paths leaving the node, and the splitting node is a node where the number of message sending paths entering the node is less than the number of message sending paths leaving the node; configure a corresponding base station identification code BSID for the message based on the identifiers of the merging node and the splitting node, so that the message is sent from the source node to the end node through the merging node and the splitting node based on the BSID; The source node is used to send source node information to the control device; The end node is used to send end node information to the control device.

7. The message sending system according to claim 6, It is characterized in that The message sending system also includes: a split node; The split node is used to receive weight information of a message sending path sent by the control device, where the weight information is determined by the control device based on traffic load information of the message sending path leaving the split node.

8. A message sending device, It is characterized in that include: The acquisition module is used to obtain the source node information and the end node information of the message; A first determination module, configured to determine all message sending paths between the source node and the end node according to the source node information and the end node information; A second determination module is used to determine a merging node and a splitting node based on the message sending path, wherein the merging node is a node where the number of message sending paths entering the node is greater than the number of message sending paths leaving the node, and the splitting node is a node where the number of message sending paths entering the node is less than the number of message sending paths leaving the node; The configuration module is used to configure the corresponding base station identification code BSID for the message based on the identifiers of the merging node and the splitting node, so that the message is sent from the source node to the end node through the merging node and the splitting node based on the BSID.

9. An electronic device, It is characterized in that include: processor; as well as A memory, configured to store executable instructions of the processor; The processor is configured to execute the message sending method described in any one of claims 1 to 5 by executing the executable instructions.

10. A computer-readable storage medium having a computer program stored thereon, It is characterized in that When the computer program is executed by a processor, the message sending method described in any one of claims 1 to 5 is implemented.