CN115297047B - Networking method, electronic device and computer-readable storage medium - Google Patents
Networking method, electronic device and computer-readable storage medium Download PDFInfo
- Publication number
- CN115297047B CN115297047B CN202211172702.9A CN202211172702A CN115297047B CN 115297047 B CN115297047 B CN 115297047B CN 202211172702 A CN202211172702 A CN 202211172702A CN 115297047 B CN115297047 B CN 115297047B
- Authority
- CN
- China
- Prior art keywords
- node
- networked
- nodes
- management
- management node
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
Images
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/02—Topology update or discovery
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L41/00—Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
- H04L41/08—Configuration management of networks or network elements
- H04L41/0803—Configuration setting
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The embodiment of the disclosure provides a networking method, electronic equipment and a computer-readable storage medium, and relates to the field of data transmission. The method comprises the steps that a gateway sends a networking command to a first management node; the first management node determines a to-be-networked area according to a networking command, sends a node requirement to a management node of the to-be-networked area, and distributes the to-be-networked node to the management node of the to-be-networked area according to the node requirement; the method comprises the steps that a first management node receives to-be-networked node information from a management node of a to-be-networked area, and determines to-be-networked nodes and a transmission sequence according to the to-be-networked node information; the first management node judges whether the determined nodes to be networked meet the networking command or not, if so, the information of the determined nodes to be networked and the transmission sequence are sent to the gateway, and the gateway performs networking; and if not, sending a new node requirement to the management node of the to-be-networked area. In this way, suitable nodes can be selected from a complex communication environment to form a stable link.
Description
Technical Field
The present disclosure relates to the field of data transmission, and in particular, to a networking method, an electronic device, and a computer-readable storage medium.
Background
In order to ensure data traffic to pass through, transmission path customization is important, and how to acquire and organize nodes on a customized route becomes a key point. However, in general, the communication status between nodes in the network is complicated, and it is difficult to select a suitable node to form an effective, high-performance, stable link.
Disclosure of Invention
The present disclosure provides a networking method, an electronic device, and a computer-readable storage medium, which can select appropriate nodes from complex communication environments and network conditions to form an efficient, high-performance, stable link.
According to a first aspect of the present disclosure, there is provided a networking method, including:
a gateway sends a networking command to a first management node, wherein the first management node is any one management node in a multi-level node network; the multi-level node network comprises a gateway and nodes to be networked, the nodes to be networked are divided into a plurality of areas, each area comprises a management node, and the nodes to be networked in each area are managed by the management nodes of the area to which the node belongs;
the first management node determines a to-be-networked area according to a networking command, sends a node requirement to a management node of the to-be-networked area, and distributes the to-be-networked node to the management node of the to-be-networked area according to the node requirement;
the method comprises the steps that a first management node receives to-be-networked node information from a management node of a to-be-networked area, and determines to-be-networked nodes and a transmission sequence according to the to-be-networked node information;
the first management node judges whether the determined nodes to be networked meet the networking command, if so, the information of the determined nodes to be networked and the transmission sequence are sent to the gateway, and the gateway performs networking; and if not, sending a new node requirement to the management node of the to-be-networked area.
In some implementations of the first aspect, the nodes to be networked include a routing node and a remote control node, the routing node can only communicate with the nodes to be networked in the multi-level node network, and the remote control node can communicate with nodes outside the multi-level node network.
In some implementation manners of the first aspect, the determining, by the first management node, a to-be-networked area according to the networking command, and sending a node requirement to a management node of the to-be-networked area, where allocating, by the management node of the to-be-networked area, the to-be-networked node according to the node requirement includes:
the first management node performs priority ordering on all management nodes, sends node requirements to the management node with the first priority ordering, and searches whether a remote control node exists in a region to which the management node with the first priority ordering belongs;
if yes, returning the remote control node information to the first management node;
if not, returning information of the non-remote control node to the first management node, and sending the node requirements to the next management node by the first management node according to the priority sequence until the remote control node information is received.
In some implementation manners of the first aspect, the allocating, by the management node of the area to be networked, the node to be networked according to the node requirement includes:
the management node of the area to be networked distributes the nodes to be networked according to the network conditions of the nodes to be networked;
the network condition of the node to be networked comprises: and one or more of delay time, packet loss rate and bandwidth of the nodes to be networked.
In some implementation manners of the first aspect, the determining, by the first management node, a to-be-networked area according to the networking command, and sending a node requirement to the management node of the to-be-networked area, where allocating, by the management node of the to-be-networked area, the to-be-networked node according to the node requirement includes:
the first management node selects all areas to be networked according to the networking command, sends node requirements to all areas to be networked, and distributes the nodes to be networked according to the node requirements to the management nodes corresponding to the areas to be networked.
In some implementation manners of the first aspect, the receiving, by the first management node, information of a node to be networked from a management node in an area to be networked, and determining, according to the information of the node to be networked, the node to be networked and the transmission sequence include:
and counting the nodes to be networked according to the area to be networked in a grouping manner, planning all networking paths which can be generated, and determining the networking paths according to an optimal path principle, wherein the networking paths comprise the nodes to be networked and a transmission sequence.
In some implementation manners of the first aspect, the networking command includes a number of nodes to be networked, and if the number of nodes to be networked does not meet the number of nodes to be networked, sending a new node requirement to a management node of the area to be networked includes:
if the number of the nodes to be networked is insufficient, the first management node sends out a new node requirement, and the number of the nodes to be networked is required to be complemented by the management nodes in the area to be networked with routing nodes in the new node requirement.
In some implementation manners of the first aspect, the complementing, by a management node of the area to be networked, the number of nodes to be networked with a routing node includes:
the management node of the area to be networked complements the corresponding number of routing nodes according to the network condition of the routing nodes;
the network condition of the routing node comprises: one or more of delay time, packet loss rate, bandwidth of the routing node.
According to a second aspect of the present disclosure, there is provided an electronic device comprising: at least one processor; and a memory communicatively coupled to the at least one processor; wherein the memory stores instructions executable by the at least one processor to enable the at least one processor to perform a method according to the first aspect of the disclosure.
According to a third 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, performs the method according to the first aspect of the present disclosure.
In the disclosure, the first management node adjusts the node requirement according to the networking command, and ensures that the finally selected node can meet the networking command, thereby meeting the networking requirement of the gateway. And because the first management node is a node in the multi-level node network, the first management node is convenient to communicate with other management nodes, and node information is easy to obtain, thereby improving the networking efficiency.
It should be understood that the statements herein reciting aspects are not intended to limit the critical or essential features of the embodiments of the present disclosure, nor are they intended to limit the scope of the present disclosure. Other features of the present disclosure will become apparent from the following description.
Drawings
The above and other features, advantages and aspects of various embodiments of the present disclosure will become more apparent by referring to the following detailed description when taken in conjunction with the accompanying drawings. The accompanying drawings are included to provide a further understanding of the present disclosure, and are not incorporated in or constitute a part of this specification, wherein like reference numerals refer to like or similar elements throughout the several views and wherein:
fig. 1 shows a flow diagram of a networking method according to an embodiment of the present disclosure;
FIG. 2 shows a schematic diagram of a multi-level node network according to an embodiment of the present disclosure;
FIG. 3 is a schematic diagram illustrating a remote control node selection algorithm according to an embodiment of the present disclosure;
figure 4 shows a schematic diagram of a preferred algorithm for a node to be networked according to an embodiment of the present disclosure;
FIG. 5 shows a schematic diagram of an optimal path selection algorithm according to an embodiment of the present disclosure;
FIG. 6 shows a flow diagram of a combination of three networking algorithms according to an embodiment of the present disclosure;
fig. 7 shows a schematic diagram of an electronic device for implementing the networking method of the embodiment of the present disclosure.
Detailed Description
To make the objects, technical solutions and advantages of the embodiments of the present disclosure more clear, the technical solutions of the embodiments of the present disclosure will be described clearly and completely with reference to the drawings in the embodiments of the present disclosure, and it is obvious that the described embodiments are some, but not all embodiments of the present disclosure. All other embodiments, which can be derived by a person skilled in the art from the embodiments disclosed herein without inventive step, are intended to be within the scope of the present disclosure.
The method can select the appropriate nodes from complex communication environment and network conditions to form an effective, high-performance and stable link.
Fig. 1 shows a flow diagram of a networking method 100 according to an embodiment of the disclosure.
As shown in fig. 1, the networking method 100 includes the following steps:
s101, a gateway sends a networking command to a first management node, wherein the first management node is any one management node in a multi-level node network;
s102, a first management node determines a to-be-networked area according to a networking command, and sends a node requirement to a management node of the to-be-networked area, and the management node of the to-be-networked area distributes the to-be-networked node according to the node requirement;
s103, the first management node receives the information of the nodes to be networked from the management nodes of the area to be networked, and determines the nodes to be networked and the transmission sequence according to the information of the nodes to be networked;
s104, the first management node judges whether the determined nodes to be networked meet the networking command, if so, the information of the determined nodes to be networked and the transmission sequence are sent to a gateway, and the gateway performs networking; and if not, sending a new node requirement to the management node of the to-be-networked area.
The networking method 100 is performed in a multi-level node network, wherein fig. 2 shows a schematic diagram of a multi-level node network according to an embodiment of the present disclosure.
As shown in fig. 2, the multi-level node network includes a gateway and nodes to be networked, the nodes to be networked are divided into a plurality of regions, each region includes a management node, and the nodes to be networked in each region are managed by the management node of the region to which the node belongs.
The first management node may be a fixed management node in the multi-level node network, and if a connection relationship is established between a management node selected in the multi-level node network and a gateway, and the gateway sends a networking command to the selected management node each time networking is performed, the selected management node may be considered as a fixed first management node; the first management node may also be a changed node, and if a gateway randomly selects one management node to send a networking command every time networking is performed, the first management node may be a changed management node. It is understood that the selection of the first management node may be based on the distance between each management node and the gateway, the signal strength of each management node, and the like.
In some embodiments, the nodes to be networked include a routing node and a remote control node, the routing node can only communicate with the nodes to be networked in the multi-level node network, and the remote control node can communicate with nodes outside the multi-level node network.
It can be understood that, if the remote control node and the routing node are distinguished in the multi-level node network, the finally determined node to be networked may not include the routing node, but must include the remote control node because only the remote control node may access the target, and if the remote control node is not included, the link cannot be generated subsequently.
As can be seen from the above description, the management node functions as: managing nodes to be networked in the area to which the nodes belong; networking calculation is carried out, and node requirements are generated; and carrying out data forwarding. The remote control node has the following functions: accessing a target; and carrying out data forwarding. The routing node has the functions of: and carrying out data forwarding.
The management of the nodes to be networked in the area to which the nodes belong comprises the following steps: the management node can acquire the information of the nodes to be networked in the region to which the management node belongs, so that the nodes meeting the node requirements are selected according to the node types. The networking command may include node hop count, link traffic upper limit, and the like; the first management node determines the areas to be networked according to the networking command, and determines specific node requirements according to the networking command, for example, the networking command includes node hop counts, and the first management node determines two areas to be networked according to the networking command, so the node requirements should include the number of nodes which should be provided in the two areas to be networked respectively.
The first management node is responsible for providing the information of the nodes to be networked to the gateway node, therefore, the first management node needs to perform calculation and judges whether the selected nodes accord with the networking command.
Fig. 3 shows a schematic diagram of a remote control node selection algorithm according to an embodiment of the present disclosure.
As shown in fig. 3, in step S102, the determining, by the first management node, a to-be-networked area according to the networking command, and sending a node requirement to the management node of the to-be-networked area, where allocating, by the management node of the to-be-networked area, the to-be-networked node according to the node requirement includes:
the first management node performs priority ordering on all management nodes, sends node requirements to the management node with the first priority ordering, and searches whether a remote control node exists in a region to which the management node with the first priority ordering belongs;
if yes, returning the remote control node information to the first management node;
if not, returning information without the remote control node to the first management node, and sending the node requirements to the next management node by the first management node according to the priority sequence until the information of the remote control node is received.
The remote control node selection algorithm is used for requiring each management node to provide remote control node information in the area to which the management node belongs in order to ensure that the selected nodes to be networked include the remote control nodes when the remote control nodes and the routing nodes are distinguished in the multi-level node network. In general, there are multiple areas with remote control nodes in a multi-level node network, and correspondingly, there are multiple areas to be networked, which can be determined, priority ranking is performed on all management nodes, and the remote control node is selected from the area with high priority.
It can be understood that, since the remote control node selection algorithm is performed on the premise of distinguishing the remote control node from the routing node in the multi-level node network, the priority ranking criteria should be favorable for quickly finding the remote control node. If the priority ranking standard is the number of nodes in each region, the regions can be ranked in a descending order according to the number of nodes, namely, the regions with high number of nodes are ranked in a front priority order, so that the probability that the regions with high number of nodes can meet the remote control nodes required in the node requirements is higher, and the probability that the regions ranked in the front can return the remote control node information to the first management node is higher. The priority ranking standard can also be the signal strength of the management node of each area, the distance between other management nodes and the first management node, the historical networking success rate of each area, and the like.
According to the embodiment of the disclosure, the nodes to be networked are ensured to be selected in the region with higher priority, and the probability of successful networking in the region with higher priority is higher, so that the networking efficiency can be improved.
Fig. 4 shows a schematic diagram of a preferred algorithm of a node to be networked according to an embodiment of the present disclosure.
As shown in fig. 4, in step S102, the allocating, by the management node of the area to be networked, a node to be networked according to the node requirement includes:
the management node of the area to be networked distributes the nodes to be networked according to the network conditions of the nodes to be networked;
the network conditions of the nodes to be networked comprise: and one or more of delay time, packet loss rate and bandwidth of the nodes to be networked.
That is, each management node can select the node with the best network node status in the area to which the management node belongs, and send the corresponding node information to the first management node.
It can be understood that, if the remote control node and the routing node are not distinguished in the multi-level node network, each management node may directly send the corresponding node information to the first management node according to the network condition. However, if the remote control nodes and the routing nodes are distinguished in the multi-level node network, each management node can preferentially select the remote control node with better network condition, and after the remote control node is selected, the routing node is selected, or the routing node and the remote control node are not distinguished, the node with the best network node condition is directly selected, and then the first management node judges whether the returned node information meets the networking command, if not, a new node requirement is re-issued, and at the moment, the new node requirement can use other algorithms.
According to the embodiment of the disclosure, each management node sends the information of the nodes to be networked with the best network condition to the first management node, so that when the gateway node performs networking, each node to be networked has a strong signal, and networking efficiency and link communication fluency corresponding to networking can be improved.
In some embodiments, in step S102, the determining, by the first management node, a to-be-networked area according to the networking command, and sending a node requirement to a management node of the to-be-networked area, where allocating, by the management node of the to-be-networked area according to the node requirement, the to-be-networked node includes:
the first management node selects all areas to be networked according to the networking command, sends node requirements to all areas to be networked, and distributes the nodes to be networked according to the node requirements by the management nodes corresponding to the areas to be networked.
According to the embodiment of the disclosure, the first management node sends the node requirements to all the areas to be networked, and can obtain all the information of the nodes to be networked which meet the conditions, so that the first management node can select the optimal node to be networked, and the networking quality is improved.
Fig. 5 shows a schematic diagram of an optimal path selection algorithm according to an embodiment of the present disclosure.
As shown in fig. 5, in step S103, the receiving, by the first management node, information of a node to be networked from a management node in an area to be networked, and determining the node to be networked and a transmission sequence according to the information of the node to be networked includes:
and counting the nodes to be networked according to the groups of the areas to be networked, planning all networking paths capable of being generated, and determining the networking paths according to an optimal path principle, wherein the networking paths comprise the nodes to be networked and a transmission sequence.
The planning of all networking paths that can be generated can specifically perform path full-permutation, and a full-permutation algorithm flow provided herein is as follows:
assuming that array = {1,2,3,4,5} is fully arranged, the arranging step is:
firstly: a 1 cell 2,3,4, 2, 1,3,4, 3, 1,2,4, and 4, 1,2,3, 4;
for {2,3,4}:2, 3,4, 3, 2,4, a face 2, 3;
for {3,4}:3, 4, 3;
……
the optimal path principle is as follows: and selecting one optimal path from the fully arranged paths, wherein the optimal path can be the path with the shortest path, the strongest signal and the most or least nodes. If the standard of the optimal path is the shortest path, the area combination sequence can be obtained through a full-permutation algorithm, and the route length of each node is calculated according to the longitude and the latitude of each node.
According to the embodiment of the disclosure, the nodes are selected according to the optimal path selection algorithm and the node sequence is sequenced, so that the networking quality and the smoothness of data transmission can be further improved.
When the remote control node and the routing node are distinguished in the multi-level node network, in some embodiments, the networking command includes the number of nodes to be networked, and in step S104, if the number of nodes to be networked does not satisfy, sending a new node requirement to the management node of the area to be networked includes:
if the number of the nodes to be networked is insufficient, the first management node sends out a new node requirement, and the number of the nodes to be networked is required to be complemented by the management nodes in the area to be networked with routing nodes in the new node requirement.
It can be understood that the networking command includes the number of networking, the management node of each to-be-networked area sends the information of the remote control nodes in the to-be-networked area to the first management node, the first management node judges whether the number of the remote control nodes is greater than or equal to the number of to-be-networked nodes according to the number of to-be-networked nodes required in the networking command, if so, the remote control nodes of the number of to-be-networked nodes are selected from the management node, if not, the first management node sends out a new node requirement to the corresponding management node, and the corresponding management node selects a routing node to complement the number of the to-be-networked nodes, wherein if the to-be-networked area is a plurality of areas, the first management node can select one or more nodes from the plurality of areas to send the new node requirement.
According to the embodiment of the disclosure, the remote control nodes are preferentially selected, and the routing nodes are selected when the number of the remote control nodes is complemented, that is, the nodes to be networked include the remote control nodes are preferentially ensured, so that the communication between the gateway and the target can be realized, and the node hop count is ensured to meet the networking command.
It can be understood that the above-mentioned remote control node selection algorithm, the to-be-networked node optimization algorithm, and the optimal path selection algorithm may be used in combination, for example, when the remote control node and the routing node are distinguished in the multi-level node network, the remote control node selection algorithm and the to-be-networked node optimization algorithm may be used in combination.
As in some embodiments, said complementing the number of nodes to be networked with routing nodes by the management nodes of the area to be networked includes:
the management node of the area to be networked complements a corresponding number of routing nodes according to the network conditions of the routing nodes;
the network condition of the routing node comprises: one or more of delay time, packet loss rate, bandwidth of the routing node.
According to the embodiment of the disclosure, the complement routing node complements according to the network condition of the routing node, so that the selected routing node is ensured to have good network condition while communication is completed by ensuring that the final networking node comprises the remote control node, and the communication smoothness is improved.
It can be understood that the above-mentioned remote control node selection algorithm, the to-be-networked node optimization algorithm, and the optimal path selection algorithm may be used in combination.
Fig. 6 shows a flow diagram of a combination of three networking algorithms according to an embodiment of the present disclosure.
As shown in fig. 6, the combination of the three algorithms includes the following steps:
a. the gateway selects a management node as a first management node and issues a networking command;
b. after receiving the networking command, the first management node builds a node requirement;
c. requesting a remote control node under the control of the remote control selection algorithm from a corresponding management node according to the remote control selection algorithm;
d. selecting a node area range according to the hop count;
e. sequencing the regions by using an optimal path algorithm;
f. according to the optimization algorithm of the nodes to be networked, the first management node selects the first 3 superior nodes from the subordinate nodes of the first management node;
g. summarizing all the selected nodes;
h. f, judging whether the number meets the hop count, if not, returning to the step f, and if so, finishing networking;
i. the first management node returns the node information and the sequence to the gateway.
It should be noted that for simplicity of description, the above-mentioned method embodiments are described as a series of acts, but those skilled in the art should understand that the present disclosure is not limited by the described order of acts, as some steps may be performed in other orders or simultaneously according to the present disclosure. Further, those skilled in the art should also appreciate that the embodiments described in the specification are exemplary embodiments and that acts and modules referred to are not necessarily required by the disclosure.
In the technical scheme of the disclosure, the acquisition, storage, application and the like of the personal information of the related user all accord with the regulations of related laws and regulations, and do not violate the good customs of the public order.
The present disclosure also provides an electronic device and a readable storage medium according to an embodiment of the present disclosure. The electronic device includes: at least one processor; and a memory communicatively coupled to the at least one processor; wherein the memory stores instructions executable by the at least one processor to enable the at least one processor to perform the method 100. The computer-readable storage medium has stored thereon a computer program which, when executed by a processor, implements the method 100.
FIG. 7 illustrates a schematic block diagram of an electronic device 700 that may be used to implement embodiments of the present disclosure. Electronic devices are intended to represent various forms of digital computers, such as laptops, desktops, workstations, personal digital assistants, servers, blade servers, mainframes, and other appropriate computers. The electronic device may also represent various forms of mobile devices, such as personal digital processing, cellular phones, smart phones, wearable devices, and other similar computing devices. The components shown herein, their connections and relationships, and their functions, are meant to be examples only, and are not intended to limit implementations of the disclosure described and/or claimed herein.
The device 700 comprises a computing unit 701, which may perform various suitable actions and processes according to a computer program stored in a Read Only Memory (ROM) 702 or a computer program loaded from a storage unit 708 into a Random Access Memory (RAM) 703. In the RAM 703, various programs and data required for the operation of the device 700 can also be stored. The calculation unit 701, the ROM 702, and the RAM 703 are connected to each other by a bus 704. An input/output (I/O) interface 705 is also connected to bus 704.
Various components in the device 700 are connected to the I/O interface 705, including: an input unit 706 such as a keyboard, a mouse, or the like; an output unit 707 such as various types of displays, speakers, and the like; a storage unit 708 such as a magnetic disk, optical disk, or the like; and a communication unit 709 such as a network card, a modem, a wireless communication transceiver, etc. The communication unit 709 allows the device 700 to exchange information/data with other devices via a computer network, such as the internet, and/or various telecommunication networks.
Various implementations of the systems and techniques described here above may be implemented in digital electronic circuitry, integrated circuitry, field Programmable Gate Arrays (FPGAs), application Specific Integrated Circuits (ASICs), application Specific Standard Products (ASSPs), system on a chip (SOCs), load programmable logic devices (CPLDs), computer hardware, firmware, software, and/or combinations thereof. These various embodiments may include: implemented in one or more computer programs that are executable and/or interpretable on a programmable system including at least one programmable processor, which may be special or general purpose, receiving data and instructions from, and transmitting data and instructions to, a storage system, at least one input device, and at least one output device.
Program code for implementing the methods of the present disclosure may be written in any combination of one or more programming languages. These program codes may be provided to a processor or controller of a general purpose computer, special purpose computer, or other programmable data processing apparatus, such that the program codes, when executed by the processor or controller, cause the functions/operations specified in the flowchart and/or block diagram to be performed. The program code may execute entirely on the machine, partly on the machine, as a stand-alone software package, partly on the machine and partly on a remote machine or entirely on the remote machine or server.
In the context of this disclosure, a machine-readable medium may be a tangible medium that can contain, or store a program for use by or in connection with an instruction execution system, apparatus, or device. The machine-readable medium may be a machine-readable signal medium or a machine-readable storage medium. A machine-readable medium may include, but is not limited to, an electronic, magnetic, optical, electromagnetic, infrared, or semiconductor system, apparatus, or device, or any suitable combination of the foregoing. More specific examples of a machine-readable storage medium would include an electrical connection based on 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 compact disc read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the foregoing.
To provide for interaction with a user, the systems and techniques described here can be implemented on a computer having: a display device (e.g., a CRT (cathode ray tube) or LCD (liquid crystal display) monitor) for displaying information to a user; and a keyboard and a pointing device (e.g., a mouse or a trackball) by which a user can provide input to the computer. Other kinds of devices may also be used to provide for interaction with a user; for example, feedback provided to the user can be any form of sensory feedback (e.g., visual feedback, auditory feedback, or tactile feedback); and input from the user may be received in any form, including acoustic, speech, or tactile input.
The systems and techniques described here can be implemented in a computing system that includes a back-end component (e.g., as a data server), or that includes a middleware component (e.g., an application server), or that includes a front-end component (e.g., a user computer having a graphical user interface or a web browser through which a user can interact with an implementation of the systems and techniques described here), or any combination of such back-end, middleware, or front-end components. The components of the system can be interconnected by any form or medium of digital data communication (e.g., a communication network). Examples of communication networks include: local Area Networks (LANs), wide Area Networks (WANs), and the Internet.
The computer system may include clients and servers. A client and server are generally remote from each other and typically interact through a communication network. The relationship of client and server arises by virtue of computer programs running on the respective computers and having a client-server relationship to each other. The server may be a cloud server, a server of a distributed system, or a server combining a blockchain.
It should be understood that various forms of the flows shown above, reordering, adding or deleting steps, may be used. For example, the steps described in the present disclosure may be executed in parallel or sequentially or in different orders, and are not limited herein as long as the desired results of the technical solutions of the present disclosure can be achieved.
The above detailed description should not be construed as limiting the scope of the disclosure. It should be understood by those skilled in the art that various modifications, combinations, sub-combinations and substitutions may be made, depending on design requirements and other factors. Any modification, equivalent replacement, and improvement made within the spirit and principle of the present disclosure should be included in the protection scope of the present disclosure.
Claims (9)
1. A networking method, comprising:
a gateway sends a networking command to a first management node, wherein the first management node is any one management node in a multi-level node network; the multi-level node network comprises a gateway and nodes to be networked, the nodes to be networked are divided into a plurality of areas, each area comprises a management node, and the nodes to be networked in each area are managed by the management nodes of the area to which the node belongs;
the first management node determines a to-be-networked area according to the networking command, sends a node requirement to the management node of the to-be-networked area, and distributes the to-be-networked node to the management node of the to-be-networked area according to the node requirement;
the method comprises the steps that a first management node receives information of nodes to be networked from management nodes of an area to be networked, and determines the nodes to be networked and a transmission sequence according to the information of the nodes to be networked;
the first management node judges whether the determined nodes to be networked meet the networking command or not, if so, the information of the determined nodes to be networked and the transmission sequence are sent to the gateway, and the gateway performs networking; if not, sending a new node requirement to a management node of the to-be-networked area;
the first management node determines a to-be-networked area according to the networking command and sends a node requirement to the management node of the to-be-networked area, and the step of distributing the to-be-networked node to the management node of the to-be-networked area according to the node requirement comprises the following steps:
the first management node performs priority sequencing on all management nodes, sends node requirements to the management node with the first priority sequencing, and searches whether a remote control node exists in a region to which the first management node with the first priority sequencing belongs;
if yes, returning the remote control node information to the first management node;
if not, returning information of the non-remote control node to the first management node, and sending the node requirements to the next management node by the first management node according to the priority sequence until the remote control node information is received.
2. The networking method according to claim 1, wherein the nodes to be networked comprise a routing node and a remote control node, the routing node can only communicate with the nodes to be networked in the multi-level node network, and the remote control node can communicate with nodes outside the multi-level node network.
3. The networking method of claim 1, wherein the allocating, by the management node of the area to be networked, the node to be networked according to the node requirement comprises:
the management node of the area to be networked distributes the nodes to be networked according to the network conditions of the nodes to be networked;
the network conditions of the nodes to be networked comprise: and one or more of delay time, packet loss rate and bandwidth of the nodes to be networked.
4. The networking method of claim 2, wherein the first management node determines a to-be-networked area according to the networking command, and sends a node requirement to a management node of the to-be-networked area, and the allocating, by the management node of the to-be-networked area, the to-be-networked node according to the node requirement comprises:
the first management node selects all areas to be networked according to the networking command, sends node requirements to all areas to be networked, and distributes the nodes to be networked according to the node requirements by the management nodes corresponding to the areas to be networked.
5. The networking method according to claim 4, wherein the first management node receiving information of the nodes to be networked from the management node of the area to be networked, and determining the nodes to be networked and the transmission sequence according to the information of the nodes to be networked comprises:
and counting the nodes to be networked according to the groups of the areas to be networked, planning all networking paths capable of being generated, and determining the networking paths according to an optimal path principle, wherein the networking paths comprise the nodes to be networked and a transmission sequence.
6. The networking method according to claim 1, wherein the networking command includes a number of nodes to be networked, and if not, sending a new node requirement to a management node of the area to be networked includes:
if the number of the nodes to be networked is insufficient, the first management node sends out a new node requirement, and management nodes in the area to be networked are required to complement the number of the nodes to be networked with routing nodes in the new node requirement.
7. The networking method of claim 6, wherein the complementing the number of the nodes to be networked by the management nodes of the area to be networked with the routing nodes comprises:
the management node of the area to be networked complements the corresponding number of routing nodes according to the network condition of the routing nodes;
the network condition of the routing node comprises: one or more of delay time, packet loss rate, bandwidth of the routing node.
8. An electronic device, comprising: at least one processor; and a memory communicatively coupled to the at least one processor; wherein the memory stores instructions executable by the at least one processor to enable the at least one processor to perform the method of any one of claims 1-7.
9. A computer-readable storage medium, on which a computer program is stored, which program, when being executed by a processor, carries out the method according to any one of claims 1-7.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202211172702.9A CN115297047B (en) | 2022-09-26 | 2022-09-26 | Networking method, electronic device and computer-readable storage medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202211172702.9A CN115297047B (en) | 2022-09-26 | 2022-09-26 | Networking method, electronic device and computer-readable storage medium |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN115297047A CN115297047A (en) | 2022-11-04 |
| CN115297047B true CN115297047B (en) | 2023-02-28 |
Family
ID=83833493
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202211172702.9A Active CN115297047B (en) | 2022-09-26 | 2022-09-26 | Networking method, electronic device and computer-readable storage medium |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN115297047B (en) |
Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN111935018A (en) * | 2020-07-23 | 2020-11-13 | 北京华云安信息技术有限公司 | Springboard network path generation method capable of configuring networking rules autonomously |
| CN113965514A (en) * | 2021-12-21 | 2022-01-21 | 北京华云安信息技术有限公司 | Link construction and display method and device and electronic equipment |
Family Cites Families (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JP4340400B2 (en) * | 2001-04-27 | 2009-10-07 | 富士通株式会社 | Packet transfer method in layered packet network, layered packet communication system, edge node and mobile terminal used in the system, and packet transfer method in layered packet network |
| US9438487B2 (en) * | 2012-02-23 | 2016-09-06 | Ericsson Ab | Bandwith policy management in a self-corrected content delivery network |
| US10812365B2 (en) * | 2017-02-28 | 2020-10-20 | Northeastern University | Geohyperbolic routing and addressing schemes for networks |
| CN110391982B (en) * | 2018-04-20 | 2022-03-11 | 伊姆西Ip控股有限责任公司 | Method, apparatus and computer program product for transmitting data |
| US11204853B2 (en) * | 2019-05-20 | 2021-12-21 | At&T Intellectual Property I, L.P. | System and method for low latency edge computing |
-
2022
- 2022-09-26 CN CN202211172702.9A patent/CN115297047B/en active Active
Patent Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN111935018A (en) * | 2020-07-23 | 2020-11-13 | 北京华云安信息技术有限公司 | Springboard network path generation method capable of configuring networking rules autonomously |
| CN113965514A (en) * | 2021-12-21 | 2022-01-21 | 北京华云安信息技术有限公司 | Link construction and display method and device and electronic equipment |
Also Published As
| Publication number | Publication date |
|---|---|
| CN115297047A (en) | 2022-11-04 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN108449286A (en) | Network bandwidth resources distribution method and device | |
| CN110458468A (en) | A kind of task processing method, device, electronic equipment and storage medium | |
| WO2019072162A1 (en) | Virtual network mapping method, device and storage medium | |
| CN109361547B (en) | Network slice link deployment method and device | |
| CN109617810A (en) | Data transmission method and device | |
| CN110933181B (en) | Routing method, device and system and electronic equipment | |
| CN112543151A (en) | SDN controller deployment method and device, electronic equipment and storage medium | |
| CN115328612A (en) | Resource allocation method, device, equipment and storage medium | |
| CN113361739B (en) | Method and device for generating picking path | |
| CN115297047B (en) | Networking method, electronic device and computer-readable storage medium | |
| WO2018188570A1 (en) | Data transmission method and apparatus | |
| CN102780632A (en) | Load sharing method and flow transmission equipment | |
| CN113077106A (en) | Time window-based article transportation method and device | |
| CN116629495A (en) | Method and device for outputting information | |
| CN115277534B (en) | Link construction method, electronic device and computer-readable storage medium | |
| CN113949666A (en) | Flow control method, device, equipment and system | |
| Li | An efficient data evacuation strategy using multi-objective reinforcement learning | |
| Guan et al. | Multidimensional resource fragmentation-aware virtual network embedding for IoT applications in MEC networks | |
| CN113285833B (en) | Method and device for acquiring information | |
| Malashenko et al. | Heterogeneous Flow Distribution at the Peak Load in the Multiuser NetworkK | |
| CN113992760B (en) | Method, device, equipment and storage medium for scheduling back source traffic | |
| CN114221906B (en) | Flow control method and device, electronic equipment and storage medium | |
| CN114301849B (en) | SRv 6-based network path priority analysis method and system | |
| CN116436978B (en) | Cloud computing-oriented memory allocation method, memory acquisition method, device and equipment | |
| CN112861024A (en) | Method and device for determining road network matrix, electronic equipment and storage medium |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |