CN103036908A - P2P node grouping method - Google Patents
P2P node grouping method Download PDFInfo
- Publication number
- CN103036908A CN103036908A CN2012105881923A CN201210588192A CN103036908A CN 103036908 A CN103036908 A CN 103036908A CN 2012105881923 A CN2012105881923 A CN 2012105881923A CN 201210588192 A CN201210588192 A CN 201210588192A CN 103036908 A CN103036908 A CN 103036908A
- Authority
- CN
- China
- Prior art keywords
- node
- server
- grouping
- strategy
- group
- 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
Links
Images
Landscapes
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
Abstract
The invention provides a P2P (Peer-to-Peer) node grouping method which utilizes grouping strategies for optimizing P2P nodes by enriched node table data structures. The P2P network comprises a CT (Central Tracking) server, NP (Normal Peer) nodes and a Source server and is characterized in that various node grouping strategies can be adopted by the CT server according to enriched node tables. The P2P node grouping method comprises the following steps: A, the the self information of the NP node is reported to the CT server when certain video is played by the NP nodes; B, the information of the NP nodes is collected and analyzed by the CT server, and the node tables are generated by the CT according to analyzed results; C, the node grouping strategies are generated by the CT server according to the node table, and the NP nodes are grouped by the CT server according to the strategies; and D, among the same group, data request is sent by the NP node to other NPs in the same group according to respective requirements.
Description
Technical field
The present invention relates to a kind of P2P node grouping method, belong to the stream media technology field.
Background technology
Along with the development of computer and information technology, the user also increases day by day to the demand of content of multimedia.Traditional C/S model can't satisfy users' demand.The appearance of P2P (Peer to Peer) technology has solved this difficult problem, the application of P2P Streaming Media, can take full advantage of the idling-resource of nodes, each node be client be again service end, can accept data again for other nodes provide data.
From topological structure, the P2P network platform is comprised of two levels.Top one deck is the CDN(Content Delivery Network of server level, i.e. internet content delivery network) network, below one deck be the P2P network that the client node used forms.The composition member of P2P network has: (CenterTracker below is abbreviated as CT) server, NP(normal peer are followed the tracks of in the center) node, data source (Source) server (for example WEB server).
The CT server can divide into groups to optimize according to the characteristics of NP that P2P shares and better network overall transfer to NP.Yet traditional CT server only is the mode according to the homology attribute, and the node of watching same video is put in the node table, and this mode causes the NP grouping strategy more single.
Summary of the invention
The present invention proposes a kind of P2P node grouping method, and it utilizes the node table data structure of abundantization to optimize the grouping strategy of P2P node.
A kind of P2P node grouping method, described P2P network comprises CT server, NP node, Source server, it is characterized in that, described CT server can adopt according to the node table of abundantization multiple node grouping strategy, comprises following preferred steps:
A, NP node are reported NP node self information to the CT server when playing certain video;
The NP nodal information is collected and analyzed to B, CT server, and generate node table according to analysis result;
C, CT produce the node grouping strategy according to node table, and according to this strategy with the NP node grouping;
D, on the same group between the NP according to needs separately on the same group other NP request msg.
Above-mentioned arbitrary scheme preferably, the described NP of above-mentioned steps A is PC, smart mobile phone.
Above-mentioned arbitrary scheme preferably, the described NP self information of above-mentioned steps A comprises; NP node unique identification, the film source ID of NP film that node is seen and NP node self IP information;
Above-mentioned arbitrary scheme preferably, the described node table element of above-mentioned steps B comprises: NP node unique identification, film source ID, ISP, NP node location.
Above-mentioned arbitrary scheme preferably, ISP and location that the described CT server of above-mentioned steps B obtains each NP node according to IP and the IP database of NPNP node.
Above-mentioned arbitrary scheme preferably, the described CT server of above-mentioned steps C comprises according to the multiple node grouping strategy of node table Element generation:
P1, the NP node division that film source ID is identical are one group strategy;
P2, film source ID is identical and be divided into one group strategy with the NP node of ISP;
P3, film source ID is identical and be divided into one group strategy with the NP node of region;
P4, film source ID is identical and be divided into one group strategy with the NP node of ISP with the region.
Above-mentioned arbitrary scheme preferably, for N the NP node that is divided into a group according to described node grouping strategy, each NP node is got N/one data above the Source server, other data all reach above other N-1 NP node on the same group.
Above-mentioned arbitrary scheme preferably, for the M that is numbered 1-M the NP node that is divided into a group according to described node grouping strategy, each NP node goes the Source server to take from that blocks of data of oneself numbering according to the numbering of oneself, when needs obtain the data block of non-self numbering, can directly send request of data and obtain the desired data piece to the numbering NP node identical with the desired data block number.
Description of drawings
Accompanying drawing 1 is by the schematic diagram of node grouping strategy P1 with the NP node grouping according to the related member CT server of the inventive method.
Accompanying drawing 2 is by the schematic diagram of node grouping strategy P2 with the NP node grouping according to the related member CT server of the inventive method.
Accompanying drawing 3 is by the schematic diagram of node grouping strategy P3 with the NP node grouping according to the related member CT server of the inventive method.
Accompanying drawing 4 is by node grouping strategy P3 another schematic diagram with the NP node grouping according to the related member CT server of the inventive method.
Accompanying drawing 5 is by the another schematic diagram of node grouping strategy P3 with the NP node grouping according to the related member CT server of the inventive method.
Accompanying drawing 6 is by the schematic diagram of node grouping strategy P4 with the NP node grouping according to the related member CT server of the inventive method.
Embodiment
Embodiment
In the P2P network platform, the present invention relates to this relevant member and be: CT server, NP node.
The NP node is the concrete network entity that depends on of using, and it can be a concrete applications client.Among the present invention, the NP node connects with three class entities, is respectively that NP node and NP node are connected to each other, the NP node is connected to the Source server, the NP node is connected to the CT server.
In the present embodiment, to CT server report NP node self information, this information comprises the NP node when playing certain video; The NP unique identification, the film source ID of film that NP sees and NP self IP information; For example, certain NP node first is watching that film source ID is 1001 film " transformer ", and the IP of this NP node first is 123.115.149.116, NP node first with oneself UUID, watch that film source ID, IP address send to the CT server.
The NP nodal information is collected and analyzed to the CT server, and generate node table according to analysis result, and these NP nodal informations are from different NP nodes.The ISP that the CT server at first obtains each NP node according to IP and the IP database of NP node and location also form a node table in conjunction with UUID and the film film source ID that sees of institute of NP.
The CT server is according to node table and node grouping strategy, and with the NP node grouping, described strategy comprises: P1, the NP node division that film source ID is identical are one group strategy; P2|, film source ID is identical and be divided into one group strategy with the NP node of ISP; P3|, film source ID is identical and be divided into one group strategy with the NP node of region; P4|, film source ID is identical and be divided into one group strategy with the NP node of ISP with the region;
In the present embodiment, if according to tactful P1 NP is divided into groups, then corresponding UUID organizes as keyword search goes out take identical film source ID.In order to make things convenient for the understanding can be with reference to the accompanying drawings-1.
In the present embodiment, if according to tactful P2 NP is divided into groups, then corresponding UUID organizes as keyword search goes out with identical ISP take identical film source ID.In order to make things convenient for the understanding can be with reference to the accompanying drawings-2.
In the present embodiment, if according to tactful P3 NP is divided into groups, then corresponding UUID organizes as keyword search goes out with region, identical place take identical film source ID.For make things convenient for understanding can be with reference to the accompanying drawings-3, accompanying drawing-4, accompanying drawing-5.
In the present embodiment, if according to tactful P4 NP is divided into groups, then take the identical ID of film source, identical ISP with and region, identical place as keyword search goes out corresponding UUID group.In order to make things convenient for the understanding can be with reference to the accompanying drawings-6.
Further, the data that the NP node also self has to the report of CT server, the described data message that has is to represent by MTB (Metadata table bit), described MTB table comprises: the UUID of NP node, film source ID, block data table.Whether described tables of data records each block data of certain film and exists, and downloads the desired data piece for other NP.
For N the NP node that is divided into a group according to above-mentioned arbitrary strategy, each NP node is got N/one data above the Source server, and other data all reach above other N-1 NP node on the same group.For example: have 100 NP nodes watching same video, the CT server divides into groups according to above-mentioned tactful P1, then these 100 NP nodes are divided into one group, and at this time each NP node is only got 1% data from the Source server, and other 99% data all are to obtain from other Np nodes
For the M that is numbered 1-M the NP node that is divided into a group according to above-mentioned strategy, each NP node goes the Source server to take from that blocks of data of oneself numbering according to the numbering of oneself, when needs obtain the data block of non-self numbering, can directly send request of data and obtain the desired data piece to the numbering NP node identical with the desired data block number.For example, the NP nodes is that 20, CT is numbered respectively 1-20 to 20 NP nodes on the same group, and certain NP node serial number is 18 to go the Source server to reach numbering that blocks of data of 18, if this NP node need to be numbered 19 data, it can directly send request of data to the NP node that is numbered 19.
Claims (7)
1. P2P node grouping method, described P2P network comprises CT server, NP node, Source server, it is characterized in that, and described CT server can adopt according to the node table of abundantization multiple node grouping strategy, and the method comprises following preferred steps:
A, NP node are reported NP node self information to the CT server when playing certain video;
The NP nodal information is collected and analyzed to B, CT server, and generate node table according to analysis result;
C, CT server produce the node grouping strategy according to node table, and according to this strategy with the NP node grouping;
D, on the same group between the NP node according to needs separately on the same group other NP node request msg.
2. P2P node grouping method as claimed in claim 1 is characterized in that, the described NP node of steps A is PC, smart mobile phone.
3. P2P node grouping method as claimed in claim 1 is characterized in that, the described NP node of steps A self information comprises; NP node unique identification, the film source ID of NP film that node is seen, NP node self IP information;
P2P node grouping method as claimed in claim 1 is characterized in that, the described node table element of step B comprises: NP node unique identification, film source ID, ISP, NP node location.
4. P2P node grouping method as claimed in claim 1 is characterized in that, ISP and location that the described CT server of step B obtains each NP node according to IP and the IP database of NP node.
5. P2P node grouping method as claimed in claim 1 is characterized in that, the described CT server of step C comprises according to the multiple node grouping strategy of node table Element generation:
P1, the NP node division that film source ID is identical are one group strategy;
P2, film source ID is identical and be divided into one group strategy with the NP node of ISP;
P3, film source ID is identical and be divided into one group strategy with the NP node of region;
P4, film source ID is identical and be divided into one group strategy with the NP node of ISP with the region.
6. such as claim 1 or 6 described P2P node grouping methods, it is characterized in that, for N the NP node that is divided into a group according to described node grouping strategy, each NP node is got N/one data above the Source server, other data all reach above other N-1 NP node on the same group.
7. such as claim 1 or 6 described P2P node grouping methods, it is characterized in that, for the M that is numbered 1-M the NP node that is divided into a group according to described node grouping strategy, each NP node goes the Source server to take from that blocks of data of oneself numbering according to the numbering of oneself, when needs obtain the data block of non-self numbering, can directly send request of data and obtain the desired data piece to the numbering NP node identical with the desired data block number.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2012105881923A CN103036908A (en) | 2012-12-31 | 2012-12-31 | P2P node grouping method |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2012105881923A CN103036908A (en) | 2012-12-31 | 2012-12-31 | P2P node grouping method |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN103036908A true CN103036908A (en) | 2013-04-10 |
Family
ID=48023391
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN2012105881923A Pending CN103036908A (en) | 2012-12-31 | 2012-12-31 | P2P node grouping method |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN103036908A (en) |
Cited By (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104092651A (en) * | 2013-12-29 | 2014-10-08 | 国家电网公司 | Method for preventing rule-violating external connection through IPsec strategy |
| CN104301296A (en) * | 2013-12-29 | 2015-01-21 | 新疆信息产业有限责任公司 | Method for preventing rule-violating external connection through IPsec policy |
| CN104661107A (en) * | 2013-11-22 | 2015-05-27 | 乐视网信息技术（北京）股份有限公司 | Data transmission method, data transmission device and point-to-point stream media system |
| CN105872000A (en) * | 2015-12-21 | 2016-08-17 | 乐视云计算有限公司 | Grouping method, device and system of P2P nodes |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101459614A (en) * | 2008-12-24 | 2009-06-17 | 腾讯科技（深圳）有限公司 | Method, system and equipment for network data transmission |
| CN101668037A (en) * | 2009-09-29 | 2010-03-10 | 乐视网信息技术（北京）股份有限公司 | Method for dispatching P2P network |
| CN102006326A (en) * | 2010-11-24 | 2011-04-06 | 中国联合网络通信集团有限公司 | System and method for downloading P2P streaming media |
| CN102394898A (en) * | 2011-04-07 | 2012-03-28 | 传聚互动(北京)科技有限公司 | File downloading method and system based on P2P (point to point) |
-
2012
- 2012-12-31 CN CN2012105881923A patent/CN103036908A/en active Pending
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101459614A (en) * | 2008-12-24 | 2009-06-17 | 腾讯科技（深圳）有限公司 | Method, system and equipment for network data transmission |
| CN101668037A (en) * | 2009-09-29 | 2010-03-10 | 乐视网信息技术（北京）股份有限公司 | Method for dispatching P2P network |
| CN102006326A (en) * | 2010-11-24 | 2011-04-06 | 中国联合网络通信集团有限公司 | System and method for downloading P2P streaming media |
| CN102394898A (en) * | 2011-04-07 | 2012-03-28 | 传聚互动(北京)科技有限公司 | File downloading method and system based on P2P (point to point) |
Cited By (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104661107A (en) * | 2013-11-22 | 2015-05-27 | 乐视网信息技术（北京）股份有限公司 | Data transmission method, data transmission device and point-to-point stream media system |
| CN104092651A (en) * | 2013-12-29 | 2014-10-08 | 国家电网公司 | Method for preventing rule-violating external connection through IPsec strategy |
| CN104301296A (en) * | 2013-12-29 | 2015-01-21 | 新疆信息产业有限责任公司 | Method for preventing rule-violating external connection through IPsec policy |
| CN105872000A (en) * | 2015-12-21 | 2016-08-17 | 乐视云计算有限公司 | Grouping method, device and system of P2P nodes |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US10798440B2 (en) | Methods and systems for synchronizing data streams across multiple client devices | |
| Scellato et al. | Track globally, deliver locally: improving content delivery networks by tracking geographic social cascades | |
| KR101475682B1 (en) | Method, system and server for managing friends' feed in network | |
| CN101176087A (en) | System and method for effectuating playlist seeking with respect to digital multimedia content from a network node | |
| CN104506493A (en) | HLS content source returning and caching realization method | |
| CN105407030B (en) | The method and device of multimedia file is played in a kind of instant messaging | |
| CN103036908A (en) | P2P node grouping method | |
| US20160381127A1 (en) | Systems and methods for dynamic networked peer-to-peer content distribution | |
| CN102883185A (en) | Video-on-demand method and equipment thereof | |
| Li et al. | What are Chinese talking about in hot weibos? | |
| WO2013029471A1 (en) | Method and device for pushing network information based on geographical position | |
| CN102938775A (en) | Issuing method, system and client of video microblog | |
| CN105338421A (en) | HLS streaming media transmission method and device | |
| JP2006101277A (en) | Information communications system, node apparatus, and overlay network forming method or the like | |
| US20160246789A1 (en) | Searching content of prominent users in social networks | |
| US9705836B2 (en) | Method, server and SNS system for message interaction | |
| CN101668037B (en) | Method for dispatching P2P network | |
| CN108419097A (en) | Video sharing method based on clustering tree under a kind of mobile ad hoc network | |
| CN102291458A (en) | Method for peer-to-peer (p2p) server framework | |
| TW201117581A (en) | Method for transmitting buffer map and network thereof | |
| Shen et al. | SOS: A distributed mobile Q&A systembased on social networks | |
| CN105554558A (en) | Embedded-local-area-network-based video on-demand method and service system | |
| CN104144151B (en) | Content distributing network dispatching method and system and native object management server | |
| CN105095454A (en) | Method and system for directional pushing of user-defined two-dimensional code | |
| Yim et al. | Design and Implementation of VOD Database System |
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: 20130410 |