CN115499285A - Method for constructing name resolution system provided by distributed hierarchical time delay - Google Patents
Method for constructing name resolution system provided by distributed hierarchical time delay Download PDFInfo
- Publication number
- CN115499285A CN115499285A CN202111137585.8A CN202111137585A CN115499285A CN 115499285 A CN115499285 A CN 115499285A CN 202111137585 A CN202111137585 A CN 202111137585A CN 115499285 A CN115499285 A CN 115499285A
- Authority
- CN
- China
- Prior art keywords
- node
- nodes
- virtual
- service providing
- added
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
- 238000000034 method Methods 0.000 title claims abstract description 79
- 230000008569 process Effects 0.000 claims abstract description 40
- 238000006467 substitution reaction Methods 0.000 claims description 10
- 238000004458 analytical method Methods 0.000 claims description 7
- 238000010276 construction Methods 0.000 claims description 6
- 238000005259 measurement Methods 0.000 claims description 6
- 238000012163 sequencing technique Methods 0.000 claims description 6
- 230000000977 initiatory effect Effects 0.000 claims description 2
- 239000000126 substance Substances 0.000 claims description 2
- 238000012546 transfer Methods 0.000 claims description 2
- 238000005516 engineering process Methods 0.000 description 8
- 230000006872 improvement Effects 0.000 description 8
- 238000004891 communication Methods 0.000 description 7
- 238000002910 structure generation Methods 0.000 description 4
- 230000008520 organization Effects 0.000 description 2
- 238000004364 calculation method Methods 0.000 description 1
- 230000007547 defect Effects 0.000 description 1
- 238000011161 development Methods 0.000 description 1
- 238000011982 device technology Methods 0.000 description 1
- 238000010586 diagram Methods 0.000 description 1
- 238000010295 mobile communication Methods 0.000 description 1
- 230000035945 sensitivity Effects 0.000 description 1
Images
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L12/00—Data switching networks
- H04L12/28—Data switching networks characterised by path configuration, e.g. LAN [Local Area Networks] or WAN [Wide Area Networks]
- H04L12/44—Star or tree networks
-
- 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/04—Network management architectures or arrangements
- H04L41/042—Network management architectures or arrangements comprising distributed management centres cooperatively managing the network
-
- 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/04—Network management architectures or arrangements
- H04L41/044—Network management architectures or arrangements comprising hierarchical management structures
-
- 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
- H04L41/0823—Configuration setting characterised by the purposes of a change of settings, e.g. optimising configuration for enhancing reliability
-
- 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/12—Discovery or management of network topologies
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L61/00—Network arrangements, protocols or services for addressing or naming
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L67/00—Network arrangements or protocols for supporting network services or applications
- H04L67/50—Network services
- H04L67/60—Scheduling or organising the servicing of application requests, e.g. requests for application data transmissions using the analysis and optimisation of the required network resources
- H04L67/61—Scheduling or organising the servicing of application requests, e.g. requests for application data transmissions using the analysis and optimisation of the required network resources taking into account QoS or priority requirements
Abstract
The invention discloses a method for constructing a name resolution system provided by distributed hierarchical time delay, wherein the name resolution system provided by the distributed hierarchical time delay comprises a management system and a plurality of service providing nodes; the method comprises the following steps: determining the position of each service providing node in a forest structure and the connection relation between each service providing node and other service providing nodes by using the node distance obtained by measuring the actual round-trip delay between the service providing nodes as a basis and determining conditions through the nesting relation; determining all branch nodes between a root node and a father node of a joining position of a service providing node to be joined through an ancestor node finding process; adding the node with lower service delay grade under the service providing node to be added through the process of finding the child node, and adjusting the tree structure accordingly; each tree represents a service area, the number of node layers included in one tree corresponds to the service delay level, the root node is the node with the maximum service delay level, and the nodes of the same level have the same service delay level.
Description
Technical Field
The invention relates to the field of computer network technology and distributed systems, in particular to a method for constructing a name resolution system provided by distributed hierarchical time delay.
Background
In recent years, with the rapid development of internet technology, the network devices and the network scale are increased sharply, the complexity of various aspects of the network is increased, and the progress and innovation of various components such as communication technology and network device technology are promoted. On the contrary, with the emergence of emerging network technologies such as fifth generation mobile communication technology, information center network and the like, the capacity of the network device processor is continuously improved, and the functions provided by the network are richer and stronger. Some applications and scenarios with strict requirements on network performance begin to appear, such as delay-sensitive industrial internet of things, internet of vehicles, telemedicine and the like, and a new demand that the provided service needs to be guaranteed in a time delay manner is provided for a corresponding distributed system for providing the service. Different from the traditional distributed system, the distributed system with time delay guarantee is different from the traditional distributed system in the nearby and best-effort service, each distributed node is required to provide the service to the service request of the user in the service area within a determined time delay upper limit, the time delay needing guarantee is divided into a plurality of levels due to different time delay sensitivities of different application scenes, and the organization structure of the distributed system is correspondingly hierarchically organized.
When the size of the node is large, the distributed system can face the problem of difficult deployment management and structure generation. The structure of distributed nodes in the existing cluster technology is completely managed by a central root node management system, and the mode is simple and direct, but the corresponding expansibility support is poor; decentralized peer-to-peer distributed systems do not have a single point bottleneck, support scalability well, but are more complex and difficult in structural organization and management. In addition, the existing structure generation method is difficult to adapt to the requirement that hierarchical time delay guarantees specific structure constraint of a distributed system.
Disclosure of Invention
The invention aims to overcome the defects of the prior art and provides a method for constructing a name resolution system provided by distributed hierarchical time delay.
In order to achieve the above object, the present invention provides a method for constructing a name resolution system provided by distributed hierarchical delay, where the name resolution system provided by distributed hierarchical delay includes a management system and a plurality of service providing nodes; the method comprises the following steps:
determining the position of each service providing node in a forest structure and the connection relation between each service providing node and other service providing nodes by using the node distance obtained by measuring the actual round-trip delay between the service providing nodes as a basis and determining conditions through the nesting relation; determining all branch nodes between a root node and a father node of a joining position of a service providing node to be joined through an ancestor node finding process; adding the node with lower service delay grade under the service providing node to be added through the process of finding the child node, and adjusting the tree structure accordingly; wherein the content of the first and second substances,
the forest structure specifically includes: each tree in the forest represents a service area, the number of node layers included in one tree corresponds to the service delay level, in the same tree, the root node is the node with the maximum service delay level, the nodes located in the same level in the forest have the same service delay level, and the nodes at the higher level have the higher service delay level than the nodes at the lower level; the nodes comprise real nodes and virtual nodes, and in the construction process of the tree, the virtual nodes are adopted to replace undeployed real nodes so as to form a complete tree structure.
As an improvement of the above method, the real node corresponds to a service providing node actually deployed, and provides an analysis service and a system structure management function for a user;
the virtual node takes an occupation role on the service delay level which is not deployed, and provides a system structure management function; a virtual node without a father node in the system structure is a virtual root node; the virtual node is generated by a real node in the joining process and is carried by a server deployed by the real node generating the virtual node;
the node distance between a virtual node and an actual node is represented by the average value of the node distances between the actual node and all actual nodes at the highest level in a subtree taking the virtual node as the root.
As an improvement of the foregoing method, the service delay level corresponds to a specific service delay, and is used to indicate an upper limit of a delay required by a user located in a service coverage area of the service providing node to obtain the service.
As an improvement of the foregoing method, the service coverage of the service providing node is all user nodes whose distance from the service providing node meets the service delay requirement, sub-tree nodes of the node, and all user nodes of each sub-tree node, the coverage of tree nodes located in different levels are in a nested relationship, and the coverage of a node in a higher level includes the coverage of a node in a lower level.
As an improvement of the above method, the nesting relationship determination condition includes:
for two nodes p and r, the respective service delay levels are L p And L r The measurement time delay of the distance between two nodes is D (p, r), and the node q is a real node of the highest layer in a subtree taking r as a root;
when nodes p and r are both real nodes, if D (p, r) < L p +L r If yes, the real node grade judgment condition is met;
when nodes p and r are both real nodes, if L p ＞L r And D (p, r) < L p -L r If yes, the real node tree-sharing judgment condition is met;
when the node p is a real node and r is a virtual node, if L p ＝L r And for all nodes q, D (p, q) < L p -L g If yes, the judgment condition of the virtual node certainty substitution is met;
when the node p is a real node and r is a virtual node, if L p ＜L r And for all nodes q, there is D (p, q) < 2*L r +L p -L q If yes, the virtual node same tree judgment condition is met; or if L p ＞L r And for all nodes q, D (p, q) < L p +L q If yes, the virtual node grade judgment condition is met;
when the node p is a real node and r is a virtual node, if L p ＜L r And there is one node q such that D (p, q) < | L q -L p If yes, the same tree judgment condition of the virtual nodes is met; or if L p ＞L r And for all nodes q, there is D (p, q) < L p -L q And then the same-tree judgment condition of the virtual nodes is satisfied.
As an improvement of the above method, the determining, by the ancestor node finding process, all branch nodes between the service providing node to be joined from the root node to the parent node of the joining location; the method specifically comprises the following steps:
step 601) comparing service delay levels L of the service providing nodes s to be added s And the highest service delay level L of the system max : if L is s ＝L max Go to step 602); if L is s ＜L max Go to step 603);
step 602) inquiring all virtual roots from the management system according to the service providing node s to be added to form a set VR, respectively performing virtual node certainty substitution judgment on the service providing node s to be added and each virtual node in the set VR, adding the satisfied virtual nodes into a certainty substitution set GR, and replacing all nodes in the certainty substitution set GR with the service providing node s to be added if GR is not null, and turning to step 609);
step 603) according to the known serviceable user set U of the service providing node s to be added, inquiring root nodes to which all users in the known serviceable user set U belong currently to form a set UR, deleting nodes which do not meet the real node grade judgment condition with the service providing node s to be added in the set UR, selecting the root node UR with the highest priority corresponding to the user, deleting the user of which the root node is not UR, taking UR as the root of the service providing node s to be added, and turning to step 606); if the root node ur which is satisfied cannot be selected, turning to step 604);
step 604) inquiring all real roots from the management system according to the service providing node s to be added to form a set R, performing real node tree-sharing judgment on the service providing node s to be added and each real node in the set R, and if a real node R meeting judgment conditions exists, turning to step 606 by taking the real node R as a root; if no real node R meeting the judgment condition exists, respectively carrying out real node grade judgment on each node to be added into the service providing nodes s and R, deleting the nodes which do not meet the judgment condition from the set R, sequencing the set R according to the sequence that the time delay between the nodes and the service providing nodes s to be added is from small to large, traversing the set R in sequence to take out the real node R, if the load of the real node R does not exceed a preset load threshold value, taking the real node R as the root of the service providing node s to be added, recording the current node Vcur as R, and turning to step 606); if the real node r meeting the judgment condition can not be selected, go to step 605);
step 605) inquiring all virtual roots from the management system according to the service providing node s to be added to form a set VR, respectively performing virtual node tree-sharing judgment on the service providing node s to be added and each virtual node in the set VR, and if a virtual node VR meeting judgment conditions exists, taking the virtual node VR as the root of the service providing node s to be added to transfer to step 606); if no virtual node VR meeting the judgment condition exists, respectively carrying out virtual node grade judgment on the service providing node s to be added and each virtual node in the set VR, deleting the unsatisfied virtual node, selecting the virtual node VR with the minimum time delay with the service providing node s to be added from the set VR as the root of the service providing node s to be added, recording the current node Vcur as VR, and turning to step 606); if no virtual node vr meeting the judgment condition exists, the service providing node s to be added generates a new virtual root node, generates all virtual nodes corresponding to the intermediate service delay level, and makes the virtual nodes establish corresponding parent-child relationships according to the level, and goes to step 609);
step 606) recording that the current node Vcur is an ancestor node of the layer by the service providing node s to be added, inquiring all real sub-nodes of the service providing node s to be added from Vcur to form a set RC, performing real node same-tree judgment on each real node to be added in the service providing node s and the RC, and if a real node RC meeting judgment conditions exists, making Vcur equal to RC and turning to step 608); if no real node meeting the judgment condition exists, respectively judging the grade of the real node of each node to be added into the service providing node s and the RC, deleting the nodes not meeting the judgment condition from the set RC, sequencing the set RC according to the sequence that the time delay between the nodes to be added and the service providing node s is from small to large, traversing the set RC in sequence to take out the real node RC, if the load of the real node RC does not exceed the preset load threshold value, making Vcur equal to RC, and turning to the step 606); if the real node rc meeting the judgment condition can not be selected, turning to step 607);
step 607) the service providing node s to be added inquires all the virtual sub-nodes thereof from the Vcur to form a set VC, respectively carries out virtual node tree-sharing judgment on the service providing node s to be added and each virtual node in the set VC, and if a virtual node VC meeting the judgment condition exists, the Vcur is made equal to the VC, and the step 608 is switched to; if no virtual node meeting the judgment condition exists, respectively carrying out virtual node grade judgment on the service providing node s to be added and each virtual node in the set VC, deleting the unsatisfied virtual node, selecting VC with the minimum time delay with the service providing node s to be added from the set VC, and enabling Vcur to be equal to VC, and turning to step 608); if no virtual node meeting the judgment condition exists, the node s to be added into the service provides a new virtual node, generates all virtual nodes corresponding to the intermediate service delay level, and makes the virtual nodes establish corresponding parent-child relationships according to the levels, and goes to step 609);
step 608) if the service delay level of the service providing node s to be added is lower than the service delay level of Vcur by one level, go to step 609); otherwise go to step 606);
step 609) the to-be-added service providing node s completes the process of finding the ancestor node.
As an improvement of the above method, the node with a lower service delay level is added to the node to be added with the service by the process of finding the child node, and the tree structure is adjusted accordingly; the method specifically comprises the following steps:
step 701) if the father node f is a real node and the father node f has no child node, the child node to be added to the service providing node s is empty, s is a leaf node, and step 706 is executed; otherwise go to step 702);
step 702) if the father node f is a virtual node and the father node f has no child node, the child node of the service providing node s to be added is empty, s is a leaf node, and step 706 is executed; otherwise go to step 703);
step 703) inquiring to obtain all virtual child nodes of the father node f according to the service providing node s to be added to form a virtual brother node set SV, and turning to step 706 if the SV is null, wherein the child nodes of the service providing node s to be added to are null; otherwise, go to step 704);
step 704) according to the service providing node s to be added, inquiring the child nodes of each virtual brother node in the virtual brother node set SV to form a child node set CS to be selected, performing virtual node tree-sharing judgment on the service providing node s to be added and each node in the child node set CS to be selected, adding the virtual nodes meeting the judgment conditions into the deterministic child node set GCS, initiating a relay invitation request to all nodes in the deterministic child node set GSS by the service providing node s to be added, deleting the nodes rejected by reply from the deterministic child node set GSS, if the GSS is not null, then relaying all the nodes in the deterministic child node set GSS by the service providing node s to be added to the self, and turning to step 705);
step 705) the service providing node s to be added detects the original father node of each adoptive child node, if the factor node is adoptively formed into a virtual leaf node, the virtual leaf node is circularly deleted upwards until the virtual leaf node does not exist in the branch, and the step 706 is turned;
step 706) the find child node process ends.
As an improvement of the above method, the service providing node s to be joined relays all nodes of the deterministic sub-node set GSS under itself; the method specifically comprises the following steps:
and changing the father node of the selected child node in the deterministic child node set GSS into the service providing node s to be added, notifying the original father node of the selected child node, and deleting the child node from the child node list.
As an improvement of the above method, the management system adopts weak centralized deployment to receive information reported by the limited nodes, wherein the information reported by the service providing nodes serving as root nodes includes, but is not limited to, node identifiers, network addresses, geographical locations, node virtual and real types, and node states; a root node query service is provided but does not perform computation and analysis of complex topologies.
Compared with the prior art, the invention has the advantages that:
compared with the prior art, the method for constructing the name resolution system provided by the distributed hierarchical time delay adopts a decentralized structure, and the distributed service nodes generate a self-organized structure to avoid the single-point bottleneck of structure management, so that the method has better expansibility; the node adding based on the actual distance measurement between the nodes can more accurately realize the constraint of the system delay guarantee, the flexible method for judging the relationship between the nodes in the node adding process also enables the system structure to have better balance and higher coverage rate to users, and the introduction of the virtual nodes improves the integrity and the connectivity of the system structure.
Drawings
FIG. 1 is a flow chart of a method for constructing a distributed hierarchical delay-provided name resolution system in accordance with the present invention;
FIG. 2 is a flow chart of the present invention for selecting a root node;
FIG. 3 is a flow diagram of ancestor node finding of the present invention;
FIG. 4 is a flow chart of finding child nodes of the present invention.
Detailed Description
The method of the invention adopts decentralized management, the nodes generate local structures in a distributed self-organizing way, a universal incremental deployment scene starting from a first point is supported, the division is carried out based on the time delay measurement among the nodes, and the generated system structure is ensured to meet the time delay guarantee of different grades of service, thereby better meeting the requirements of time delay sensitive application on service use.
The name resolution system provided by hierarchical time delay consists of a management system and a plurality of service providing nodes, wherein all the service providing nodes form a forest structure, each tree in the forest represents a service area, and each node in the tree corresponds to a coverage range of providing resolution service for a user under a service time delay level; in the same tree, the nodes in the same layer have the same service delay level, and the user set served by the service node in the upper stage comprises the complete set of users served by the service node in the lower stage which has a nested relation with the user set; the name resolution system provided by the distributed hierarchical time delay has the characteristic of supporting gradual deployment and construction, and for the condition that a service providing node of a certain service time delay level is not actually deployed and a service providing node of a lower service time delay level contained in the coverage area of the service providing node is deployed, a virtual node is adopted to replace the undeployed node so as to form a complete tree structure; in the construction process, the node distance obtained by measuring the actual round trip delay between service providing nodes is used as a basis, and the position of each node in the forest and the connection relation with other nodes are determined through a nesting relation judgment condition. Specifically, the construction process comprises two processes of finding ancestor nodes and finding child nodes, wherein the nodes are added. Wherein, finding ancestor nodes refers to the process of determining all branch nodes between the newly added node from the root to the parent node of the node adding position; finding a child node refers to the process of adding a node with a possibly lower service delay level in the system under the newly added node and adjusting the tree structure accordingly.
The technical solution of the present invention will be described in detail below with reference to the accompanying drawings and examples.
Example 1
In this embodiment, a description is given by using a field name resolution system deployed in a network as a main scenario, where the field name resolution system is a name resolution system provided by distributed hierarchical delay, and is a distributed query service system capable of providing services to users at multiple delay levels, and the system is composed of multiple resolution service nodes deployed in a distributed manner, and a communication delay of a resolution service provided by each resolution service node for a user in a coverage area of the resolution service node is less than a predetermined delay upper limit.
The coverage area is composed of all users served by the service node, one service node covers a certain user, and the service node can provide query service of the communication delay upper limit corresponding to the service delay level of the user; conversely, a serviceable node of a user at a service latency level represents all nodes that can provide query service for the user at the service latency level.
Distributed analysis service nodes in the system form a forest structure, the tree level of the analysis service nodes in the forest corresponds to the service delay level of the nodes, the nodes in the forest structure are divided into real nodes and virtual nodes, the functions executed by the real nodes comprise structure management and user service provision, and the virtual nodes only execute the structure management function; the structural information for each node includes, but is not limited to, parent node pointers and child node lists.
The nodes in the same level in the forest have the same service delay level, the nodes in different levels have different service delay levels, and the service delay level with the higher service delay upper limit corresponds to the level closer to the root node in the forest structure.
In the field name resolution system, one user can have one or more resolvable service nodes on the same service delay level, but only one node is a main node, and the main node is an ancestor node selected by each level in the node adding process; all master nodes covering each service delay level of a certain user need to satisfy a nesting relationship, that is, the set of users covered by one resolution service node must be a subset of users covered by all ancestor nodes thereof.
As shown in fig. 1, based on this scenario, the present invention provides a method for generating a structure of a hierarchical delay guarantee service system, where the structure of the system is generated by each service node cooperatively in a self-organizing manner, and the method includes: firstly, a node to be added is configured with a service delay grade, a root node list of a current forest structure is obtained through an entrance query node, and a virtual root node in the root node list is replaced; then, starting from the root node list, selecting an ancestor node in each level by the node to be added in the direction from the root to the leaf, iteratively selecting the next-level ancestor node in the child nodes of the ancestor node in the current level layer by layer until finding a father node, and ending iteration; finally, the node to be added acquires the virtual child node list from the father node, and respectively tries to perform the relaying on the child nodes of the nodes in the list, so as to complete the addition of the new node; the selection of the ancestor node and the adoptive of the child node are determined through a time delay measurement technology and a node relation judgment constraint.
In the above technical solution, the virtual node is a logical node that provides an occupancy function for the sake of integrity and connectivity requirements during structure generation, and the virtual node is generated during the joining process of the real node and is located in the same server as the real node.
The structure management function refers to a function module located on each distributed node in the system, and is used for obtaining, storing and updating system structure information in the adding process of the distributed nodes and carrying out inter-node communication and cooperative decision of the distributed nodes when a system structure is constructed. The system structure information includes, but is not limited to: a parent node pointer and a child node list;
in the above technical solution, the root node management system refers to a node that is located outside the hierarchical delay guarantee service system and can provide a root node entry query function for a node to be added, and the system only provides a query service for the root node without performing complex topology calculation and node addition position indication; the provided root node information includes but is not limited to node identification, network address, geographical location and node virtual and real type; and the root node information is registered through the notification message by the service node which is deployed and then serves as the root.
A time delay measurement technology is adopted in the structure generation process of the field name analysis system, and the nodes measure the real round-trip communication time delay of the two nodes to be measured in the joining process. The inter-node delay is defined as follows: if the two nodes are both real nodes, the time delay between the nodes is the communication time delay between the two nodes; if one of the nodes is a virtual node, the inter-node time delay is the average value of the communication time delay from the real node to all the real nodes with the highest lower level of the virtual node.
Ancestor nodes refer to all service nodes which are positioned on the connection path of the current service node and the root node and have higher service level than the current node. In the process of searching ancestor nodes, if a plurality of nodes meet the relationship judgment constraint among the nodes in one level, the nodes with certainty nesting are preferentially selected, and then the node with the minimum time delay among the nodes with possibility of nesting is selected as the ancestor node; if no node satisfies the relationship determination constraint, the newly added node generates a virtual node at the node in the hierarchy and takes the virtual node as an ancestor node of the hierarchy.
As shown in fig. 2, the selection process for the root node includes the following steps:
step 101) comparing the preset time delay level L of the newly added node s s And the highest delay level L of the system r The delay value corresponding to the delay level of s is Ts: if L is s ＝L r Go to step 102); if L is s <L r Go to step 103);
step 102) s, inquiring a set VR consisting of all virtual roots from a root node management system, carrying out deterministic substitution judgment on each node in the VR by s, and adding nodes meeting the judgment into a deterministic substitution set GR: if the GR is not empty, all nodes in the GR are replaced by s, and the node s completes the addition; if GR is empty, s is added as a new root node;
and 103) the subordinate user set in the U is searched, the root node UR to which all the users currently belong in the U is inquired, the UR with the shortest time delay from s in the UR is selected, if the time delay between the UR and the s is less than Tur + Ts, the UR is selected as the root node, the users which do not use the UR as the root node are filtered, and the root node selection process is completed. If no, go to step 104);
and 104) s, inquiring a set R consisting of all real root nodes from the root node management system, sequencing each node R in the R from small to large according to the time delay from the node R to s, sequentially traversing the R, and selecting R as a root if one time delay between the R and the s is smaller than Tr-Ts, thereby finishing the root node selection process. And if the satisfied R cannot be selected, sequentially traversing the R, and if one time delay between the R and the s is smaller than Tr + Ts, selecting the R as a root to finish the root node selection process. If the satisfied r can not be selected, go to step 105);
and 105) s, inquiring a set VR formed by all virtual roots from the root node management system, sequentially traversing the VRs according to the descending order of the time delay from the VR to the s for each node VR in the VR, and selecting VR as the root if the time delay between one VR and one s is less than Tvr-Ts, thereby finishing the root node selection process. If the satisfied VR can not be selected, the VR is traversed in sequence, and for any node q in the subtree of the VR, the distance between q and s is less than 2*L r +L p -L q And selecting vr as a root to complete the root node selection process. If the satisfied vr cannot be selected, s generates a new virtual root.
As shown in FIG. 3, for the process of finding ancestor nodes, the following steps are included:
step 201) s using the selected root node r as the entrance of the current search branch;
step 202), if the delay grade of s is lower than the delay grade of the current search branch by one grade, turning to step 205), otherwise, turning to step 203);
step 203) s inquires all real sub-nodes under the search branch entry node to add the set P to be searched, for each node P in P, sequencing the nodes from small to large according to the time delay from the node P to s, and if the time delay between P and s is smaller than Tp-Ts, selecting P as the entry of a subsequent search branch. If the satisfied P can not be selected, sequentially traversing P, if a time delay between P and s is less than Tp + Ts, selecting P as an entry of a subsequent search branch, and turning to step 202). If the satisfied p can not be selected, go to step 204);
step 204) s inquires all the virtual sub-nodes under the PV to be searched and adds the PV to be searched into the search branch entry node, for each node PV in the PV, the PV is sequentially traversed according to the descending order of the time delay from the node PV to the node s, and if the time delay between one PV and the node s is smaller than Tpv-Ts, the PV is selected as the entry of a subsequent search branch. If the satisfied PV cannot be selected, PV is traversed sequentially, and if there is a delay between PV and s smaller than Tpv + Ts, PV is selected as the entry of the subsequent search branch, go to step 202). If the satisfied pv cannot be selected, s generates a new virtual node and adds it under the current search branch entry.
Step 205) completes the find ancestor node process.
As shown in fig. 4, the process of finding child nodes includes the following steps:
step 301) s adds a set of virtual sibling nodes SV to all virtual children of the selected parent node rf query rf, if SV is null, go to 304). Otherwise go to 302);
step 302) s inquires the child nodes of SV from each node SV in SV, adds the child nodes to be selected to a child node set CS, and for each node CS in CS, sequentially traverses CS according to the sequence from small to large of the time delay from s, finds all CS meeting the condition that the time delay of s is less than Ts-Tcs, and adds the CS to a deterministic child node set GCS. If GCS is not empty, s relays all nodes in GCS by its original father node; go to 304 if GCS is empty);
step 303) s detecting the original father node pp of each adoptive child node, and if the pp factor nodes are adoptively walked to form virtual leaf nodes, circularly deleting the virtual leaf nodes upwards until the virtual leaf nodes do not exist.
Step 304) s, the selection process of the child nodes is completed, and the deployment is completed.
Finally, it should be noted that the above embodiments are only used for illustrating the technical solutions of the present invention and are not limited. Although the present invention has been described in detail with reference to the embodiments, it will be understood by those skilled in the art that various changes may be made and equivalents may be substituted without departing from the spirit and scope of the invention as defined in the appended claims.
Claims (9)
1. A name resolution system construction method that the hierarchical time delay of a distributed type provides, the name resolution system that the said hierarchical time delay of distributed type provides includes administrative system and multiple service provides the node; the method comprises the following steps:
determining the position of each service providing node in a forest structure and the connection relation between each service providing node and other service providing nodes by using the node distance obtained by measuring the actual round-trip delay between the service providing nodes as a basis and determining conditions through the nesting relation; determining all branch nodes between a root node and a father node of a joining position of a service providing node to be joined through an ancestor node finding process; adding the node with lower service delay grade under the service providing node to be added through the process of finding the child node, and adjusting the tree structure accordingly; wherein the content of the first and second substances,
the forest structure specifically includes: each tree in the forest represents a service area, the number of node layers included in one tree corresponds to the service delay level, in the same tree, the root node is the node with the maximum service delay level, the nodes located in the same level in the forest have the same service delay level, and the nodes at the higher level have the higher service delay level than the nodes at the lower level; the nodes comprise real nodes and virtual nodes, and in the construction process of the tree, the virtual nodes are adopted to replace undeployed real nodes so as to form a complete tree structure.
2. The method of claim 1, wherein the name resolution system provided by the distributed hierarchical time delay system,
the real node corresponds to a service providing node which is actually deployed and provides analysis service and system structure management functions for a user;
the virtual node takes an occupation role on the service delay level which is not deployed, and provides a system structure management function; a virtual node without a father node in the system structure is a virtual root node; the virtual node is generated by a real node in the joining process and is carried by a server deployed by the real node generating the virtual node;
the node distance between a virtual node and an actual node is represented by the average value of the node distances between the actual node and all actual nodes at the highest level in a subtree taking the virtual node as the root.
3. The method according to claim 1 or 2, wherein the service delay level corresponds to a specific service delay, and is used to indicate an upper limit of a delay required by a user located in a service coverage area of the service providing node to obtain the service.
4. The method according to claim 3, wherein the service coverage of the service providing node is all user nodes whose distance from the service providing node meets the service delay requirement, sub-tree nodes of the service providing node, and all user nodes of each sub-tree node, and the coverage of tree nodes at different levels are in a nested relationship, and the coverage of nodes at a higher level includes the coverage of nodes at a lower level.
5. The method for building a name resolution system provided by distributed hierarchical delay according to claim 4, wherein the nesting relation determination condition includes:
for two nodes p and r, the respective service delay levels are L respectively p And L r The measurement time delay of the distance between two nodes is D (p, r), and the node q is a real node of the highest layer in a subtree taking r as a root;
when nodes p and r are both real nodes, if D (p, r) < L p +L r Then satisfy the real sectionA point grade determination condition;
when nodes p and r are both real nodes, if L p ＞L r And D (p, r) < L p -L r If yes, the real node tree-sharing judgment condition is met;
when the node p is a real node and r is a virtual node, if L p ＝L r And for all nodes q, there is D (p, q) < L p -L q If so, the judgment condition of the deterministic substitution of the virtual node is met;
when the node p is a real node, r is a virtual node, if L p ＜L r And for all nodes q, there is D (p, q) < 2*L r +L p -L q If yes, the virtual node same tree judgment condition is met; or if L p ＞L r And for all nodes q, D (p, q) < L p +L q If yes, the virtual node grade judgment condition is met;
when the node p is a real node and r is a virtual node, if L p ＜L r And there is one node q such that D (p, q) < | L q -L p If yes, the virtual node identity tree judgment condition is met; or if L p ＞L r And for all nodes q, D (p, q) < L p -L q And then the same-tree judgment condition of the virtual nodes is satisfied.
6. The method for building a distributed hierarchical delay-provided name resolution system according to claim 5, wherein the determining of all branch nodes between the root node and the parent node of the joining location of the service providing node to be joined is performed by an ancestor node finding process; the method specifically comprises the following steps:
step 601) comparing service delay levels L of the service providing nodes s to be added s And the highest service delay level L of the system max : if L is s ＝L max Go to step 602); if L is s ＜L max Go to step 603);
step 602) inquiring all virtual roots from the management system according to the service providing node s to be added to form a set VR, respectively performing virtual node certainty substitution judgment on the service providing node s to be added and each virtual node in the set VR, adding the satisfied virtual nodes into a certainty substitution set GR, and replacing all nodes in the certainty substitution set GR with the service providing node s to be added if GR is not null, and turning to step 609);
step 603) inquiring root nodes to which all users in the known serviceable user set U belong currently according to the known serviceable user set U to be added into the service providing node s to form a set UR, deleting nodes which do not meet the judgment condition of the node grade with the service providing node s to be added in the set UR, selecting the root node UR with the highest priority corresponding to the user, deleting the user of which the root node is not UR, taking UR as the root of the service providing node s to be added, and turning to step 606); if the root node ur can not be selected, go to step 604);
step 604) inquiring all real roots from the management system according to the service providing node s to be added to form a set R, performing real node tree-sharing judgment on the service providing node s to be added and each real node in the set R, and if a real node R meeting judgment conditions exists, turning to step 606 by taking the real node R as a root; if no real node R meeting the judgment condition exists, respectively carrying out real node grade judgment on each node to be added into the service providing nodes s and R, deleting the nodes which do not meet the judgment condition from the set R, sequencing the set R according to the sequence that the time delay between the nodes and the service providing nodes s to be added is from small to large, traversing the set R in sequence to take out the real node R, if the load of the real node R does not exceed a preset load threshold value, taking the real node R as the root of the service providing node s to be added, recording the current node Vcur as R, and turning to step 606); if the real node r meeting the judgment condition can not be selected, turning to step 605);
step 605) inquiring all virtual roots from the management system according to the service providing node s to be added to form a set VR, respectively performing virtual node tree-sharing judgment on the service providing node s to be added and each virtual node in the set VR, and if a virtual node VR meeting judgment conditions exists, taking the virtual node VR as the root of the service providing node s to be added to transfer to step 606); if no virtual node VR meeting the judgment condition exists, respectively carrying out virtual node grade judgment on the service providing node s to be added and each virtual node in the set VR, deleting the unsatisfied virtual node, selecting the virtual node VR with the minimum time delay with the service providing node s to be added from the set VR as the root of the service providing node s to be added, recording the current node Vcur as VR, and turning to step 606); if no virtual node vr meeting the judgment condition exists, the service providing node s to be added generates a new virtual root node, generates all virtual nodes corresponding to the intermediate service delay level, and makes the virtual nodes establish corresponding parent-child relationships according to the level, and goes to step 609);
step 606) the service providing node s to be added records that the current node Vcur is an ancestor node of the layer, the service providing node s to be added inquires all real sub-nodes of the node from Vcur to form a set RC, real node tree-sharing judgment is carried out on each real node to be added in the service providing node s and the RC, if a real node RC meeting the judgment condition exists, the Vcur is equal to RC, and the step 608 is carried out); if no real node meeting the judgment condition exists, respectively carrying out real node grade judgment on each node to be added into the service providing node s and the RC, deleting the nodes which do not meet the judgment condition from the set RC, sequencing the set RC according to the sequence that the time delay between the nodes to be added and the service providing node s is from small to large, sequentially traversing the set RC to take out the real node RC, and if the load of the real node RC does not exceed the preset load threshold, making Vcur equal to RC, and turning to a step 606); if the real node rc meeting the judgment condition cannot be selected, go to step 607);
step 607) the service providing node s to be added inquires all the virtual sub-nodes thereof from the Vcur to form a set VC, respectively carries out virtual node tree-sharing judgment on the service providing node s to be added and each virtual node in the set VC, and if a virtual node VC meeting the judgment condition exists, the Vcur is made equal to the VC, and the step 608 is switched to; if no virtual node meeting the judgment condition exists, respectively carrying out virtual node grade judgment on the service providing node s to be added and each virtual node in the set VC, deleting the unsatisfied virtual node, selecting VC with the minimum time delay with the service providing node s to be added from the set VC, and enabling Vcur to be equal to VC, and turning to step 608); if no virtual node meeting the judgment condition exists, the node s to be added into the service provides a new virtual node, generates all virtual nodes corresponding to the intermediate service delay level, and makes the virtual nodes establish corresponding parent-child relationships according to the levels, and goes to step 609);
step 608) if the service delay level of the service providing node s to be added is lower than the service delay level of Vcur by one level, go to step 609); otherwise go to step 606);
step 609) the to-be-added service providing node s completes the process of finding the ancestor node.
7. The method for constructing a name resolution system provided by distributed hierarchical delay according to claim 6, wherein the node with a lower service delay level is added below the node to be added by the process of finding child nodes, and the tree structure is adjusted accordingly; the method specifically comprises the following steps:
step 701) if the father node f is a real node and the father node f has no child node, the child node to be added to the service providing node s is empty, s is a leaf node, and step 706 is executed; otherwise go to step 702);
step 702) if the father node f is a virtual node and the father node f has no child node, the child node of the service providing node s to be added is empty, s is a leaf node, and step 706 is executed; otherwise go to step 703);
step 703) obtaining all virtual child nodes of the father node f by inquiring according to the service providing node s to be added, forming a virtual brother node set SV, if the SV is empty, the child node of the service providing node s to be added is empty, and turning to step 706); otherwise, go to step 704);
step 704) according to the service providing node s to be added, inquiring the child nodes of each virtual brother node in the virtual brother node set SV to form a child node set CS to be selected, performing virtual node tree-sharing judgment on the service providing node s to be added and each node in the child node set CS to be selected, adding the virtual nodes meeting the judgment conditions into the deterministic child node set GCS, initiating a relay invitation request to all nodes in the deterministic child node set GSS by the service providing node s to be added, deleting the nodes rejected by reply from the deterministic child node set GSS, if the GSS is not null, then relaying all the nodes in the deterministic child node set GSS by the service providing node s to be added to the self, and turning to step 705);
step 705) the to-be-added service providing node s detects the original father node of each adoptive child node, if the factor node is adoptively formed into a virtual leaf node, the factor node circularly deletes the virtual leaf node upwards until the branch does not have the virtual leaf node, and then the step 706 is executed);
step 706) the find child node process ends.
8. The method for constructing a name resolution system provided by distributed hierarchical time delay according to claim 7, wherein the service providing node s to be added relays all nodes of the deterministic sub-node set GSS under itself; the method specifically comprises the following steps:
and changing the father node of the selected child node in the deterministic child node set GSS into the service providing node s to be added, notifying the original father node of the selected child node, and deleting the child node from the child node list.
9. The method according to claim 8, wherein the management system adopts a weakly centralized deployment to receive information reported by the finite nodes, wherein the information reported by the service providing nodes serving as root nodes includes node identifiers, network addresses, geographical locations, node virtual and real types, and node states; a root node query service is provided but does not perform computation and analysis of complex topologies.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| PCT/CN2021/121622 WO2022262145A1 (en) | 2021-06-18 | 2021-09-29 | Method for constructing name resolution system of distributed hierarchical delay provision |
Applications Claiming Priority (2)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2021106776887 | 2021-06-18 | ||
| CN202110677688 | 2021-06-18 |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN115499285A true CN115499285A (en) | 2022-12-20 |
| CN115499285B CN115499285B (en) | 2023-11-24 |
Family
ID=84464217
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202111137585.8A Active CN115499285B (en) | 2021-06-18 | 2021-09-27 | Method for constructing name resolution system provided by distributed hierarchical time delay |
Country Status (2)
| Country | Link |
|---|---|
| CN (1) | CN115499285B (en) |
| WO (1) | WO2022262145A1 (en) |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20050102294A1 (en) * | 2000-01-03 | 2005-05-12 | Dirk Coldewey | Method for prefetching recursive data structure traversals |
| CN1835451A (en) * | 2005-03-15 | 2006-09-20 | 北京航空航天大学 | Mesh information management system based on forest structure |
| CN103631870A (en) * | 2013-11-06 | 2014-03-12 | 广东电子工业研究院有限公司 | System and method used for large-scale distributed data processing |
| CN110633667A (en) * | 2019-09-11 | 2019-12-31 | 沈阳航空航天大学 | Action prediction method based on multitask random forest |
| CN112699091A (en) * | 2021-01-04 | 2021-04-23 | 国网电子商务有限公司 | Distributed file sharing system and method |
Family Cites Families (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US7460583B2 (en) * | 2003-12-15 | 2008-12-02 | Telefonaktiebolaget Lm Ericsson (Publ) | Method for path searching and verification |
| US20080304421A1 (en) * | 2007-06-07 | 2008-12-11 | Microsoft Corporation | Internet Latencies Through Prediction Trees |
| US8937886B2 (en) * | 2010-12-17 | 2015-01-20 | Cisco Technology, Inc. | Dynamic reroute scheduling in a directed acyclic graph (DAG) |
| CN109947764B (en) * | 2017-09-18 | 2020-12-22 | 中国科学院声学研究所 | Query enhancement system and method for constructing elastic site based on time delay |
-
2021
- 2021-09-27 CN CN202111137585.8A patent/CN115499285B/en active Active
- 2021-09-29 WO PCT/CN2021/121622 patent/WO2022262145A1/en unknown
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20050102294A1 (en) * | 2000-01-03 | 2005-05-12 | Dirk Coldewey | Method for prefetching recursive data structure traversals |
| CN1835451A (en) * | 2005-03-15 | 2006-09-20 | 北京航空航天大学 | Mesh information management system based on forest structure |
| CN103631870A (en) * | 2013-11-06 | 2014-03-12 | 广东电子工业研究院有限公司 | System and method used for large-scale distributed data processing |
| CN110633667A (en) * | 2019-09-11 | 2019-12-31 | 沈阳航空航天大学 | Action prediction method based on multitask random forest |
| CN112699091A (en) * | 2021-01-04 | 2021-04-23 | 国网电子商务有限公司 | Distributed file sharing system and method |
Also Published As
| Publication number | Publication date |
|---|---|
| WO2022262145A1 (en) | 2022-12-22 |
| CN115499285B (en) | 2023-11-24 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Cheng et al. | Building a big data platform for smart cities: Experience and lessons from santander | |
| EP2252949B1 (en) | Efficient stream sharing for multi-user sensor data collection | |
| CN104995870A (en) | Multi-objective server placement determination | |
| Gavalas et al. | An approach for near-optimal distributed data fusion in wireless sensor networks | |
| CN110932981B (en) | Data exchange system supporting automatic routing | |
| WO2022227303A1 (en) | Information processing method and apparatus, computer device, and storage medium | |
| CN107889183B (en) | Data transmission method and device | |
| Zhu et al. | Shape segmentation and applications in sensor networks | |
| CN114090244A (en) | Service arranging method, device, system and storage medium | |
| CN102882979B (en) | Data acquisition based on cloud computing system and the system and method collecting shunting | |
| Zheng et al. | Reliable path planning for bus networks considering travel time uncertainty | |
| CN101251843A (en) | Full distributed duplicate copy positioning method for data grid | |
| Fernández et al. | Distributed slicing in dynamic systems | |
| CN112989137A (en) | Entity relationship analysis method for complex network information system construction | |
| CN110059795A (en) | A kind of mobile subscriber's node networking method merging geographical location and temporal characteristics | |
| CN113641869A (en) | Digital object access method and system in man-machine-object fusion environment | |
| CN115499285B (en) | Method for constructing name resolution system provided by distributed hierarchical time delay | |
| CN112328877A (en) | Skyline inquiry method for multiple users on time-dependent road network | |
| JP2021536606A (en) | Data sample template (DST) management to enable fog-based data processing | |
| Kallab et al. | Automatic K-resources discovery for hybrid web connected environments | |
| CN112836145B (en) | Neighbor query method facing mobile object in dynamic directed road network | |
| Prasad et al. | A k-clique based clustering protocol for resource discovery in p2p network | |
| CN109104466B (en) | WoT resource management method based on P2P | |
| CN105007190A (en) | P2P networking quality optimization method | |
| CN114697221B (en) | Reliability mapping algorithm based on snapshot tree model in space-earth integrated network |
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 |