CN101860469A - Method and device for carrying out grouping on nodes in peer-to-peer technology network - Google Patents

Method and device for carrying out grouping on nodes in peer-to-peer technology network Download PDF

Info

Publication number
CN101860469A
CN101860469A CN200910081593A CN200910081593A CN101860469A CN 101860469 A CN101860469 A CN 101860469A CN 200910081593 A CN200910081593 A CN 200910081593A CN 200910081593 A CN200910081593 A CN 200910081593A CN 101860469 A CN101860469 A CN 101860469A
Authority
CN
China
Prior art keywords
node
network
point
information
peer
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.)
Pending
Application number
CN200910081593A
Other languages
Chinese (zh)
Inventor
王妍
李春秀
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Huawei Technologies Co Ltd
Original Assignee
Huawei Technologies Co Ltd
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Huawei Technologies Co Ltd filed Critical Huawei Technologies Co Ltd
Priority to CN200910081593A priority Critical patent/CN101860469A/en
Priority to PCT/CN2010/071709 priority patent/WO2010118672A1/en
Publication of CN101860469A publication Critical patent/CN101860469A/en
Pending legal-status Critical Current

Links

Images

Classifications

    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L67/00Network arrangements or protocols for supporting network services or applications
    • H04L67/01Protocols
    • H04L67/10Protocols in which an application is distributed across nodes in the network
    • H04L67/104Peer-to-peer [P2P] networks
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L67/00Network arrangements or protocols for supporting network services or applications
    • H04L67/01Protocols
    • H04L67/10Protocols in which an application is distributed across nodes in the network
    • H04L67/104Peer-to-peer [P2P] networks
    • H04L67/1044Group management mechanisms 
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L67/00Network arrangements or protocols for supporting network services or applications
    • H04L67/50Network services
    • H04L67/52Network services specially adapted for the location of the user terminal
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04WWIRELESS COMMUNICATION NETWORKS
    • H04W4/00Services specially adapted for wireless communication networks; Facilities therefor
    • H04W4/02Services making use of location information

Abstract

The embodiment of the invention provides a method and a device for carrying out grouping on nodes in a peer-to-peer (P2P) technology network. The method mainly comprises the following steps of: acquiring at least one of physical distance information, logical distance information and characteristic information of nodes in a P2P network; and then carrying out grouping on the nodes in the P2P network according to at least one of physical distance information, logical distance information and characteristic information. The invention can simplify network logical topology and shorten the time consumed on positioning a peer client end of a P2P application server, thereby being beneficial to carrying out the peer sequence selection by the P2P application server.

Description

The method and apparatus that node in the point-to-point technology network is divided into groups
Technical field
The present invention relates to network communications technology field, relate in particular to a kind of method and apparatus that node in P2P (Peer to Peer, the point-to-point technology) network is divided into groups.
Background technology
At present, along with networks development, people are to the demand of network, and the demand of especially big capacity information such as music, video file constantly increases, and P2P is used obtained development widely.But under most of situation, P2P uses peer (equity) sequence that can't find a best, can cause server performance to descend and the too much flow across the territory thus.P2P uses and has not only taken a large amount of network bandwidths, and has taken the finite element network resource of operator greatly.So it is a very important problem that the P2P flow is optimized.
The optimisation technique of P2P flow comprises interlayer cooperation technology, and this interlayer cooperation technology adopts operator and P2P to use cooperation, and P2P the information that provides according to operator is provided is carried out the peer selection, and then optimizes the method for flow.By the service of P2P flow optimization, P2P uses and can comprehensively judge according to user's up, download bandwidth, selects the efficient of maximum overall exchange to carry out the most effective peer.
Need be when client terminal start-up P2P uses to the tabulation of P2P application server requesting node, by the service of P2P flow optimization, P2P uses information such as can obtaining network topology and is used to optimize the peer selection, returns preferred peer tabulation.In the service of P2P flow optimization, need to solve the problem of in network topology, how to locate the peer client, promptly need a kind of method to make the P2P application server can locate the peer client fast, quicken peer and select.
At present, the peer client is not divided into groups, cause P2P to use and adopt too meticulous granularity that the peer client is positioned, the position fixing process spended time is long, and weak effect, amount of transmitted information is many, thereby has influenced integral body download and uploading speed that P2P uses.
In realizing process of the present invention, the inventor finds the method for also the peer client not being divided into groups effectively in the prior art.
Summary of the invention
Embodiments of the invention provide a kind of method and apparatus that node in the P2P network is divided into groups, and with realization the peer client are divided into groups effectively.
A kind of method that node in the point-to-point technology P2P network is divided into groups comprises:
Obtain at least one in physical distance information, logical reach information and the characteristic information of the node in the point-to-point technology P2P network;
At least one item according in described physical distance information, logical reach information and the characteristic information divides into groups to the node in the described P2P network.
A kind of device that node in the point-to-point technology P2P network is divided into groups comprises:
The information acquisition module is used for obtaining at least one in physical distance information, logical reach information and the characteristic information of node of point-to-point technology P2P network;
PHM packet handling module is used at least one item according to described physical distance information, logical reach information and characteristic information, and the node in the described P2P network is divided into groups.
The technical scheme that is provided by the embodiment of the invention described above as can be seen, the embodiment of the invention is divided into groups to node by at least one in the physical distance information, logical reach information and the characteristic information that utilize the node in the P2P network, can simplify the cellular logic topology, reduce the peer client location spended time of P2P application server, carry out the peer sequence selection thereby be of value to the P2P application server.
Description of drawings
In order to be illustrated more clearly in the technical scheme of the embodiment of the invention, the accompanying drawing of required use is done to introduce simply in will describing embodiment below, apparently, accompanying drawing in describing below only is some embodiments of the present invention, for those of ordinary skills, under the prerequisite of not paying creative work, can also obtain other accompanying drawing according to these accompanying drawings.
The process chart of a kind of method that node in the P2P network is divided into groups that Fig. 1 provides for the embodiment of the invention one;
The P2P network diagram of a kind of peer of the being provided with grouping computing module that Fig. 2 provides for the embodiment of the invention one;
The grouping situation that a kind of POP of utilization that Fig. 3 provides for the embodiment of the invention one is ordered is carried out the schematic diagram that the cellular logic topology is simplified;
The specific implementation structure chart of a kind of device that node in the point-to-point technology P2P network is divided into groups that Fig. 4 provides for the embodiment of the invention two.
Embodiment
In embodiments of the present invention, obtain in physical distance information, logical reach information and the characteristic information of the node in the P2P network at least one.Then, at least one item according in described physical distance information, logical reach information and the characteristic information divides into groups to the node in the described P2P network.
Further, the node in the described P2P network comprises: the Rendezvous Point POP of reciprocity peer client or peer client (Point Of Presence, Rendezvous Point) point.
Further, obtaining the weighted value on the optimal path between two nodes in the P2P network, when described weighted value during greater than predefined grouping metric, is one group with described two node division then.
Further, the weighted value on the described optimal path comprises: the summation of the weighted value of all links on the optimal path.
Further, a plurality of reference points are set in the P2P network, measure the jumping figure of each node to each reference point;
Choose all reference points successively, the node of jumping figure in predetermined scope that will arrive each reference point is divided into one group respectively.
Further, a plurality of reference points are set in the P2P network, measure the physical distance of each node to each reference point;
The physical distance measured value of each node to each reference point sorted according to predetermined ordering rule, and the node division that will have the sort order of identical physical distance measured value is one group.
Further, obtain the number information of the peer client that is connected under the POP point in the P2P network, described POP point is divided into groups according to described number information.
Further, obtain at least one in performance, ability and the cut-in method of peer client, the peer client is divided into groups according at least one in described performance, ability and the cut-in method.
For ease of understanding, be that example is further explained explanation below in conjunction with accompanying drawing with several specific embodiments, and each embodiment does not constitute the qualification to the embodiment of the invention to the embodiment of the invention.
Embodiment one
The handling process of a kind of method that node in the P2P network is divided into groups that this embodiment provides comprises as shown in Figure 1:
11: peer grouping computing module is set in the P2P network that ISP (Internet Service Provider, Internet service provider) disposes.
The embodiment of the invention is at ISP (Internet Service Provider, Internet service provider) in the P2P network of Bu Shuing peer grouping computing module is set, this peer grouping computing module can be provided with separately, also can be arranged in the P2P flow optimization device in the P2P network, this P2P flow optimization device is arranged on network side by ISP, and being used for provides the service of P2P flow optimization in the P2P application to each peer client.A kind of P2P network diagram that is provided with above-mentioned peer grouping computing module that this embodiment provides as shown in Figure 2.
As shown in Figure 2, each peer client is pooled to different POP respectively, peer in P2P flow optimization device grouping computing module is finished the grouping that each peer client or POP orders according to the group technology of setting, and gives the distribution of each peer client or POP point a packet number.
Owing to all can be provided with P2P flow optimization device in the P2P network that each ISP disposes, the peer grouping group technology that computing module adopted in the P2P flow optimization device of each ISP is separate, can be identical also can be inequality.
12, peer grouping computing module divides into groups to POP point or peer client according at least one in logical reach, physical distance and the characteristic of POP point or peer client.
As the node in the P2P network, above-mentioned peer grouping computing module can divide into groups to the node in the P2P network, and distribute a packet number to identify according to the information such as logical reach, physical distance and characteristic of node with POP point or peer client.
Introduce the various group technologies of POP point or peer client below respectively
1, the group technology of logic-based distance
1.1, based on the group technology of weighted value
At first preestablish a grouping metric.Then, measure interior any two POP points of a P2P network or the weighted value on the optimal path between the peer client, this weighted value can be bandwidth, metric (tolerance criterion) etc.Weighted value on the above-mentioned optimal path can be the summation of the weighted value of all links on the optimal path.
When the weighted value on the above-mentioned optimal path during less than above-mentioned grouping metric, then two POP points or the peer client with correspondence is divided into same group.Repeat above-mentioned processing procedure, finish all the POP points in the P2P network or the division operation of peer client.Finally make be divided into each the group in each POP point or the weighted value on the optimal path between the peer client all less than above-mentioned grouping metric.
The setting of above-mentioned grouping metric is relevant with concrete network composition situation, and the grouping metric is big more, and the grouping granularity is thick more, otherwise thin more.
1.2, based on the group technology of jumping figure
P2P network condition according to concrete is provided with a plurality of reference points in network.Then, as node, measure the jumping figure of each node with each POP point or peer client to each reference point.With each reference point is the center, is scope with certain jumping figure, and the node in the jumping figure scope is polymerized to one group.Choose all reference points successively, the node of jumping figure in predetermined scope that will arrive each reference point is divided into one group respectively.
In the method, if w reference point is set, just can mark off w different group.If the node that is not aggregated arranged, can be separately as one group or be aggregated in close group; If have node can be aggregated to many groups, then can put this node under one group at random.
2, based on the group technology of physical distance
A plurality of reference points are set in the P2P network.Then, with each POP point or peer client as node, measure the physical distance of each node to each reference point, the physical distance of each node to each reference point sorted according to predetermined ordering rule (such as incremented/decremented), because node nearer on topology location is approaching to the physical distance of same reference point, so the node division that will have the sort order of identical physical distance measured value is one group.
Above-mentioned each node can be the RTT (network delay, round trip time) of each node to each reference point to the physical distance of each reference point.
In the method, if w reference point is set, just can mark off the factorial different group of w.
The setting of above-mentioned reference point is relevant with the composition situation of choosing with concrete ISP network, if the number and the position of reference point rationally are set, can be so that the physical distance between each node in each group be all smaller, then POP point or peer client rationally can be divided into groups, satisfy the network demand that P2P uses.
3, based on the group technology of characteristic
3.1, the number of the peer client that connected down according to the POP point divides into groups.Such as, the less relatively POP point of number that will have the peer client aggregates into one group.
3.2, obtain at least one in performance, ability and the cut-in method of peer client, according at least one in described performance, ability and the cut-in method peer client is divided into groups.Such as, the peer client that ability is relatively poor relatively aggregates into one group.
After peer grouping computing module divides into groups for each POP point according to above-mentioned group technology, distributes a packet number for each POP point.As shown in Figure 2, because each peer client is pooled to different POP respectively, when a peer client during to the registration of POP point that it converged, this POP above-mentioned peer grouping computing module of naming a person for a particular job offers the peer client to the packet number of its distribution, this packet number will be as the packet number of above-mentioned peer client, and this packet number can be used as a kind of of peer client location information.
In actual applications, the use that can combine of the various group technologies of above-mentioned POP point or peer client, peer grouping computing module is taken all factors into consideration the group result of various group technologies, and all POP points or peer client are finally divided into groups.
The grouping situation that above-mentioned Peer client or POP are ordered is dynamic, is not static constant.The division that is each group can be according to situations such as the variation of network configuration, the variations of P2P application deployment and dynamic change.
The grouping scale that Peer client or POP are ordered also needs to consider, the group scale is too big or too little all not to meet practical application, can not improve network performance, and can not optimize P2P use in the selection of peer.
13, the grouping situation of utilizing Peer client or POP to order is simplified the cellular logic topology, fast the Peer client is positioned, and optimizes the selection of peer sequence.
After P2P flow optimization device obtains grouping situation that above-mentioned all Peer clients or POP order by its inner peer grouping computing module, this grouping situation is transferred to the abstract processing module of network topology in the ISP network.The abstract processing module of this network topology can be that basic element carries out topological abstract with the group, thereby simplify the cellular logic topology according to this grouping situation.Such as, the grouping situation that a kind of POP of utilization is ordered is carried out the topological schematic diagram of simplifying of cellular logic as shown in Figure 3, before the cellular logic topology is simplified, have 13 nodes and need management, after the grouping situation of utilizing POP to order is carried out the simplification of cellular logic topology, 13 nodes have been divided into 4 groups, node can preferentially select and node on the same group between carry out data communication, thereby reduced the data communication between each group.
After the cellular logic topology is simplified, the cellular logic topology information of optimization can be provided for the P2P application server, thereby be of value to the peer sequence selection of P2P application server.
The grouping situation that above-mentioned P2P flow optimization device is also ordered above-mentioned Peer client or POP is transferred to the P2P application server, makes the P2P application server only need locate grouping rank under the peer client, locatees the pee client fast from higher level.
The P2P application server can carry out the peer sequence selection for the peer client according to the cellular logic topology information of above-mentioned optimization after positioning for fast the peer client, selects thereby quicken peer, returns preferred peer tabulation.On concrete, can select to be optimized in the group, promptly when peer selects, pay the utmost attention to peer on the same group to peer.
This embodiment is based on geographical position and logical reach factor, and the peer client of close together is divided in same grouping, peer is chosen in the group finishes, and saved the time that the peer of P2P application end selects, and optimized the selection of peer greatly.This embodiment also divides into groups based on the characteristic of POP point or peer client, and POP point or peer client with similar characteristic are condensed together, and helps the management of POP point or peer client.
Embodiment two
The embodiment of the invention also provides a kind of device that node in the point-to-point technology P2P network is divided into groups, and its specific implementation structure specifically can comprise as shown in Figure 4:
Information acquisition module 41 is used for each POP point of P2P network or peer client as a node, obtains at least one in physical distance information, logical reach information and the characteristic information of node;
PHM packet handling module 42 is used at least one item according to described physical distance information, logical reach information and characteristic information, and the node in the described P2P network is divided into groups.
Described PHM packet handling module 42 specifically can comprise: first processing module 421, second processing module 422, the 3rd processing module 423, the are managed at least one in module 424 and the 5th processing module 425 everywhere, wherein,
Described first processing module 421 is used for when the weighted value on the optimal path between two nodes in the P2P network that described information acquisition module is obtained during greater than predefined grouping metric, is one group with described two node division then; Repeat above-mentioned processing procedure, finish division operation all nodes in the P2P network (POP point or peer client).
Described second processing module 422, each node in the P2P network that is used for being obtained according to described information acquisition module are to the jumping figure of each reference point, and the node of jumping figure in predetermined scope that will arrive each reference point is divided into one group respectively;
Described the 3rd processing module 423, each node in the P2P network that is used for being obtained according to described information acquisition module is to the physical distance of each reference point, the physical distance measured value of each node to each reference point sorted according to predetermined ordering rule, and the node division that will have the sort order of identical physical distance measured value is one group.Above-mentioned each node can be the network delay value of each node to each reference point to the physical distance of each reference point.
Described the manages module 424 everywhere, is used for the number information of the peer client that the POP of the P2P network that obtained according to described information acquisition module connects, and described POP point is divided into groups;
Described the 5th processing module 425 is used for performance, ability and cut-in method at least one of the peer client obtained according to described information acquisition module, and the peer client is divided into groups.
The above-mentioned device that node in the point-to-point technology P2P network is divided into groups can be provided with separately, also can integrate with the P2P flow optimization device in the P2P network.
One of ordinary skill in the art will appreciate that all or part of flow process that realizes in the foregoing description method, be to instruct relevant hardware to finish by computer program, described program can be stored in the computer read/write memory medium, this program can comprise the flow process as the embodiment of above-mentioned each side method when carrying out.Wherein, described storage medium can be magnetic disc, CD, read-only storage memory body (Read-Only Memory, ROM) or at random store memory body (Random Access Memory, RAM) etc.
In sum, the embodiment of the invention has been finished the calculating of peer client packets by utilizing peer grouping computing module, can simplify the cellular logic topology, reduce the peer client location spended time of P2P application server, carry out the peer sequence selection thereby be of value to the P2P application server.The peer sequence selection is finished in group, optimized the selection of peer sequence greatly.
The embodiment of the invention provides multiple group technology, can adopt the peer grouping computational methods that are fit to according to concrete network configuration.And each grouping can be according to situations such as the variation of network configuration, the variations of P2P application deployment and dynamic change has more flexibility, and application scenarios is extensive.
The embodiment of the invention utilizes the peer group technology to simplify the cellular logic topology, has reduced the amount of transmitted information that P2P is used, and does not influence the message transmission of physical layer.Undertaken alternately by other application processes in peer grouping computing module and the service of P2P flow optimization, the overall architecture that perfect P2P flow optimization is served helps finishing of P2P flow optimization service.
The above; only for the preferable embodiment of the present invention, but protection scope of the present invention is not limited thereto, and anyly is familiar with those skilled in the art in the technical scope that the present invention discloses; the variation that can expect easily or replacement all should be encompassed within protection scope of the present invention.Therefore, protection scope of the present invention should be as the criterion with the protection range of claim.

Claims (10)

1. the method that the node in the point-to-point technology P2P network is divided into groups is characterized in that, comprising:
Obtain at least one in physical distance information, logical reach information and the characteristic information of the node in the point-to-point technology P2P network;
At least one item according in described physical distance information, logical reach information and the characteristic information divides into groups to the node in the described P2P network.
2. method according to claim 1 is characterized in that, the node in the described P2P network comprises: the Rendezvous Point POP point of reciprocity peer client or peer client.
3. method according to claim 1 and 2 is characterized in that, described method specifically comprises:
Obtaining the weighted value on the optimal path between two nodes in the P2P network, when described weighted value during greater than predefined grouping metric, is one group with described two node division then.
4. method according to claim 3 is characterized in that, the weighted value on the described optimal path comprises: the summation of the weighted value of all links on the optimal path.
5. method according to claim 1 and 2 is characterized in that, described method specifically comprises:
A plurality of reference points are set in the P2P network, measure the jumping figure of each node to each reference point;
The node of jumping figure in predetermined scope that will arrive each reference point is divided into one group respectively.
6. method according to claim 1 and 2 is characterized in that, described method specifically comprises:
A plurality of reference points are set in the P2P network, measure the physical distance of each node to each reference point;
The physical distance measured value of each node to each reference point sorted according to predetermined ordering rule, and the node division that will have the sort order of identical physical distance measured value is one group.
7. method according to claim 1 and 2 is characterized in that, described method specifically comprises:
Obtain the number information of the peer client of the POP connection in the P2P network, described POP point is divided into groups according to described number information.
8. method according to claim 1 and 2 is characterized in that, described method specifically comprises:
Obtain at least one in performance, ability and the cut-in method of peer client, the peer client is divided into groups according at least one in described performance, ability and the cut-in method.
9. the device that the node in the point-to-point technology P2P network is divided into groups is characterized in that, comprising:
The information acquisition module is used for obtaining at least one in physical distance information, logical reach information and the characteristic information of node of point-to-point technology P2P network;
PHM packet handling module is used at least one item according to described physical distance information, logical reach information and characteristic information, and the node in the described P2P network is divided into groups.
10. the device that the node in the point-to-point technology P2P network is divided into groups according to claim 9, it is characterized in that, described PHM packet handling module comprises: first processing module, second processing module, the 3rd processing module, the are managed at least one in module and the 5th processing module everywhere, wherein
Described first processing module is used for when the weighted value on the optimal path between two nodes in the P2P network that described information acquisition module is obtained during greater than predefined grouping metric, is one group with described two node division then;
Described second processing module, each node in the P2P network that is used for being obtained according to described information acquisition module are to the jumping figure of each reference point, and the node of jumping figure in predetermined scope that will arrive each reference point is divided into one group respectively;
Described the 3rd processing module, each node in the P2P network that is used for being obtained according to described information acquisition module is to the physical distance of each reference point, the physical distance measured value of each node to each reference point sorted according to predetermined ordering rule, and the node division that will have the sort order of identical physical distance measured value is one group;
Described the manages module everywhere, is used for the number information of the peep client that the POP point of the P2P network that obtained according to described information acquisition module connects, and described POP point is divided into groups;
Described the 5th processing module is used for performance, ability and cut-in method at least one of the peer client obtained according to described information acquisition module, and the peer client is divided into groups.
CN200910081593A 2009-04-13 2009-04-13 Method and device for carrying out grouping on nodes in peer-to-peer technology network Pending CN101860469A (en)

Priority Applications (2)

Application Number Priority Date Filing Date Title
CN200910081593A CN101860469A (en) 2009-04-13 2009-04-13 Method and device for carrying out grouping on nodes in peer-to-peer technology network
PCT/CN2010/071709 WO2010118672A1 (en) 2009-04-13 2010-04-13 Method and device for grouping nodes in peer to peer network

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN200910081593A CN101860469A (en) 2009-04-13 2009-04-13 Method and device for carrying out grouping on nodes in peer-to-peer technology network

Publications (1)

Publication Number Publication Date
CN101860469A true CN101860469A (en) 2010-10-13

Family

ID=42946139

Family Applications (1)

Application Number Title Priority Date Filing Date
CN200910081593A Pending CN101860469A (en) 2009-04-13 2009-04-13 Method and device for carrying out grouping on nodes in peer-to-peer technology network

Country Status (2)

Country Link
CN (1) CN101860469A (en)
WO (1) WO2010118672A1 (en)

Cited By (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN102567123A (en) * 2010-12-29 2012-07-11 无锡江南计算技术研究所 Computer communication and connection method and system
CN104079417A (en) * 2013-03-27 2014-10-01 宏碁股份有限公司 Method for keeping devices in alive-states and server
CN105872000A (en) * 2015-12-21 2016-08-17 乐视云计算有限公司 Grouping method, device and system of P2P nodes
CN110622467A (en) * 2016-12-23 2019-12-27 瑞典爱立信有限公司 Apparatus and method for identifying a group of network objects
WO2024001963A1 (en) * 2022-07-01 2024-01-04 中兴通讯股份有限公司 Satellite system end station grouping method, controller, satellite system, and storage medium

Family Cites Families (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
EP1741270B1 (en) * 2004-04-30 2009-02-25 NTT DoCoMo INC. Zone-based peer-to-peer
CN100488145C (en) * 2006-06-21 2009-05-13 中国科学院计算技术研究所 Distributed type clustering method in use for constructing cluster type peer-to-peer network
CN100433689C (en) * 2006-09-13 2008-11-12 华中科技大学 An organization method for tree network of control stream in the stream media living broadcast system

Cited By (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN102567123A (en) * 2010-12-29 2012-07-11 无锡江南计算技术研究所 Computer communication and connection method and system
CN104079417A (en) * 2013-03-27 2014-10-01 宏碁股份有限公司 Method for keeping devices in alive-states and server
CN104079417B (en) * 2013-03-27 2018-06-29 宏碁股份有限公司 Maintain device at any time can wake-up states method and server
CN105872000A (en) * 2015-12-21 2016-08-17 乐视云计算有限公司 Grouping method, device and system of P2P nodes
CN110622467A (en) * 2016-12-23 2019-12-27 瑞典爱立信有限公司 Apparatus and method for identifying a group of network objects
WO2024001963A1 (en) * 2022-07-01 2024-01-04 中兴通讯股份有限公司 Satellite system end station grouping method, controller, satellite system, and storage medium

Also Published As

Publication number Publication date
WO2010118672A1 (en) 2010-10-21

Similar Documents

Publication Publication Date Title
JP5745169B2 (en) Content processing method, content processing device, and content processing system
CN104717304B (en) A kind of CDN P2P content optimizations select system
CN101296152B (en) Data scheduling method and system of equity linked network
Sun et al. Traffic load balancing among brokers at the IoT application layer
CN103957269B (en) The system of selection of P2P network nodes and point-to-point redirection P2P Redirector servers
Wang et al. Hierarchical cooperative caching in mobile opportunistic social networks
CN110430274A (en) A kind of document down loading method and system based on cloud storage
CN101860469A (en) Method and device for carrying out grouping on nodes in peer-to-peer technology network
CN101997891A (en) Method, device and system for allocating P2P media stream
CN109194718A (en) A kind of block chain network and its method for scheduling task
CN102957624A (en) Content routing method and device
Rawadi et al. Providing local cloud services to mobile devices with inter-cloudlet communication
CN103986747A (en) Method for sharing and downloading files in P2P protocol
CN102821115B (en) A kind of method and apparatus of point-to-point P2P transfer resource
CN103546516B (en) Generate polymer layer network and the method and device of polymer layer expense figure
WO2010099984A1 (en) Method and system for efficiently using available network access resources
CN102986196B (en) The node being distributed on communication structure accesses network using the topology server selected with multiple criteria
Meng et al. Elastic caching solutions for content dissemination services of ip-based internet technologies prospective
Bhat et al. A load balancing approach for adaptive bitrate streaming in information centric networks
Batbayar et al. Collaborative informed gateway selection in large-scale and heterogeneous networks
CN105007190A (en) P2P networking quality optimization method
Feng et al. Optimizing content delivery in ICN networks by the supply chain model
Guan et al. Multidimensional Resource Fragmentation-Aware Virtual Network Embedding for IoT Applications in MEC Networks
CN102684891B (en) Data distribution system and data distribution server
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
RJ01 Rejection of invention patent application after publication
RJ01 Rejection of invention patent application after publication

Application publication date: 20101013