KR20170091912A - System for calculating the number of the local triangular using the terminal resources and method thereof - Google Patents

System for calculating the number of the local triangular using the terminal resources and method thereof Download PDF

Info

Publication number
KR20170091912A
KR20170091912A KR1020160012791A KR20160012791A KR20170091912A KR 20170091912 A KR20170091912 A KR 20170091912A KR 1020160012791 A KR1020160012791 A KR 1020160012791A KR 20160012791 A KR20160012791 A KR 20160012791A KR 20170091912 A KR20170091912 A KR 20170091912A
Authority
KR
South Korea
Prior art keywords
node
local
information
triangles
server
Prior art date
Application number
KR1020160012791A
Other languages
Korean (ko)
Other versions
KR101940802B1 (en
Inventor
김지용
민옥기
Original Assignee
한국전자통신연구원
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 한국전자통신연구원 filed Critical 한국전자통신연구원
Priority to KR1020160012791A priority Critical patent/KR101940802B1/en
Publication of KR20170091912A publication Critical patent/KR20170091912A/en
Application granted granted Critical
Publication of KR101940802B1 publication Critical patent/KR101940802B1/en

Links

Images

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L41/00—Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
    • H04L41/08—Configuration management of networks or network elements
    • H04L41/0803—Configuration setting
    • H04L41/0813—Configuration setting characterised by the conditions triggering a change of settings
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L41/00—Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
    • H04L41/08—Configuration management of networks or network elements
    • H04L41/0803—Configuration setting
    • H04L41/0823—Configuration setting characterised by the purposes of a change of settings, e.g. optimising configuration for enhancing reliability
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L41/00—Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
    • H04L41/14—Network analysis or design

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Image Generation (AREA)

Abstract

A method for calculating a local triangle number using terminal resources according to an embodiment of the present invention is a method for calculating a local triangle number using terminal resources, And notifying the second node that a new edge between the first node and the second node is added, updating information of the second node by adding the information of the second node to the previously stored first neighbor set information at the first node, Updating the information of the first node in the second neighbor set information previously stored in the second node to update the second neighbor set information updated in the second node to the second node, Wherein the first neighbor set information and the second neighbor set information are received from the second node, In step, and the first node to obtain the number of the triangular region that is generated by transmitting the number of the information and the triangular area of the common neighboring node to the server.

Description

Field of the Invention The present invention relates to a system for calculating a local triangular number using terminal resources and a method of operating the same,

BACKGROUND OF THE INVENTION 1. Field of the Invention The present invention relates to a network technology composed of a plurality of nodes, and more particularly, to a system for calculating the number of local triangles using terminal resources and an operation method thereof.

In today's Internet of Things (IoT) environment, various devices connect to the Internet to produce and collect data in real time. The produced and collected data can be sent to the server and analyzed and usefully used. At this time, the server can calculate the number of local triangles by counting the connection relationship between the nodes. Here, a local triangle refers to a triangle containing the node for each node in the graph. At this time, the number of the calculated local triangles is applied to various examples such as spam detection, fake account detection, community detection, and anomaly detection.

The server manages a graph composed of a plurality of nodes, which include connections (edges, edges) between nodes and nodes. In the past, it was a way of collecting the shape of the graph on the server, regardless of how accurate the calculation was, regardless of how much memory was used to analyze the graph.

For example, assume that there is a server and a plurality of nodes (u node, w node, v node) as shown in FIG. 1, and an edge connecting a u node and a w node is configured. At this time, when a new edge (e = (u, v)) connecting the u node and the v node is added, the server updates the number of the local triangles through the process shown in FIG.

Specifically, the server adds neighboring neighbor information based on the neighbor set information Nu of the u node and the edge e added to the neighbor set information Nv of the v node (S201). Then, the server obtains a common neighbor node (intersection) N of the neighbor set information Nu of the u node and the neighbor set information Nv of the v node (S202). The number of the local triangles stored in each of the u-node and the v-node is updated through the common neighbor node (S20) (S203). At this time, it is obvious that the new triangle generated by the new edge (e) is formed by neighboring common neighbor nodes of both nodes (u and v nodes). Thereafter, the number of the local triangles stored in the common neighbor node (w node) of the u node and the v node is updated (S204). Here, a common neighbor node adds 1 to its local triangle count.

Through this process, the number of local triangles can be calculated accurately. However, as described above, the shape of all the graphs must be uploaded to the server memory before the above calculations are possible. In the case of Facebook, a typical SNS service company, the number of actual users (nodes) is about one billion, and the relationship (edge) is theoretically (one billion) 2/2.

However, as the number of nodes and edges increases, the size of the graph itself increases, and it becomes difficult to analyze the shape of all the graphs in the server memory at once. And, when the addition and deletion of edges occur dynamically, the computation of the change must be made continuously, and such an operation is also not easy.

In this way, since the shape of the graph can not be placed on the server memory and can not be compared, it is possible to predict a local triangle using a much smaller graph using a sampling method. The sampling method is not to calculate all the graphs in the server's memory but to calculate the number of local triangles by selecting the edges with a certain probability and to calculate the corrected values by using the calculation formulas in the calculated results. This approach can reduce the memory requirement, but it can obtain a fairly accurate number of local triangles at the time of calculation.

However, this sampling method is only an estimation value and there is an error, and it saves a lot of memory, but it is heavy on a server.

It is an object of the present invention to provide a system and a method for calculating the number of local triangles by utilizing memory and computing resources held by a terminal or a user corresponding to a node.

According to an aspect of the present invention, there is provided a method for calculating a local triangle number using terminal resources, the method comprising: transmitting, to a first node and a second node in a server, notification of addition of a new edge between the first node and the second node; Updating information of the second node by adding information of the second node to the previously stored first neighbor set information at the first node and updating information by adding the information of the first node to the previously stored second neighbor set information at the second node, Transmitting the second neighbor set information updated at the second node to the second node, receiving the second neighbor set information received from the second node at the first node, Obtaining a number of local triangles generated by the common neighbor node and the common neighbor node based on the information, The number of information and the triangle area and a step of transmitting to the server.

The method of calculating a local triangle number using the terminal resource may further include updating the number of the local triangles in the first local triangle information previously stored in the first node.

The method comprising the steps of: transmitting the number of the local triangles at the first node to the second node using the terminal resource, and transmitting the number of the local triangles received at the second node, And updating the number of triangles.

The method for calculating the number of regional triangles using the terminal resource further includes updating the shape of the graph based on the information of the common neighbor node received from the server and the number of the local triangles.

The method comprising the steps of: informing each of the common neighbor nodes of the number of the local triangles by 1 in the server, calculating a local triangle number using the terminal resources, And adding 1 to the number of local triangles included in the information.

Wherein the step of informing the addition of the new edge is that when an edge connection is requested between the first node and the second node from at least one of the first and second nodes, To be added.

According to another aspect of the present invention, there is provided a method for calculating a local triangle number using terminal resources, the method comprising: informing a first node of a server that a new edge between the first node and a second node is added; Transmitting second neighbor set information stored in the second node to the first node in the server by adding information of the second node to the previously stored first neighbor set information in the first node, Obtaining the number of local triangles generated by the common neighbor node and the common neighbor node based on the updated first neighbor set information and the updated second neighbor set information at the first node, And transmitting the information of the common neighbor node and the number of the local triangles to the server.

The method for calculating a local triangle number using the terminal resource may further comprise updating the number of the local triangles in the first local triangle information at the first node.

The method for calculating the number of regional triangles using the terminal resource further includes updating the shape of the graph based on the information of the common neighbor node received from the server and the number of the local triangles.

The method for calculating a local triangle number using the terminal resource further includes informing the server that the new edge is added to the second node and transmitting the number of the local triangles to the second node.

Wherein the local triangulation number calculation method using the terminal resource further comprises updating the first node information by adding the information of the first node to the second neighbor set information at the second node, And updating the number.

The method comprising the steps of: informing each of the common neighbor nodes in the server that the number of the local triangles is incremented by one, and transmitting a third region stored in the third node included in the common neighbor node, And adding 1 to the number of local triangles included in the triangle information.

The step of informing that the new edge is added informs the first node that the new edge is added when an edge connection is requested from the outside to the first node and the second node.

According to the embodiment of the present invention, the large-scale graph analysis can be accurately and efficiently performed by avoiding the method of obtaining the local triangles all over the server and utilizing the resources of the node terminals for distributed processing.

1 is a first reference diagram for explaining a conventional method of calculating a local triangle number.
FIG. 2 is a second reference diagram for explaining a conventional method of calculating a local triangle number. FIG.
3 is a block diagram of a system for calculating the number of regional triangles using terminal resources according to an embodiment of the present invention.
FIG. 4 is a flowchart illustrating a method of calculating a local triangular number using terminal resources according to an embodiment of the present invention. FIG.
FIG. 5 is a flowchart illustrating a method of calculating a local triangular number using terminal resources according to another embodiment of the present invention. FIG.

BRIEF DESCRIPTION OF THE DRAWINGS The advantages and features of the present invention, and the manner of achieving them, will be apparent from and elucidated with reference to the embodiments described hereinafter in conjunction with the accompanying drawings. The present invention may, however, be embodied in many different forms and should not be construed as being limited to the embodiments set forth herein. Rather, these embodiments are provided so that this disclosure will be thorough and complete, and will fully convey the scope of the invention to those skilled in the art. And is provided to fully convey the scope of the invention to those skilled in the art, and the present invention is defined by the claims. It is to be understood that the terminology used herein is for the purpose of describing particular embodiments only and is not intended to be limiting of the invention. In the present specification, the singular form includes plural forms unless otherwise specified in the specification. It is noted that " comprises, " or "comprising," as used herein, means the presence or absence of one or more other components, steps, operations, and / Do not exclude the addition.

Hereinafter, preferred embodiments of the present invention will be described in detail with reference to the accompanying drawings. In the drawings, the same reference numerals are given to the same or similar components, and in the following description of the present invention, Detailed explanations of the detailed description will be omitted when the gist of the present invention can be obscured.

FIG. 3 is an overall configuration diagram of a local triangular number calculation system utilizing terminal resources according to an embodiment of the present invention.

3, the system for calculating a local triangle number using terminal resources according to an exemplary embodiment of the present invention includes a server 110, a first node 121, a second node 122, and a third node 123, .

Here, the nodes (the first to third nodes 121 to 123) can take various forms (shapes). For example, if the node is a user of an SNS such as Facebook or Twitter, it may be in the form of software such as an application, a web browser, or a plug-in. Alternatively, the node may take the form of embedded software (SW) if it is a gateway of the network or a thing of IoT (Internet of Things). The commonality of these nodes is that they have storage space and computing resources, and they can communicate with each other via a network.

In addition, each of the nodes (first to third nodes 121 to 123) may store neighbor set information including information on neighbor nodes neighboring the node. Here, the information on the neighboring nodes may be unique identifier (ID) information of the neighboring node. For example, a neighboring node may be a node connected to itself and an edge. 3, the information of the first node 121 and the information of the third node 123, which is a neighbor node connected to the edge, is stored in the neighbor set information (first neighbor set information) of the first node 121 Can be. Likewise, the neighbor set information (third neighbor set information) of the third node 123 may include information of the third node 123 and the first node 121, which is a neighbor node connected to the edge.

In addition, each of the nodes (the first to third nodes 121 to 123) may also store local triangles related to itself. At this time, the local triangle information of each of the nodes (first to third nodes 121 to 123) may include information of another node or server forming a local triangle together with the local triangle information. In addition, the number of the local triangles to which the local triangles are related can also be stored in the local triangles information of each of the nodes (the first to third nodes 121 to 123). For example, the first node 121 may store the local triangle information (first local triangle information)? U associated with the first node 121, and similarly, the second and third nodes 122 and 123 may also store the local triangle information Local triangle information (second and third local triangle information [Delta] v, [Delta] w).

Meanwhile, in the present invention, when edge is added or deleted between nodes, description will be made of a technique of calculating the number of local triangles by utilizing memory and computing resources possessed by a terminal or a user corresponding to the node. That is, according to the embodiment of the present invention, the shape of the graph can be divided or stored in the node or downloaded from the server, and the number of the local triangles can be calculated in the node instead of the server.

Hereinafter, for convenience of explanation, it is assumed that a new edge (e = u, v) between the first node 121 and the second node 122 is added.

4 is a flowchart illustrating a method of calculating a local triangle number using terminal resources according to an exemplary embodiment of the present invention.

First, a request is made to add a new edge e between the first node 121 and the second node 122 (S401). At this time, the server 110 may receive a new edge addition request between the first node 121 and the second node 122 from the outside. As an example, the server 110 may receive a new edge addition request according to the input of the network manager which maintains and manages the system-wide network. As another example, the server 110 may have an edge connection between the first node 121 and the second node 122 due to user manipulation of at least one of the first node 121 and the second node 122 Can be requested. Alternatively, the server 110 may accept an edge connection request through its own evaluation if an edge connection between the first node 121 and the second node 122 is requested.

Upon receiving the request to add a new edge e, the server 110 sends to the first and second nodes 121 and 122 the addition of a new edge e between the first node 121 and the second node 122 (S402). In addition, the server 110 may present the connection method between the first node 121 and the second node 122 to the first and second nodes 121 and 122, respectively.

For example, the server 110 may request the first and second nodes 121 and 122 to additionally store each other in their neighbor set information Nu, Nv previously stored. The server 110 updates the first neighbor set information Nu stored in the first node 121 based on the new edge e so that the information of the second node 122 is added to the first neighbor set information Nu, And requests the second node 122 to add the information of the first node 121 to the second neighbor set information Nv previously stored in the second node 122. [

Accordingly, the first node 121 adds the information of the second node 122 to its neighbor set information (first neighbor set information) Nu, inserts the information of the second node 122 into the second node 122, May update its neighbor set information by inserting the information of the first node 121 into its neighbor set information (second neighbor set information) Nv (S403-1, S403) -2)

In addition, the server 110 may instruct one of the first node 121 and the second node 122 to transmit its updated neighbor set information to another node. At this time, the instruction may be instructed together with the connection method in step S402. For example, the server 110 may instruct the second node 122 to transmit the updated second neighbor set information Nv to the first node 121 with the information of the first node 121 added thereto. Accordingly, the second node 122 may transmit its updated neighbor set information Nv to the first node 121 (S404). At this time, it is also possible to use a technique of comparing and analyzing neighboring set information of a specific domain.

The first node 121 receiving the second neighbor set information Nv from the second node 122 receives the neighboring second neighbor set information Nv and its neighbor set information Nu The number of local triangles | N | generated by the intersection N (common neighbor node) and the intersection N of the intersection N of the local triangles is calculated (S405). At this time, it is apparent that the node included in the area triangle newly generated through the new edge e is a neighbor node of both nodes (the first and second nodes 121 and 122).

Since the obtained result changes the shape of the graph and the number of the local hanger angles, the first node 121 transmits the information of the common neighbor node N obtained in step S405 to the region newly created by the common neighbor node N The number of triangles (| N |) is transmitted to the server 110 (S406-1), and the number of generated local triangles | N | is transmitted to the second node 122 (S406-2).

The server 110 updates the shape of the graph based on the common neighbor node N information received from the first node 121 and the number of local triangles generated by the common neighbor node N (S407).

In addition, each of the first node 121 and the second node 122 calculates the number (? N |) of the local triangles generated by the common neighbor node N to the local triangle information (? U,? V) (S408-1, S408-2). Specifically, the first node 121 reflects the number of local triangles (| N |) generated by the common neighbor node (N) to the local triangle information (? U) of the first node (121) (? U =? U + | N |), and the second node 122 updates its local triangle information (second triangle information)? V with a common neighbor node (? V =? V + | N |) by reflecting the number of local triangles (| N |) generated by the local triangles (?

In addition, the server 110 informs each common neighbor node of the first and second nodes 121 and 122 that the number of the local triangles is incremented by one (S409). For example, if the third node 123 is a common neighbor node of the first and second nodes 121 and 122, the server 110 requests the third node 123 to add the number of the local triangles by one .

Accordingly, the third node 123 can update its own local triangle information? W by adding one to its local triangle information? W (? W =? W + 1) (S410 ). In the above process, the operation sequence of steps S407, S408-1, S408-2, S409, and S410 may be changed depending on the situation.

As another method of calculating the number of local triangles using terminal resources, there is a method of reducing the shape of a graph in the server 110. This is a method managed by the server without direct connection between the nodes.

Hereinafter, a method for calculating the number of local triangles using terminal resources according to another embodiment of the present invention will be described with reference to FIG.

5 is a flowchart illustrating a method of calculating a local triangle number using terminal resources according to another embodiment of the present invention.

First, a request is made to add a new edge e between the first node 121 and the second node 122 (S501). At this time, the server 110 may receive a new edge addition request between the first node 121 and the second node 122 from the outside. As an example, the server 110 may receive a new edge addition request according to the input of the network manager which maintains and manages the system-wide network. As another example, the server 110 may have an edge connection between the first node 121 and the second node 122 due to user manipulation of at least one of the first node 121 and the second node 122 Can be requested. Alternatively, the server 110 may accept an edge connection request through its own evaluation if an edge connection between the first node 121 and the second node 122 is requested.

The server 110 informs the first node 121 of the addition of a new edge e between the first node 121 and the second node 122 in operation S502. At the same time, the server 110 transmits the information of the neighbor set information (second neighbor set information) Nv of the second node 122 to the first node 121.

Accordingly, the first node 121 adds the information of the second node 122 to its neighbor set information Nu (Insert v to Nu), updates its neighbor set information, The number of local triangles generated by the intersection (N) (common neighbor node) and the intersection (N) of the received second neighbor set information Nv and its neighbor set information (first neighbor set information) | N |) (S503). At this time, it is apparent that the node included in the area triangle newly generated through the new edge e is a neighbor node of both nodes (the first and second nodes 121 and 122).

Since the obtained result changes the shape of the graph and the number of the local hanger angles, the first node 121 transmits the information of the common neighbor node N obtained in step S503 to the region newly created by the common neighbor node N The number of triangles (| N |) is transmitted to the server 110 (S504).

The server 110 updates the shape of the graph based on the common neighbor node N information received from the first node 121 and the number of local triangles generated by the common neighbor node N (S505).

In addition, the first node 121 reflects the number of local triangles (| N |) generated by the common neighbor node N to its local triangle information (? U) (S506).

Meanwhile, the server 110 informs the common neighbor node N that the number of the local triangles is incremented by one (S507). For example, if the third node 123 is a common neighbor node of the first and second nodes 121 and 122, the server 110 requests the third node 123 to add the number of the local triangles by one .

Accordingly, the third node 123 can update its own local triangle information? W by adding one to its local triangle information? W (? W =? W + 1) (S508 ).

In addition, the server 110 informs the second node 122 of the addition of a new edge e between the first node 121 and the second node 122, and the local triangle (| N |) (S509).

Accordingly, the second node 122 adds (inserts to Nv) the information of the first node 121 received from the server 110 to its neighbor set information (second neighbor set information) Nv Updates its neighbor set information and updates its own local triangle information (? V) by reflecting the number (? N |) of the local triangles generated by the common neighbor node (N) (? V =? V + | N |) (S510).

This scheme increases the workload of the server 110 rather than the scheme of FIG. 4, but minimizes unstable interference between nodes. For example, if the second node 122 is responsible for transmitting the second neighbor set information Nv to the first node 121 in the method of FIG. 4, the server 110 takes charge of the method of FIG. Similarly, in FIG. 4, the first node 121 transmits the information of the common neighbor node N and the number of regional triangles (| N |) newly generated by the common neighbor node N to the second node 122 , The server 110 is responsible for updating the new graph shape.

In addition, the present invention encompasses various variants of calculating the number of distributed processing region triangles including these key elements. For example, there may be various variations such as a method of slightly changing the posterior relationship of the step or further increasing the role of the server.

As described above, according to the embodiment of the present invention, the large-scale graph analysis can be performed accurately and efficiently by avoiding the method in which the server obtains the local triangles all over and utilizing the resources of the node terminals to perform distributed processing.

For example, the embodiment of the present invention can be applied when detecting a spam account in the SNS service. Here, a user terminal using a SNS service or a browser is a node, and a server for providing an SNS service exists at the top.

In the local triangle counting method for detecting a spam account, a list of its friends (neighbors) is recorded in the storage space of each user terminal or browser, and the number of local triangles is recorded. At this time, the shape of the graph may be dispersively recorded in the node (terminal). Also, the establishment of a new friend relationship may be a situation where a new edge (e = (u, v)) is added. In the past, the server is performing graph analysis to search for spam accounts. According to the embodiment of the present invention, the graph analysis can be effectively and accurately performed using the user terminal to search spam accounts.

While the present invention has been described in connection with what is presently considered to be practical exemplary embodiments, it is to be understood that the invention is not limited to the disclosed embodiments, but, on the contrary, It is to be understood that the invention may be embodied in other specific forms. It is therefore to be understood that the above-described embodiments are illustrative in all aspects and not restrictive. The scope of the present invention is defined by the appended claims rather than the detailed description, and all changes or modifications derived from the scope of the claims and their equivalents should be construed as being included within the scope of the present invention.

110: server 121: first node
122: second node 123: third node

Claims (13)

Informing the first and second nodes at the server that a new edge is added between the first node and the second node;
Adding and updating information of the second node to the previously stored first neighbor set information at the first node and adding and updating information of the first node to the previously stored second neighbor set information at the second node ;
Transmitting the updated second neighbor set information from the second node to the second node;
Obtaining the number of local triangles generated by the common neighbor node and the common neighbor node based on the second neighbor set information and the first neighbor set information received from the second node at the first node; And
Transmitting the information of the common neighbor node and the number of the local triangles to the server at the first node;
A method for calculating the number of local triangles using terminal resources including.
The method according to claim 1,
Updating the number of the local triangles in the first local triangle information previously stored in the first node;
And calculating the number of local triangles using the terminal resource.
The method according to claim 1,
Transmitting the number of the local triangles to the second node at the first node; And
Updating the number of the local triangles received in the second local triangle information previously stored at the second node;
And calculating the number of local triangles using the terminal resource.
The method according to claim 1,
Updating the shape of the graph based on the information of the common neighbor node received from the server and the number of the local triangles;
And calculating the number of local triangles using the terminal resource.
The method according to claim 1,
Informing each of the common neighbor nodes of the server that the number of the local triangles is incremented by one; And
Adding 1 to the number of the local triangles included in the previously stored third region triangle information at the third node included in the common neighbor node;
And calculating the number of local triangles using the terminal resource.
2. The method of claim 1, wherein the step of informing that the new edge is added comprises:
Informing the first and second nodes that the new edge is added if at least one of the first and second nodes requests an edge connection between the first node and the second node
A method for calculating the number of local triangles using terminal resources.
Informing the first node at the server that a new edge is added between the first node and the second node;
Transmitting, by the server, second neighbor set information stored in the second node to the first node;
Adding and updating information of the second node to the previously stored first neighbor set information at the first node;
Obtaining the number of local triangles generated by the common neighbor node and the common neighbor node based on the updated first neighbor set information and the updated second neighbor set information at the first node; And
Transmitting the information of the common neighbor node and the number of the local triangles to the server at the first node;
A method for calculating the number of local triangles using terminal resources including.
8. The method of claim 7,
Updating the number of the local triangles in the first local triangle information at the first node;
And calculating the number of local triangles using the terminal resource.
8. The method of claim 7,
Updating the shape of the graph based on the information of the common neighbor node received from the server and the number of the local triangles;
And calculating the number of local triangles using the terminal resource.
10. The method of claim 9,
Notifying the server of the addition of the new edge to the second node and transmitting the number of the local triangles to the second node
And calculating the number of local triangles using the terminal resource.
11. The method of claim 10,
Updating information of the first node to the second neighbor set information at the second node and updating the number of the received local triangles in the previously stored second local triangle information;
And calculating the number of local triangles using the terminal resource.
10. The method of claim 9,
Informing each of the common neighbor nodes of the server that the number of the local triangles is incremented by one; And
Adding 1 to the number of the local triangles included in the previously stored third region triangle information at the third node included in the common neighbor node;
A method for calculating the number of local triangles using the terminal resources further included.
8. The method of claim 7, wherein notifying that the new edge is added comprises:
If an edge connection between the first node and the second node is requested from the outside, informing the first node that the new edge is added
A method for calculating the number of local triangles using terminal resources.
KR1020160012791A 2016-02-02 2016-02-02 System for calculating the number of the local triangular using the terminal resources and method thereof KR101940802B1 (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
KR1020160012791A KR101940802B1 (en) 2016-02-02 2016-02-02 System for calculating the number of the local triangular using the terminal resources and method thereof

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
KR1020160012791A KR101940802B1 (en) 2016-02-02 2016-02-02 System for calculating the number of the local triangular using the terminal resources and method thereof

Publications (2)

Publication Number Publication Date
KR20170091912A true KR20170091912A (en) 2017-08-10
KR101940802B1 KR101940802B1 (en) 2019-01-22

Family

ID=59652412

Family Applications (1)

Application Number Title Priority Date Filing Date
KR1020160012791A KR101940802B1 (en) 2016-02-02 2016-02-02 System for calculating the number of the local triangular using the terminal resources and method thereof

Country Status (1)

Country Link
KR (1) KR101940802B1 (en)

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN109993338A (en) * 2017-12-29 2019-07-09 中移(苏州)软件技术有限公司 A kind of link prediction method and device

Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
KR20130066352A (en) * 2011-12-12 2013-06-20 건국대학교 산학협력단 System and method for triangle counting sampling by using map-reduce
KR20150065261A (en) * 2013-12-05 2015-06-15 건국대학교 산학협력단 Apparatus and method for denial of service defense using triangle counting

Patent Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
KR20130066352A (en) * 2011-12-12 2013-06-20 건국대학교 산학협력단 System and method for triangle counting sampling by using map-reduce
KR20150065261A (en) * 2013-12-05 2015-06-15 건국대학교 산학협력단 Apparatus and method for denial of service defense using triangle counting

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN109993338A (en) * 2017-12-29 2019-07-09 中移(苏州)软件技术有限公司 A kind of link prediction method and device
CN109993338B (en) * 2017-12-29 2021-08-06 中移(苏州)软件技术有限公司 Link prediction method and device

Also Published As

Publication number Publication date
KR101940802B1 (en) 2019-01-22

Similar Documents

Publication Publication Date Title
CN109492380B (en) Equipment authentication method and device and block link point
CN107169094B (en) Information aggregation method and device
CN113807538B (en) Federal learning method, federal learning device, electronic equipment and storage medium
US9729500B2 (en) IP allocation pools
US10939228B2 (en) Mobile device location proofing
CN106528289B (en) Resource operation processing method and device
CN110601978B (en) Flow distribution control method and device
CN104283723A (en) Network access log processing method and device
CN111083179B (en) Internet of things cloud platform, and equipment interaction method and device based on same
US20180013610A1 (en) File delivery method, apparatus and system
US10452726B2 (en) In-network semantic mashup for an information-centric networking (ICN) network
CN104243598A (en) Information recommendation method and device
CN103139081A (en) Update method and nodes for distributed hash table routing lists
WO2014151507A1 (en) System and method for omni-channel identity matching
WO2019108892A1 (en) Identifying devices on a remote network
CN110674427B (en) Method, device, equipment and storage medium for responding to webpage access request
CN105100002A (en) Attribute operation method and device
Jiang et al. Connectivity-based skeleton extraction in wireless sensor networks
CN109471713B (en) Method and device for inquiring information
KR101940802B1 (en) System for calculating the number of the local triangular using the terminal resources and method thereof
CN105530323A (en) File upgrading method, related equipment and system
CN103997517A (en) CDN-node file synchronization method and device
US20180124576A1 (en) Method and apparatus for implementing member resource processing
CN110888892A (en) Block synchronization method, device and storage medium
CN107682271B (en) Method and device for generating routing line

Legal Events

Date Code Title Description
A201 Request for examination
E902 Notification of reason for refusal
E701 Decision to grant or registration of patent right
GRNT Written decision to grant