CN100536422C - Peer-to-peer network and its network resource inquiring method - Google Patents
Peer-to-peer network and its network resource inquiring method Download PDFInfo
- Publication number
- CN100536422C CN100536422C CNB2007100907165A CN200710090716A CN100536422C CN 100536422 C CN100536422 C CN 100536422C CN B2007100907165 A CNB2007100907165 A CN B2007100907165A CN 200710090716 A CN200710090716 A CN 200710090716A CN 100536422 C CN100536422 C CN 100536422C
- Authority
- CN
- China
- Prior art keywords
- network
- peer
- partition
- node
- internet resources
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Expired - Fee Related
Links
Images
Abstract
The invention discloses peer-to-peer network. The network includes partition network composed of agency nodes and user nodes in network, and agency network composed of all agency nodes in network. Partitioning geographical position the agency nodes and user nodes locate at constitute partition network in use for providing node information the network resources locate at. The agency network is in use for providing information of partition network the network resources locate at. The invention also discloses method for querying network resources based on the peer-to-peer network. Using the disclosed peer-to-peer network and the method for querying network resources can use resources of target network nearby, and raise transmission performance of network.
Description
Technical field
The present invention relates to the computer network and the communication technology, relate in particular to peer-to-peer network (P2P, Peer toPeer Network) and network resource query method thereof.
Background technology
P2P is a kind of distributed network, and it has broken traditional terminal/server, and (status of each node in this network all is reciprocity for C/S, Client/Server) pattern.The participant of network shares a part of hardware resource that each network node is had, as disposal ability, storage capacity, network concatenation ability, printer or the like, these hardware shared resources need provide service and content by network, can directly be visited by other peer node (Peer) and need not through intermediate entities.Participant in this network is the Internet resources suppliers, is again that Internet resources obtain taker.
Along with developing rapidly of internet and broadband access network, the P2P network has obtained a large amount of application and research, particularly obtain the attention of industry based on the second generation P2P network of distributed hash table (DHT, Distributed Hash Table) and overlay network (Overlay Network).Yet, along with going deep into of research, industry finds that this P2P network exists four more serious holding it back and carries out the problem that large-scale commercial applications is used: the first, and mismatch problem, specifically, overlay network is a logic virtual network, it and real network do not match, such as: the identifier that two nodes are assigned with is close, but the distance in real network may be far, thereby had a strong impact on the transmission performance of content route response performance and actual content data, caused network performance low; The second, service problem nearby, specifically, because user identifier and content designator uniform hashing are to the whole network in the DHT technology, make that user's service is not that nearby principle according to real network carries out, both caused the excessive problem of transregional flow, also reduced quality of services for users; The 3rd, hot issue, specifically, when certain Internet resources temperature is very high, copy number in network will be very many, carry out access but can be directed to certain several Peer, thereby the number of times that causes these several peer to be copied increases sharply, and hot issue occurs according to the storage index of these Internet resources of DHT principle; The 4th because Internet resources index information and Internet resources itself all are to be stored in user node, therefore, when the online user more after a little while, a lot of Internet resources can not guarantee to provide service, have influenced normal commercial the application.
Summary of the invention
In view of this, main purpose of the present invention is to provide a kind of peer-to-peer network, can utilize target network resource nearby and improve network transmission performance.
For achieving the above object, technical scheme of the present invention is achieved in that
A kind of peer-to-peer network comprises partition network that is made of local side node and user node in the network and the local side network that is made of owning administration's end node in the network;
Described partition network forms according to described local side node and user node residing geographical position division, is used to provide the nodal information at Internet resources place;
Described local side network is used to provide the partition network information at Internet resources place.
Wherein, described local side node and user node are respectively arranged with the partition number in corresponding geographical position of living in.
Wherein, described local side node is used to provide the partition network information at Internet resources place during as the node of local side network; Described local side node is used to provide the nodal information at Internet resources place during as the node of partition network.
Wherein, described partition network information is partition number.
Wherein, store the original of all-network resource and/or the copy of Internet resources in the described local side node.
Wherein, store the copy of Internet resources in the described user node.
Main purpose of the present invention is to provide a kind of network resource query method, can inquire target network resource nearby.
For achieving the above object, technical scheme of the present invention is achieved in that
A kind of network resource query method comprises the steps:
A. whether there is target network resource in the partition network under the inquiry,, then obtains the nodal information at this target network resource place, finish current querying flow if having; Otherwise, execution in step b;
B. inquire about whether there is target network resource in the local side network,, then obtain the partition network information at this target network resource place if having, and execution in step c; Otherwise, there is not this target network resource in the whole network, finish current querying flow;
C. according to the partition network information of obtaining, from the respective partition network, obtain the nodal information at this target network resource place.
Wherein, described partition network information is according to the residing geographical position of each node assigned sections number.
The technique scheme according to the present invention, because peer-to-peer network is made of local side network and partition network, again owing to partition network is divided according to the residing geographical position of each node, make on the one hand the inquiry of hot spot networks resource each subregion that is dispersed carry out, thereby help utilizing Internet resources nearby; Make that on the other hand overlay network and real network are mated.In addition,, thereby guaranteed the availability of each Internet resources because the all-network resource all has original on often online local side node, guarantee service normally provide and use normally carry out.
Description of drawings
Fig. 1 is a peer network architecture schematic diagram of the present invention;
Fig. 2 is Internet resources storage distribution schematic diagram of the present invention;
Fig. 3 is the flow chart of network resource query method of the present invention.
Embodiment
Below in conjunction with drawings and the specific embodiments, further specify technical characterictic of the present invention and function.
Referring to Fig. 1, Fig. 1 is a peer network architecture schematic diagram of the present invention.Peer-to-peer network 8 comprises partition network 6 that is made of local side node and user node in the network and the local side network 7 that is made of owning administration's end node in the network.Described partition network, form according to described local side node and user node residing geographical position division, be used to provide the nodal information at Internet resources place, each frame of broken lines is represented a partition network 6 among Fig. 1, wherein, Internet resources comprise service and the content that network provides at least.Described local side network is used to provide the partition network information at Internet resources place.
Wherein, the local side node often is online server, and the information processing capability of this node and information storage capability are all stronger; User node is non-often online user endpoints, the information processing capability of this node and information storage capability all a little less than.
Described local side node and user node all Random assignment have unique identifier, and are assigned partition number according to residing geographical position, and then mark off partition network according to partition number, and overlay network and real network are mated.
Referring to table one, table two, table three and table four, the route information table that table one is safeguarded during as the node of local side network for the local side node, the Internet resources storage concordance list that table two is safeguarded during as the node of local side network for the local side node, when table three is the local side node as the node of partition network or the route information table safeguarded of user node, when table four be the local side node as the node of partition network or the Internet resources safeguarded of user node store concordance list.
| ID1 | Next-ID1 |
| ID2 | Next-ID2 |
| | | | | | | | | | | | | | | | | | |
| IDn | Next-IDn |
Table one
| CID1 | Partition number tabulation 1 |
| CID2 | Partition number tabulation 2 |
| | | | | | | | | | | | | | | | | | |
| CIDn | Partition number tabulation n |
Table two
| ID1′ | Next-ID1′ |
| ID2′ | Next-ID2′ |
| | | | | | | | | | | | | | | | | | |
| IDn′ | Next-IDn′ |
| CID1 | Memory node tabulation 1 |
| CID2 | Memory node tabulation 2 |
| | | | | | | | | | | | | | | | | | |
| CIDn | Memory node tabulation n |
Table four
In table one, table three, table two and the table four, identifier is that the local side node of ID1, ID2......IDn is not only as the node of local side network but also as the node of partition network, safeguard the routing iinformation and the Internet resources storage index information of two networks simultaneously, specifically: authorities' end node is during as the node of local side network, the Internet resources storage index information of its maintenance is used to provide the partition network information at Internet resources place, i.e. recording identifier in the Internet resources storage index information is the partition number tabulation of the Internet resources storage of CID1, CID2......CIDn; Authorities' end node is during as the node of partition network, the Internet resources storage index information of its maintenance is used to provide the nodal information at Internet resources place, i.e. recording identifier in the Internet resources storage index information is the node listing of the Internet resources storage of CID1, CID2......CIDn.
Referring to table three and table four, identifier is ID1 ', ID2 ' ... the user node of an IDn ' node as partition network, only safeguard the routing iinformation and the Internet resources storage index information of partition network, this Internet resources storage index information is used to provide the nodal information at Internet resources place, i.e. recording identifier in the Internet resources storage index information is the node listing of the Internet resources storage of CID1, CID2......CIDn.
In order to ensure the availability of each Internet resources, the all-network resource all need have an original on the local side node, and the copy of storage networking resource on user node only.Certainly, copy that also can the storage networking resource on the local side node.
Referring to Fig. 2, Fig. 2 is Internet resources storage distribution schematic diagram of the present invention.For instance, the original of Internet resources 1 and Internet resources 2 is stored on the local side node A, and the original of Internet resources 3 and Internet resources 4 is stored on the local side Node B.Therefore suppose that present partition network 1 will increase the copy of Internet resources 4, owing to do not have Internet resources 4 in the partition network 1, after increasing Internet resources 4, need upgrade the storage index information of these Internet resources 4 simultaneously at partition network 1 and local side network 7.But increase the copy of Internet resources 1, Internet resources 2 or Internet resources 3 if desired at partition network 1, then only need the storage index information of these Internet resources of inquiry in partition network 1 to get final product.Equally, if partition network 1 will be deleted the copy of Internet resources 3, owing to be last Internet resources 3 in the partition network 1, therefore behind deletion Internet resources 3, need upgrade the storage index information of these Internet resources 3 simultaneously at partition network 1 and local side network 7.So just the variation of Internet resources is confined to the part as far as possible, has reduced message number and shortened the response time.
Based on peer-to-peer network shown in Figure 1, network resource query method of the present invention may further comprise the steps referring to Fig. 3:
Whether step 301 has target network resource in the partition network under the inquiry active user, if having, then obtains the nodal information at this target network resource place, finishes current querying flow; Otherwise, execution in step 302;
If have target network resource in the current partition network, then safeguard the nodal information that this target network resource place is arranged in the node of this partition network.
Whether step 302 has target network resource in the inquiry local side network, if having, then obtains the partition network information at this target network resource place, and execution in step 303; Otherwise, there is not this target network resource in the whole network, finish current querying flow;
If have target network resource in the local side network, then safeguard the partition network information that this target network resource place is arranged in the node of this local side network.
Wherein, partition network information is according to the residing geographical position of each node assigned sections number.
Referring to Fig. 2 and Fig. 3, suppose that the target network resource that the user node in the partition network 1 need be obtained is Internet resources 2, then only need can obtain an original and two copies of Internet resources 2 in partition network 1 inquiry, utilize Internet resources to get final product nearby.Such as, the target network resource that user node in the partition network 1 need be obtained is Internet resources 4, inquire about this subregion network 1 earlier, if do not have, inquire about local side network 7 again, and obtain there are Internet resources 4 in the partition network 2 thus, inquire about the nodal information that partition network 2 just can obtain storing these Internet resources 4 again.For another example, the target network resource that the user node in the partition network 1 need be obtained is non-existent Internet resources 5 in the whole network, also is to inquire about partition network 1 earlier, if do not have, inquire about local side network 7 again,, then can judge and do not have Internet resources 5 in the whole network if still do not have.Like this, just can realize the inquiry localization, therefore solve the Internet resources hot issue preferably.
Above-mentioned embodiment describes the present invention with preferred embodiment, but the example of this visualization of just lifting for the ease of understanding should not be considered to be limitation of the scope of the invention.Equally, according to the description of technical scheme of the present invention and preferred embodiment thereof, can make various possible being equal to and change or replacement, and all these changes or replacement all should belong to the protection range of claim of the present invention.
Claims (6)
1, a kind of peer-to-peer network is characterized in that, this network comprises partition network that is made of local side node and user node in the network and the local side network that is made of owning administration's end node in the network;
Described partition network forms according to described local side node and user node residing geographical position division, is used to provide the nodal information at Internet resources place;
Described local side network is used to provide the partition network information at Internet resources place;
Described local side node and user node are respectively arranged with the partition number in corresponding geographical position of living in;
Described local side node is used to provide the partition network information at Internet resources place during as the node of local side network; Described local side node is used to provide the nodal information at Internet resources place during as the node of partition network.
2. peer-to-peer network according to claim 1 is characterized in that, described partition network information is partition number.
3, peer-to-peer network according to claim 1 is characterized in that, stores the original of all-network resource and/or the copy of Internet resources in the described local side node.
4, peer-to-peer network according to claim 1 is characterized in that, stores the copy of Internet resources in the described user node.
5, a kind of network resource query method based on the described peer-to-peer network of claim 1 is characterized in that, this method comprises the steps:
A. whether there is target network resource in the partition network under the inquiry,, then obtains the nodal information at this target network resource place, finish current querying flow if having; Otherwise, execution in step b;
B. inquire about whether there is target network resource in the local side network,, then obtain the partition network information at this target network resource place if having, and execution in step c; Otherwise, there is not this target network resource in the whole network, finish current querying flow;
C. according to the partition network information of obtaining, from the respective partition network, obtain the nodal information at this target network resource place.
6, method according to claim 5 is characterized in that, described partition network information is according to the residing geographical position of each node assigned sections number.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CNB2007100907165A CN100536422C (en) | 2007-04-04 | 2007-04-04 | Peer-to-peer network and its network resource inquiring method |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CNB2007100907165A CN100536422C (en) | 2007-04-04 | 2007-04-04 | Peer-to-peer network and its network resource inquiring method |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN101026537A CN101026537A (en) | 2007-08-29 |
| CN100536422C true CN100536422C (en) | 2009-09-02 |
Family
ID=38744458
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CNB2007100907165A Expired - Fee Related CN100536422C (en) | 2007-04-04 | 2007-04-04 | Peer-to-peer network and its network resource inquiring method |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN100536422C (en) |
Families Citing this family (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101741869B (en) * | 2008-11-07 | 2013-04-24 | 华为技术有限公司 | Method and system for providing contents |
| CN101938509B (en) * | 2009-06-29 | 2015-11-25 | 日电（中国）有限公司 | For P2P network provides server, the method and system of nodal information |
| CN102065064A (en) * | 2009-11-18 | 2011-05-18 | 中兴通讯股份有限公司 | Peer-to-peer overlay network, method for storing service contents and method for downloading same |
| CN102118376B (en) * | 2010-01-06 | 2016-03-02 | 中兴通讯股份有限公司 | Content delivery network service device and content download method |
| CN105162852A (en) * | 2015-08-12 | 2015-12-16 | 西安电子科技大学 | Distributed resource sharing method of multi-exit heterogeneous wireless network |
| CN108769149B (en) * | 2018-05-14 | 2022-02-25 | 上海掌门科技有限公司 | Application partition processing method and device and computer readable storage medium |
-
2007
- 2007-04-04 CN CNB2007100907165A patent/CN100536422C/en not_active Expired - Fee Related
Also Published As
| Publication number | Publication date |
|---|---|
| CN101026537A (en) | 2007-08-29 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US20110047272A1 (en) | Dissemination of Network Management Tasks in a Distributed Communication Network | |
| Confais et al. | Performance analysis of object store systems in a fog and edge computing infrastructure | |
| CN110166220B (en) | Slicing method for slicing according to hash value of partition key | |
| CN100536422C (en) | Peer-to-peer network and its network resource inquiring method | |
| EP2091272B1 (en) | Method and device for constructing a node identifier | |
| Felber et al. | Survey on load balancing in peer-to-peer distributed hash tables | |
| CN101345628B (en) | Source node selection method | |
| Wehrle et al. | 7. distributed hash tables | |
| Trifa et al. | A novel replication technique to attenuate churn effects | |
| JP2007524325A (en) | Non-stop service system using voting and information updating and providing method in the system | |
| US9325787B2 (en) | Limited broadcast, peering among DHTs, broadcast put of limited content only | |
| Galluccio et al. | Georoy: A location-aware enhancement to Viceroy peer-to-peer algorithm | |
| US20100293223A1 (en) | Limiting storage messages in peer to peer network | |
| Dimakopoulos et al. | A peer-to-peer approach to resource discovery in multi-agent systems | |
| JP4251148B2 (en) | In-group communication method, system, and recording medium | |
| Confais et al. | Data location management protocol for object stores in a fog computing infrastructure | |
| Viana et al. | Twins: a dual addressing space representation for self-organizing networks | |
| JP2007156700A (en) | Information retrieval method, information registration method and network service information retrieval system | |
| Bandara et al. | Exploiting communities for enhancing lookup performance in structured p2p systems | |
| CN108965387A (en) | A kind of equalization methods and system improving P2P data storage survivability | |
| Amft et al. | The Benefit of Stacking Multiple Peer-to-Peer Overlays | |
| JP5434268B2 (en) | Distributed storage system, data file distributed storage method and program | |
| Confais et al. | SToN: A New Fundamental Trade-off for Distributed Data Storage Systems | |
| Li et al. | A Novel CAN Tree Coordinate Routing in Content-Addressable Network | |
| Takemoto et al. | A fault-tolerant content addressable network |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| C14 | Grant of patent or utility model | ||
| GR01 | Patent grant | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20090902 Termination date: 20150404 |
|
| EXPY | Termination of patent right or utility model |