CN102547471B - Method and system for obtaining candidate cooperation node in P2P streaming media system - Google Patents
Method and system for obtaining candidate cooperation node in P2P streaming media system Download PDFInfo
- Publication number
- CN102547471B CN102547471B CN2011101729091A CN201110172909A CN102547471B CN 102547471 B CN102547471 B CN 102547471B CN 2011101729091 A CN2011101729091 A CN 2011101729091A CN 201110172909 A CN201110172909 A CN 201110172909A CN 102547471 B CN102547471 B CN 102547471B
- Authority
- CN
- China
- Prior art keywords
- node
- information
- dimension
- service
- service node
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Expired - Fee Related
Links
Images
Landscapes
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
- Computer And Data Communications (AREA)
Abstract
The invention provides a method and a system for obtaining a candidate cooperation node in a P2P streaming media system. The method includes the step of using one-dimensional distributed Hashtable to maintain multi-dimensional information of each server node in the P2P streaming media system. In the step, each server node takes video data information owned by the server node, service ability of the server node and stability information as parameters to input a group of several multi-dimensional and one-dimensional resource identifiers with position sensitivity to generate function, a group of several one-dimensional identifiers are obtained, and composite information which comprises the information of the several identifiers is released to the distributed Hashtable. The method further includes the step of obtaining target server node information. When a node with an application requirement sends out application requirement information, the server node which meets the service requirement is searched for in the distributed Hashtable according to the application requirement information to serve as the target server node, and the target server node is taken as the candidate cooperation node of a data scheduling layer.
Description
Technical field
The present invention relates to technical field of the computer network, specifically, the present invention relates to obtain in a kind of P2P stream media system the method and system of candidate cooperation node.
Background technology
Each node in the P2P stream media system is set up contact by covering stratum reticulare.Nerve of a covering should be according to the demand of data dispatch layer, fast, colleges and universities, search in current system the node that meets certain condition accurately, for the data dispatch layer provides candidate cooperation node, and can reach by the mode of adjusting autologous tissue's structure the purpose of the indexs such as optimization system stability, bandwidth availability ratio.
In each channel inside of P2P live broadcast system, the broadcast point of each node is all near the broadcast point in the live data source, and the probability that can carry out the data cooperation is larger; In VOD system, the broadcast point of each node distributes and comparatively disperses, higher to the Capability Requirement of overlay search candidate cooperation node.And, when choosing cooperative nodes, the factors such as the potential service ability of both candidate nodes and stability also be should give and are considered to improve reliability and the efficiency of data dispatch.
In part P2P stream media system, adopt distributed hashtable to safeguard as Kademlia, Chord the information such as data that each node has.When using distributed hashtable, node is using one's own data message as key, using the information such as IP:port of node self as value, and formation<key, value > right, be published in distributed hashtable.And node obtains while having the nodal information of specific data at needs, from distributed hashtable search and desired data information to coupling<key, value > information gets final product.At present, most of conventional P 2P stream media systems, when organizing its nerve of a covering, only from the angle of tissue, search video content, are not done too much consideration to information such as the service ability of each node and stability.Some systems are done certain optimization on this basis, as nerve of a covering organizational form of geographical position sensitivity etc., but can't change it, take video data as basic starting point.In these stream media systems, cover stratum reticulare when for the data dispatch layer, providing candidate cooperation node, can't effectively get the node with better service ability and online stability, and then the quality of the both candidate nodes provided for the data dispatch layer has been provided.
Summary of the invention
The objective of the invention is, in the stream media system that overcomes prior art, cover stratum reticulare when for the data dispatch layer, providing the candidate service node, can't effectively get the service node with better service ability and online stability, and then reduced the quality of the both candidate nodes provided for the data dispatch layer, thereby the invention provides the method and system of obtaining candidate cooperation node in a kind of P2P stream media system.
The present invention is by using the multidimensional peer-to-peer network to safeguard video data, node service ability and this three-dimensional information of stability that in the P2P stream media system, each node has, so that when for the data dispatch layer, providing candidate cooperation node, the data that can not only have from node, but can get easily all nodes preferably such as the performance that has desired data, service ability and online stability, and then improve data dispatch layer node quality used.
For achieving the above object, the invention provides a kind of obtain candidate cooperation node in P2P stream media system method, the service ability of the covering stratum reticulare of the method based on service node and online stability, for the data dispatch layer provides candidate's cooperative nodes, comprise:
Safeguard the step of the various dimensions information of each service node in the P2P stream media system with the one dimension distributed hashtable, in this step, each service node is by the owned video data information of this service node, the service ability of self and stability information are that parameter is inputted the resource identifier generating function that one group of several multidimensional with position sensing arrives one dimension, described one group of multidimensional is mapped to one dimension to the resource identifier generating function of one dimension by the multidimensional of described service node input parameter, obtain one group of several dimension identifier, and the composite information that will comprise described several identifier information is published in distributed hashtable,
Obtain the step of destination service nodal information, when the node that application demand is arranged sends application demand information, according to described application demand information, in described distributed hashtable, search for meet service request service node as the destination service node, described destination service node is as the candidate cooperation node of described data dispatch layer;
Wherein, described destination service node is some in described service node or several; Described service node comprises allly can provide nodes live or the request program data for other node in system; Described composite information refers to that take a described dimension identifier is key, the IP address of node and port number information are value<and key, value > right.
In technique scheme, described video data information, for programme televised live, mean by the sequence number of this program; For request program, by each program, by being each segment number after set time length burst, the video data information of each fragment is used request program number jointly to identify with the sequence number of this fragment in its program.
In technique scheme, described service ability, for characterizing a node for other nodes provide the ability of stream medium data, comprising: but the intrinsic upstream bandwidth of node, available upstream bandwidth or service node quantity.
In technique scheme, described node stability, for characterizing a node for other nodes provide the degree of stability of stream medium data, comprising: node online hours, the time interval or the upstream bandwidth degree of fluctuation of watching progress redirect, switching program.
In technique scheme, described multidimensional to the resource identifier generating function of one dimension is: at first, by one group of position sensing hash function, by the multidimensional information vector Hash of described each service node input, be middle multi-C vector; By intermediate vector, by a position sensing hash function Hash, be the one dimension integer more afterwards; Finally use normalized function that the one dimension integer obtained is mapped in the identifier space of one dimension distributed hashtable, so far complete the Hash of multidimensional information to one-dimension information, obtain final one dimensional resource identifier.
In technique scheme, the described step of obtaining the destination service node further comprises:
Step 201: the step of obtaining the Multi-attributes information that required destination service node should be satisfied;
Step 202: choose the step of a multidimensional to the resource identifier generating function of one dimension, select a not yet used resource identifier generating function of this search at random from described one group of several multidimensional with position sensing to the resource identifier generating function of one dimension, and this identifier generating function that will select is labeled as and uses;
Step 203: the step of obtaining the range of identifiers that the destination service node is corresponding, this step adopts the resource identifier generating function of the multidimensional of described selection to one dimension, and the one dimension range of identifiers corresponding to feature of the required destination service node of Multi-attributes Information generation that should be satisfied according to the described required destination service node obtained, from described distributed hashtable, search has the resource node in this scope;
Step 204: whether the service node number that judgement has been selected meets the step of application demand, whether the interstitial content that this step judgement searches meets the requirement of application demand, if meet stop search, and Search Results is fed back to the node of waiting for application service; If otherwise return to step 202.
Based on above method, the invention provides the method and system of obtaining candidate cooperation node in a kind of P2P stream media system, the service ability of the covering stratum reticulare of this system based on service node and online stability, for the data dispatch layer provides candidate's cooperative nodes, comprise:
Central index server, this server arrives the resource identifier generating function of one dimension for storing one group of several multidimensional with position sensing; Service node, referring to can provide for other nodes the node of service in the P2P stream media system, obtain the resource identifier generating function of multidimensional to one dimension from described central index server, the video data information had according to this node, self service ability and stability Information generation one dimension identifier, and the composite information that will comprise the one dimension identifier information stores in the one dimension distributed hashtable; Should there is demand to send node, refer to need to obtain from other nodes the node of service in the P2P stream media system, send the information of application demand, video data information, node service ability and online stability information that this packets of information should have containing the destination service node, described destination service node is one or several in service node; Wherein, described application demand node also is provided with search module, and the service node that this module is used for can meeting the demands in described distributed hashtable search is as the destination service node, and described service node is as the candidate cooperation node of data dispatch layer; IP address and port numbers that described composite information comprises node.
In technique scheme, described video data information, for programme televised live, mean by the sequence number of this program; For request program, by each program, by being each segment number after set time length burst, the video data information of each fragment is used request program number jointly to identify with the sequence number of this fragment in its program; Described service ability, for characterizing a node for other nodes provide the ability of stream medium data, comprising: but the intrinsic upstream bandwidth of node, available upstream bandwidth or service node quantity; Described node stability, for characterizing a node for other nodes provide the degree of stability of stream medium data, comprising: node online hours, the time interval or the upstream bandwidth degree of fluctuation of watching progress redirect, switching program;
In technique scheme, described multidimensional to the generative process of the resource identifier generating function of one dimension is: at first, by one group of position sensing hash function, by the multidimensional information of input vector Hash, be middle multi-C vector; By intermediate vector, by a position sensing hash function Hash, be the one dimension integer more afterwards; Finally use normalized function that the one dimension integer obtained is mapped in the identifier space of one dimension distributed hashtable, so far complete the Hash of multidimensional to one dimension, obtain final one dimensional resource identifier.
With respect to prior art, the present invention has following technique effect:
1. obtain the method and system of candidate cooperation node in P2P stream media system of the present invention, safeguarded the multidimensional data that has video data information, node service ability, online stability information that comprises each node, can make nerve of a covering effectively get the node that service ability and stability all meet the demands for data dispatch layer search cooperative nodes the time, improve the node quality.
2. multidimensional overcast net of the present invention, resource identifier generating function by holding position sensitiveness, the multidimensional resource information is mapped to one dimension, and then realize using the distributed hashtable of one dimension to safeguard multidimensional data, can effectively reduce structure and the maintenance difficulties of nerve of a covering, and strengthen the system expandability.
3. in the present invention, by using one group of one dimensional resource identifier generating function that parameter is different, can effectively disperse the distribution of resource identifier in identifier space, balanced each node is for safeguarding the load of the information that is distributed to this node.
4. in the present invention, when nerve of a covering is searched in distributed hashtable, searched for for one in one group of one dimensional resource range of identifiers information of random choose, can effectively be reduced in distributed hashtable node for the treatment of the load of information search.
The accompanying drawing explanation
Fig. 1 obtains the block diagram of system of candidate cooperation node in P2P stream media system of the present invention;
Fig. 2 is that node is issued the resource information flow chart in nerve of a covering;
Fig. 3 is the flow chart that nerve of a covering is searched for required node;
The composition frame chart that Fig. 4 is node of the present invention;
Fig. 5 is the composition frame chart of central index server of the present invention.
Embodiment
Various dimensions nerve of a covering and processing method thereof below in conjunction with the drawings and specific embodiments to the P2P of being applicable to stream media system of the present invention are described in detail.
The various dimensions nerve of a covering that is applicable to the P2P stream media system provided by the invention, this nerve of a covering watches that by all in a stream media system live, the node of request program and the various dimensions information that each node has all are maintained in an one dimension distributed hashtable (DHT), and the operation of this nerve of a covering comprises the steps:
1) system maintenance multidimensional is mapped to the resource identifier generating function of one dimension, and the identifier generating function is left on central index server;
When 2) each service node has just been reached the standard grade, get above-mentioned resource identifier generating function;
3) whole system is used an one dimension distributed hashtable (DHT) to safeguard all nodes in the P2P stream media system and the various dimensions information of this service node;
4) service node is for the video data information of own each fragment had, and the information of various dimensions in conjunction with self, become the multidimensional information vector, by step 1) described one group of resource identifier generating function generates one group of one dimensional resource identifier;
5) service node is usingd step 4) in the dimension identifier that obtains as the key in distributed hashtable, the IP:port information of self is as value, generate one group<key, value > right, by these<key, value > information is published in distributed hashtable, complete<key, value > to information distributed storage on each node in system, for other node searchings.
6), when the data dispatch layer need to obtain candidate cooperation node from the covering stratum reticulare, should have which video data, service ability value and stability value to covering stratum reticulare proposition destination node and should meet which demand.Nerve of a covering is searched for required node from distributed hashtable.
7) need to obtain in the P2P stream media system service ability of the video content data that has in specified scope and node and stability preferably during node when an application demand node, by specifying the scope of required video content data, the scope of required service ability and the scope of stability, by 1) described in one group of resource identifier generating function, know the one dimensional resource range of identifiers of target zone correspondence under each resource identifier generating function of above multidimensional, and search has the service node of resource in this one dimensional resource range of identifiers from distributed hashtable.
The information of the various dimensions that wherein, described node has is by including but not limited to following three vectors that information forms: the video data information that node has, node service capability information and the online stability of node;
Wherein, described step 1) multidimensional in is α to the quantity of the resource identifier generating function of one dimension, and α >=1 is system configuration parameter.
Wherein, described step 1) one group of multidimensional in is mapped to the resource identifier generating function of one dimension, each resource identifier generating function is wherein answered holding position sensitiveness, point close on hyperspace is after being mapped to one-dimensional point by the resource identifier generating function, holding position proximity still, concrete mode is as follows:
If the resource identifier generating function be input as the d dimensional vector v=[v in real number space
1, v
2..., v
d], at first use k p-to stablize distributing position sensitiveness hash function (LSH function)
by v from
be mapped to
obtain k dimensional vector g (v)=(h
a1, b1(v) ..., h
ak, bk(v)), reuse afterwards p-and stablize the LSH function
by g (v) from
dimension is mapped to
so far d dimensional vector v has been mapped to the one dimension integer space.For the identifier space M that makes the integer-valued codomain of the one dimension acquired and distributed hashtable is consistent, use normalized function φ (τ) that result is adjusted in the identifier space M of one dimension distributed hashtable.This normalized function can be used as linear normalization or other modes realize, for example uses following φ (τ) function:
In above formula, μ and σ are respectively τ
g-LSH(v) average and standard deviation.So far, final resource identifier generating function is Φ (v)=φ (τ
g-LSH(v))=φ (h
a ', b '(g (v))).Each parameter in this group resource identifier generating function is all not identical, is to stablize LSH function h by random selection as the p-of its part
a1, b1(v) ..., h
ak, bkand h (v)
a ', b '(g) parameter realizes.It can be l that all p-on the above stablize the LSH function
1normal form, l
2p-under normal form or other normal forms stablizes the LSH function.
Wherein, described step 3) video data information in, for programme televised live, video data information means by the sequence number of this program; For request program, each program is by the set time length T
bucketbeing divided into after fragment is each segment number, and the video data information of each fragment is used request program number jointly to identify with the sequence number of this fragment in its program.But the service ability of node self can be with the intrinsic upstream bandwidth of node self, can mean by upstream bandwidth service node quantity etc.; The stability information of node can mean by the average line duration of this node, bandwidth stability etc.
Wherein, described step 4) the one dimension distributed hashtable in can be Kademlia or Chord or other various one dimension distributed hashtables.
Wherein, affiliated step 7) nerve of a covering in is searched for required node from distributed hashtable, refer to that nerve of a covering, according to the required video data of data dispatch layer, node service ability and stability boundary, is searched for from distributed hashtable, the information of search in specified scope.
Wherein, described step 8) middle video data, service ability, the stability requirement that covers the required node of stratum reticulare should be satisfied, according to the data dispatch layer, the candidate cooperation node proposed requirement is carried out.
Wherein, described step 8) in, in search, have when specifying the node of one dimensional resource range of identifiers internal information, the nerve of a covering of this node is from 8) described in a group identifier range information one of random choosing, in distributed hashtable, searched for.
1. system configuration
Fig. 1 obtains the block diagram of system of candidate cooperation node in P2P stream media system of the present invention.There is the index server of a center type in this system.During system initialization, determine that is total to the resource identifier generating function of α multidimensional to one dimension, and this group function is deposited in central index server to the parameter that α sets while being system initialization.Watch all nodes of live request program in the distributed hashtable maintenance system of an one dimension of this system use, and the resource information of node issue.
The resource identifier generating function is all answered holding position sensitiveness, on hyperspace close point after using this resource identifier generating function to be mapped to one-dimensional point, holding position proximity still.For example can construct the resource identifier generating function that meets above requirement by position-based sensitiveness Hash, as follows:
If the resource identifier generating function be input as three-dimensional variable:
V=[video data numbering, service ability value, stability value]
For by v from
be mapped to
use k l
2the p-of normal form stablizes distributing position sensitiveness hash function
obtain k dimensional vector g (v)=(h
a1, b1(v) ..., h
ak, bk(v)).Reuse afterwards l
2the p-of normal form stablizes the LSH function
by g (v) from
dimension is mapped to
this τ
lSHnormal Distribution
finally use following φ (τ) function by τ
lSHvalue is adjusted in the identifier space M of one dimension distributed hashtable:
In above formula, μ and σ are respectively τ
g-LSH(v) average and standard deviation.So the final resource identifier generating function that we use is Φ (v)=φ (τ
g-LSH(v))=φ (h
a ', b '(g (v))).
Each parameter in this group resource identifier generating function is all not identical, is as the position sensing hash function h under the l2 normal form of its part by random selection
a1, b1(v) ..., h
ak, bkand h (v)
a ', b '(g) parameter realizes.
2. node adds system flow
After ordinary node is reached the standard grade, carry out following operation:
1) get the resource identifier generating function of a foregoing α multidimensional to one dimension from central index server.
2) get the information of the node of some in native system from central index server
3) rely on these nodal informations to be added the bootstrap operation of system, and then add distributed hashtable.
3. node is issued resource information in nerve of a covering
Fig. 2 is node to the flow chart of issue resource information in nerve of a covering.As shown in the drawing, in native system, the video data information of programme televised live means by the sequence number of this program; For request program, each program is by the set time length T
bucketbeing divided into after fragment is each segment number, and the video data information of each fragment is used request program number jointly to identify with the sequence number of this fragment in its program.The service ability of node self means with the upstream bandwidth of node self; The stability information of node means with the average line duration of this node.Node is watched a programme televised live adding, or under buffer memory after the request program data slot of some, to issue video resource information in nerve of a covering.This issue flow process is as follows:
1) node knows that oneself will be published to the information of which video data fragment in nerve of a covering, and obtains self service ability and online stability value;
2) the every a video data frag info that will issue for self, in conjunction with node self service ability value and stability value, form 3 dimensional vector v=[video data numberings, the service ability value, stability value], and use the resource identifier generating function from central index server or α multidimensional obtaining to one dimension, calculate α 1 and tie up resource identifier;
3) take respectively calculate each 1 the dimension resource identifier be key, node self IP:Port information is value, formation<key, value > right, by these<key, value > to being published in distributed hashtable.
4. provide candidate cooperation node to the data dispatch layer
When the data dispatch layer need to obtain candidate cooperation node from the covering stratum reticulare, should have which video data, service ability value and stability value to covering stratum reticulare proposition destination node and should meet which demand.The covering stratum reticulare is picked out and is met the node that the data dispatch layer is made demands from the candidate node list of self maintained; When if satisfy condition in candidate node list, the sum of node is less than β times of the average required number of nodes of data dispatch layer, nerve of a covering is searched for required node from distributed hashtable, and β>1 is system parameters.
5. search node from distributed hashtable
Cover stratum reticulare can not to the data dispatch layer provide requirement meet the node of its requirement the time, or when covering number of nodes in the candidate node list that stratum reticulare safeguards and being less than 2 times of the average required number of nodes of data dispatch layer, nerve of a covering proceeds as follows:
Nerve of a covering is by knowing the scope of required video content data, the scope of required service ability and the scope of stability, by when adding system or the α obtained a resource identifier generating function, know the one dimensional resource range of identifiers of target zone correspondence under each resource identifier generating function of above 3 dimensions, start subsequently to search for the node that meets the data dispatch requirement from distributed hashtable
Fig. 3 is the flow chart that nerve of a covering is searched for required node, as shown in the drawing:
In search place, have when specifying the node of one dimensional resource range of identifiers internal information, the nerve of a covering of this node therefrom selects one in a described group identifier range information at random, in distributed hashtable, is searched for; If can search the node of sufficient amount, stop search; If can not search the node of sufficient amount,, after some cycles, again select at random a not yet used range information from an above-mentioned group identifier range information, again searched for.So repeatedly, until search the node of sufficient amount, maybe this group one dimension range information all was used.
6, node structure
The composition frame chart that Fig. 4 is node of the present invention.What the present invention is directed to is the P2P stream media system, and each node both can obtain video data from other nodes, also can provide data for other nodes.Therefore each node of system has the service of reception and the double role of service is provided.
Safeguarding in each node that the group got is total to the resource identifier generating function list of α multidimensional to one dimension from the center type index server, for multidimensional information is mapped to one dimension; Each node is also being safeguarded distributed hashtable, i.e. routing table.According to certain distributed hashtable protocol architecture, depositing in system the information such as ID, IP, port of other nodes of part, and safeguarding that other nodes are published to the part<key in system, value in this distributed hashtable information.The distributed hashtable that each node is safeguarded common " distributed " completes index, the query function that the node in system and node are released news.
This node is for the video data information of own each fragment had, in conjunction with the information of the various dimensions such as stability, service ability of self, generation multidimensional information vector, and by the group that gets from the center type index server altogether α multidimensional to the resource identifier generating function of one dimension, by the multidimensional information dimensionality reduction to one dimension; State subsequently a dimension identifier more than this node as the key in distributed hashtable, the IP:port information of self is as value, generate one group<key, value > right, by these<key, value > information is published in distributed hashtable, complete<key, value > to information distributed storage on each node in system, for other node searchings.
When this node need to obtain the candidate cooperation node met certain requirements, the upper layer application of this node (for example data dispatch layer) at first proposes the each side demand to the target candidate cooperative nodes, comprises data, service ability, stability information that destination node should have; These demands form the requirement vector of various dimensions, arrive the resource identifier generating function of one dimension by the multidimensional of this node storage, are mapped to the one dimension object identifier; After this, by in the distributed hashtable search system with this one dimension object identifier coupling<key, value > to information (key and this this one dimension object identifier coupling), and then arrive target candidate cooperative nodes information by the value acquisition of information, and this Search Results is added in the candidate cooperation node list.
7, central index server structure
The composition frame chart that Fig. 5 is central index server of the present invention.The center type index server is being safeguarded line node list and the list of resource identifier generating function in system.Wherein, storing the information such as IP, port, node ID of current online all or part of node in system in the line node list.When a new node adds system, at first this node obtains some current line node information from the line node list of central index server, and then pass through these line nodes by other nodes in the self information apprizing system, and collect the distributed routing table that other nodal informations are set up oneself, and then complete the step into distributed hashtable.During system initialization, determine that is total to the resource identifier generating function of α multidimensional to one dimension, and this group function is deposited in central index server to the parameter that α sets while being system initialization.
It should be noted that, embodiment of the present invention of above introduction and and unrestricted.It will be understood by those of skill in the art that any modification to technical solution of the present invention or be equal to substitute not break away from the spirit and scope of technical solution of the present invention, it all should be encompassed in claim scope of the present invention.
Claims (8)
1. obtain the method for candidate cooperation node in a P2P stream media system, the service ability of the covering stratum reticulare of the method based on service node and online stability, for the data dispatch layer provides candidate's cooperative nodes, comprise:
Safeguard the step of the various dimensions information of each service node in the P2P stream media system with the one dimension distributed hashtable, in this step, each service node is by the owned video data information of this service node, the service ability of self and stability information are that parameter is inputted the resource identifier generating function that one group of several multidimensional with position sensing arrives one dimension, described one group of multidimensional is mapped to one dimension to the resource identifier generating function of one dimension by the multidimensional of described service node input parameter, obtain one group of several dimension identifier, and the composite information that will comprise described several identifier information is published in distributed hashtable,
Obtain the step of destination service node, when the node that application demand is arranged sends application demand information, according to described application demand information, in described distributed hashtable, search for meet service request service node as the destination service node, described destination service node is as the candidate cooperation node of described data dispatch layer;
Wherein, described destination service node is some in described service node or several; Described service node comprises allly can provide nodes live or the request program data for other node in system; Described composite information refers to that take a described dimension identifier is key, the IP address of node and port number information are value<and key, value > right;
Described multidimensional to the resource identifier generating function of one dimension is: at first, by one group of position sensing hash function, by the multidimensional information vector Hash of described each service node input, be middle multi-C vector; By intermediate vector, by a position sensing hash function Hash, be the one dimension integer more afterwards; Finally use normalized function that the one dimension integer obtained is mapped in the identifier space of one dimension distributed hashtable, so far complete the Hash of multidimensional information to one-dimension information, obtain final one dimensional resource identifier;
The described step of obtaining the destination service node further comprises:
Step 201: the step of obtaining the Multi-attributes information that required destination service node should be satisfied;
Step 202: choose the step of a multidimensional to the resource identifier generating function of one dimension, select a not yet used resource identifier generating function of this search at random from described one group of several multidimensional with position sensing to the resource identifier generating function of one dimension, and this identifier generating function that will select is labeled as and uses;
Step 203: the step of obtaining the range of identifiers that the destination service node is corresponding, this step adopts the resource identifier generating function of the multidimensional of described selection to one dimension, and the one dimension range of identifiers corresponding to feature of the required destination service node of Multi-attributes Information generation that should be satisfied according to the described required destination service node obtained, from described distributed hashtable, search has the resource node in this scope;
Step 204: whether the service node number that judgement has been selected meets the step of application demand, whether the interstitial content that this step judgement searches meets the requirement of application demand, if meet stop search, and Search Results is fed back to the node of waiting for application service; If otherwise return to step 202.
2. obtain the method for candidate cooperation node in P2P stream media system according to claim 1, it is characterized in that described video data information, for programme televised live, means by the sequence number of this program; For request program, by each program, by being each segment number after set time length burst, the video data information of each fragment is used request program number jointly to identify with the sequence number of this fragment in its program.
3. obtain the method for candidate cooperation node in P2P stream media system according to claim 1, it is characterized in that, described service ability, for characterizing a node for other nodes provide the ability of stream medium data, comprising: but the intrinsic upstream bandwidth of node, available upstream bandwidth or service node quantity.
4. obtain the method for candidate cooperation node in P2P stream media system according to claim 1, it is characterized in that, the stability of described node, for characterizing a node for other nodes provide the degree of stability of stream medium data, comprising: node online hours, the time interval or the upstream bandwidth degree of fluctuation of watching progress redirect, switching program.
5. obtain the system of candidate cooperation node in a P2P stream media system, the service ability of the covering stratum reticulare of this system based on service node and online stability, for the data dispatch layer provides candidate's cooperative nodes, comprise:
Central index server, this server arrives the resource identifier generating function of one dimension for storing one group of several multidimensional with position sensing;
Service node, referring to can provide for other nodes the node of service in the P2P stream media system, obtain the resource identifier generating function of multidimensional to one dimension from described central index server, the video data information had according to this node, self service ability and stability Information generation one dimension identifier, and the composite information that will comprise the one dimension identifier information stores in the one dimension distributed hashtable;
Should there is demand to send node, refer to need to obtain from other nodes the node of service in the P2P stream media system, send the information of application demand, video data information, node service ability and online stability information that this packets of information should have containing the destination service node, described destination service node is one or several in service node;
Wherein, described application demand node is searched for the service node that can meet the demands as the destination service node in described distributed hashtable, and described service node is as the candidate cooperation node of data dispatch layer; IP address and port numbers that described composite information comprises node;
Described multidimensional to the resource identifier generating function of one dimension is:
At first, by one group of position sensing hash function, by the multidimensional information of input vector Hash, be middle multi-C vector; By intermediate vector, by a position sensing hash function Hash, be the one dimension integer more afterwards; Finally use normalized function that the one dimension integer obtained is mapped in the identifier space of one dimension distributed hashtable, so far complete the Hash of multidimensional to one dimension, obtain final one dimensional resource identifier.
6. obtain the system of candidate cooperation node in P2P stream media system according to claim 5, it is characterized in that described video data information, for programme televised live, means by the sequence number of this program; For request program, by each program, by being each segment number after set time length burst, the video data information of each fragment is used request program number jointly to identify with the sequence number of this fragment in its program.
7. obtain the system of candidate cooperation node in P2P stream media system according to claim 5, it is characterized in that, described service ability, for characterizing a node for other nodes provide the ability of stream medium data, comprising: but the intrinsic upstream bandwidth of node, available upstream bandwidth or service node quantity.
8. obtain the system of candidate cooperation node in P2P stream media system according to claim 5, it is characterized in that, the stability of described node, for characterizing a node for other nodes provide the degree of stability of stream medium data, comprising: node online hours, the time interval or the upstream bandwidth degree of fluctuation of watching progress redirect, switching program.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2011101729091A CN102547471B (en) | 2010-12-08 | 2011-06-24 | Method and system for obtaining candidate cooperation node in P2P streaming media system |
Applications Claiming Priority (3)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201010590401 | 2010-12-08 | ||
| CN201010590401.9 | 2010-12-08 | ||
| CN2011101729091A CN102547471B (en) | 2010-12-08 | 2011-06-24 | Method and system for obtaining candidate cooperation node in P2P streaming media system |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN102547471A CN102547471A (en) | 2012-07-04 |
| CN102547471B true CN102547471B (en) | 2013-12-11 |
Family
ID=46353216
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN2011101729091A Expired - Fee Related CN102547471B (en) | 2010-12-08 | 2011-06-24 | Method and system for obtaining candidate cooperation node in P2P streaming media system |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN102547471B (en) |
Families Citing this family (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103412883B (en) * | 2013-07-17 | 2016-09-28 | 中国人民解放军国防科学技术大学 | Semantic intelligent information distribution subscription method based on P2P technology |
| CN104168265B (en) * | 2014-07-16 | 2018-01-05 | 南京邮电大学 | A kind of anonymous communication method based on distributed hashtable network |
| CN104967873A (en) * | 2015-06-29 | 2015-10-07 | 上海帝联信息科技股份有限公司 | Streaming live scheduling method, system and scheduling server |
| CN109788301B (en) * | 2019-01-08 | 2021-12-03 | 深圳市网心科技有限公司 | Live broadcast method, terminal equipment, live broadcast system and computer readable storage medium of streaming media |
| CN109981760A (en) * | 2019-03-13 | 2019-07-05 | 扬州大学 | P2P stream media node selection method based on greedy algorithm |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101667200A (en) * | 2009-09-18 | 2010-03-10 | 浙江大学 | Window query method in P2P environment |
| CN101741750A (en) * | 2010-01-15 | 2010-06-16 | 中国科学院计算技术研究所 | Resource downloading method in P2P (peer-to peer) and system thereof |
| CN101753610A (en) * | 2008-12-19 | 2010-06-23 | 华为技术有限公司 | Distributed network structure method, device, system and task processing method |
-
2011
- 2011-06-24 CN CN2011101729091A patent/CN102547471B/en not_active Expired - Fee Related
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101753610A (en) * | 2008-12-19 | 2010-06-23 | 华为技术有限公司 | Distributed network structure method, device, system and task processing method |
| CN101667200A (en) * | 2009-09-18 | 2010-03-10 | 浙江大学 | Window query method in P2P environment |
| CN101741750A (en) * | 2010-01-15 | 2010-06-16 | 中国科学院计算技术研究所 | Resource downloading method in P2P (peer-to peer) and system thereof |
Also Published As
| Publication number | Publication date |
|---|---|
| CN102547471A (en) | 2012-07-04 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN102547471B (en) | Method and system for obtaining candidate cooperation node in P2P streaming media system | |
| CN103078847B (en) | Method for storing and reading multi-code-rate stream file and relevant device | |
| CN107707926A (en) | A kind of live TV stream transmission method, device and system | |
| US20090037960A1 (en) | Method and Apparatus for Acquiring Media Assets For Distribution to Subscribers in an On-Demand Media Delivery System Using a Peer-to-Peer File Transfer Protocol | |
| CN101145929A (en) | A P2P stream media VoD system for IPV6 environment | |
| CN101031060B (en) | System and method for generating electronic programm guide | |
| Shang et al. | A survey of distributed dataset synchronization in Named Data Networking | |
| CN101567796A (en) | Multimedia network with fragmented content and business method thereof | |
| CN104935644A (en) | Method and device for distribution storage of film sources | |
| CN101631034A (en) | Method, device and system for node management and access in peer-to-peer network | |
| CN101442558A (en) | Method and system for providing index service for P2SP network | |
| CN106777387A (en) | A kind of Internet of Things big data access method based on HBase | |
| He et al. | Optimal prefetching scheme in P2P VoD applications with guided seeks | |
| CN101286927A (en) | Method for realizing P2P stream media system based on node interconnection optimization | |
| Tuncer et al. | Scalable cache management for ISP-operated content delivery services | |
| CN101202902A (en) | Method for designing P2P stream medium network transferring structure with number copyright management | |
| CN107959704A (en) | A kind of data processing method and home gateway | |
| CN103457976A (en) | Data downloading method and system | |
| CN104935878A (en) | Large-scale network video monitoring hotspot information distribution system and distribution method thereof | |
| CN101977223A (en) | Network television based information interaction method | |
| Liu et al. | MeTree: A contribution and locality-aware P2P live streaming architecture | |
| Chang et al. | Social VoD: A social feature-based P2P system | |
| KR101144331B1 (en) | Time Driven Mesh Overlay Network System and Method for Constructing Time Driven Mesh Overlay Network Using the Same | |
| Sangpachatanaruk et al. | A p2p overlay architecture for personalized resource discovery, access, and sharing over the internet | |
| CN108270845A (en) | A kind of P2P VOD systems and method based on RTSP |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| C14 | Grant of patent or utility model | ||
| GR01 | Patent grant | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20131211 Termination date: 20200624 |
|
| CF01 | Termination of patent right due to non-payment of annual fee |