CN110958144B - Method and device for acquiring network - Google Patents

Method and device for acquiring network Download PDF

Info

Publication number
CN110958144B
CN110958144B CN201911198325.4A CN201911198325A CN110958144B CN 110958144 B CN110958144 B CN 110958144B CN 201911198325 A CN201911198325 A CN 201911198325A CN 110958144 B CN110958144 B CN 110958144B
Authority
CN
China
Prior art keywords
plane
target
ranking
resource consumption
unit area
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
Application number
CN201911198325.4A
Other languages
Chinese (zh)
Other versions
CN110958144A (en
Inventor
侯琛
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Tencent Technology Shenzhen Co Ltd
Original Assignee
Tencent Technology Shenzhen Co Ltd
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by Tencent Technology Shenzhen Co Ltd filed Critical Tencent Technology Shenzhen Co Ltd
Priority to CN201911198325.4A priority Critical patent/CN110958144B/en
Publication of CN110958144A publication Critical patent/CN110958144A/en
Application granted granted Critical
Publication of CN110958144B publication Critical patent/CN110958144B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L41/00Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
    • H04L41/14Network analysis or design
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L41/00Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
    • H04L41/06Management of faults, events, alarms or notifications
    • H04L41/0654Management of faults, events, alarms or notifications using network fault recovery
    • H04L41/0663Performing the actions predefined by failover planning, e.g. switching to standby network elements
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L41/00Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
    • H04L41/06Management of faults, events, alarms or notifications
    • H04L41/0654Management of faults, events, alarms or notifications using network fault recovery
    • H04L41/0668Management of faults, events, alarms or notifications using network fault recovery by dynamic selection of recovery network elements, e.g. replacement by the most appropriate element after failure

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
  • Mobile Radio Communication Systems (AREA)

Abstract

The application discloses a method and a device for acquiring a network, and belongs to the technical field of computers. The method comprises the following steps: acquiring the distance corresponding to each plane of a target subnetwork and the unit area resource consumption corresponding to each plane, wherein the distance corresponding to any plane is the distance between any plane and a plane parallel to any plane in a parent network; determining a target ranking result based on the distance corresponding to each plane and the resource consumption of each plane in unit area, wherein the target ranking result is a ranking result which enables the total resource consumption required by the target sub-network to meet the condition; and sequentially acquiring each plane based on the target ranking of each plane in the target ranking result until a target sub-network is obtained. Based on the above process, the distances corresponding to the planes and the resource consumption of the unit area corresponding to the planes are comprehensively considered, so that the total resource consumption required for obtaining the target sub-network can be reduced, and the comprehensive effect of the obtained target sub-network is favorably improved.

Description

Method and device for acquiring network
Technical Field
The embodiment of the application relates to the technical field of computers, in particular to a method and a device for acquiring a network.
Background
With the development of network technology, there is an increasing need to acquire a sub-network with certain characteristics in a parent network to replace the failed parent network with the sub-network to continue normal operation. For example, a sub-network in which each plane is parallel to the plane of the parent network is acquired in the parent network, and the sub-network is used to replace the parent network for normal operation.
In the related art, the process of acquiring a sub-network in a parent network is as follows: determining the distance corresponding to each plane of the sub-network to be acquired, wherein the distance corresponding to each plane is the distance between the plane and a plane parallel to the plane in the parent network; and sequentially acquiring each plane of the sub-network in any order according to the corresponding distance of each plane until the sub-network is obtained.
In the course of implementing the present application, the inventors found that the related art has at least the following problems:
in the related art, the planes of the subnets are sequentially acquired in an arbitrary order, and since resource consumption per unit area corresponding to each plane of the subnetwork may be different, in such a process of acquiring the subnetwork, total resource consumption required may be large, and an overall effect of the acquired subnetwork is poor.
Disclosure of Invention
The embodiment of the application provides a method and a device for acquiring a network, which can be used for solving the problems in the related art. The technical scheme is as follows:
in one aspect, an embodiment of the present application provides a method for acquiring a network, where the method includes:
acquiring the distance corresponding to each plane of a target subnetwork and the resource consumption of unit area corresponding to each plane, wherein the distance corresponding to any plane is the distance between any plane and a plane parallel to any plane in a parent network;
determining a target ranking result based on the distance corresponding to each plane and the resource consumption amount per unit area corresponding to each plane, wherein the target ranking result is a ranking result which enables the total resource consumption amount required for acquiring the target sub-network to meet a reference condition, the target ranking result comprises a target ranking of each plane, and the target ranking of any plane is used for indicating the acquired rank of any plane;
and sequentially acquiring each plane based on the target ranking of each plane in the target ranking result until the target sub-network is obtained.
In another aspect, an apparatus for acquiring a network is provided, the apparatus including:
the first acquisition module is used for acquiring the distance corresponding to each plane of a target subnetwork and the resource consumption of unit area corresponding to each plane, wherein the distance corresponding to any plane is the distance between any plane and a plane parallel to any plane in a parent network;
a determining module, configured to determine a target ranking result based on the distance corresponding to each plane and the resource consumption amount per unit area corresponding to each plane, where the target ranking result is a ranking result such that a total resource consumption amount required for acquiring the target subnetwork meets a reference condition, the target ranking result includes a target ranking of each plane, and the target ranking of any plane is used to indicate a rank of the acquired any plane;
and the second acquisition module is used for sequentially acquiring each plane based on the target ranking of each plane in the target ranking result until the target sub-network is obtained.
In one possible implementation, the determining module includes:
a selecting unit configured to select a first plane and a second plane from the planes;
a determining unit, configured to determine a ranking front-back order of the first plane and the second plane based on a first distance corresponding to the first plane and a first resource consumption per unit area corresponding to the first plane, and a second distance corresponding to the second plane and a second resource consumption per unit area corresponding to the second plane;
the determining unit is further configured to determine an initial ranking result based on a front-back order of the rankings of the first plane and the second plane, where the initial ranking result includes the ranking of the first plane and the ranking of the second plane;
the selecting unit is further configured to select a third plane from the planes, where the third plane is any one of the planes except the first plane and the second plane;
the determining unit is further configured to determine an updated initial ranking result based on the third plane, where the updated initial ranking result includes an updated ranking of the first plane, an updated ranking of the second plane, and a ranking of the third plane;
the determining unit is further configured to repeat the above steps until the updated initial ranking result includes the target ranking of each plane, so as to obtain a target ranking result.
In a possible implementation manner, the determining unit is further configured to select planes in sequence according to the ranking order in the initial ranking result, and compare the planes with the third plane until the updated initial ranking result is determined.
In one possible implementation, the ranking order is a back-to-front ranking order; the determining unit is further configured to determine a ranking front-back order of a first target plane and a third plane based on a distance corresponding to the first target plane and a resource consumption amount per unit area corresponding to the first target plane, and a third distance corresponding to the third plane and a resource consumption amount per unit area corresponding to the third plane, where the first target plane is a plane ranked the most back in the initial ranking result;
when the ranking front and back orders of the first target plane and the third plane are that the ranking of the first target plane is front and the ranking of the third plane is back, directly determining an updated initial ranking result;
when the pre-and-post ranking order of the first target plane and the third plane is that the third plane is ranked first and the first target plane is ranked later, determining the pre-and-post ranking order of the second target plane and the third plane based on the distance corresponding to the second target plane and the resource consumption per unit area corresponding to the second target plane, and the third distance corresponding to the third plane and the resource consumption per unit area corresponding to the third plane, and determining an updated initial ranking result based on the pre-and-post ranking order of the second target plane and the third plane, wherein the second target plane is a plane ranked one bit before the first target plane in the initial ranking result.
In one possible implementation, the ranking order is the order of ranking from front to back; the determining unit is further configured to determine a ranking front-back order of a third target plane and the third plane based on a distance corresponding to the third target plane and a resource consumption amount per unit area corresponding to the third target plane, and a third distance corresponding to the third plane and a resource consumption amount per unit area corresponding to the third plane, where the third target plane is a plane ranked the most front in the initial ranking result;
when the ranking of the third target plane and the third plane is front and rear, the updated initial ranking result is directly determined;
when the rank front-back order of the third target plane and the third plane is that the third target plane is ranked first and the third plane is ranked later, determining the rank front-back order of the fourth target plane and the third plane based on the distance corresponding to the fourth target plane and the resource consumption per unit area corresponding to the fourth target plane, and the third distance corresponding to the third plane and the resource consumption per unit area corresponding to the third plane, and determining an updated initial ranking result based on the rank front-back order of the fourth target plane and the third plane, wherein the fourth target plane is a plane ranked next to the third target plane in the initial ranking result.
In a possible implementation manner, the determining unit is further configured to determine a first target parameter corresponding to the first plane based on the first distance and the second resource consumption per unit area; determining a second target parameter corresponding to the second plane based on the second distance and the first resource consumption per unit area;
determining the ranking front and back order of the first plane and the second plane based on the magnitude relation of the first target parameter and the second target parameter.
In a possible implementation manner, the determining unit is further configured to use a product of the first distance and the second resource consumption per unit area as a first target parameter corresponding to the first plane; and taking the product of the second distance and the first resource consumption per unit area as a second target parameter corresponding to the second plane.
In a possible implementation manner, the determining unit is further configured to, when the size relationship between the first target parameter and the second target parameter is that the first target parameter is greater than the second target parameter, rank order of the first plane and the second plane is that the first plane is ranked first and the second plane is ranked next;
when the size relationship between the first target parameter and the second target parameter is that the first target parameter is smaller than the second target parameter, the ranking order of the first plane and the second plane is that the second plane is ranked first and the first plane is ranked second;
when the size relationship between the first target parameter and the second target parameter is that the first target parameter is equal to the second target parameter, the front and back ranks of the first plane and the second plane are sequentially the first plane with the front rank and the second plane with the back rank, or the second plane with the front rank and the first plane with the back rank.
In one possible implementation manner, the parent network is a narrowband internet of things, and the target sub-network is a homomorphic parallel sub-network of the narrowband internet of things.
In another aspect, a computer device is provided, which includes a processor and a memory, where at least one program code is stored in the memory, and the at least one program code is loaded and executed by the processor to implement any one of the above methods for acquiring a network.
In another aspect, a computer-readable storage medium is provided, in which at least one program code is stored, and the at least one program code is loaded and executed by a processor to implement any of the above-mentioned methods for acquiring a network.
The technical scheme provided by the embodiment of the application at least has the following beneficial effects:
determining a target ranking result which enables the total resource consumption required by the target sub-network to meet the condition based on the distance corresponding to each plane and the resource consumption of each plane in unit area; and then sequentially acquiring each plane based on the target ranking of each plane in the target ranking result until a target sub-network is obtained. In the process of acquiring the network, the distances corresponding to the planes and the resource consumption of the unit area corresponding to the planes are comprehensively considered, so that the total resource consumption required for acquiring the target sub-network can be reduced, and the comprehensive effect of the acquired target sub-network is favorably improved.
Drawings
In order to more clearly illustrate the technical solutions in the embodiments of the present application, the drawings needed to be used in the description of the embodiments are briefly introduced below, and it is obvious that the drawings in the following description are only some embodiments of the present application, and it is obvious for those skilled in the art to obtain other drawings based on these drawings without creative efforts.
Fig. 1 is a schematic diagram of an implementation environment of a method for acquiring a network according to an embodiment of the present application;
fig. 2 is a flowchart of a method for acquiring a network according to an embodiment of the present disclosure;
FIG. 3 is a schematic diagram of a homomorphic parallel subnetwork provided in an embodiment of the present application;
fig. 4 is a schematic diagram of a parent network provided in an embodiment of the present application;
FIG. 5 is a schematic diagram of a process for determining a target ranking result according to an embodiment of the present disclosure;
FIG. 6 is a diagram of a system hardware platform provided in an embodiment of the present application;
fig. 7 is a schematic diagram of an apparatus for acquiring a network according to an embodiment of the present application;
FIG. 8 is a block diagram of a determining module according to an embodiment of the present disclosure;
fig. 9 is a schematic structural diagram of a device for acquiring a network according to an embodiment of the present application.
Detailed Description
To make the objects, technical solutions and advantages of the present application more clear, embodiments of the present application will be described in further detail below with reference to the accompanying drawings.
The terms "first," "second," and the like in the description and in the claims of the present application and in the above-described drawings are used for distinguishing between similar elements and not necessarily for describing a particular sequential or chronological order. It is to be understood that the data so used is interchangeable under appropriate circumstances such that the embodiments of the application described herein are capable of operation in sequences other than those illustrated or described herein. The embodiments described in the following exemplary embodiments do not represent all embodiments consistent with the present application. Rather, they are merely examples of apparatus and methods consistent with certain aspects of the present application, as detailed in the appended claims.
With the development of network technology, there is an increasing need to acquire a sub-network with certain characteristics in a parent network to replace the failed parent network with the sub-network to continue normal operation. For example, a sub-network in which each plane is parallel to the plane of the parent network is acquired in the parent network, and the sub-network is used to replace the parent network for normal operation. In acquiring the sub-networks, the total resource consumption amount required for acquiring the sub-networks is an important index for evaluating the comprehensive effect of the acquired sub-networks.
In view of the above, an embodiment of the present application provides a method for acquiring a network to acquire a target sub-network in a parent network, please refer to fig. 1, which illustrates a schematic diagram of an implementation environment of the method for acquiring a network according to the embodiment of the present application. The implementation environment may include: a server 11 and a network 12.
The server 11 may obtain relevant information of the network 12, and then store the obtained information, where the relevant information includes, but is not limited to, network element information in the network 12, connection relationship information of planes formed by the network elements, and the like. Of course, based on the stored relevant information of the server 12, the server may also determine the distance corresponding to each plane of the sub-network to be obtained and the unit resource consumption amount corresponding to each plane of the sub-network to be extracted, further determine a target ranking result, and sequentially obtain each plane of the sub-network in the network 12 based on the target ranking result until the target sub-network is obtained.
In a possible implementation manner, the server 11 may be one server, a server cluster composed of multiple servers, or a cloud computing service center. Network 12 may refer to any network that supports acquisition of sub-networks, such as the Internet of things, Internet of vehicles, and so forth.
It should be understood by those skilled in the art that the server 11 and the network 12 are only examples, and other existing or future servers or networks may be suitable for the present application, and are included within the scope of the present application and are incorporated herein by reference.
Based on the implementation environment shown in fig. 1, an embodiment of the present application provides a method for acquiring a network, which is applied to a server as an example. As shown in fig. 2, the method provided by the embodiment of the present application may include the following steps:
in step 201, the distances corresponding to the planes of the target subnetwork and the resource consumption per unit area corresponding to the planes are obtained.
The target subnetwork refers to the subnetwork that needs to be extracted from the parent network. The parent network refers to a network from which a child network is allowed to be obtained, and the type of the parent network is not limited in the embodiment of the present application, for example, the parent network may refer to an internet of things, and may also be an internet of vehicles. In the embodiment of the present application, the target sub-network is any one of the parallel sub-networks of the parent network. The meaning of parallel sub-networks is presented next: if there are two networks, any one plane of one network is parallel to the plane of the other network, then the two networks are called parallel networks; if two networks are parallel to each other and one network is a sub-network of the other network, then the sub-network is said to be a parallel sub-network of the other network (referred to as the parent network).
In one possible implementation, the target sub-network may also be a homomorphic sub-network of the parent network, that is, the target sub-network is a homomorphic parallel sub-network of the parent network. Wherein, the meaning of isomorphic parallel sub-networks is: if one network is a parallel sub-network of another network (called parent network), and the number of planes and the connection relationship between the planes of the sub-network are the same as those of the parent network corresponding to the sub-network, the sub-network is called a homomorphic parallel sub-network of the latter. As shown in fig. 3, the network 1 is a parent network, the network 2 is a child network, and the network 2 is a homomorphic parallel child network of the network 1.
The isomorphic parallel sub-networks acquired in the parent network can reduce the mutual interference of network elements in the network on the basis of keeping the original performance of the parent network to a greater extent. In an actual application scenario, some network elements in the parent network may fail, so that the parent network cannot work normally. At this time, isomorphic parallel sub-networks can be acquired in the parent network to work instead of the parent network.
The target sub-network may be determined based on the actual behavior of the parent network, e.g. parallel sub-networks that avoid the faulty network element are the target sub-networks. The embodiment of the present application does not limit the manner of determining the position and size of the target subnetwork to be acquired.
After the position and the size of the target sub-network are determined, the distance corresponding to each plane of the target sub-network and the unit area resource consumption corresponding to each plane can be obtained. And the distance corresponding to any plane is the distance between any plane and a plane parallel to any plane in the parent network. For example, as shown in fig. 3, the network 2 is a target subnetwork, and the distance corresponding to the plane a of the network 2 is a distance a. The method for obtaining the distances corresponding to the planes of the target subnetwork may be to measure the distances corresponding to the planes of the target subnetwork after the target subnetwork is determined, or may be to extract the distances corresponding to the planes from the stored data, which is not limited in the embodiment of the present application.
The resource consumption per unit area corresponding to any plane refers to the ratio of the total resource consumption required by obtaining any plane to the area of the plane where any plane is located. It should be noted that, in the embodiment of the present application, the plane in which any plane is located refers to a plane limited in a parent network, for example, as shown in fig. 3, the plane in which the plane a is located is limited in the network 1. In addition, the unit of the area of the plane where any plane is located is not limited in the embodiments of the present application, and may be, for example, square meters, square decimeters, or square centimeters.
In an actual application scenario, the manner of acquiring any plane is to cut any plane from a parent network. In one possible implementation, the way to cut any plane out of the parent network may be: and powering off all network elements of the plane where any plane is located. In the process of powering off all network elements of a plane where any plane is located, the server needs to send a power-off instruction to the power control units of the network elements, and the power control units of the network elements execute power-off operation according to the power-off instruction. In the process that the server sends the power-off instruction and the power control unit executes the power-off operation, resources such as a broadband and a memory need to be consumed, and the sum of various resources consumed for powering off each network element is used as the total resource consumption needed for obtaining any plane.
It should be noted that the resource consumption per unit area corresponding to any plane may be predetermined and stored, and then after determining the target subnetwork to be acquired, the resource consumption per unit area corresponding to each plane of the target subnetwork is extracted from the storage. The embodiment of the present application does not limit the manner of determining the resource consumption per unit area corresponding to any plane. For example, the resource consumption per unit area corresponding to any plane may be determined empirically or may be determined based on actual measurement results.
In the process of acquiring the target sub-network, resource consumption amounts of unit areas corresponding to different planes of the target sub-network may be different, and due to different distances corresponding to the different planes, areas of planes to be cut corresponding to the same plane may be different in different acquisition orders, so that total resource consumption amounts required for acquiring the target sub-network according to the different acquisition orders are also different.
In one possible implementation, the parent network is a narrowband Internet of Things (NB-IoT) and the target subnetwork is a homomorphic parallel subnetwork of the narrowband Internet of Things. The narrow-band Internet of things is an Internet of things technology, is an important branch of the internet of everything, has the characteristics of low cost, low power consumption, wide coverage and the like, is positioned in the low-speed Internet of things market of an operator grade and based on authorized spectrum, and has a wide application prospect. NB-IoT is an emerging technology in the field of internet of things (IoT), supports cellular data connectivity of Low-Power devices over Wide Area networks, and is also called Low-Power Wide-Area Network (LPWAN). NB-IoT supports efficient connectivity for devices with long standby time and high requirements for network connectivity. A schematic diagram of a narrowband internet of things may be as shown in fig. 4, where the narrowband internet of things includes a plurality of NB-IoT sensors, such as a0, a1, a2, A3, B0, C0, D0, E0, and so on, as shown in fig. 4.
In step 202, a target ranking result is determined based on the distance corresponding to each plane and the resource consumption per unit area corresponding to each plane, and the target ranking result is a ranking result such that the total resource consumption required for obtaining the target sub-network satisfies the condition.
The target ranking result is a ranking result such that the total resource consumption amount required to acquire the target sub-network satisfies the condition. The condition that the total resource consumption amount required for obtaining the target sub-network satisfies may be that the total resource consumption amount required for obtaining the target sub-network is the lowest when the ranking result is determined based on the distance corresponding to each plane and the resource consumption amount per unit area corresponding to each plane. The target ranking result comprises target rankings of the planes, and the target ranking of any one plane is used for indicating the acquired order of any one plane. For example, when the target rank of plane a of the target subnetwork in the target ranking result is 2 nd, then in the process of acquiring the target subnetwork, the 2 nd acquires plane a.
In one possible implementation, as shown in fig. 5, the process of determining the target ranking result based on the distance corresponding to each plane and the resource consumption amount per unit area corresponding to each plane includes steps 2021 to 2025:
step 2021: selecting a first plane and a second plane from the planes, and determining the ranking order of the first plane and the second plane based on a first distance corresponding to the first plane and a first resource consumption per unit area corresponding to the first plane, and a second distance corresponding to the second plane and a second resource consumption per unit area corresponding to the second plane.
In the process of obtaining the target ranking result, two planes are selected randomly from each plane of the target sub-network, and the two planes are used as a first plane and a second plane. Taking the distance corresponding to the first plane as a first distance, taking the resource consumption per unit area corresponding to the first plane as a first resource consumption per unit area, taking the distance corresponding to the second plane as a second distance, and taking the resource consumption per unit area corresponding to the second plane as a second resource consumption per unit area; and then determining the ranking front and back order of the first plane and the second plane based on the first distance, the first resource consumption per unit area, the second distance and the second resource consumption per unit area.
It should be noted that the determining of the rank order of the first plane and the second plane is to determine the order of acquiring the first plane and the second plane in the process of acquiring the target subnetwork. If the front and back ranks of the first plane and the second plane are the first rank of the first plane and the second rank of the second plane, the first plane is obtained first and then the second plane is obtained in the process of obtaining the target sub-network; if the front and back ranks of the first plane and the second plane are the rank of the second plane before and the rank of the first plane after, the second plane is acquired first and then the first plane is acquired in the process of acquiring the target sub-network.
In one possible implementation, based on the first distance, the first resource consumption per unit area, the second distance, and the second resource consumption per unit area, the determining the rank order of the first plane and the second plane is as follows: determining a first target parameter corresponding to the first plane based on the first distance and the resource consumption of the second unit area; determining a second target parameter corresponding to the second plane based on the second distance and the first unit area resource consumption; and determining the ranking front-rear order of the first plane and the second plane based on the size relation of the first target parameter and the second target parameter.
In a possible implementation manner, based on the first distance and the second resource consumption per unit area, the first target parameter corresponding to the first plane is determined, and based on the second distance and the first resource consumption per unit area, the second target parameter corresponding to the second plane is determined in a manner that: taking the product of the first distance and the second unit area resource consumption as a first target parameter corresponding to the first plane; and taking the product of the second distance and the resource consumption of the first unit area as a second target parameter corresponding to the second plane.
Illustratively, assume that the first distance is d1The first resource consumption per unit area is c1Of 1 atTwo distances are d2The second resource consumption per unit area is c2The first target parameter is y1The second target parameter is y2Then y is1=d1*c2,y2=d2*c1
In one possible implementation manner, based on the magnitude relationship between the first target parameter and the second target parameter, the determining of the rank order of the first plane and the second plane is as follows: when the size relationship between the first target parameter and the second target parameter is that the first target parameter is larger than the second target parameter, the front and back ranks of the first plane and the second plane are that the first plane is ranked before and the second plane is ranked after; when the size relationship between the first target parameter and the second target parameter is that the first target parameter is smaller than the second target parameter, the front and back ranks of the first plane and the second plane are that the rank of the second plane is before and the rank of the first plane is after; when the size relationship between the first target parameter and the second target parameter is that the first target parameter is equal to the second target parameter, the front and back ranks of the first plane and the second plane are sequentially the first plane ranked first and the second plane ranked second, or the second plane ranked first and the first plane ranked second.
That is, when the first target parameter is greater than the second target parameter, in the process of acquiring the target subnetwork, the first plane is acquired first, and then the second plane is acquired; when the first target parameter is smaller than the second target parameter, in the process of acquiring the target sub-network, acquiring the second plane first and then acquiring the first plane; when the first target parameter is equal to the second target parameter, in the process of acquiring the target subnetwork, the first plane may be acquired first, and then the second plane may be acquired, or the second plane may be acquired first, and then the first plane may be acquired.
After determining the ranking front-to-back order of the first plane and the second plane, step 2 is performed to determine an initial ranking result.
Step 2022: based on the rank order of the first plane and the second plane, an initial ranking result is determined, the initial ranking result comprising a rank of the first plane and a rank of the second plane.
After the ranking of the first plane and the ranking of the second plane are determined, the ranking of the first plane and the ranking of the second plane can be determined, and the ranking of the first plane and the ranking of the second plane are used as an initial ranking result.
It should be noted that only the rankings of the planes in the determined ranking order are included in the initial ranking result. Since only the rank order of the first plane and the second plane is determined at this time, only the rank of the first plane and the rank of the second plane are included in the initial result at this time.
Illustratively, based on the ranking order of the first plane and the second plane, the manner of determining the initial ranking result is as follows: when the front and back ranks of the first plane and the second plane are that the first plane ranks at the front and the second plane ranks at the back, the initial ranking result is that the rank of the first plane is the 1 st and the rank of the second plane is the 2 nd; when the first plane and the second plane are ranked before and after the second plane and the first plane is ranked after the second plane, the initial ranking result is that the second plane is ranked as the 1 st and the first plane is ranked as the 2 nd.
Step 2023: and selecting a third plane from the planes, wherein the third plane is any one of the planes except the first plane and the second plane.
After determining an initial ranking result comprising the ranking of the first plane and the ranking of the second plane, a third plane is selected among the planes of the target subnetwork. And the third plane is any one of the planes of the target sub-network except the first plane and the second plane. The embodiment of the present application does not limit the manner of selecting the third plane, and for example, one plane is randomly selected as the third plane from among planes other than the first plane and the second plane.
Step 2024: based on the third plane, an updated initial ranking result is determined, the updated initial ranking result including an updated ranking of the first plane, an updated ranking of the second plane, and a ranking of the third plane.
After the third plane is selected, the initial ranking result may be updated, and the updated initial ranking result is determined. At this time, the updated initial ranking result includes the updated ranking of the first plane, the updated ranking of the second plane, and the ranking of the third plane. It should be noted that the rank of the updated first plane may be the same as or different from the rank of the first plane before updating, and this is not limited in this embodiment of the application.
In one possible implementation, based on the third plane, the updated initial ranking result is determined by: and sequentially selecting the planes and the third plane for comparison according to the ranking sequence in the initial ranking result until the updated initial ranking result is determined. The ranking order in the initial ranking result comprises the following two conditions:
the first condition is as follows: the ranking order is the order of the ranking from back to front.
Under the condition, according to the ranking sequence in the initial ranking result, sequentially selecting the planes and the third plane for comparison until the updated initial ranking result is determined, wherein the process comprises the following three steps:
step 1: and determining the ranking front and back orders of the first target plane and the third plane based on the distance corresponding to the first target plane and the resource consumption per unit area corresponding to the first target plane, and the third distance corresponding to the third plane and the resource consumption per unit area corresponding to the third plane.
Wherein the first target plane is a plane ranked most backward in the initial ranking result. Since only the rank of the first plane and the rank of the second plane are included in the initial ranking result at this time. Therefore, if the initial ranking result is that the ranking of the first plane is the 1 st and the ranking of the second plane is the 2 nd, the first target plane is the second plane; and if the initial ranking result is that the ranking of the second plane is the 1 st and the ranking of the first plane is the 2 nd, the first target plane is the first plane.
Next, the following description will be given taking as an example the ranking of the first plane as the 1 st ranking and the ranking of the second plane as the 2 nd ranking. At this time, the first target plane is a second plane, the distance corresponding to the first target plane is a second distance, and the resource consumption per unit area corresponding to the first target plane is a second resource consumption per unit area.
In a case that the first target plane is the second plane, based on the distance corresponding to the first target plane and the resource consumption per unit area corresponding to the first target plane, and the third distance corresponding to the third plane and the resource consumption per unit area corresponding to the third plane, the process of determining the order of the first target plane and the third target plane before and after ranking may be: and taking the product of the second distance and the third resource consumption per unit area as an updated second target parameter corresponding to the second plane, taking the product of the third distance and the second resource consumption per unit area as a third target parameter corresponding to the third plane, and determining the ranking order of the second plane and the third plane based on the size relationship between the updated second target parameter and the updated third target parameter. Based on the updated magnitude relationship between the second target parameter and the third target parameter, see step 2021 for a manner of determining the order of the second plane and the third plane before and after ranking, which is not described herein again.
When the rank front and back order of the second plane and the third plane is that the rank of the second plane is front and the rank of the third plane is back, the rank front and back order of the first target plane and the third plane is that the rank of the first target plane is front and the rank of the third plane is back, and at this time, step 2 is executed; when the rank of the second plane and the rank of the third plane are front rank of the third plane and the rank of the second plane is back rank, the rank of the first target plane and the rank of the third plane are front rank of the third plane and the rank of the first target plane is back rank, and at this time, step 3 is executed.
Step 2: and when the rank front and back orders of the first target plane and the third plane are that the rank of the first target plane is front and the rank of the third plane is back, directly determining the updated initial ranking result.
Since the first target plane is the plane ranked most backward in the initial ranking result, when the first target plane and the third plane are ranked first and then the third plane is ranked later, the ranking of the third plane in the updated initial ranking result can be directly determined to be the 3 rd. That is, the updated initial ranking result may also be determined directly.
Illustratively, the ranking of the first plane as the initial ranking result is the 1 st ranking, and the ranking of the second plane is the 2 nd ranking. The updated initial ranking result is that the ranking of the first plane is the 1 st, the ranking of the second plane is the 2 nd and the ranking of the third plane is the 3 rd. In this case, the rank of the first plane after update is the same as the rank of the first plane before update, and the rank of the second plane after update is the same as the rank of the second plane before update.
And step 3: when the rank front-back order of the first target plane and the third plane is that the third plane is ranked first and the first target plane is ranked later, determining the rank front-back order of the second target plane and the third plane based on the distance corresponding to the second target plane and the resource consumption per unit area corresponding to the third distance corresponding to the third plane and the resource consumption per unit area corresponding to the third plane, and determining the updated initial ranking result based on the rank front-back order of the second target plane and the third plane.
Since the first target plane is the plane ranked most backward in the initial ranking result, when the first target plane and the third plane are ranked first and then the first target plane is ranked later, it cannot be determined whether the third plane is ranked as the 1 st or the 2 nd in the updated initial ranking result.
At this time, it is necessary to further determine the rank order of the second target plane and the third plane. And the second target plane is a plane which is ranked one bit before the first target plane in the initial ranking result. Since only the rank of the first plane and the rank of the second plane are included in the initial ranking result at this time. Therefore, if the initial ranking result is that the ranking of the first plane is the 1 st and the ranking of the second plane is the 2 nd, the second target plane is the first plane; and if the initial ranking result is that the ranking of the second plane is the 1 st and the ranking of the first plane is the 2 nd, the second target plane is the second plane.
Next, the following description will be given taking as an example the ranking of the first plane as the 1 st ranking and the ranking of the second plane as the 2 nd ranking. At this time, the second target plane is the first plane, the distance corresponding to the second target plane is the first distance, and the resource consumption per unit area corresponding to the second target plane is the first resource consumption per unit area.
In a case that the second target plane is the first plane, based on the distance corresponding to the second target plane and the resource consumption per unit area corresponding to the second target plane, and the third distance corresponding to the third plane and the resource consumption per unit area corresponding to the third plane, the process of determining the order of the second target plane and the third target plane before and after ranking may be: and determining the ranking front and rear order of the first plane and the third plane based on the size relationship of the updated first target parameter and the updated third target parameter. Based on the updated magnitude relationship between the first target parameter and the third target parameter, see step 2021 for a manner of determining the order of the first plane and the third plane before and after ranking, which is not described herein again.
After determining the ranking front and back order of the second target plane and the third plane, the updated initial ranking result may be determined based on the ranking front and back order of the second target plane and the third plane.
Illustratively, the ranking of the first plane as the initial ranking result is the 1 st ranking, and the ranking of the second plane is the 2 nd ranking. At this time, the first target plane is the second plane, and the second target plane is the first plane. Based on the ranking front and back order of the second target plane and the third plane, the process of determining the updated initial ranking result is: and determining the updated initial ranking result based on the ranking front and back order of the first plane and the third plane.
Since the ranking of the first plane is 1 st, the ranking of the second plane is 2 nd, and the ranking of the first target plane (second plane) and the third plane are in the front-to-back order of the ranking of the third plane and the ranking of the first target plane (second plane) is in the back, in the initial ranking result, the updated initial ranking result is determined based on the front-to-back order of the ranking of the first plane and the third plane as follows:
case 1: and when the front and back ranks of the first plane and the third plane are that the first plane ranks at the front and the third plane ranks at the back, determining that the updated initial ranking result is that the rank of the first plane is the 1 st, the rank of the third plane is the 2 nd and the rank of the second plane is the 3 rd.
In this case, the rank of the updated first plane is the same as the rank of the first plane before update, and the rank of the updated second plane is different from the rank of the second plane before update.
Case 2: and when the front and back ranks of the first plane and the third plane are that the third plane ranks at the front and the first plane ranks at the back, determining that the updated initial ranking result is that the rank of the third plane is the 1 st, the rank of the first plane is the 2 nd and the rank of the second plane is the 3 rd.
In this case, the rank of the updated first plane is not the same as the rank of the first plane before updating, and the rank of the updated second plane is not the same as the rank of the second plane before updating.
Case two: the ranking order is the order of the ranking from front to back.
Under the condition, according to the ranking sequence in the initial ranking result, sequentially selecting the planes and the third plane for comparison until the updated initial ranking result is determined, wherein the process comprises the following three steps:
step 1: and determining the ranking front and rear order of the third target plane and the third plane based on the distance corresponding to the third target plane and the resource consumption per unit area corresponding to the third target plane, and the third distance corresponding to the third plane and the resource consumption per unit area corresponding to the third plane.
Wherein the third target plane is the top plane in the initial ranking result. Since only the rank of the first plane and the rank of the second plane are included in the initial ranking result at this time. Therefore, if the initial ranking result is that the ranking of the first plane is the 1 st and the ranking of the second plane is the 2 nd, the third target plane is the first plane; and if the initial ranking result is that the ranking of the second plane is the 1 st and the ranking of the first plane is the 2 nd, the third target plane is the second plane.
The process of determining the rank order of the third target plane and the third plane may refer to step 1 in the above case one, and details are not repeated here.
When the third target plane and the rank of the third plane are front rank of the third plane and rear rank of the third target plane, executing the step 2; and when the third target plane and the ranking of the third plane are front and back, the ranking of the third target plane is front and the ranking of the third plane is back, the step 3 is executed.
Step 2: and when the ranking of the third target plane and the third plane is front and rear, the ranking of the third plane is front, and the ranking of the third target plane is rear, directly updating the initial ranking result.
Since the third target plane is the plane ranked the most forward in the initial ranking result, when the third target plane and the third plane are ranked before the third plane and after the third target plane, the ranking of the third plane in the updated initial ranking result can be directly determined as the 1 st rank. That is, the updated initial ranking result may also be determined directly.
Illustratively, the ranking of the first plane as the initial ranking result is the 1 st ranking, and the ranking of the second plane is the 2 nd ranking. The updated initial ranking result is that the ranking of the third plane is the 1 st, the ranking of the first plane is the 2 nd and the ranking of the second plane is the 3 rd. In this case, the rank of the updated first plane is not the same as the rank of the first plane before updating, and the rank of the updated second plane is not the same as the rank of the second plane before updating.
And step 3: and when the rank front-back order of the third target plane and the third plane is that the third target plane is ranked first and the third plane is ranked later, determining the rank front-back order of the fourth target plane and the third plane based on the distance corresponding to the fourth target plane and the resource consumption per unit area corresponding to the third distance corresponding to the third plane and the resource consumption per unit area corresponding to the third plane, and updating the initial ranking result based on the rank front-back order of the fourth target plane and the third plane, wherein the fourth target plane is a plane ranked next to the third target plane in the initial ranking result.
Since the third target plane is the plane ranked the most forward in the initial ranking result, when the third target plane and the third plane are ranked before and after the third target plane, the ranking of the third plane in the updated initial ranking result cannot be determined to be the 2 nd or the 3 rd.
At this time, it is necessary to further determine the ranking order of the fourth target plane and the third plane. And the fourth target plane is a plane ranked one bit after the third target plane in the initial ranking result. Since only the rank of the first plane and the rank of the second plane are included in the initial ranking result at this time. Therefore, if the initial ranking result is that the ranking of the first plane is the 1 st and the ranking of the second plane is the 2 nd, the fourth target plane is the second plane; and if the initial ranking result is that the ranking of the second plane is the 1 st and the ranking of the first plane is the 2 nd, the fourth target plane is the first plane.
The process of determining the rank order of the fourth target plane and the third plane may refer to step 3 in the above case one, and details are not repeated here.
After determining the ranking front and back order of the fourth target plane and the third plane, the updated initial ranking result may be determined based on the ranking front and back order of the fourth target plane and the third plane.
Illustratively, the ranking of the first plane as the initial ranking result is the 1 st ranking, and the ranking of the second plane is the 2 nd ranking. At this time, the third target plane is the first plane, and the fourth target plane is the second plane. Based on the ranking front and back order of the fourth target plane and the third plane, the process of determining the updated initial ranking result is: and determining the updated initial ranking result based on the ranking front-back order of the second plane and the third plane.
Since the ranking of the first plane is 1 st, the ranking of the second plane is 2 nd, and the ranking of the third target plane (first plane) and the third plane are in a front-rear order, the ranking of the third target plane (first plane) is in a front-rear order, and the ranking of the third plane is in a rear-rear order in the initial ranking result, the updated initial ranking result is determined based on the front-rear order of the second plane and the third plane as follows:
case 1: and when the front and back ranks of the second plane and the third plane are that the second plane ranks at the front and the third plane ranks at the back, determining that the updated initial ranking result is that the rank of the first plane is the 1 st, the rank of the second plane is the 2 nd and the rank of the third plane is the 3 rd.
In this case, the rank of the first plane after update is the same as the rank of the first plane before update, and the rank of the second plane after update is the same as the rank of the second plane before update.
Case 2: and when the front and back ranks of the second plane and the third plane are that the third plane ranks at the front and the second plane ranks at the back, determining that the updated initial ranking result is that the rank of the first plane is the 1 st, the rank of the third plane is the 2 nd and the rank of the second plane is the 3 rd.
In this case, the rank of the updated first plane is the same as the rank of the first plane before update, and the rank of the updated second plane is different from the rank of the second plane before update.
Whether according to step 1-step 3 in the above-mentioned case one or according to step 1-step 3 in the above-mentioned case two, an updated initial ranking result can be determined, and the updated initial ranking result includes an updated ranking of the first plane, an updated ranking of the second plane, and a ranking of the third plane.
Step 2025: and repeating the steps until the updated initial ranking result comprises the target ranking of each plane, and obtaining the target ranking result.
After the step 2024 is executed, a fourth plane is continuously selected from the planes, where the fourth plane is any one of the planes except the first plane, the second plane, and the third plane; and then determining the updated initial ranking result based on a fourth distance corresponding to the fourth plane and a fourth resource consumption per unit area corresponding to the fourth plane, so that the updated initial ranking result comprises the updated ranking of the first plane, the updated ranking of the second plane, the updated ranking of the third plane and the updated ranking of the fourth plane. The above process is continuously executed until the updated initial ranking result comprises the ranking of each plane. And taking the obtained ranking of each plane as the target ranking of each plane, and obtaining a target ranking result based on the target ranking of each plane.
It should be noted that, when performing alignment with the third plane, the initial ranking result only includes the ranking of the first plane and the ranking of the second plane, so that the updated initial ranking result can be determined by performing alignment at most twice. In the subsequent process of further updating the initial ranking result, as the number of the rankings of the planes included in the updated initial ranking result increases, the maximum comparison times required for determining the updated initial ranking result increases in the process of comparing the updated initial ranking result with the newly selected plane.
Illustratively, in the process of comparing with the newly selected 5 th plane, since the updated initial ranking result already includes the rankings of 4 planes at this time, the maximum number of times of comparison required for determining the updated initial ranking result is 4 times.
In step 203, based on the target ranking of each plane in the target ranking result, each plane is sequentially acquired until a target subnetwork is obtained.
Since the target ranking result includes the target ranking of each plane, and the target ranking of any plane is used to indicate the obtained rank of the plane, the obtained rank of each plane can be determined based on the target ranking of each plane in the target ranking result, and then each plane can be sequentially obtained according to the obtained rank of each plane. And obtaining the target sub-network after all planes of the target sub-network are acquired.
Illustratively, assuming that the target subnetwork has 6 planes, which are plane a, plane B, plane C, plane D, plane E, and plane F, respectively, the target ranking result indicates that the target rank of plane a is the 6 th, the target rank of plane B is the 5 th, the target rank of plane C is the 4 th, the target rank of plane D is the 3 rd, the target rank of plane E is the 2 nd, and the target rank of plane F is the 1 st, plane F, plane E, plane D, plane C, plane B, and plane a are sequentially acquired in acquiring the target subnetwork.
In one possible implementation, the server may obtain the target sub-network based on the system hardware platform as shown in FIG. 6. The system hardware platform comprises a data storage unit, a computing unit, a cloud end unit and a cutting unit. The data storage unit is used for acquiring distances corresponding to all planes of a target subnetwork in the parent network and unit area resource consumption corresponding to all the planes, and sending the distances corresponding to all the planes and the unit area resource consumption corresponding to all the planes to the cloud end unit; the computing unit is used for determining a target ranking result based on the distance corresponding to each plane and the unit area resource consumption corresponding to each plane, which are acquired from the cloud end unit; the cloud end unit is a hub of information exchange and is used for sending cutting instructions of all planes to the cutting unit according to the target ranking of all planes in the target ranking result determined by the calculation unit; the cutting unit is used for sequentially obtaining each plane based on the cutting instruction of each plane sent by the cloud end until a target sub-network is obtained. The embodiment of the present application does not limit the way of writing the program of each unit in the system hardware platform. For example, the program of the cloud unit is written in Python language, the program of the computing unit is written in Java language, the program of the cutting unit is written in C language, and the program of the data storage unit is written in C # language.
In the practical application process, the total resource consumption amount required by obtaining the target sub-network according to the method provided by the embodiment of the application is compared with the total resource consumption amount required by obtaining the target sub-network according to the method in the related art, so as to obtain the comparison result shown in the following table.
Figure BDA0002295227290000181
In the above table, the unit of the total resource consumption is converted into an element, the total resource consumption required for obtaining the target sub-network according to the method in the related art is 100 elements, the total resource consumption required for obtaining the target sub-network according to the method provided by the embodiment of the present application is 60 elements, and the total resource consumption required for obtaining the target sub-network according to the method provided by the embodiment of the present application is reduced by 40%.
In the embodiment of the application, a target ranking result which enables the total resource consumption required by the target sub-network to meet the condition is determined based on the distance corresponding to each plane and the resource consumption of each plane in unit area; and then sequentially acquiring each plane based on the target ranking of each plane in the target ranking result until a target sub-network is obtained. In the process of acquiring the network, the distances corresponding to the planes and the resource consumption of the unit area corresponding to the planes are comprehensively considered, so that the total resource consumption required for acquiring the target sub-network can be reduced, and the comprehensive effect of the acquired target sub-network is favorably improved.
Based on the same technical concept, referring to fig. 7, an embodiment of the present application provides an apparatus for acquiring a network, including:
a first obtaining module 701, configured to obtain a distance corresponding to each plane of a target subnetwork and a resource consumption amount per unit area corresponding to each plane, where the distance corresponding to any plane is a distance between any plane and a plane parallel to any plane in a parent network;
a determining module 702, configured to determine a target ranking result based on a distance corresponding to each plane and a resource consumption amount per unit area corresponding to each plane, where the target ranking result is a ranking result that a total resource consumption amount required for obtaining a target subnetwork meets a reference condition, the target ranking result includes a target ranking of each plane, and the target ranking of any plane is used to indicate a rank of the obtained any plane;
the second obtaining module 703 is configured to sequentially obtain each plane based on the target ranking of each plane in the target ranking result until a target subnetwork is obtained.
In one possible implementation, referring to fig. 8, the determining module 702 includes:
a selecting unit 7021 configured to select a first plane and a second plane from among the planes;
a determining unit 7022, configured to determine, based on a first distance corresponding to the first plane and a first resource consumption per unit area corresponding to the first plane, and a second distance corresponding to the second plane and a second resource consumption per unit area corresponding to the second plane, a ranking order of the first plane and the second plane;
a determining unit 7022, further configured to determine an initial ranking result based on a front-back order of the rankings of the first plane and the second plane, where the initial ranking result includes the ranking of the first plane and the ranking of the second plane;
a selecting unit 7021, further configured to select a third plane from the planes, where the third plane is any one of the planes except the first plane and the second plane;
a determining unit 7022, further configured to determine, based on the third plane, an updated initial ranking result, where the updated initial ranking result includes an updated ranking of the first plane, an updated ranking of the second plane, and a ranking of the third plane;
determining unit 7022 is further configured to repeat this process until the updated initial ranking result includes the target ranking of each plane, so as to obtain a target ranking result.
In a possible implementation manner, the determining unit 7022 is further configured to sequentially select a plane and a third plane according to a ranking order in the initial ranking result, and compare the planes with the third plane until an updated initial ranking result is determined.
In one possible implementation, the ranking order is the order of the rankings from back to front; determining unit 7022, further configured to determine, based on a distance corresponding to the first target plane and a resource consumption amount per unit area corresponding to the first target plane, and a third distance corresponding to the third plane and a resource consumption amount per unit area corresponding to the third plane, a front-back order of the first target plane and the third plane, where the first target plane is a plane ranked the most backward in the initial ranking result;
when the front and back ranks of the first target plane and the third plane are that the first target plane is ranked first and the third plane is ranked later, directly determining an updated initial ranking result;
when the rank front-back order of the first target plane and the third plane is that the third plane is ranked first and the first target plane is ranked later, determining the rank front-back order of the second target plane and the third plane based on the distance corresponding to the second target plane and the resource consumption per unit area corresponding to the third distance corresponding to the third plane and the resource consumption per unit area corresponding to the third plane, and determining the updated initial ranking result based on the rank front-back order of the second target plane and the third plane, wherein the second target plane is a plane ranked one bit before the first target plane in the initial ranking result.
In one possible implementation, the ranking order is the order of the rankings from front to back; a determining unit 7022, further configured to determine, based on a distance corresponding to a third target plane and a resource consumption amount per unit area corresponding to the third target plane, and a third distance corresponding to the third plane and a resource consumption amount per unit area corresponding to the third plane, a ranking order of the third target plane and the third plane, where the third target plane is a plane ranked the most ahead in the initial ranking result;
when the rank front and back orders of the third target plane and the third plane are that the rank of the third plane is front and the rank of the third target plane is back, directly determining an updated initial ranking result;
when the rank front-back order of the third target plane and the third plane is that the third target plane is ranked first and the third plane is ranked later, determining the rank front-back order of the fourth target plane and the third plane based on the distance corresponding to the fourth target plane and the resource consumption per unit area corresponding to the third distance corresponding to the third plane and the resource consumption per unit area corresponding to the third plane, and determining the updated initial ranking result based on the rank front-back order of the fourth target plane and the third plane, wherein the fourth target plane is a plane ranked next to the third target plane in the initial ranking result.
In a possible implementation manner, determining unit 7022 is further configured to determine, based on the first distance and the second resource consumption per unit area, a first target parameter corresponding to the first plane; determining a second target parameter corresponding to the second plane based on the second distance and the first unit area resource consumption;
and determining the ranking front-rear order of the first plane and the second plane based on the size relation of the first target parameter and the second target parameter.
In a possible implementation manner, determining unit 7022 is further configured to use a product of the first distance and the second resource consumption per unit area as a first target parameter corresponding to the first plane; and taking the product of the second distance and the resource consumption of the first unit area as a second target parameter corresponding to the second plane.
In a possible implementation manner, the determining unit 7022 is further configured to, when the size relationship between the first target parameter and the second target parameter is that the first target parameter is greater than the second target parameter, rank order of the first plane and the second plane is that the first plane is ranked first and the second plane is ranked next;
when the size relationship between the first target parameter and the second target parameter is that the first target parameter is smaller than the second target parameter, the front and back ranks of the first plane and the second plane are that the rank of the second plane is before and the rank of the first plane is after;
when the size relationship between the first target parameter and the second target parameter is that the first target parameter is equal to the second target parameter, the front and back ranks of the first plane and the second plane are sequentially the first plane ranked first and the second plane ranked second, or the second plane ranked first and the first plane ranked second.
In one possible implementation, the parent network is a narrowband internet of things, and the target subnetwork is a homomorphic parallel subnetwork of the narrowband internet of things.
In the embodiment of the application, a target ranking result which enables the total resource consumption required by the target sub-network to meet the condition is determined based on the distance corresponding to each plane and the resource consumption of each plane in unit area; and then sequentially acquiring each plane based on the target ranking of each plane in the target ranking result until a target sub-network is obtained. In the process of acquiring the network, the distances corresponding to the planes and the resource consumption of the unit area corresponding to the planes are comprehensively considered, so that the total resource consumption required for acquiring the target sub-network can be reduced, and the comprehensive effect of the acquired target sub-network is favorably improved.
It should be noted that, when the apparatus provided in the foregoing embodiment implements the functions thereof, only the division of the functional modules is illustrated, and in practical applications, the functions may be distributed by different functional modules according to needs, that is, the internal structure of the apparatus may be divided into different functional modules to implement all or part of the functions described above. In addition, the apparatus and method embodiments provided by the above embodiments belong to the same concept, and specific implementation processes thereof are described in the method embodiments for details, which are not described herein again.
Fig. 9 is a schematic structural diagram of a device for acquiring a network according to an embodiment of the present application, where the device may be a server, and the server may generate a relatively large difference due to different configurations or performances, and may include one or more processors (CPUs) 901 and one or more memories 902, where at least one program code is stored in the one or more memories 902, and is loaded and executed by the one or more processors 901 to implement the method for acquiring a network according to the above method embodiments. Of course, the server may also have components such as a wired or wireless network interface, a keyboard, and an input/output interface, so as to perform input/output, and the server may also include other components for implementing the functions of the device, which are not described herein again.
In an exemplary embodiment, a computer device is also provided that includes a processor and a memory having at least one program code stored therein. The at least one program code is loaded into and executed by one or more processors to implement any of the above methods for obtaining a network.
In an exemplary embodiment, a computer readable storage medium is further provided, in which at least one program code is stored, the at least one program code being loaded and executed by a processor of a computer device to implement any of the above methods for acquiring a network.
Alternatively, the computer-readable storage medium may be a Read-Only Memory (ROM), a Random Access Memory (RAM), a Compact Disc Read-Only Memory (CD-ROM), a magnetic tape, a floppy disk, an optical data storage device, and the like.
It should be understood that reference to "a plurality" herein means two or more. "and/or" describes the association relationship of the associated objects, meaning that there may be three relationships, e.g., a and/or B, which may mean: a exists alone, A and B exist simultaneously, and B exists alone. The character "/" generally indicates that the former and latter associated objects are in an "or" relationship.
The above description is only exemplary of the present application and should not be taken as limiting the present application, and any modifications, equivalents, improvements and the like that are made within the spirit and principle of the present application should be included in the protection scope of the present application.

Claims (10)

1. A method of acquiring a network, the method comprising:
acquiring the distance corresponding to each plane of a target subnetwork and the resource consumption of unit area corresponding to each plane, wherein the distance corresponding to any plane is the distance between any plane and a plane parallel to any plane in a parent network;
determining a target ranking result based on the distance corresponding to each plane and the resource consumption amount per unit area corresponding to each plane, wherein the target ranking result is a ranking result which enables the total resource consumption amount required for obtaining the target sub-network to meet a condition, the target ranking result comprises a target ranking of each plane, and the target ranking of any plane is used for indicating the acquired rank of any plane;
and sequentially acquiring each plane based on the target ranking of each plane in the target ranking result until the target sub-network is obtained.
2. The method of claim 1, wherein determining a target ranking result based on the distance corresponding to the respective plane and the resource consumption per unit area corresponding to the respective plane comprises:
selecting a first plane and a second plane from the planes, and determining the ranking front and back order of the first plane and the second plane based on a first distance corresponding to the first plane and a first resource consumption per unit area corresponding to the first plane, and a second distance corresponding to the second plane and a second resource consumption per unit area corresponding to the second plane;
determining an initial ranking result based on a rank order of the first plane and the second plane, the initial ranking result comprising a rank of the first plane and a rank of the second plane;
selecting a third plane from the planes, wherein the third plane is any one of the planes except the first plane and the second plane;
determining an updated initial ranking result based on the third plane, the updated initial ranking result including an updated ranking of the first plane, an updated ranking of the second plane, and a ranking of the third plane;
and repeating the steps until the updated initial ranking result comprises the target ranking of each plane, and obtaining a target ranking result.
3. The method of claim 2, wherein determining an updated initial ranking result based on the third plane comprises:
and sequentially selecting planes and comparing the planes with the third plane according to the ranking sequence in the initial ranking result until the updated initial ranking result is determined.
4. The method of claim 3, wherein the ranking order is a back-to-front ranking order; sequentially selecting a plane and the third plane for comparison according to the ranking sequence in the initial ranking result until the updated initial ranking result is determined, wherein the method comprises the following steps:
determining a front-rear ranking order of a first target plane and a third plane based on a distance corresponding to the first target plane and a resource consumption per unit area corresponding to the first target plane, and a third distance corresponding to the third plane and a resource consumption per unit area corresponding to the third plane, wherein the first target plane is a plane ranked the most backward in the initial ranking result;
when the ranking front and back orders of the first target plane and the third plane are that the ranking of the first target plane is front and the ranking of the third plane is back, directly determining an updated initial ranking result;
when the pre-and-post ranking order of the first target plane and the third plane is that the third plane is ranked first and the first target plane is ranked later, determining the pre-and-post ranking order of the second target plane and the third plane based on the distance corresponding to the second target plane and the resource consumption per unit area corresponding to the second target plane, and the third distance corresponding to the third plane and the resource consumption per unit area corresponding to the third plane, and determining an updated initial ranking result based on the pre-and-post ranking order of the second target plane and the third plane, wherein the second target plane is a plane ranked one bit before the first target plane in the initial ranking result.
5. The method of claim 3, wherein the ranking order is from top to bottom; sequentially selecting a plane and the third plane for comparison according to the ranking sequence in the initial ranking result until the updated initial ranking result is determined, wherein the method comprises the following steps:
determining the ranking order of a third target plane and the third plane based on the distance corresponding to the third target plane and the resource consumption per unit area corresponding to the third target plane, and the third distance corresponding to the third plane and the resource consumption per unit area corresponding to the third plane, wherein the third target plane is the plane ranked the most forward in the initial ranking result;
when the ranking of the third target plane and the third plane is front and rear, the updated initial ranking result is directly determined;
when the rank front-back order of the third target plane and the third plane is that the third target plane is ranked first and the third plane is ranked later, determining the rank front-back order of the fourth target plane and the third plane based on the distance corresponding to the fourth target plane and the resource consumption per unit area corresponding to the fourth target plane, and the third distance corresponding to the third plane and the resource consumption per unit area corresponding to the third plane, and determining an updated initial ranking result based on the rank front-back order of the fourth target plane and the third plane, wherein the fourth target plane is a plane ranked next to the third target plane in the initial ranking result.
6. The method of claim 2, wherein the determining the rank order of the first plane and the second plane based on a first distance corresponding to the first plane and a first resource consumption per unit area corresponding to the first plane, and a second distance corresponding to the second plane and a second resource consumption per unit area corresponding to the second plane comprises:
determining a first target parameter corresponding to the first plane based on the first distance and the second resource consumption per unit area; determining a second target parameter corresponding to the second plane based on the second distance and the first resource consumption per unit area;
determining the ranking front and back order of the first plane and the second plane based on the magnitude relation of the first target parameter and the second target parameter.
7. The method of claim 6, wherein the determining a first target parameter corresponding to the first plane based on the first distance and the second resource consumption per unit area; determining a second target parameter corresponding to the second plane based on the second distance and the first resource consumption per unit area, including:
taking the product of the first distance and the second resource consumption per unit area as a first target parameter corresponding to the first plane;
and taking the product of the second distance and the first resource consumption per unit area as a second target parameter corresponding to the second plane.
8. The method of claim 6, wherein determining the rank order of the first plane and the second plane based on the magnitude relationship of the first target parameter and the second target parameter comprises:
when the size relationship between the first target parameter and the second target parameter is that the first target parameter is greater than the second target parameter, the ranking of the first plane and the ranking of the second plane are in front of the ranking of the first plane and in back of the ranking of the second plane;
when the size relationship between the first target parameter and the second target parameter is that the first target parameter is smaller than the second target parameter, the ranking order of the first plane and the second plane is that the second plane is ranked first and the first plane is ranked second;
when the size relationship between the first target parameter and the second target parameter is that the first target parameter is equal to the second target parameter, the front and back ranks of the first plane and the second plane are sequentially the first plane with the front rank and the second plane with the back rank, or the second plane with the front rank and the first plane with the back rank.
9. The method of any one of claims 1-8, wherein the parent network is a narrowband internet of things and the target subnetwork is a homomorphic parallel subnetwork of the narrowband internet of things.
10. An apparatus for acquiring a network, the apparatus comprising:
the first acquisition module is used for acquiring the distance corresponding to each plane of a target subnetwork and the resource consumption of unit area corresponding to each plane, wherein the distance corresponding to any plane is the distance between any plane and a plane parallel to any plane in a parent network;
a determining module, configured to determine a target ranking result based on the distance corresponding to each plane and the resource consumption amount per unit area corresponding to each plane, where the target ranking result is a ranking result such that a total resource consumption amount required for acquiring the target subnetwork meets a reference condition, the target ranking result includes a target ranking of each plane, and the target ranking of any plane is used to indicate a rank of the acquired any plane;
and the second acquisition module is used for sequentially acquiring each plane based on the target ranking of each plane in the target ranking result until the target sub-network is obtained.
CN201911198325.4A 2019-11-29 2019-11-29 Method and device for acquiring network Active CN110958144B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201911198325.4A CN110958144B (en) 2019-11-29 2019-11-29 Method and device for acquiring network

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201911198325.4A CN110958144B (en) 2019-11-29 2019-11-29 Method and device for acquiring network

Publications (2)

Publication Number Publication Date
CN110958144A CN110958144A (en) 2020-04-03
CN110958144B true CN110958144B (en) 2021-06-22

Family

ID=69978992

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201911198325.4A Active CN110958144B (en) 2019-11-29 2019-11-29 Method and device for acquiring network

Country Status (1)

Country Link
CN (1) CN110958144B (en)

Citations (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN1996920A (en) * 2006-11-29 2007-07-11 北京邮电大学 Novel method for wireless communication networking based on the cooperation mechanism
CN101374096A (en) * 2008-10-22 2009-02-25 清华大学 Virtual concurrent internet architecture
CN102624597A (en) * 2012-03-09 2012-08-01 北京邮电大学 Two-way sequencing virtual network mapping method
CN106789744A (en) * 2017-01-13 2017-05-31 重庆邮电大学 Handled up resource regulating method with the height that time delay is perceived based on UNE virtualization
CN106961471A (en) * 2017-03-03 2017-07-18 上海谱翱数据科技有限公司 Node apparatus and Internet of Things communication subsystem
CN109842520A (en) * 2018-12-27 2019-06-04 华为技术服务有限公司 The determination method, apparatus and system of network topology
WO2019184067A1 (en) * 2018-03-26 2019-10-03 中国电子科技集团公司第十研究所 Intelligent measurement and control communication network system

Patent Citations (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN1996920A (en) * 2006-11-29 2007-07-11 北京邮电大学 Novel method for wireless communication networking based on the cooperation mechanism
CN101374096A (en) * 2008-10-22 2009-02-25 清华大学 Virtual concurrent internet architecture
CN102624597A (en) * 2012-03-09 2012-08-01 北京邮电大学 Two-way sequencing virtual network mapping method
CN106789744A (en) * 2017-01-13 2017-05-31 重庆邮电大学 Handled up resource regulating method with the height that time delay is perceived based on UNE virtualization
CN106961471A (en) * 2017-03-03 2017-07-18 上海谱翱数据科技有限公司 Node apparatus and Internet of Things communication subsystem
WO2019184067A1 (en) * 2018-03-26 2019-10-03 中国电子科技集团公司第十研究所 Intelligent measurement and control communication network system
CN109842520A (en) * 2018-12-27 2019-06-04 华为技术服务有限公司 The determination method, apparatus and system of network topology

Also Published As

Publication number Publication date
CN110958144A (en) 2020-04-03

Similar Documents

Publication Publication Date Title
US10841241B2 (en) Intelligent placement within a data center
US10284623B2 (en) Optimized browser rendering service
CN110595482A (en) Path planning method and device with obstacle avoidance weight and electronic equipment
US9875186B2 (en) System and method for data caching in processing nodes of a massively parallel processing (MPP) database system
US9805140B2 (en) Striping of directed graphs and nodes with improved functionality
CN103067297B (en) A kind of dynamic load balancing method based on resource consumption prediction and device
CN110147407B (en) Data processing method and device and database management server
CN113821332B (en) Method, device, equipment and medium for optimizing efficiency of automatic machine learning system
US20180025091A1 (en) Optimized browser render process
CN107070645B (en) Method and system for comparing data of data table
CN104504147A (en) Resource coordination method, device and system for database cluster
CN103488699A (en) Data processing device and method based on stored data grids
CN102724301B (en) Cloud database system and method and equipment for reading and writing cloud data
CN106155822A (en) A kind of disposal ability appraisal procedure and device
US8161079B2 (en) Acquisition and expansion of storage area network interoperation relationships
CN110958144B (en) Method and device for acquiring network
CN104778088A (en) Method and system for optimizing parallel I/O (input/output) by reducing inter-progress communication expense
CN111988156A (en) Method for creating network simulation platform, network simulation method and corresponding device
CN111737347B (en) Method and device for sequentially segmenting data on Spark platform
CN114564523A (en) Big data vulnerability analysis method and cloud AI system for intelligent virtual scene
CN108073502B (en) Test method and system thereof
CN117573730B (en) Data processing method, apparatus, device, readable storage medium, and program product
Ranaweera et al. Non-local data fetch scheme based on delay distribution for Hadoop clusters in public cloud
CN117851028A (en) Training method of distributed model and related equipment
CN113900931A (en) Docker-based test method, device, 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
REG Reference to a national code

Ref country code: HK

Ref legal event code: DE

Ref document number: 40021129

Country of ref document: HK

GR01 Patent grant
GR01 Patent grant