KR20200003625A - Method for providing internet service using proof-of-reliability based on block-chain and distributed infrastructure p2p model - Google Patents

Abstract

Provided is a method of providing Internet service using proof of reliability (PoR) based on a blockchain and a distributed infrastructure P2P model. According to the present invention, the method comprises the steps of: transmitting a request event for retrieving or storing information through an Internet browser; selecting at least one pool having a predetermined proximity among clustered pools by a node forming a blockchain connected to a client terminal through distributed P2P; confirming reliability of the selected at least one pool using PoR; and selecting a pool having the highest reliability value and asynchronously receiving fragment data corresponding to the request event from a plurality of nodes included in the selected pool based on an index.

Description

How to provide Internet service using PoR proof based on blockchain and distributed infrastructure P2P model {METHOD FOR PROVIDING INTERNET SERVICE USING PROOF-OF-RELIABILITY BASED ON BLOCK-CHAIN AND DISTRIBUTED INFRASTRUCTURE P2P MODEL}

The present invention relates to an Internet service providing method using blockchain and distributed infrastructure P2P model-based PoR authentication, which verifies the reliability of each node to increase the availability and speed of resource requests and retrieval, and provides compensation for resource provision. Provide a method.

In recent years, data on the Internet is not only controlled by institutions without knowledge, but organizations are also continuing to develop browsers and operating systems to monitor individuals, and large organizations that sell the information obtained as a result of surveillance are unaffected. Although it has been accumulating trillion assets, individuals do not even have the right to claim it. In addition, in the Internet environment, there is a delicate battle between a company that wants to collect more customer information and a customer who wants to protect their privacy.However, for the Internet service, a company collects and utilizes customer information through terms and conditions and privacy policy. It informs the scope, purpose, and procedure of the loss, but it is difficult for the individual to exercise the rights of the information subject since the Internet service cannot be used without consent.

At this time, a technology for improving the privacy protection and the efficiency of the search operation has been developed. In this regard, Korean Patent Publication No. 2011-0056034 (published on May 26, 2011), which is a related art, provides a user with a search box of a search site. A search history storage means for storing the keyword entered in the web browser, and storing the link information of the search result posted by the search site according to the keyword for each search site, and in connection with the internet communication module of the web browser, Disclosed is a configuration for identifying and delivering a search site and a keyword, and checking and storing link information of a search result clicked by a user among search results posted by the search site.

However, the above-described configuration is merely to prevent others from seeing their keywords while using the existing Internet, and is a simple structure that cannot prevent information collected by a browser of the Internet. In addition, the information that a user obtains over the Internet does not change the paradigm that is limited and controlled by content providers, and the benefits of distributing personal information ensure that only a few large corporations maintain a structure called the ship. It is required to develop a platform having a profit structure that decentralizes and divides the cost of using information among information providers.

According to an embodiment of the present invention, data is distributed based on a blockchain and stored in a node forming a blockchain, and the reliability of the stored node is measured to retrieve and provide data from a pool forming a node having a high reliability. How to provide Internet service using PoR proof based on blockchain and distributed infrastructure P2P model, which allows nodes sharing the data resources to be rewarded with cryptocurrency to prevent equitable wealth distribution and control of contents by some large enterprises. Can be provided. However, the technical problem to be achieved by the present embodiment is not limited to the technical problem as described above, and other technical problems may exist.

As a technical means for achieving the above technical problem, an embodiment of the present invention, the step of transmitting a request event for retrieving or storing information through an Internet browser, a node forming a block chain connected to the client terminal and distributed P2P Selecting at least one pool having a predetermined proximity among the clustered pools, checking the reliability of the selected at least one pool using PoR proof, and selecting the pool having the highest reliability value. Selecting and receiving fragment data corresponding to the request event asynchronously based on the index from a plurality of nodes included in the selected pool.

According to any one of the above-described means for solving the problem of the present invention, by distributing the data based on the block chain and storing the data in the nodes forming the block chain, by measuring the reliability of the stored node data from the pool forming a node with high reliability Nodes that share data resources can be rewarded with cryptocurrencies to prevent equal distribution of wealth and control of content by some large enterprises.

FIG. 1 is a diagram illustrating an internet service providing system using block chain and distributed infrastructure P2P model based PoR authentication according to an embodiment of the present invention.
FIG. 2 is a block diagram illustrating a client terminal included in the system of FIG. 1.
FIG. 3 is a diagram illustrating an embodiment in which data distribution and file storage processes are implemented in an Internet service using block chain and distributed infrastructure P2P model based PoR authentication according to an embodiment of the present invention.
FIG. 4 is a diagram illustrating a data fragment copying process and a Merkle tree used for data distribution in an Internet service using block chain and distributed infrastructure P2P model based PoR authentication according to an embodiment of the present invention.
FIG. 5 illustrates an embodiment of collecting data fragments from a distributed web server and serving a client terminal in an Internet service using block chain and distributed infrastructure P2P model based PoR authentication according to an embodiment of the present invention, and a process of accessing the Internet. It is a diagram for explaining one embodiment.
6 is a flowchart illustrating a method for providing an Internet service using block chain and distributed infrastructure P2P model based PoR authentication according to an embodiment of the present invention.

DETAILED DESCRIPTION Hereinafter, exemplary embodiments of the present invention will be described in detail with reference to the accompanying drawings so that those skilled in the art may easily implement the present invention. As those skilled in the art would realize, the described embodiments may be modified in various different ways, all without departing from the spirit or scope of the present invention. In the drawings, parts irrelevant to the description are omitted in order to clearly describe the present invention, and like reference numerals designate like parts throughout the specification.

Throughout the specification, when a part is "connected" to another part, this includes not only "directly connected" but also "electrically connected" with another element in between. . In addition, when a part is said to "include" a certain component, which means that it may further include other components, except to exclude other components, unless specifically stated otherwise, one or more other features It is to be understood that the present disclosure does not exclude the possibility of the presence or the addition of numbers, steps, operations, components, parts, or combinations thereof.

As used throughout the specification, the terms "about", "substantially", and the like, are used at, or in close proximity to, numerical values when manufacturing and material tolerances inherent in the meanings indicated are intended to aid the understanding of the invention. Accurate or absolute figures are used to assist in the prevention of unfair use by unscrupulous infringers. As used throughout the specification of the present invention, the term "step of" or "step of" does not mean "step for".

In the present specification, the term 'unit' includes a unit realized by hardware, a unit realized by software, and a unit realized by both. In addition, one unit may be realized using two or more pieces of hardware, or two or more units may be realized by one piece of hardware.

Some of the operations or functions described as being performed by the terminal, the apparatus, or the device may be performed instead in the server connected to the terminal, the apparatus, or the device. Similarly, some of the operations or functions described as being performed by the server may be performed by the terminal, apparatus or device connected to the server.

In the present specification, some of the operations or functions described as mapping or matching with a terminal mean that a unique number of a terminal or identification information of an individual, which is identification data of the terminal, is mapped or matched. Can be interpreted as

Hereinafter, the present invention will be described in detail with reference to the accompanying drawings.

1 is a diagram illustrating an Internet service providing system using block chain and distributed infrastructure P2P model based PoR authentication according to an embodiment of the present invention. Referring to FIG. 1, the Internet service providing system 1 using block chain and distributed infrastructure P2P model based PoR authentication includes a client terminal 100, a distributed web server 300, a root DNS server 400, and a TLD (Top). Level Domain) may include a DNS server 500 and a pool 600. However, since the Internet service providing system 1 using the blockchain and distributed infrastructure P2P model-based PoR authentication of FIG. 1 is only an embodiment of the present invention, the present invention is not limitedly interpreted through FIG. 1.

In this case, each component of FIG. 1 is generally connected through a network 200. For example, as shown in FIG. 1, the client terminal 100 is a distributed web server 300, a root DNS server 400, a TLD DNS server 500, and a pool 600 via a network 200. It can be connected with. In addition, the distributed web server 300 may be connected to the client terminal 100 and the pool 600 through the network 200. In addition, the root DNS server 400 may be connected to the client terminal 100 and the TLD DNS server 500 through the network 200. In addition, the TLD DNS server 500 may be connected to the root DNS server 400 and the client terminal 100 through the network 200. In addition, the pool 500 may be connected to the client terminal 100 through the network 200.

Here, the network refers to a connection structure capable of exchanging information between respective nodes such as a plurality of terminals and servers. Examples of such a network include RF, 3rd Generation Partnership Project (3GPP) network, and long term (LTE). Evolution network, 5th Generation Partnership Project (5GPP) network, World Interoperability for Microwave Access (WIMAX) network, Internet, Local Area Network (LAN), Wireless Local Area Network (WLAN), Wide Area Network (WAN) , PAN (Personal Area Network), Bluetooth (Bluetooth) network, NFC network, satellite broadcasting network, analog broadcasting network, DMB (Digital Multimedia Broadcasting) network and the like, but is not limited thereto.

In the following description, the term “at least one” is defined as a singular and plural term, and each component may exist in the singular or plural, even though the term “at least one” does not exist, and may mean the singular or plural. It will be self explanatory. In addition, the singular or plural elements may be changed according to embodiments.

The method according to an embodiment of the present invention does not use an existing Internet browser, a search engine, an operating system, a web server, a domain system, but a browser, a search engine, an operating system, and a web based on a distributed infrastructure P2P model that is not centralized. All resources in servers, domain systems, and storage spaces use computing or networking resources corresponding to the nodes that make up the blockchain. To this end, each node in the blockchain is evaluated for reliability when a client requests a file or performs a search, which is credited with PoR proof, and is highly trusted. The more the more resources can be provided to the client, the reward for providing the resources, which may be cryptocurrency. At this time, since the client cannot determine all the reliability of all nodes, the node is divided into a pool including a plurality of nodes, and it is determined whether resources can be given to the client based on the reliability of the pool. In this way, the resources are distributed and stored, and the stored partitioned data are collected and provided at the client's request, and if there is an error in the data, if there is a change in the data, all nodes in the blockchain share the same file. By having the ability to detect to hold, the same response to the same request can exist anywhere, anytime.

Each configuration will be described based on the basic concept according to the embodiment of the present invention.

The client terminal 100 stores data through a node consisting of a distributed infrastructure P2P and a blockchain using a web page, an app page, a program or an application related to an Internet service using a blockchain and distributed infrastructure P2P model based PoR authentication. The terminal may request, request an internet search, or use a streaming service. In addition, the client terminal 100 may be a terminal that selects the pool 600 having the closest and highest reliability among the plurality of pools 600 connected to the client terminal 100 and requests data. In addition, when the client terminal 100 makes a domain request, that is, when url search is performed, the client terminal 100 may be a terminal that obtains a response through the root DNS server 400 or the TLD DNS server 500. Of course, a node may be a node from a viewpoint of providing a resource to a client terminal, but a role of requesting and receiving a resource is defined as a client, and a role of providing a resource is defined as a node. Of course, the client terminal may be a node when providing the pores, it will be apparent that the node may also be a client terminal.

Here, the client terminal 100 may be implemented as a computer that can access a server or a terminal in a remote place through a network. Here, the computer may include, for example, a navigation, a laptop equipped with a web browser, a desktop, a laptop, and the like. In this case, the client terminal 100 may be implemented as a terminal that can access a server or terminal in a remote place through a network. The client terminal 100 is, for example, a wireless communication device that ensures portability and mobility, and includes a navigation, a personal communication system (PCS), a global system for mobile communications (GSM), a personal digital cellular (PDC), and a personal PHS (PHS). Handyphone System (PDA), Personal Digital Assistant (PDA), International Mobile Telecommunication (IMT) -2000, Code Division Multiple Access (CDMA) -2000, W-Code Division Multiple Access (W-CDMA), Wireless Broadband Internet (WBRO) terminal, All types of handheld based wireless communication devices such as smartphones, smartpads, tablet PCs, and the like may be included.

The distributed web server 300 may be a server that always responds to a file request of the client terminal 100 using an Internet service web page, an app page, a program, or an application using blockchain and distributed infrastructure P2P model based PoR authentication. . In the blockchain, all are defined as nodes, and among them, may be defined as a server for responding to a request of the client terminal 100 anytime and anywhere. The distributed web server 300, which may be a dynamic or static web server, collects, arranges, and sorts data fragments distributed in the pool 600 by using a fragment collector when a request from the client terminal 100 exists. After the processing of the server may be transmitted to the client terminal (100).

Here, the distributed web server 300 may be implemented as a computer that can access a server or a terminal in a remote place through a network. Here, the computer may include, for example, a navigation, a laptop equipped with a web browser, a desktop, a laptop, and the like.

The root DNS server 400 may be a name server for an Internet DNS root region using an internet service related web page, an app page, a program, or an application using block chain and distributed infrastructure P2P model based PoR authentication. In this case, the root DNS server 400 may be a server that directly responds to the recording request of the client terminal 100 occurring in the root zone, and other requests may be authorized to the TLD DNS server 400 to perform a surrogate response. . As the distributed web server 300 is also a node that is a component in the blockchain, the root DNS server 400 is also a component in the blockchain. The corresponding element is defined as a pool, not a node. Accordingly, the root DNS server 400 may include a plurality of nodes. That is, a distributed web server 300 is a node capable of waiting 24 hours among a plurality of nodes, and a set pool of nodes responding to a recording request occurring in a root zone among a pool of a plurality of nodes is configured as a root DNS server ( 400). The pool at this time is different from the pool 600, which means that the condition for forming the root DNS server 400 must be a pool having a high reliability ranking, for example, within ranking 10. In addition, the root DNS server 400 may store address information of all valid TLD DNS servers 500. Accordingly, the root DNS server 400 may directly transmit and receive information with the TLD DNS server 500.

Here, the root DNS server 400 may be implemented as a computer that can access a server or a terminal in a remote place through a network. Here, the computer may include, for example, a navigation, a laptop equipped with a web browser, a desktop, a laptop, and the like.

The TLD DNS server 500 may be a server that holds a higher ranked pool using a web page, an app page, a program, or an application related to an Internet service using a blockchain and distributed infrastructure P2P model-based PoR proof, or is a higher ranked pool. In this case, the TLD DNS server 500 provides the information requested by the root DNS server 400 or holds pieces of content data that match the information received from the TLD DNS server 500 at the root DNS server 400. If the pool is informed, it may be a server providing information corresponding thereto.

Here, the TLD DNS server 500 may be implemented as a computer that can access a server or terminal in a remote place through a network. Here, the computer may include, for example, a navigation, a laptop equipped with a web browser, a desktop, a laptop, and the like.

The pool 600 may be a set of nodes that are requested data from the client terminal 100 using a web page, an app page, a program, or an application related to Internet services using blockchain and distributed infrastructure P2P model based PoR authentication. In this case, a manager managing the pool 600 may exist, and the manager may of course be a node. In addition, the pool 600 has a reliability based on the reliability of each node, and based on this, the pool 600 is provided with an opportunity to provide data to the client terminal 100. Can be.

Here, the plurality of nodes included in the pool 600 may be implemented as a computer that can access a server or a terminal in a remote place through a network. Here, the computer may include, for example, a navigation, a laptop equipped with a web browser, a desktop, a laptop, and the like. In this case, the plurality of nodes included in the pool 600 may be implemented as a terminal that can access a server or terminal in a remote place through a network. The plurality of nodes included in the pool 600 may be, for example, a wireless communication device that ensures portability and mobility, and includes navigation, personal communication system (PCS), global system for mobile communications (GSM), and personal digital cellular (PDC). ), Personal Handyphone System (PHS), Personal Digital Assistant (PDA), International Mobile Telecommunication (IMT) -2000, Code Division Multiple Access (CDMA) -2000, W-Code Division Multiple Access (W-CDMA), Wibro (Wireless) It may include all kinds of handheld based wireless communication devices such as a Broadband Internet terminal, a smart phone, a smart pad, a tablet PC, and the like.

FIG. 2 is a block diagram illustrating a client terminal included in the system of FIG. 1, and FIGS. 3 to 5 illustrate an Internet service using block chain and distributed infrastructure P2P model based PoR authentication according to an embodiment of the present invention. A diagram for describing one embodiment implemented. Hereinafter, although described with reference to FIG. 2, the components or concepts included in FIG. 2 will be described with reference to FIGS. 3 to 5.

2, the client terminal 100 may include a transmitter 110, a selector 120, a confirmer 130, and a receiver 140.

The distributed web server 300 according to an embodiment of the present invention or another server (not shown) operating in conjunction with the client terminal 100, the root DNS server 400, the TLD DNS server 500, and the pool 600. When transmitting an Internet service application, a program, an app page, a web page, etc. using a blockchain and distributed infrastructure P2P model based PoR authentication, a client terminal 100, a root DNS server 400, a TLD DNS server 500, The pool 600 may install or open Internet service applications, programs, app pages, web pages, and the like using blockchain and distributed infrastructure P2P model based PoR authentication. In addition, the service program may be driven in the client terminal 100, the root DNS server 400, the TLD DNS server 500, and the pool 600 using a script executed in a web browser. Here, the web browser is a program that enables the use of the World Wide Web (WWW) service, and refers to a program that receives and displays hypertext described in HTML (hyper text mark-up language), for example, Netscape. , Explorer, chrome and the like. In addition, an application means an application on a terminal, and includes, for example, an app running on a mobile terminal (smartphone).

Referring to FIG. 2, the transmitter 110 may transmit a request event for searching or storing information through an internet browser. At this time, the Internet browser is an Internet browser developed according to an embodiment of the present invention, which is a browser that can access both the existing website and the platform-based website of the present invention, and collects the user's data and transmits it to other organizations without permission. It is a browser that improves security and freedom using PoR protocol. In this case, PoR will be described later.

The selector 120 may select at least one pool 600 having a predetermined proximity among the pools 600 in which the nodes forming the blockchain connected to the client terminal 100 by distributed P2P are clustered. In this case, the node may be a miner located in the pool, and may be in charge of maneuvering power to provide network resources and computing resources for the client terminal 100 while renting their respective fast bandwidth and extra hard disk space. It may be a terminal that receives an incentive virtual currency in exchange for. The node then takes care of the distributed portion of the data, and the new Merkle Tree leads to the previously created Merkle Tree. In addition, the pool 600 is an aggregation space of nodes as described above, and one pool 600 may include one pool manager. The pool 600 may communicate directly with the client terminal 100, which may be via an application or a browser. The pool manager can then be randomly determined within the range of trusted nodes. Due to the introduction of such a pool, it is possible to operate efficiently when reflecting data distributed to other nodes. The number of nodes that can be included in each pool 600 is limited, and the introduction of this pool 600 concept can be much easier to find a node suitable for itself in the client terminal 100. That is, searching 10 pools is much better than searching all 1000 nodes. At this time, one pool may accommodate 1000 nodes, but the number may increase or decrease according to an embodiment.

The identification unit 130 may confirm the reliability of the selected at least one pool 600 using PoR proof. At this time, the PoR proof means a formula (R = Ut + Sr) in which the reliability R of the node is calculated based on the sum of the operating time of each node and the storage space reputation. The operating time Ut for each node may be calculated as a percentage of the total time T for which one node can perform a data storage function every one hour P. The storage reputation (Sr) is calculated as a percentage of the ratio of the average capacity of the storage space (S) of one node to the preset minimum maintenance storage space (Mms) that must be maintained at each node for one hour. Can be. The reliability of the pool 600 is a value obtained by dividing the reliability Ri of the plurality of nodes included in the pool 600 (Σ, i is from 1 to n) divided by the number of nodes (n). The node that is an average of the reliability of the node and transmits and receives a message with the client terminal 100 may be a pool 600 manager node that is a node belonging to the pool 600 while managing a plurality of nodes in the pool 600.

In other words, the key to a successful distributed application starts with maintaining the reliability of the distributed node at the highest level of activation, and a high-reliability node can ensure fast and reliable connectivity to the distributed network. One node must be able to reserve storage space for at least one piece of data that corresponds to one storage request. In other words, the minimum storage space requirement must be met to meet the average demand for storage requests that will occur at any given time without notice. To this end, reliability and PoR proof are used, where P is expressed in one hour and in seconds. At this time, it is obvious that the value of P is changeable according to the embodiment and is not described in order to exclude other times.

Of the above-mentioned parameters, the unit of T is also seconds, and the unit of Ut is also defined as seconds. S, the average capacity of one storage space, requires at least 15 gigabytes of storage for miners. And, if the concept of Sr is necessary, it is to prevent the high score of reliability with only one element of the storage space. That is, a node must prepare enough storage space as much as possible for the data host whenever there is a storage request, thus preparing for concentrating storage requests for large amounts of data to some nodes, which increases the speed of the Internet. Can lead naturally. Mms may be, for example, 1,000 GB if the condition should continue to be 1,000 GB.

As mentioned above, the concept of pool can significantly reduce the search time of a specific node of a client in a distributed hash table. A node that can send and receive messages with a client is not defined as a number of general nodes, but is defined as a node that holds the position of pool manager. Because. At this time, the pool manager can be selected based on the uptime reputation and response rate, and the pool manager can constantly monitor the performance status and abnormality of the nodes in the pool while sending messages to the nodes at regular intervals. At every client request, the pool manager should always be ready to respond immediately.

For this purpose, files must be distributed and stored in each node. This is called data fragmentation, which will be described with reference to FIG. 3. First, referring to FIG. 3A, a schematic diagram of a system including a client terminal 100 and a pool 600 is shown. In order to respond to a request of the client terminal 100 in such a network structure, a file stored in each node must exist. This is defined as decentralized storage components.

The data partitioning process refers to a process of dividing data into smaller pieces for easier management, which is a method of applying a distributed algorithm to a storage network. In this case, the distribution algorithm may consider parameters of the pool location, bandwidth, uptime rank, and number of storage devices. Here, the factor to be considered as a priority is the reliability of the nearest pool, and the reliability is as described. In this case, the maximum size of the distributed data may be 4 MB, but this may be increased or decreased according to an embodiment. For example, it takes about 0.07 seconds to load data based on Korea's average network speed of 60.58 MBps. The location of the pool is one of very important factors for speed and reliability. When storing and retrieving data in the client terminal 100, the closest pool is selected based on the client terminal 100 as described above. In addition, factors such as the number of memories, reliability, bandwidth, and uptime may be considered.

In this case, since the pool 600 constantly maintains the record by synthesizing the storage devices used by the nodes in the pool, it may be helpful to find the pool 600 that can sufficiently store the data distributed at a given time. This may eliminate unnecessary communication between the client terminal 100 and the node. In addition, it is possible to avoid using data contained in other pools that do not meet the conditions. In this case, when there is no storage device to accommodate the data distributed in the adjacent pool, it may be stored in another pool, and nodes in the same pool may communicate with more frequency and period than nodes in the other pool. In this case, when the bandwidth condition does not satisfy the reference value, when the data distribution process is performed, the size of the fragment of the distributed data may also be reduced.

When the data distribution process is operated, one file of the client terminal 100 is divided into data fragments, and the divided data fragments must be extracted from the client terminal 100 to be distributed to each node. You will be inspected as in b). The Merkle Tree Debris Inspection can lightly handle heavy hashes that burden the I / O and processing units. In addition, the data fragment distribution process may store the Merkle Tree root and length of the client terminal 100, and may improve the transmission of the data fragment and the Merkle Tree leaf node. When partitioning and distributing data in parallel, the data fragments can be efficiently distributed to the nodes in the pool 600. At this time, it may be based on the open source IPFS protocol to facilitate fragment storage in the pool 600. On the other hand, copying data pieces refers to replicating and maintaining pieces. That is, the node can replicate the data fragments from the nodes in the adjacent pool 600, to ensure the practicality of the data fragments and to prepare for the case that some nodes do not synchronize.

2, the receiver 140 selects the pool 600 having the highest reliability value and asynchronously selects fragment data corresponding to the request event from a plurality of nodes included in the selected pool 600. Can be received based on the index. In this case, when the receiving unit 140 cannot process the request event in any one of the plurality of nodes, any one node may transmit the request event to a node existing in the other pool 600. In addition, a plurality of nodes of each pool 600 may be held by executing data fragmentation mirroing that maintains a plurality of copies of the data fragments in a mirror site format. In this case, the receiving unit 140 receives the asynchronously based on the index because a plurality of nodes included in the pool 600 are broadcast through the P2P Gossip protocol at different clocks that are different or the same. to be. Here, the Gossip protocol is a peer that transmits a message to any peer in the vicinity of the one that has received one message, and was developed to provide scalability while providing high reliability of message transmission. Will be omitted.

In this case, data fragment copying will be described with reference to FIG. 4. In this case, referring to FIG. 4A, when a node in the pool 600 runs out of available resources held by the pool 600 or receives no more requests, the node requests help from a node in another pool. For example, the first pool Pool 1 is a close pool with average reliability in the whole, and the third pool Pool3 is the farthest pool with the highest reliability among all nodes. In this case, the strategy of renting a node is to maintain multiple copies of a piece of data in the form of a mirror site so that a file can be easily recovered even if the Internet connection fails. Thus, even if one node stops working, the adjacent node informs the other nodes, and each node contains a history of the data fragments, so that the information on the node that retains (owns, owns) a copy of the data fragments, and the currently active mirror. The number of sites can be included, allowing you to handle requests that come to you with help from other nodes.

In addition, referring to Figure 4 (b), there is shown a diagram for explaining the Merkle tree used for data distribution, Merkle tree is a family structure of a data structure, that is, a hash list woven into a hash, a kind of tree structure, leaf Nodes are hashes of blocks containing data, and non-leaf nodes are hashes of child nodes. At this time, there are two branches of Merkle Tree, that is, up to two child nodes of each node. Leaf and data of Merkle Tree may be stored in the node, and the root of the Merkle Tree may be stored in the wallet. Merkle proof can be used to perform PoR proof in the client terminal (100). In other words, the most important factor in a distributed P2P system is data proof, because the same data is distributed in multiple regions, and when a part of data located in one place is changed, data of all regions must be changed. As a result, data attestation serves to prove that the same data exists everywhere, but every time one system wants to verify the data, it cannot go through the data attestation process. To prevent consumption. To this end, the amount of data transmitted over the network is limited as constant as possible, but rather than transmitting the entire file over the network, a hash of the file is transmitted.

Therefore, when the data held by any one node of the plurality of nodes is changed, the data of all nodes in the blockchain is changed, and the data proof held by the plurality of nodes is searched through the Merkle Tree and the Merkle Tree (Retrievability via Merkle Tree). and Merkle Proof), when the first node in the blockchain sends a hash of the data file to the second node, the second node compares the hash stored in the Merkle Tree root with the transmitted hash. If there is a change, and if the result of the check is a change, the two nodes of the transmitted hash are requested to the first node until the changed data is found, and the first node generates a hash in response to the request and then the first node. Can transmit to 2 nodes.

With the method described above, computers can compute multiple hashes at once because they are running simultaneously, and the computer is much faster because it only sends hashes, not entire files, over the network. In addition, if data with different contents is found, fixing the error portion rather than rewriting the entire file to correct the error can help save time. This means that Merkle Tree is useful in distributed systems because it doesn't need to verify the entire file each time, and can help determine if an unverified source is found or authentic.

Meanwhile, a distributed web server 300 will be described with reference to FIG. 5A. In order to respond to the request of the client terminal 100, the distributed web server 300 and the client terminal 100 for a plurality of nodes constituting the blockchain may be interworked. The distributed web server 300 is connected to a fragment collector for collecting and arranging pieces of data held by a plurality of nodes, and arranged so that pieces of data requested from the client terminal 100 form one file through the fragment collector. And aligned, the distributed web server 300 may transmit to the client terminal 100 when the processing of the arrangement and the sorted data is completed.

In this case, when the client terminal 100 requests dynamic content, that is, a script or code of a type that executes before the content is operated on the web browser, the client terminal 100 searches for and confirms a DNS address. If confirmed, the content can be requested. In this case, the distributed web server 300 owns the information on the requested content based on the DNS address, and the owned information also includes the content type and metadata on how to respond for each request. At this time, the static website can be sufficiently provided as a request to the general pool 600 even without going through the distributed web server (300).

Referring to FIG. 5B, when the client terminal 100 searches for a URL address through a browser, a root DNS server, which is a pool 600 that is responsible for a domain name system (DNS) in a blockchain, is a DNS root zone. The TLD DNS server (top-level domain domain name system server) including the pool 600 whose response to the recording request can be directly responded to the client terminal 100 and whose ranking is set to the reliability level within the reference value when the DNS root zone is not. Can be authorized to respond on behalf of.

In this case, DNS is a hierarchical naming system for computers, services, or resources connected to the Internet or a private network. A DNS server connects different information to a domain assigned to an object participating in the Internet or a network. You can register different information in the domain names assigned to you, and use network protocols to translate domain names into numeric IP addresses to find and identify blockchain services and devices on a particular computer. The domain format according to an embodiment of the present invention may be “d” + IANA (Internet Assignment Number Management Agency).

In addition, the cryptocurrency given as a reward will be described. The virtual currency is given in return for each of the above-described provision actions of the node, such as each node providing fragment data at the request of the client terminal 100, collecting fragment data, and providing the fragment data to the client terminal 100 as a single file. . At this time, the Internet service according to an embodiment of the present invention does not need to provide advertising revenue to third parties because it has a system of self-financing having self-sufficiency by collecting virtual currency. At present, large enterprises do not want individuals to own important information, and censorship and control are being performed. When applying cryptocurrency according to an embodiment of the present invention, in order to obtain virtual currency, contents within a blockchain A node that provides a node or a piece of data that owns or provides a piece of content or data that is more valuable, will increase the quality of computing resources and networking resources to achieve higher reliability.

In this case, the parameters for evaluating the value of the content may include the number of contents, emotional participation, total views, single views, viewing duration, relevance of search ability, number of links, number of requests, and the like. Emotional Engagement (E) is an index for measuring the preference for content through emotional indicators mutually formed on the Internet. In this case, an emoticon having a preference may be given a +1, and a negative emoticon including a antagonism may be given a -1. View count (Vc) is the number of daily views of content, for example, if a two-hour movie had 2 million views, 2 million could be an arithmetic figure of content viewing demand, so a high view count It can be interpreted to mean high value. In addition, the unique view count (Vu) is an arithmetic value based on content if the view count is an arithmetic value based on a visitor as compared to the view count. Refers to the number of visits per viewer for one piece of content and excludes viewing of duplicated content. Stickiness duration (S) is the length of time that content viewers, pages, and website visitors stay.

Relevance (R) is the relevance of the content. In other words, the suitability of search ability is determined by the transparency of search engines and algorithms. Since search engines such as Google are designed to generate advertising revenue, they inevitably bring up search results irrelevant to the user's original interest and degraded query contents. It may also result in overcompensation to inappropriate creators who have created. In contrast, in one embodiment of the present invention, since a part of the mined cryptocurrency, for example, 10% is used for maintenance, there is no third party institution. Linked (L) is the number of times mentioned or referenced on the Internet, and SPC is the economic value of cryptocurrency.

Using the above-described parameters and Equation 1, the value Cv for the creative content CC given at a specific time S may be calculated. At this time, Dv means the demand of the Internet service of the present invention in the market, and SPC means the value of virtual currency in the market. The higher the Dv, the higher the real value of the SPC, and the lower the Dv, the lower the real value of the SPC.

The above-mentioned matters for the method of providing the Internet service using the blockchain and distributed infrastructure P2P model based PoR authentication of FIG. 2 to FIG. 5 are described above with reference to FIG. 1 through the Internet service using the blockchain and distributed infrastructure P2P model based PoR authentication. The description of the providing method may be easily inferred from the same or described contents, and thus descriptions thereof will be omitted.

FIG. 6 is a diagram illustrating a process of transmitting and receiving data between components included in the Internet service providing system using the blockchain and distributed infrastructure P2P model-based PoR authentication of FIG. 1 according to an embodiment of the present invention. Hereinafter, an example of a process in which data is transmitted and received between each component will be described with reference to FIG. 6, but the present disclosure is not limited to the above-described embodiments, and is illustrated in FIG. 6 according to the various embodiments described above. It is apparent to those skilled in the art that the process of transmitting and receiving data may be changed.

Referring to FIG. 6, the client terminal transmits a request event for retrieving or storing information through an internet browser (S6100).

The client terminal selects at least one pool having a predetermined proximity among the pools in which nodes forming a blockchain connected to the client terminal by distributed P2P are clustered (S6200), and reliability of the selected at least one pool. Verify using the PoR proof (S6300).

In addition, the client terminal selects the pool having the highest reliability value, and receives the fragment data corresponding to the request event asynchronously from the plurality of nodes included in the selected pool based on the index (6400).

The order between the above-described steps S6100 to S6400 is merely an example, and is not limited thereto. That is, the order between the above-described steps (S6100 ~ S6400) may be changed mutually, some of the steps may be executed or deleted at the same time.

The details of the method for providing the Internet service using the blockchain and distributed infrastructure P2P model based PoR authentication of FIG. 6 are described above with reference to the blockchain and distributed infrastructure P2P model based PoR authentication. The description of the providing method may be easily inferred from the same or described contents, and thus descriptions thereof will be omitted.

The details of the method for providing the Internet service using the blockchain and distributed infrastructure P2P model based PoR authentication of FIG. 6 are described above with reference to the blockchain and distributed infrastructure P2P model based PoR authentication. The description of the providing method may be easily inferred from the same or described contents, and thus descriptions thereof will be omitted.

An internet service providing method using blockchain and distributed infrastructure P2P model based PoR authentication according to an embodiment described with reference to FIG. 6 includes a record including instructions executable by a computer such as an application or a program module executed by the computer. It may also be implemented in the form of a medium. Computer readable media can be any available media that can be accessed by a computer and includes both volatile and nonvolatile media, removable and non-removable media. In addition, computer readable media may include all computer storage media. Computer storage media includes both volatile and nonvolatile, removable and non-removable media implemented in any method or technology for storage of information such as computer readable instructions, data structures, program modules or other data.

According to an embodiment of the present invention, an Internet service providing method using blockchain and distributed infrastructure P2P model-based PoR authentication includes an application basically installed in a terminal (that is, a program included in a platform or an operating system basically loaded in the terminal). It may also be executed by the application (ie, a program) that the user installed directly on the master terminal through an application providing server, such as an application store server, an application or a web server associated with the service. In this sense, the Internet service providing method using the blockchain and distributed infrastructure P2P model-based PoR authentication according to the embodiment of the present invention described above is implemented as an application (ie, a program) that is basically installed in a terminal or directly installed by a user. And a computer readable recording medium such as a terminal.

The foregoing description of the present invention is intended for illustration, and it will be understood by those skilled in the art that the present invention may be easily modified in other specific forms without changing the technical spirit or essential features of the present invention. will be. Therefore, it should be understood that the embodiments described above are exemplary in all respects and not restrictive. For example, each component described as a single type may be implemented in a distributed manner, and similarly, components described as distributed may be implemented in a combined form.

The scope of the present invention is shown by the following claims rather than the detailed description, and all changes or modifications derived from the meaning and scope of the claims and their equivalents should be construed as being included in the scope of the present invention. do.

Claims (7)

In the Internet service providing method executed in the client terminal,
Transmitting a request event for retrieving or storing information through an internet browser;
Selecting at least one pool having a predetermined proximity among clustered pools by nodes forming a blockchain connected to the client terminal through distributed P2P;
Confirming reliability of the at least one selected pool using PoR proof;
Selecting a pool having the highest reliability value and asynchronously receiving fragment data corresponding to the request event from a plurality of nodes included in the selected pool based on an index;
Internet service providing method using a blockchain and distributed infrastructure P2P model-based PoR proof, including.
The method of claim 1,
The PoR proof means a formula (R = Ut + Sr) in which the reliability R of the node is calculated based on the sum of uptime and storage space reputation of each node.
The uptime Ut for each node is calculated as a percentage of the total time T at which one node can perform a data storage function every 1 hour P,
The storage space reputation (Sr) is calculated as a percentage of the ratio of the average capacity of the storage space margin (S) of one node to the predetermined minimum maintenance storage space (Mms) that must be maintained at each node for 1 hour. Internet service providing method using blockchain and distributed infrastructure P2P model-based PoR proof.
The method of claim 2,
The reliability of the pool is a value obtained by adding up the reliability Ri of the plurality of nodes included in the pool (Σ, i is from 1 to n) divided by the number of nodes (n). Average of reliability,
The node for transmitting and receiving a message with the client terminal is a pool manager node that is a node belonging to the pool while managing a plurality of nodes in the pool, Internet service providing method using block chain and distributed infrastructure P2P model based PoR authentication.
The method of claim 1,
Selecting a pool having the highest reliability value, and receiving the fragment data corresponding to the request event asynchronously from the plurality of nodes included in the selected pool based on the index,
If any one of the plurality of nodes is unable to process the request event, the one node sends the request event to a node in another pool;
Including,
Internet services using PoR proof based on blockchain and distributed infrastructure P2P model, where multiple nodes in each pool are held by executing Data Fragmentation Mirroing, which maintains multiple copies of the data fragments in the form of mirror sites. How to Provide.
The method of claim 1,
When data held by any one node of the plurality of nodes is changed, data of all nodes in the blockchain is changed,
Proof of data held by the plurality of nodes is proved using a retrievability via Merkle Tree and Merkle Proof,
When the first node constituting the blockchain transmits a hash of the data file to the second node, the second node compares the hash stored in the Merkle tree root with the transmitted hash to check whether there is a change,
If there is a change as a result of the checking, until the changed data is found, two subtree roots of the transmitted hash are requested to the first node, and the first node generates a hash in response to the request and then the The Internet service providing method using the blockchain and distributed infrastructure P2P model-based PoR authentication to transmit to the second node.
The method of claim 1,
In order to respond to a request of the client terminal, a distributed web server for the plurality of nodes constituting the blockchain and the client terminal are interworked.
The distributed web server is connected to a fragment collector for collecting and arranging pieces of data held by the plurality of nodes, and arranging and arranging the pieces of data requested from the client terminal to form one file through the fragment collector. Become,
The distributed web server transmits to the client terminal when processing of the arranged and aligned data is completed, the Internet service providing method using blockchain and distributed infrastructure P2P model based PoR authentication.
The method of claim 1,
When the client terminal retrieves a URL address through a browser, a root DNS server that is a pool in charge of a domain name system (DNS) in the blockchain directly responds to a recording request in a DNS root region to the client terminal.
Blockchain and distributed infrastructure P2P is authorized to respond to the TLD DNS server (Top-Level Domain Domain Name System Server) including the pool that the ranking set to the reliability is within the reference value if not the DNS root zone. Method of providing Internet service using model based PoR proof.

Images