CN100473007C - Content exchange network - Google Patents
Content exchange network Download PDFInfo
- Publication number
- CN100473007C CN100473007C CNB2006100015727A CN200610001572A CN100473007C CN 100473007 C CN100473007 C CN 100473007C CN B2006100015727 A CNB2006100015727 A CN B2006100015727A CN 200610001572 A CN200610001572 A CN 200610001572A CN 100473007 C CN100473007 C CN 100473007C
- Authority
- CN
- China
- Prior art keywords
- content
- identification information
- node
- demand
- delivery network
- 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
Landscapes
- Information Transfer Between Computers (AREA)
Abstract
The provided new content switching network comprises a plurality of nodes with every one real-time sending mark information to the target node that can obtain the content according to the mark information.
Description
Technical field
The present invention relates to a kind of communication system, particularly a kind of content delivery network.
Background technology
Content delivery network (Content Switch Network) is a hot spot technology in NGN (next generation network) technical research field.Along with development of internet technology, the content that is distributed on the equipment such as all over the world computer, wireless terminal all can be shared mutually by the network user, and content resource is constantly expanded, people to the demand of content exchange also in continuous growth.Content exchange relates to a lot of aspects, such as the network architecture, content distribution, obtains with exchanged form etc.From using present situation, present content delivery network framework can not well adapt to this demand growth.
At first, say that existing content exchange system has following several types from the network architecture:
(1) client/server (C/S) mode:
This technology has following defective: (a) maintenance costs of C/S model lower network server is very big, and always becomes the bottleneck of content delivery; (b) along with the improving constantly of personal terminal ability, this pattern has seriously hindered effective performance of personal terminal ability; (c) this pattern has limited user's freedom to act to a great extent, and the original data content of issuing and exchanging to the user has brought inconvenience.
(2) peer-to-peer network (P2P) mode:
Peer-to-peer network (P2P) mode comprises following three kinds of schemes: with the Napster model be representative first generation P2P network model, be the second generation P2P network model of representative, be the third generation structured P 2 P network model of representative with the Pastry model with the Gnutella model
With the Napster model is that the first generation P2P network model of representative has following defective: (a) paralysis of central server causes the collapse of whole network easily, and reliability and fail safe are lower; (b), central directory server is safeguarded and the expense upgraded will sharply increase that required cost is too high along with the expansion of network size.
With the Gnutella model is that the second generation P2P network model of representative has following defective: (a) content position fixing process more complicated (b) mode with diffusion when search for content is dispersed in message on the network, this can cause spreading unchecked of message, also makes the extensibility of system to promote.
With the Pastry model is that the third generation structured P 2 P network model of representative has following defective: (a) owing to use single Hash mapping on framework, do not consider the collaborative parallel processing of multinode, therefore can't form effective download group according to user's content demand, greatly reduce content delivery efficient; (b) in the content building process, do not consider the network physical topological structure, have (Detouring) problem that detours between content download person and content provider, increased network traffics and reduced content transmission speed; (C) owing to neither one node under the complete distributed frame can be controlled and manage network, so network is in a kind of state of anarchy.
On the other hand, obtain content way from the user, existing content exchange system adopts following several types usually:
(1) the content obtain manner of searching based on the user (user carries out content search by portal website or search engine, and carries out the download of content based on link):
This technology has following defective: (a) content owner (being server) is passive provides content, waits for that the user searches and downloads, and can't initiatively push content to all users interest; (b) process of user search content is more loaded down with trivial details, and all must login or be connected to each fixing website or server when needing certain content at every turn, in case lose to the address of this website or server, then can't obtain corresponding contents.
(2) the content obtain manner of subscribing to based on RSS (Really Simple Syndication, simple and easy information fusion):
This technology has following defective: (a) user surveys the very big burden that update content can cause server in the mode of poll; (b) centralized architecture based on server is still adopted in content distribution, and content owner's (being server) can't be in real time, push content to all subscribers on one's own initiative; (c) the original data content of the unpromising user of this mode provides effective distribution approach; (d) this content-distribution model is still used the single-point downloading mode, according to the user demand of content is not formed effective downloads group, exchanges thereby make client can't carry out content resource synergistically.
Summary of the invention
The object of the present invention is to provide a kind of efficient content switching network,, satisfy the demand of growing create contents of people and exchanging contents to adapt to the continuous development of the network bandwidth and personal terminal ability better.
According to content delivery network of the present invention, it comprises a plurality of nodes, wherein, the content demand of each node in described a plurality of node and content distributed content demand identification information and the content distributed identification information of being mapped as, when arbitrary node is content distributed, the content demand identification information that this content release node is complementary according to the content distributed identification information with self is determined the content demand nodes of the described content of demand, and its identification information is sent to the content demand nodes of described this content of demand, the identification information of described transmission comprises the content distributed identification information of described content release node, the content demand nodes obtains the content of this node issue according to the identification information of its reception from the content release node.
In the present invention, arbitrary content owner can be content distributed whenever and wherever possible, and all the elements all can push to the demand user in real time, on one's own initiative, thereby distribute effectively and switching channel for the various contents that comprise the original data content of user provide.
Description of drawings
Fig. 1 is the structural representation according to an embodiment of content delivery network of the present invention.
Embodiment
The invention provides a kind of implementation method of novel content delivery network, realized the distributed content exchange, pushed and characteristic such as multi-user collaborative content delivery, and effectively improved stability, extensibility and the content delivery efficient of content delivery network based on the real-time active content of user's request.
As shown in Figure 1, (GlobalRegister Server, GRS), (Content Switch is CS) with ordinary node P for content exchange appliance to comprise overall registrar according to content delivery network of the present invention.
The function class of GRS is a global data base like DNS (Domain Name System, domain name system) root server, mainly is responsible for the IP address of storage and maintenance different brackets content exchange appliance.CS serves as each core of assembling colony (Cluster), and what the present invention adopted is half centralized network structure, and the CS major function is to provide guide effect for newly added node initialization routing table.
In according to content delivery network of the present invention, be divided into the self-organizing network cohort of different brackets according to the actual scale of network and physical topological structure, a large amount of CS are all arranged in the self-organizing network of each grade, and each CS itself also can be an ordinary node in the network.The nearer node of physical distance is by sending the mode of CS query messages to GRS, be merged in groups under the assistance of GRS (i.e. self-organizing network cohort) and be connected to first order CS, by its unified management.Whether this first order CS can be upgraded and become a CS based on ability (disposal ability, factors such as storage capacity and bandwidth) and then decision by ordinary node.
Identical principle, the nearer CS1 of physical distance will be merged in groups and be connected to second level CS, and by its unified management, determining of second level CS is identical with first order CS, and the rest may be inferred.According to network size, top CS and core CS thereof are generated by the stationary nodes that administrative staff set up, as the intermediate hub that system is managed and dispatches.In example shown in Figure 1, CS1, CS2, CS3, CS4 are first order CS, and CS5 and CS6 etc. is second level CS, and CS7 is third level CS.The CS of second level CS, third level CS and higher level does not participate in the transmission of data, only plays the effect that makes up structural P 2 P cover layer network and management next stage CS.
When new ordinary node adds network, at first connect GRS, GRS will return the CS tabulation nearest with this nodal distance, and new node will join in the tabulation under certain CS at random.The node that ability is strong becomes a new CS with auto-update, and sends registration message to GRS, carries out identity registration.
When CS enters or exit network; this CS node will adopt the establishment of existing structured P2P routing algorithm or upgrade local Hash routing table; the child node map information of this locality storage is adjusted and distributed; and notify other CS that is associated to carry out routing table update, to guarantee the integrality of Hash loop.
Adopting hash algorithm that the tag maps of CS node is become a length is the binary sequence NID (Node ID) of M position (M=160), and with its unique this CS that distributes to.
In addition, the content demand of each node (comprising CS) the binary sequence RID (Requirement ID) that also to adopt hash algorithm to be mapped to a length be the M position.
The ordinary node user is sent to the CS node of its ownership with RID, and CS is responsible for setting up the mapping relations of subordinate's child node RID and its address information.
CS with oneself local demand RID and the RID information of all child nodes together with the NID of this CS route to NID in the network greater than and approach the target CS storage of this RID most.
In the example of Fig. 1, suppose that the content demand of ordinary node P1, P2 and CS1 is mapped as RID1, RID2 and RID3 respectively.Then, ordinary node P1 and P2 send to CS1 with their RID1 and RID2.CS1 sets up the RID1 of ordinary node P1 and the mapping relations of its address information, sets up the RID2 of ordinary node P2 and the mapping relations of its address information.And CS1 is according to the occurrence of RID1, with the RID1 of P1 together with the NID1 of CS1 route to NID greater than and approach the target CS storage of RID1 most.CS1 is according to the occurrence of RID2, with the RID2 of P2 together with the NID1 of CS1 route to NID greater than and approach the target CS storage of RID2 most.CS1 is according to the occurrence of RID3, with the RID3 of CS together with the NID1 of CS1 route to NID greater than and approach the target CS storage of RID3 most.
In addition, the binary sequence CID (Content ID) that it is the M position that the content of each user (comprising CS) issue also adopts hash algorithm to be mapped to a length, the content release mode is consistent with the published method of content demand in the network.The cid information of this locality of each CS issue CID and all child nodes thereof together with the NID of this CS route to NID greater than and approach the CS storage of this CID most.Because RID and CID utilize with a kind of algorithm to generate, therefore when RID equaled CID, the content of then representing demand was exactly the content of issue.
Certainly, above-mentioned NID, RID and CID also can generate by other algorithms are unified, but adopt hash algorithm to have load balancing, avoid a conflict and guarantee advantages such as extensibility.
Thereby,, in arbitrary CS, store the mapping relations of mapping relations, its subordinate's child node CID and its address information of its subordinate's child node RID and its address information by top processing.And, the RID of all nodes and the NID of CS with node ownership of this RID all be stored in NID greater than and approach most among the CS of this RID, the CID of all nodes and the NID of CS with node ownership of this CID all be stored in NID greater than and approach most among the CS of this CID.
And, since the CID of all nodes all be stored in NID greater than and approach most among the CS of this CID, the RID of all nodes all be stored in NID greater than and approach most among the CS of this RID, therefore when node (comprising CS and ordinary node P) is issued the identical content (RID) of identical content (CID) and demand, the relevant information of these nodes (corresponding relation of NID that comprises the CS of CID, RID and its ownership) is all by same CS unified management.
In each CS, with the NID of the not homology CS of its storage as master index, mapping relations that the RID and the CID of its storage set up multi-to-multi, and make up different multicast tree at every kind of mapping relations.Any one project in the CID subclass produces update event, all can trigger the application layer multicast to the RID subclass.This application layer multicast will initiatively push to each content demand nodes in multicast tree in the mode of application layer multicast with the NID information of CID and ownership CS thereof to each qualified coupling group nodes based on multicast tree.
The content demand nodes will be to the download request of content distributed CS transmission to this content after the NID information of the CID that receives active push and this content ownership CS.If this CID is corresponding to the local memory contents of CS, CS will accept connection request, and the content requests node will directly carry out content delivery with this CS.If this CID is corresponding to subordinate's child node content of a CS, CS will retrieve local CID and child node information mapping table, and the address information of this content of actual stored is sent to the content requests node.The content requests node will directly connect with this child node and carry out content delivery.
For example, suppose the new content distributed CID11 of ordinary node P1, and this CID11 and be routed to CS2 storage with the NID1 of the corresponding CS1 of this CID11, the content demand of CS2 subordinate's ordinary node P3 and CS3 subordinate's ordinary node P5 is all RID11.Then, CS2 sets up P1 with CID11 to P3 with RID11 and the multicast tree of P5, and this multicast tree is sent to ordinary node P1.Ordinary node P1 sends its identification information (CID11 that comprises this ordinary node P1 with and the NID1 of the CS1 of ownership) and is transmitted to the content corresponding demand nodes by the CS that node was belonged to of this content of demand according to this multicast tree.Concrete, CS2 is according to the CID11 in the identification information, and the RID11 that retrieval equates with CID11 and the corresponding relation of address information find the content demand nodes P3 with RID11, and the identification information of this ordinary node P1 are transmitted to P3.Equally, CS3 is transmitted to P5 with the identification information of this ordinary node P1.The content demand nodes that receives this identification information obtains the address information of ordinary node P1 according to the identification information of ordinary node P1 (content release node).Concrete, P3 and P5 send request to CS1 according to the NID1 in the identification information of ordinary node P1, and CS1 searches the CID that is stored among this CS1 and the relation table of address information according to CID11, find the address information of P1, and this address information is sent to P3 and P5.Thereby P3 and P5 can set up and being connected of ordinary node P1 according to this address information, obtain the content that ordinary node P1 issues.
Based on the multicast tree physics topological structure of CID and RID matching relationship is dynamic creation in the process of each user node issue RID requirement message.When RID1 of user node P1 issue, this RID1 will according to existing structured P2P routing algorithm by hop-by-hop route to NID greater than and approach the node P of this RID1 most
RGive out information at RID1 and to be routed to a certain jumping intermediate node P
iWhen (0＜i＜logN, wherein N is the network node number), node P
iWhether can detect oneself automatically has been the member node of this RID1 multicast tree.If not, then node Pi will create the record of RID1 multicast tree in this locality, and RID1 given out information the last hop node of process as the child node of the RID1 multicast tree of oneself, this RID1 is given out information continue to route to the structured P 2 P network next-hop node then; If, P then
iTo stop to continue to transmit this RID1 and give out information, directly the last hop node that RID1 is given out information increases to the RID1 multicast tree child node of oneself.When giving out information, a RID1 is routed to P
RThe time, by complete generation, the root node of this multicast tree is exactly P based on the multicast tree physics topological structure of RID1
RThe node of the same RID1 demand of follow-up initiation will be generated as the leaf node of this multicast tree dynamically, in real time according to the transmit path of its message.
According to content delivery network of the present invention, arbitrary content owner can be content distributed whenever and wherever possible, all the elements all can push to the demand user in real time, on one's own initiative, thereby distribute effectively and switching channel for the various contents that comprise the original data content of user provide.
In this novel content exchange system framework, creatively proposed a series of network configuration, management and optimized Algorithm and scheme and (comprised network hierarchy method based on physical topology, based on key assignments distribution, storage and the matching principle etc. of DHT multiple spot mapping) with the cohort division, further improve content delivery efficient, guaranteed the robustness and the extensibility of network simultaneously.
The present invention combines technology such as structured P 2 P network technology and application layer multicast technology and proposes.
Therefore, compared with prior art, the present invention has banned content distribution and the switch mode that the main flow C/S model is the center with the server, adopts the autonomous improved distributed structured P2P network architecture, has avoided problems such as the expense of maintenance server and single-point collapse.The present invention comprising the improvement of existing structure P2P network (SON): by network hierarchy and the cohort division methods based on physical distance, content exchange is finished between the nearer node of physical distance as far as possible, overcome (Detouring) problem that detours of SON, improved network transmission efficiency; By introducing the hinge of content exchange appliance (Content Switch), structural P 2 P stability of network and manageability have been guaranteed as content location and distribution; Banned the single mapping pattern of structural P 2 P content exchange pattern, set up different groups dynamically according to network physical topological sum content match relation, on existing P2P network architecture basis based on DHT, propose the scheme of the unique distribution of a cover, storage and maintenance multi-to-multi demand coupling mapping relations, realized content-based multinode cross-matched and multiplexing.
On the user content obtain manner, banned content obtaining mode based on RSS poll and user's active searching resource, content is pushed to the user of all demands initiatively, in real time, be very easy to the user and issue original data content and obtain own interested content, and started a kind of novel content service pattern.
Though the present invention expresses in more mode; but be not in order to qualification the present invention, any those skilled in the art, without departing from the spirit and scope of the present invention; can do various changes and retouching, so protection scope of the present invention is as the criterion when looking the patent claim person of defining.
Claims (14)
1. content delivery network, it comprises a plurality of nodes, wherein, the content demand of each node in described a plurality of node and content distributed content demand identification information and the content distributed identification information of being mapped as respectively, when arbitrary node is content distributed, the content demand identification information that this content release node is complementary according to the content identification information with self issue is determined the content demand nodes of this content of demand, and its identification information is sent in real time the content demand nodes of described this content of demand, the identification information of described transmission comprises the content distributed identification information of described content release node, the content demand nodes obtains the content of this node issue according to the identification information of its reception from described content release node.
2. content delivery network as claimed in claim 1, wherein, described a plurality of nodes comprise the content exchange appliance of ordinary node and management ordinary node, the node identification of each content exchange appliance is mapped as the node identification information of the described content exchange appliance of unique identification.
3. content delivery network as claimed in claim 2, wherein, described node identification information, content demand identification information, and content distributed identification information utilize same mapping algorithm to be mapped to.
4. content delivery network as claimed in claim 3, wherein, described node identification information, content demand identification information, and content distributed identification information be the binary sequence that utilizes same mapping algorithm to be mapped to.
5. content delivery network as claimed in claim 4, wherein, described mapping algorithm is a hash algorithm.
6. as each described content delivery network among the claim 2-5, wherein,
Each content exchange appliance is all stored the mapping relations between mapping relations between its subordinate's the content demand identification information of each node and described subordinate's the address of node information and subordinate's thereof the content distributed identification information of each node and described subordinate's the address of node information.
7. content delivery network as claimed in claim 6, wherein,
The node identification information of the content demand identification information of all nodes and the content exchange appliance corresponding with described content demand identification information all be stored in node identification information greater than and approach most in the content exchange appliance of described content demand identification information,
The node identification information of the content distributed identification information of all nodes and the content exchange appliance corresponding with described content distributed identification information all be stored in node identification information greater than and approach most in the content exchange appliance of described content distributed identification information.
8. content delivery network as claimed in claim 7, wherein,
The content exchange appliance of described content release node ownership is set up the mapping relations of content distributed identification information and content demand identification information, and set up multicast tree according to these mapping relations, the content release node is according to from the multicast tree of this content exchange appliance, sends its identification information to the content demand nodes that has with the corresponding content demand of self content distributed identification information identification information.
9. content delivery network as claimed in claim 8, wherein,
The identification information that described content release node sends is transmitted to this content demand nodes by the content exchange appliance of content demand nodes ownership.
10. content delivery network as claimed in claim 9, wherein,
The identification information that described content release node sends also comprises the node identification information of the content exchange appliance of described content release node ownership.
11. content delivery network as claimed in claim 10, wherein,
The content exchange appliance of content demand nodes ownership will be transmitted to the node that has with described content demand identification information corresponding address from the identification information of content release node according to the corresponding relation between content demand identification information and the address information.
12. content delivery network as claimed in claim 11, wherein,
Behind the identification information that receives the content release node, the content demand nodes is according to the node identification information of the content exchange appliance in the identification information of described reception, send request to this content exchange appliance, ask with have described identification information in subordinate's node content distributed identification information, that belong to described content exchange appliance of comprising be connected.
13. as each described content delivery network among claim 2-5, the 7-12, it further comprises:
Manage the upper strata content exchange appliance of described content exchange appliance.
14. as each described content delivery network among claim 2-5, the 7-12, wherein:
The ordinary node that belongs under the same content exchange appliance is a node approaching on the physical distance.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CNB2006100015727A CN100473007C (en) | 2006-01-24 | 2006-01-24 | Content exchange network |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CNB2006100015727A CN100473007C (en) | 2006-01-24 | 2006-01-24 | Content exchange network |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN101009563A CN101009563A (en) | 2007-08-01 |
| CN100473007C true CN100473007C (en) | 2009-03-25 |
Family
ID=38697736
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CNB2006100015727A Expired - Fee Related CN100473007C (en) | 2006-01-24 | 2006-01-24 | Content exchange network |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN100473007C (en) |
Families Citing this family (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101640691B (en) * | 2008-07-28 | 2012-01-11 | 中国移动通信集团公司 | Method for storing and searching data, and data storage network |
| CN101854391B (en) * | 2010-05-25 | 2013-01-02 | 南京邮电大学 | Realization method of ares protocol analysis system based on peer-to-peer network |
| EP2938042A1 (en) * | 2011-01-25 | 2015-10-28 | Interdigital Patent Holdings, Inc. | Method and apparatus for automatically discovering and retrieving content based on content identity |
| CN103209162B (en) * | 2012-01-16 | 2016-05-18 | 中国科学院声学研究所 | A kind of Web class service deployment method and device |
| CN103685073B (en) * | 2012-09-03 | 2017-04-12 | 中国电信股份有限公司 | Achieving method and system for virtual connection communication protocol, and content switches |
| CN104967477B (en) * | 2015-06-26 | 2018-03-13 | 南京邮电大学 | Optical-fiber network intelligence P circle guard methods based on multicast service |
| CN105897827A (en) * | 2015-11-27 | 2016-08-24 | 乐视云计算有限公司 | Server node, local area network server cluster and realizing method thereof |
| CN109743361B (en) * | 2018-12-14 | 2021-07-02 | 西安电子科技大学 | Data processing method of content increment switching network and communication network platform |
-
2006
- 2006-01-24 CN CNB2006100015727A patent/CN100473007C/en not_active Expired - Fee Related
Non-Patent Citations (10)
| Title |
|---|
| Peer-to-Peer网络模型研究. 李祖鹏，黄道颖，庄，雷，黄建华.计算机工程，第30卷第12期. 2004 |
| Peer-to-Peer网络模型研究. 李祖鹏，黄道颖，庄雷，黄建华.计算机工程，第30卷第12期. 2004 * |
| Push 技术:网上个性化信息服务的实现. 郝亚玲.情报杂志，第2002 年第10 期. 2002 |
| Push 技术:网上个性化信息服务的实现. 郝亚玲.情报杂志，第2002 年第10 期. 2002 * |
| SCRIBE: A large-scale and dencentralisedapplication-level multicast infrastructure. M.castro, P.Druschel, A.M.Kermarrec and A.Rowstron.IEEE journal on Selected Areas in Communications,Vol.20 No.8. 2002 |
| SCRIBE: A large-scale and dencentralisedapplication-level multicast infrastructure. M.castro, P.Druschel, A.M.Kermarrec and A.Rowstron.IEEE journal on Selected Areas in Communications,Vol.20 No.8. 2002 * |
| 一种基于对等网的资源主动发布方法. 包秀国，胡铭曾，方滨兴.小型微型计算机系统，第25卷第4期. 2004 |
| 一种基于对等网的资源主动发布方法. 包秀国，胡铭曾，方滨兴.小型微型计算机系统，第25卷第4期. 2004 * |
| 基于p2p计算模式的自组织网络路由模型. 李祖鹏，黄建华，唐辉.软件学报，第16卷第5期. 2005 |
| 基于p2p计算模式的自组织网络路由模型. 李祖鹏，黄建华，唐辉.软件学报，第16卷第5期. 2005 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN101009563A (en) | 2007-08-01 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN100473007C (en) | Content exchange network | |
| Jafari Navimipour et al. | A comprehensive study of the resource discovery techniques in Peer-to-Peer networks | |
| Yang et al. | An efficient hybrid peer-to-peer system for distributed data sharing | |
| CN1764171B (en) | Rendezvousing resource requests with corresponding resources | |
| CN100536423C (en) | Structured P2P based application service platform and implementing method thereof | |
| CN101146022B (en) | Node overlapping content distribution network | |
| Felber et al. | Survey on load balancing in peer-to-peer distributed hash tables | |
| CN101355591A (en) | P2P network and scheduling method thereof | |
| CN103095727A (en) | Location method for peer-to-peer (P2P) resource | |
| Huang | VIRGO: Virtual hierarchical overlay network for scalable grid computing | |
| Khan et al. | MobiStore: A system for efficient mobile P2P data sharing | |
| Ayorak et al. | Super peer web service discovery architecture | |
| Wette et al. | Adding capacity-aware storage indirection to homogeneous distributed hash tables | |
| Liu et al. | Efficient resource discovery in self‐organized unstructured peer‐to‐peer networks | |
| CN103179191A (en) | P2P (peer to peer) network control device and P2P network control architecture | |
| Ayyasamy et al. | A qos-aware intelligent replica management architecture for content distribution in peer-to-peer overlay networks | |
| Ali et al. | HPRDG: A scalable framework hypercube-P2P-based for resource discovery in computational Grid | |
| Ahulló et al. | Supporting geographical queries onto DHTs | |
| Anandaraj et al. | An efficient QOS based multimedia content distribution mechanism in P2P network | |
| Chen et al. | A service discovery mechanism with load balance issue in decentralized peer-to-peer network | |
| CN101394415B (en) | Method and device of resource broadcast interaction mechanism used in structured coverage network | |
| Ma et al. | Resource discovery algorithm based on small-world cluster in hierarchical grid computing environment | |
| Sangpachatanaruk et al. | A p2p overlay architecture for personalized resource discovery, access, and sharing over the internet | |
| Caron et al. | Efficiency of tree-structured peer-to-peer service discovery systems | |
| US20220272092A1 (en) | Decentralized network access systems and methods |
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 | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20090325 Termination date: 20210124 |