CN101997922B - Cost optimization-based P2P streaming media coverage network topology structure adjustment method - Google Patents
Cost optimization-based P2P streaming media coverage network topology structure adjustment method Download PDFInfo
- Publication number
- CN101997922B CN101997922B CN2010105524645A CN201010552464A CN101997922B CN 101997922 B CN101997922 B CN 101997922B CN 2010105524645 A CN2010105524645 A CN 2010105524645A CN 201010552464 A CN201010552464 A CN 201010552464A CN 101997922 B CN101997922 B CN 101997922B
- Authority
- CN
- China
- Prior art keywords
- node
- message
- requesting
- father
- alternative
- 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
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The invention provides a cost optimization-based P2P streaming media coverage network topology structure adjustment method. In the method, the dynamism and isomerism of nodes are fully considered, the topology information of nodes, link delay between the nodes and available uplink bandwidth of the nodes are utilized, high-capacity nodes are greedily selected from alternative nodes to serve as service nodes by calculating the weight of the link between the nodes and the capacity value of the alternative nodes. Meanwhile, due to an adaptive topology adjustment method for periodically and continuously adjusting nodes with high bandwidth and long survival time to be close to a video source, the nodes in the network can gradually learn the network status and continuously optimize the system performance. A coverage network topology constructed by the method can improve the data diffusion speed, ensures the stability and continuity of streaming distribution, and effectively reduces the flow cross operators.
Description
Technical field
The present invention relates to P2P stream media technology field, relate in particular to a kind of nerve of a covering topological structure method of adjustment.
Background technology
It is one of focus of current academia and industrial quarters research that P2P (peer-to-peer claims peer-to-peer network again) technology is combined with the Streaming Media application.The P2P stream media technology is made up of nerve of a covering topological structure and two parts of data dispatch, and the nerve of a covering topological structure is meant how to seek neighbor node, thereby an application layer network is organized; And data dispatch is meant that on the nerve of a covering that has built, carrying out Streaming Media again transmits.Therefore the nerve of a covering topological structure is the basis of data dispatch.At present, the nerve of a covering topology in the P2P stream media technology mainly with tree-shaped and netted be main.Document [1] analysis has been compared mesh topology and two kinds of structures of multi-tree topology, point out that mesh topology can effectively utilize the network bandwidth more under the network stabilization state, and under the situation of network disturbance, the mesh topology robustness is better.Based on the nerve of a covering of net (mesh) topology because be with good expansibility, to the adaptivity and the robustness of node dynamic, become the main flow topological mode that adopt in current p2p streaming medium content distribution field.
At present, based on the mode that the overlay network of mesh mainly takes random node to select, the node of participating in the stream distribution session obtains online resource node at random through concentrated or distributed way and connects, and obtains data.The mode that this random node is selected; Owing to do not consider the node self attributes; Physical topology information like node; The available bandwidth of node, node be link delay etc. between line duration and node, makes that the P2P stream media system based on the mesh topological structure has very high cross-domain flow rate, and the delay of data distribution is bigger; Simultaneously, the node of selecting frequent off-line has strengthened the shake of nerve of a covering topology as service node, has reduced the continuity of stream distribution service.Therefore, optimize mesh nerve of a covering topology and become the key of lifting based on the P2P streaming medium content distribution technology of mesh.
To mesh nerve of a covering topological optimization; Tara people such as [2] proposes the distributed covering topological structure of Outreach algorithm; Newly added node is poor through the upstream bandwidth and the downlink bandwidth of existing node in the evaluating system, therefrom selects the maximum node of bandwidth difference as service node, connects.This method is a target to realize maximization node upstream bandwidth utilance, to minimize the source server average bandwidth.Dongni people such as [3] proposes the quick nerve of a covering topological construction method of Fast-mesh; Through the ratio of link delay between computing node available bandwidth and node, adopt greedy method to select the big node of ratio makes up the delay minimum as the method for the service node of newly added node nerve of a covering topology successively.The method of above topology optimization has all only been considered to promote the performance of application layer system, and does not consider the flow cost that the application layer system causes the bottom physical network, and this flow cost can constantly increase along with the increase of system scale.Simultaneously; Simple serves as the covering topological structure method of selecting foundation with bandwidth with postponing; Because do not consider the life span of node, the node of selection possibly have very strong dynamic, causes the instability of application layer system; Grievous injury the continuity of video flowing distribution, and then reduced the service quality of stream distribution.
Document 1:Magharei; N.; R.Rejaie, et al..Mesh or Multiple-Tree:A Comparative Studyof Live P2P Streaming Approaches.The 26th IEEE International Conference on ComputerCommunications (INFOCOM 2007).
Document 2:Tara; S.; L.Baochun, et al..Outreach:peer-to-peer topology constructiontowards minimized server bandwidth costs.IEEE Journal on Selected Areas inCommunications, 25 (1): 35-45.
Document 3:Dongni Ren; Y.T.H.Li; Et al..0n Reducing Mesh Delay for Peer-to-PeerLive Streaming.The 27th IEEE International Conference on Computer Communications (INFOCOM 2008) .Phoenix, AZ.
Summary of the invention
Technical problem to above-mentioned existence; The present invention proposes a kind of P2P Streaming Media nerve of a covering topological structure method of adjustment; This method makes full use of the topology information of node and the statistical information of node life span; Through the weights of link between computing node and the ability value of alternative node, the greedy high node of the ability of from alternative node, selecting is as service node.Simultaneously, through periodically bandwidth height and the long node of life span constantly being adjusted the self adaptation topology method of adjustment near video source, the situation of the learning network that the node in the network can be progressive is continued to optimize systematic function.
For achieving the above object, the present invention adopts following technical scheme:
A kind of P2P Streaming Media nerve of a covering topological structure method of adjustment based on cost optimization; Index server and video source server have been included in the P2P stream media network; Realize the nerve of a covering topological structure based on cost optimization, the adjustment of neighbor node dynamic self-adapting is provided behind the structure
Said nerve of a covering topological structure, the step S1 that adopts during realization comprises following substep,
S1-1, requesting node send the registration message message with adding P2P stream media network to index server,
The registration message message that each requesting node sends comprises the node IP address of this requesting node, play position, node upstream bandwidth and the node downlink bandwidth of node request;
After S1-2, index server are received the registration message message of certain requesting node; Play position according to the node request; Provide requesting node information to be kept in the global node tabulation this registration message message; And the alternative node of selecting online N play position and requesting node to be close to, the composition alternative node list number sends to requesting node together with the autonomous system of requesting node
Information comprises between autonomous system number, this alternative node and the requesting node under the node IP address, node of each alternative node autonomous system jumping figure, node upstream bandwidth, node line duration and the current play position of node in the alternative node list;
S1-3, requesting node send the connection probe messages respectively to N alternative node;
Connect probe messages and comprise requesting node IP address;
S1-4, alternative node if currently have an available upstream bandwidth, then send the connection response message and give requesting node after receiving the connection probe messages that requesting node sends; Otherwise abandon the connection probe messages;
The connection response message comprises link delay and the current play position of node between node current residual upstream bandwidth, node IP address, node and the video source server of this alternative node;
If S1-5 is in the time-out time of setting; Requesting node is received the connection response message of sending more than or equal to Kp alternative node; Requesting node is according to the cost of link between connection response message computing node; Therefrom select of satisfying rate requirement or more than alternative node set up father and son's annexation, accomplish the adition process of requesting node; If in the time-out time of setting, requesting node is received the connection response message that h alternative node sent, and h is less than Kp, then execution in step S1-6; Said Kp is the degree of the requesting node preset;
And; When not receiving the connection response message that certain alternative node is sent in the alternative node list in the time-out time that requesting node is being set; Then this alternative node of not doing response is deleted from alternative node list, and the intranodal that node IP address that will this alternative node deposits requesting node in is treated the deletion of node tabulation;
S1-6, requesting node send to index server and obtain line node list request message, and this obtains the current play position that node IP address, intranodal that line node list request message comprises this requesting node are treated deletion of node tabulation and node;
S1-7, index server receive that requesting node sends obtain line node list request message after, select again with contiguous being different from of requesting node play position and treat that (Kp-h) the individual new alternative node in the deletion of node tabulation sends to requesting node;
S1-8, requesting node send to (Kp-h) individual new alternative node and connect probe messages, continue to begin to carry out from step S1-4; When execution in step S1-5, in the time-out time of setting, requesting node is received the connection response message of sending more than or equal to Kp alternative node;
Said neighbor node dynamic self-adapting method of adjustment, the step S2 that adopts during realization comprises following substep,
S2-1, the session node that has added the P2P stream media network and participated in P2P Streaming Media distribution are periodically sent probe message messages to its all father's nodes, and the upstream bandwidth, session node that the probe message message comprises life span TTL, the session node of this probe message message be the IP address of line duration and session node;
After Father's Day of S2-2, session node, point was received the probe message message, carry out TTL and subtract 1 operation, if operation back TTL equals 0, execution in step S2-3 then, otherwise, execution in step S2-4;
Father's node of S2-3, session node is self upstream bandwidth and session node upstream bandwidth size relatively, and self line duration and session node line duration is big or small;
If the session node upstream bandwidth then abandons the probe message message greater than the upstream bandwidth of father's node and session node line duration greater than the line duration of father's node, and sends the grant message packet and give session node;
If the session node upstream bandwidth greater than the upstream bandwidth of father's node but session node line duration less than the line duration of father's node, then execution in step S2-5;
Otherwise, abandon the probe message message, no longer process;
Said grant message packet comprises the IP address of father's node, the IP address of all father's nodes of father's node self, and the line duration of father's node;
Father's node of S2-4, session node continues to transmit this probe message message, circulation execution in step S2-2 to all father's nodes of this father's node self;
The difference of the upstream bandwidth of S2-5, computing session node upstream bandwidth and father's node and session node be the difference of the line duration of line duration and father's node, if the difference of upstream bandwidth is greater than bandwidth difference threshold value B
ThresholdAnd the difference of line duration is less than line duration difference limen value T
Threshold, then send the grant message packet and give session node; Otherwise, abandon the probe message message;
S2-6, in predefined time-out time, session node is sent the node of grant message packet from all, finds to postpone the renewal that minimum node is carried out neighbor node from the video source server to this session node; The renewal of said neighbor node comprises following substep during realization,
S2-6-1, session node are sent session node to said all father's nodes that postpone minimum node and are connected probe messages;
S2-6-2, receive father's node that session node connects probe messages, if the residue upstream bandwidth is arranged, then return the connection response message, this session node connection response message comprises the node IP address of father's node, and to accept this session node be child nodes; Otherwise, execution in step S2-6-3;
S2-6-3, receive father's node that session node connects probe messages; Compare self all child nodes upstream bandwidths and this session node upstream bandwidth size; From bandwidth all child nodes, select-the individual node that is replaced probability less than certain preset determined value less than this session node; Be called selected child nodes, execution in step S2-6-4;
S2-6-4, said father's node send service disruption message to said selected child nodes, send the connection response message to the described request node, set up being connected between father's node and this session node;
S2-6-5, said selected child nodes receive service disruption message; If also there is other father's node in this child nodes; Then continue to carry out the adjustment of neighbor node dynamic self-adapting according to step S2; If this child nodes does not have other father's node to exist, then return and continue execution in step S1 as requesting node, send the registration message message to index server again.
And, among the step S1-2,
Autonomous system jumping figure between said alternative node and the requesting node is to obtain through searching inner global I P-AS mapping table and the autonomic system the Internet map of preserving of index server;
The node that described request node play position is contiguous, through formula | C
1-C
2|＜M calculates, wherein C
1Be the current play position of node online in the index server, C
2Be the play position of requesting node request, M is non-negative constant;
The information source of said alternative node list is, the node in the P2P stream media network periodically sends oneself state information to index server with the mode of " heartbeat message ", and this state information comprises the current play position of node.
And, node described in the step S1-2 node described in line duration and the step S2-3 line duration press △ t=t
Active-t
SinceCalculate, wherein, t
ActiveThe moment that the expression index server is received the last heartbeat message of this node, t
SinceRepresent that this node adds the P2P stream media network sends the moment from the registration message message to index server.
And the link delay between node described in the step S1-4 and the video source server equals the video source server and in all paths of this node, postpones maximum, by formula
Recursive calculation, wherein,
RTT is the round-trip delay from node i to node j link, D
i(s) be delay from video source server s to node i;
Said node i is to the round-trip delay of node j link, is RTT=T by formula
Recv-T
SendCalculate, wherein T
SendThe expression node i is sent the moment that connects the probe requests thereby message, T to node j
RecvThe moment that the expression node i is received the connection response message that node j sends.
And among the step S1-5, requesting node by formula
The cost of link between computing node, wherein r is a flow rate, R
i(j) be the upstream bandwidth of alternative node j current residual, α is non-negative constant, and 0≤α≤1, D
i(j) be the delay cost of alternative node j, C to requesting node i link
i(j) be the flow cost of alternative node j, by formula to requesting node i link
Calculate, wherein H
i(j) be alternative node j to requesting node i bottom physical pathway the autonomous system number of process; Work as ASN
i=ASN
j, the H when autonomous system of promptly alternative node j and requesting node i is number identical
i(j) be 1, otherwise H
i(j) for alternative node j adds 1 to the autonomous system number of requesting node i process, ρ and σ are non-negative constants;
Requesting node sorts according to link cost to the alternative node that returns response message from big to small among the step S1-5; And employing greedy method; M alternative node before selecting successively; The residue upstream bandwidth sum that satisfies this m alternative node equals flow rate r, and m is less than the degree Kp of requesting node here, and the degree of requesting node by formula
Calculate, wherein B
pBe the upstream bandwidth of requesting node, r is a flow rate, and δ is non-negative constant;
Requesting node is set up set membership with the big node of the link cost of selecting successively, comprises that requesting node sends the bandwidth occupancy request message to father's node, and the bandwidth occupancy request message comprises requesting node IP address and the upstream bandwidth that need take; After father's node receives the bandwidth occupancy request message of requesting node, begin to send data, accomplish the adition process of requesting node to requesting node.
And, among the step S2-5, upstream bandwidth difference Δ B=|B by formula between node
P1-B
P2| calculate, wherein B
P1Be the upstream bandwidth of session node, B
P2Be the upstream bandwidth of father's node, bandwidth difference threshold value B
ThresholdB by formula
Threshold=γ B
pCalculate 0＜γ＜1 wherein, B
pBe the upstream bandwidth of session node, line duration difference Δ T=|T by formula between node
P2-T
P1| calculate, wherein T
P1Be the line duration of session node, T
P2Be the line duration of father's node, line duration difference limen value T
ThresholdT by formula
Threshold=θ T
pCalculate 0＜θ＜1 wherein, T
pIt is the line duration of session node.
And child nodes is replaced probability by formula among the step S2-6-3
Calculate, wherein, CF
iBe the child nodes number of this child nodes i current service, PF
iBe the current father's node number of this child nodes i, μ, v are two non-negative constants.
The present invention has the following advantages and good effect:
1) the inventive method makes full use of link delay information between upstream bandwidth and the node of topology information and node of node; Provide and postpone cost and all lower topological structure method of flow cost; When reducing P2P stream media system distribution delay; Effectively reduce the flow between the cross operator, reduced the operating cost of operator.
2) employing is progressively adjusted to the position near video source according to the adaptive session dot position adjusting method of link delay between node upstream bandwidth and node with high bandwidth, stable node, has promoted the stability of system, has quickened the diffusion velocity of stream distribution.
Description of drawings
Fig. 1 is an embodiment of the invention topological structure process practical implementation sketch map.
Fig. 2 is an embodiment of the invention nerve of a covering topological structure schematic flow sheet;
Fig. 3 is an embodiment of the invention topology self adaptation adjustment schematic flow sheet;
Fig. 4 is that embodiment of the invention neighbor node upgrades schematic flow sheet.
Embodiment
Specify embodiment of the present invention below in conjunction with accompanying drawing and embodiment.
According to existing P2P stream media technology; A typical P2P stream media system comprises the index server that fixed ip address is arranged that several are known; For the subscriber's main station of initial adding system provides other online user's list information and streaming media server IP address information; In order to periodically to receive the heartbeat message that subscriber's main station sends, safeguard overall User simultaneously.The plurality of video source server is used for the burst distribution of video content.Watch the user of certain video file, the user transmits the video content that receives and gives other user watching video as when being served object.Generally all video source servers regard as one virtual, be equivalent to make up the form of a video source server cluster exactly, externally show as one on time.Fig. 1 is a specific embodiment according to the inventive method; The video source server is designated as S; Index server is designated as T, and A, B, C, D node are the active node that exists in the system among the figure, and new node E obtains node listing through connecting index server T; And, obtain data through setting up and being connected of active node.Be that node A, B, C, D, E are the user terminals of participating in the stream distribution session.Among the figure with the Data Identification video source server S in the square frame to the delay of node, for example to S as 0, be 10, be 31, be 40 to node D to node C to Node B.Express to cover on the arrow of link, with (wherein a representes to postpone between link for a, b) this link information of mark, and b representes autonomous system jumping figure between link, for example postpones to be 16 between the expression of (16,2) between node A and C link, the autonomous system jumping figure is 2 between link.
At first carry out the nerve of a covering topological structure, the step S1 that adopts during realization comprises following substep:
S1-1, requesting node send the registration message message with adding P2P stream media network to index server,
The registration message message that each requesting node sends comprises the node IP address of this requesting node, play position, node upstream bandwidth and the node downlink bandwidth of node request.As shown in fig. 1, among the embodiment, requesting node E is (1) to the registration message message identification that index server T sends.
After S1-2, index server are received the registration message message of certain requesting node; Play position according to the node request; Provide requesting node information to be kept in the global node tabulation this registration message message; And the alternative node of selecting online N play position and requesting node to be close to, the composition alternative node list number sends to requesting node together with the autonomous system of requesting node.As shown in fig. 1, among the embodiment, index server T is designated (2) to the alternative node list that requesting node E sends.During practical implementation, N can get suitable value according to experiment.
Information comprises between autonomous system number, this alternative node and the requesting node under the node IP address, node of each alternative node autonomous system jumping figure, node upstream bandwidth, node line duration and the current play position of node in the alternative node list.Specifying information can obtain through prior art; For the purpose of convenient enforcement; The invention provides further scheme: autonomous system jumping figure between said alternative node and the requesting node is to obtain through searching inner global I P-AS mapping table and the autonomic system the Internet map of preserving of index server; The node that described request node play position is contiguous, through formula | C
1-C
2|＜M calculates, wherein C
1Be the current play position of node online in the index server, C
2Be the play position of requesting node request, M is non-negative constant, can get suitable value according to experiment; The information source of said alternative node list is, the node in the P2P stream media network periodically sends oneself state information to index server with the mode of " heartbeat message ", and this state information comprises the current play position of node.Node line duration is pressed △ t=t
Active-t
SinceCalculate, wherein, t
ActiveThe moment that the expression index server is received the last heartbeat message of this node, t
SineeRepresent that this node adds the P2P stream media network sends the moment from the registration message message to index server.
After S1-3, requesting node were received the alternative node list of index server transmission, N the alternative node of selecting to index server sent the connection probe messages respectively;
Connect probe messages and comprise requesting node IP address.As shown in fig. 1, among the embodiment, requesting node E is designated (3) to the connection probe messages that alternative Node B, C, D send.
S1-4, alternative node if currently have an available upstream bandwidth, then send the connection response message and give requesting node after receiving the connection probe messages that requesting node sends; Otherwise abandon the connection probe messages;
The connection response message comprises link delay and the current play position of node between node current residual upstream bandwidth, node IP address/node and the video source server of this alternative node.As shown in fig. 1, among the embodiment, alternative Node B, C, D are (4) to the connection response message identification that requesting node E sends.
For the purpose of convenient enforcement; The link delay that the invention provides between node IP address/node and the video source server is specifically asked for scheme: the delay between said node and the video source server equals the video source server and in all paths of this node, postpones maximum, by formula
Recursive calculation, wherein,
RTT is the round-trip delay from node i to node j link, D
i(s) be delay from video source server s to node i; Said node i is to the round-trip delay of node j link, is RTT=T by formula
Recv-T
SendCalculate, wherein T
SendThe expression node i is sent the moment that connects the probe requests thereby message, T to node j
RecvThe moment that the expression node i is received the connection response message that node j sends.Recurrence formula D
j(s), the expression video source is to the delay of node j, equals video source and adds that to the delay of node i node j arrives the delay of node i.
If S1-5 is in the time-out time of setting; Requesting node is received the connection response message of sending more than or equal to Kp alternative node; Requesting node is according to the cost of link between connection response message computing node; Therefrom select of satisfying rate requirement or more than alternative node set up father and son's annexation, accomplish the adition process of requesting node; If in the time-out time of setting, requesting node is received the connection response message that h alternative node sent, and h is less than Kp, then execution in step S1-6; Said Kp is the degree of the requesting node preset;
And; When not receiving the connection response message that certain alternative node is sent in the alternative node list in the time-out time that requesting node is being set; Then this alternative node of not doing response is deleted from alternative node list, and the intranodal that node IP address that will this alternative node deposits requesting node in is treated the deletion of node tabulation.
As shown in Figure 2; The judgement flow process of this step can be designed as to be judged the alternative node in the alternative node list one by one; For the alternative node in each alternative node list; Judge whether this alternative node returns the connection response message in the connection time-out time of setting, then from alternative node list, do not delete this node.Judge like this in the alternative node list and to check that whether remaining alternative node number h is less than Kp in the alternative node list behind all alternative nodes.If h is more than or equal to Kp, then from the remaining alternative node of alternative node list, select of satisfying rate requirement or more than alternative node set up father and son's annexation, accomplish the adition process of requesting node.If h is less than Kp, execution in step S1-6 then sends to index server and to obtain line node list request message, and index server sends Kp-h new alternative node and gives requesting node, up to h more than or equal to Kp.
For the purpose of convenient enforcement, the invention provides the concrete implementation that requesting node adds smoothly:
At first, among the step S1-5, requesting node by formula
The cost of link between computing node, wherein r is a flow rate, R
i(j) be the upstream bandwidth of alternative node j current residual, α is non-negative constant, and 0≤α≤1, D
i(j) be the delay cost of alternative node j, C to requesting node i link
i(j) be the flow cost of alternative node j, by formula to requesting node i link
Calculate, wherein H
i(j) be alternative node j to requesting node i bottom physical pathway the autonomous system number of process.Work as ASN
i=ASN
j, the autonomous system of promptly alternative node j and requesting node i is number identical, and just alternative node j and requesting node i are positioned at same autonomous system when inner, H
i(j) be 1.Otherwise ASN
i≠ ASN
j, it is inner that just alternative node j and requesting node i are not positioned at same autonomous system, H
i(j) for alternative node j adds 1 to the autonomous system number of requesting node i process, ρ and σ are non-negative constants, can get suitable value according to experiment.
Then; Requesting node sorts according to link cost to the alternative node that returns response message from big to small; And adopt greedy method (prior art), and m alternative node before selecting successively, the residue upstream bandwidth sum that satisfies m node equals flow rate r; Here m can get suitable value less than the degree Kp of requesting node according to experiment during practical implementation; The degree of requesting node by formula
Calculate, wherein B
pBe the upstream bandwidth of requesting node, r is a flow rate, and δ is non-negative constant (embodiment gets δ after experiment is 10).
At last, requesting node is set up set membership with the big node of the link cost of selecting successively, comprises that requesting node sends the bandwidth occupancy request message to father's node, and the bandwidth occupancy request message comprises requesting node IP address and the upstream bandwidth that need take; After father's node receives the bandwidth occupancy request message of requesting node, begin to send data, accomplish the adition process of requesting node to requesting node.
S1-6, requesting node send to index server and obtain line node list request message, and this obtains the current play position that node IP address, intranodal that line node list request message comprises this requesting node are treated deletion of node tabulation and node.
S1-7, index server receive that requesting node sends obtain line node list request message after, select again with contiguous being different from of requesting node play position and treat that (Kp-h) the individual new alternative node in the deletion of node tabulation sends to requesting node.
S1-8, requesting node send to (Kp-h) individual new alternative node and connect probe messages, continue to begin to carry out from step S1-4; When execution in step S1-5, in the time-out time of setting, requesting node is received the connection response message of sending more than or equal to Kp alternative node.
The nerve of a covering topological structure flow process of embodiment is referring to Fig. 2; When user E watches certain video; User E at first adds to index server Server (T) application as requesting node, obtains online and contiguous with this user's current request play position nodal information (comprising Node B, C and D).Index server T deposits this user profile in online user's tabulation according to the play position of user's request simultaneously.Online user's tabulation comprises following field:
Simultaneously, index server returns to requesting node E and is not more than N current online and play position and the contiguous user profile of this requesting node.Among the embodiment, the difference between line node play position C1 and the requesting node play position C2 | C1-C2|＜180sec, N gets 20.Like Fig. 1, embodiment provides the alternative node list content to comprise
B(XX，35，3，50kbps，30min，00:02:30)
C(XX，42，2，100kbps，20min，00:02:00)
D(XX，27，1，150kbps，18min，00:01:45)
B (XX, 35,3 for example; 50kbps; 30min, 00:02:30), the node IP address of alternative Node B is expressed as XX; Autonomous system under the Node B number is 35, the autonomous system jumping figure is 3 between this alternative Node B and the requesting node E,, the upstream bandwidth of Node B be 50kbps, Node B line duration be that the current play position of 30min, Node B is 00:02:30.
Requesting node is according to the contained information of returning of alternative node list, and the alternative node of all in tabulation sends and connects probe messages, and it is 600ms that embodiment sets time-out time.If in the overtime time, requesting node is received the connection response message of h alternative node, h＞k here
p, then according to formula
Wherein
The cost function of link between calculating and the alternative node.Here, r gets 300kbps, and α gets 0.8, and ρ gets 1, and σ gets 10.And according to the cost value that obtains from big to small to the alternative node { p that sorts
1, p
2, p
3..., p
L, u alternative node satisfies R as the data provider before selecting successively
i(p
1)+R
i(p
2)+...+R
i(p
u)=r.Requesting node sends the bandwidth occupancy request message to this u node.Agree that receiving this requesting node is child nodes if receive the node of bandwidth occupancy request message, then send accept and receive message, otherwise, disregard.In the real process, might there be enough resources by father's node.Can, the accept of father's node comprise the bandwidth that this father's node can provide for requesting node in receiving message; Receive that by the requesting node basis all accept receive message; That confirms to obtain always provides flow rate, if flow rate, then continues h-u+1 place node transmission bandwidth occupancy request message in the alternative node list of ordering less than r; Till wait-for-response, this process last till that always total flow rate that this requesting node obtains is r.Accomplish the node selection course of requesting node.
Behind the constructing network topology, the present invention has also realized dynamic adjustment, and the step S2 that adopts when the adjustment of neighbor node dynamic self-adapting realizes comprises following substep,
S2-1, the session node that has added the P2P stream media network and participated in P2P Streaming Media distribution are periodically sent probe message messages to its all father's nodes, and the upstream bandwidth, session node that the probe message message comprises life span TTL, the session node of this probe message message be the IP address of line duration and session node.
After Father's Day of S2-2, session node, point was received the probe message message, carry out TTL and subtract 1 operation, if operation back TTL equals 0, execution in step S2-3 then, otherwise, execution in step S2-4.
Father's node of S2-3, session node is self upstream bandwidth and session node upstream bandwidth size relatively, and self line duration and session node line duration is big or small;
If the session node upstream bandwidth then abandons the probe message message greater than the upstream bandwidth of father's node and session node line duration greater than the line duration of father's node, and sends the grant message packet and give session node;
If the session node upstream bandwidth greater than the upstream bandwidth of father's node but session node line duration less than the line duration of father's node, then execution in step S2-5;
Otherwise (for example session node bandwidth upstream bandwidth is less than father's node upstream bandwidth) abandons the probe message message, no longer processes;
Said grant message packet comprises the IP address of father's node, the IP address of all father's nodes of father's node self, and the line duration of father's node;
The line duration of father's node and session node is pressed △ t=t equally
Active-t
SinceCalculate, wherein, t
ActiveThe moment that the expression index server is received the last heartbeat message of this node, t
SinceRepresent that this node adds the P2P stream media network sends the moment from the registration message message to index server.
Father's node of S2-4, session node continues to transmit this probe message message, circulation execution in step S2-2 to all father's nodes of this father's node self.That is to say that father's node of session node in the epicycle is regarded the session node of next round as, continue to carry out.
The difference of the upstream bandwidth of S2-5, computing session node upstream bandwidth and father's node and session node be the difference of the line duration of line duration and father's node, if the difference of upstream bandwidth is greater than bandwidth difference threshold value B
ThresholdAnd the difference of line duration is less than line duration difference limen value T
Threshold, then send the grant message packet and give session node; Otherwise, abandon the probe message message.
The present invention suggestion, upstream bandwidth difference Δ B=|B by formula between node
P1-B
P2| calculate, wherein B
P1Be the upstream bandwidth of session node, B
P2Be the upstream bandwidth of father's node, bandwidth difference threshold value B
ThresholdB by formula
Threshold=γ B
pCalculate, wherein suitable value, B can be got according to experiment in 0＜γ＜1
pBe the upstream bandwidth of session node, line duration difference Δ T=|T by formula between node
P2-T
P1| calculate, wherein T
P1Be the line duration of session node, T
P2Be the line duration of father's node, line duration difference limen value T
ThresholdT by formula
Shreshold=θ T
pCalculate, wherein suitable value, T can be got according to experiment in 0＜θ＜1
pIt is the line duration of session node.
S2-6, in predefined time-out time, session node is sent the node of grant message packet from all, finds to postpone the renewal that minimum node is carried out neighbor node from the video source server to this session node.
The neighbor node of embodiment is dynamically adjusted flow process referring to Fig. 3.Node (being called requesting node) is periodically adjusted upper reaches father's node.Here adjustment cycle is made as 10s.Requesting node sends probe message to its upper reaches father's node, and TTL is set to 2 here.After the Father's Day of requesting node, point was received probe message; Carry out TTL and subtract 1 operation; If TTL equals 0; Then relatively self upstream bandwidth is big or small with the requesting node upstream bandwidth, if the requesting node upstream bandwidth greater than the upstream bandwidth of father's node and requesting node line duration greater than father's node, perhaps the requesting node upstream bandwidth greater than the upstream bandwidth of father's node and requesting node upstream bandwidth greater than the difference of the upstream bandwidth of father's node greater than bandwidth difference threshold value B
Threshold, simultaneously requesting node line duration less than father's node line duration, between node the line duration difference less than threshold value T
Threshold, then abandon the probe message message, and send the grant message packet and give requesting node; Otherwise abandon the probe message message, no longer process;
Upstream bandwidth difference Δ B=|B by formula between the embodiment node
P1-B
P2| during calculating, bandwidth difference threshold value B
ThresholdB by formula
Threshold=γ B
pCalculate, γ gets 0.5 here.Line duration difference Δ T=|T by formula between node
P2-T
P1| calculate, line duration difference limen value T
ThresholdT by formula
Threshold=θ T
pCalculate, θ gets 1//3.
In the renewal of neighbor node described in the S2-6, comprise following substep when specifically realizing,
S2-6-1, session node are sent session node to said all father's nodes that postpone minimum node and are connected probe messages.Sending the node of grant message packet, possibly be father's node of session node, also possibly be father's node of father's node, even higher level's node more.The father's node that postpones minimum node from the video source server to this session node can be regarded as the ancestor node of session node, and subsequent step directly is called father's node for simplicity.
S2-6-2, receive session node when connecting probe messages when said certain father's node that postpones minimum node; If the residue upstream bandwidth is arranged; Then return the connection response message; This session node connection response message comprises the node IP address of father's node, and to accept this session node be child nodes; Otherwise, execution in step S2-6-3.
S2-6-3, receive father's node that session node connects probe messages; Compare self all child nodes upstream bandwidths and this session node upstream bandwidth size; From bandwidth all child nodes, select a node that is replaced probability less than certain preset determined value less than this session node; Be called selected child nodes, execution in step S2-6-4.During practical implementation, the order of all child node stores is at random, can select first probability to be replaced less than the node of certain determined value according to the order of all child node stores.
S2-6-4, said father's node send service disruption message to said selected child nodes, send the connection response message to the described request node, set up being connected between father's node and this session node.
S2-6-5, said selected child nodes receive service disruption message; If also there is other father's node in this child nodes; Then continue to carry out the adjustment of neighbor node dynamic self-adapting according to step S2; If this child nodes does not have other father's node to exist, then return and continue execution in step S1 as requesting node, send the registration message message to index server again.
The present invention's suggestion: child nodes is replaced probability by formula among the step S2-6-3
Calculate, wherein, CF
iBe the child nodes number of this child nodes i current service, PF
iBe the current father's node number of this child nodes i, μ, v are two non-negative constants, can get suitable value according to experiment.
The neighbor node of embodiment more new technological process referring to Fig. 4.Requesting node is received the grant message that a plurality of nodes send, and therefrom selects from the source to this node to postpone all father's nodes transmission connection probe messages of minimum node.Receive father's node of requesting node connection probe messages, if the residue upstream bandwidth is arranged, then return the connection response message, accepting this node is child nodes; Otherwise relatively all child nodes upstream bandwidths and this requesting node upstream bandwidth are big or small; From bandwidth all child nodes, select less than this requesting node probability
less than the node of certain determined value (among Fig. 4 through judging that Rand ()＜P (i) finds P (i) first child nodes less than Rand (); Rand () is illustrated in [0; 1] gets random number between; This formula whether represent to try to achieve between the random number of probability and acquisition of P (i) less than relation); Send the service disruption message packet, send the connection response message to the described request node, set up with this requesting node between be connected.Here, μ gets 1, and v gets 2.Receive the child nodes of service disruption message,, then periodically adjust neighbor node according to Fig. 3 if also there is other father's node.If this child nodes does not have other father's node to exist, then send the registration message message to index server again.
Claims (7)
1. P2P Streaming Media nerve of a covering topological structure method of adjustment based on cost optimization; Include index server and video source server in the P2P stream media network; It is characterized in that: realize the nerve of a covering topological structure based on cost optimization, the adjustment of neighbor node dynamic self-adapting is provided behind the structure
Said nerve of a covering topological structure, the step S1 that adopts during realization comprises following substep,
S1-1, requesting node send the registration message message with adding P2P stream media network to index server,
The registration message message that each requesting node sends comprises the node IP address of this requesting node, play position, node upstream bandwidth and the node downlink bandwidth of node request;
After S1-2, index server are received the registration message message of certain requesting node; Play position according to the node request; Provide requesting node information to be kept in the global node tabulation this registration message message; And the alternative node of selecting online N play position and requesting node to be close to, the composition alternative node list number sends to requesting node together with the autonomous system of requesting node, and N gets suitable value according to experiment;
Information comprises between autonomous system number, this alternative node and the requesting node under the node IP address, node of each alternative node autonomous system jumping figure, node upstream bandwidth, node line duration and the current play position of node in the alternative node list;
S1-3, requesting node send the connection probe messages respectively to N alternative node;
Connect probe messages and comprise requesting node IP address;
S1-4, alternative node if currently have an available upstream bandwidth, then send the connection response message and give requesting node after receiving the connection probe messages that requesting node sends; Otherwise abandon the connection probe messages;
The connection response message comprises link delay and the current play position of node between node current residual upstream bandwidth, node IP address, node and the video source server of this alternative node;
If S1-5 is in the time-out time of setting; Requesting node is received the connection response message of sending more than or equal to Kp alternative node; Requesting node is according to the cost of link between connection response message computing node; Therefrom select of satisfying rate requirement or more than alternative node set up father and son's annexation, accomplish the adition process of requesting node; If in the time-out time of setting, requesting node is received the connection response message that h alternative node sent, and h is less than Kp, then execution in step S1-6; Said Kp is the degree of the requesting node preset, and according to formula
Calculate, wherein B
pBe the upstream bandwidth of requesting node, r is a flow rate, and δ is non-negative constant;
And; When not receiving the connection response message that certain alternative node is sent in the alternative node list in the time-out time that requesting node is being set; Then this alternative node of not doing response is deleted from alternative node list, and the intranodal that node IP address that will this alternative node deposits requesting node in is treated the deletion of node tabulation;
S1-6, requesting node send to index server and obtain line node list request message, and this obtains the current play position that node IP address, intranodal that line node list request message comprises this requesting node are treated deletion of node tabulation and node;
S1-7, index server receive that requesting node sends obtain line node list request message after, select again with contiguous being different from of requesting node play position and treat that (Kp-h) the individual new alternative node in the deletion of node tabulation sends to requesting node;
S1-8, requesting node send to (Kp-h) individual new alternative node and connect probe messages, continue to begin to carry out from step S1-4; When execution in step S1-5, in the time-out time of setting, requesting node is received the connection response message of sending more than or equal to Kp alternative node;
Said neighbor node dynamic self-adapting method of adjustment, the step S2 that adopts during realization comprises following substep,
S2-1, the session node that has added the P2P stream media network and participated in P2P Streaming Media distribution are periodically sent probe message messages to its all father's nodes, and the upstream bandwidth, session node that the probe message message comprises life span TTL, the session node of this probe message message be the IP address of line duration and session node;
After Father's Day of S2-2, session node, point was received the probe message message, carry out TTL and subtract 1 operation, if operation back TTL equals 0, execution in step S2-3 then, otherwise, execution in step S2-4;
Father's node of S2-3, session node is self upstream bandwidth and session node upstream bandwidth size relatively, and self line duration and session node line duration is big or small;
If the session node upstream bandwidth then abandons the probe message message greater than the upstream bandwidth of father's node and session node line duration greater than the line duration of father's node, and sends the grant message packet and give session node;
If the session node upstream bandwidth greater than the upstream bandwidth of father's node but session node line duration less than the line duration of father's node, then execution in step S2-5;
Otherwise, abandon the probe message message, no longer process;
Said grant message packet comprises the IP address of father's node, the IP address of all father's nodes of father's node self, and the line duration of father's node;
Father's node of S2-4, session node continues to transmit this probe message message, circulation execution in step S2-2 to all father's nodes of this father's node self;
The difference of the upstream bandwidth of S2-5, computing session node upstream bandwidth and father's node and session node be the difference of the line duration of line duration and father's node, if the difference of upstream bandwidth is greater than bandwidth difference threshold value B
ThresholdAnd the difference of line duration is less than line duration difference limen value T
Threshold, then send the grant message packet and give session node; Otherwise, abandon the probe message message;
S2-6, in predefined time-out time, session node is sent the node of grant message packet from all, finds to postpone the renewal that minimum node is carried out neighbor node from the video source server to this session node; The renewal of said neighbor node comprises following substep during realization,
S2-6-1, session node are sent session node to said all father's nodes that postpone minimum node and are connected probe messages;
S2-6-2, receive father's node that session node connects probe messages, if the residue upstream bandwidth is arranged, then return the connection response message, this session node connection response message comprises the node IP address of father's node, and to accept this session node be child nodes; Otherwise, execution in step S2-6-3;
S2-6-3, receive father's node that session node connects probe messages; Compare self all child nodes upstream bandwidths and this session node upstream bandwidth size; From bandwidth all child nodes, select a node that is replaced probability less than certain preset determined value less than this session node; Be called selected child nodes, execution in step S2-6-4;
S2-6-4, said father's node send service disruption message to said selected child nodes, send the connection response message to the described request node, set up being connected between father's node and this session node;
S2-6-5, said selected child nodes receive service disruption message; If also there is other father's node in this child nodes; Then continue to carry out the adjustment of neighbor node dynamic self-adapting according to step S2; If this child nodes does not have other father's node to exist, then return and continue execution in step S1 as requesting node, send the registration message message to index server again.
2. P2P Streaming Media nerve of a covering topological structure method of adjustment according to claim 1 is characterized in that: among the step S1-2,
Autonomous system jumping figure between said alternative node and the requesting node is to obtain through searching inner global I P-AS mapping table and the autonomic system the Internet map of preserving of index server;
The node that described request node play position is contiguous, through formula | C
1-C
2|<m calculates, wherein C
1Be the current play position of node online in the index server, C
2Be the play position of requesting node request, M is non-negative constant;
The information source of said alternative node list is, the node in the P2P stream media network periodically sends oneself state information to index server with the mode of " heartbeat message ", and this state information comprises the current play position of node.
3. P2P Streaming Media nerve of a covering topological structure method of adjustment according to claim 1 is characterized in that: node described in the step S1-2 node described in line duration and the step S2-3 line duration press Δ t=t
Active-t
SinceCalculate, wherein, t
ActiveThe moment that the expression index server is received the last heartbeat message of this node, t
SinceRepresent that this node adds the P2P stream media network sends the moment from the registration message message to index server.
4. P2P Streaming Media nerve of a covering topological structure method of adjustment according to claim 1; It is characterized in that: the link delay between node described in the step S1-4 and the video source server equals the video source server and in all paths of this node, postpones maximum, by formula
Recursive calculation, wherein,
RTT is the round-trip delay from node i to node j link, D
i(s) be delay from video source server s to node i;
Said node i is to the round-trip delay of node j link, is RTT=T by formula
Recv-T
SendCalculate, wherein T
SendThe expression node i is sent the moment that connects the probe requests thereby message, T to node j
RecvThe moment that the expression node i is received the connection response message that node j sends.
5. P2P Streaming Media nerve of a covering topological structure method of adjustment according to claim 1, it is characterized in that: among the step S1-5, requesting node by formula
The cost of link between computing node, wherein r is a flow rate, R
i(j) be the upstream bandwidth of alternative node j current residual, α is non-negative constant, and 0≤α≤1, D
i(j) be the delay cost of alternative node j, C to requesting node i link
i(j) be the flow cost of alternative node j, by formula to requesting node i link
Calculate, wherein H
i(j) be alternative node j to requesting node i bottom physical pathway the autonomous system number of process; Work as ASN
i=ASN
j, the H when autonomous system of promptly alternative node j and requesting node i is number identical
i(j) be 1, otherwise H
i(j) for alternative node j adds 1 to the autonomous system number of requesting node i process, ρ and σ are non-negative constants;
Requesting node sorts according to link cost to the alternative node that returns response message from big to small among the step S1-5; And employing greedy method; M alternative node before selecting successively, the residue upstream bandwidth sum that satisfies this m alternative node equals flow rate r, and m is less than the degree Kp of requesting node here;
Requesting node is set up set membership with the big node of the link cost of selecting successively, comprises that requesting node sends the bandwidth occupancy request message to father's node, and the bandwidth occupancy request message comprises requesting node IP address and the upstream bandwidth that need take; After father's node receives the bandwidth occupancy request message of requesting node, begin to send data, accomplish the adition process of requesting node to requesting node.
6. P2P Streaming Media nerve of a covering topological structure method of adjustment according to claim 1 is characterized in that: among the step S2-5, and upstream bandwidth difference Δ B=|B by formula between node
P1-B
P2| calculate, wherein B
P1Be the upstream bandwidth of session node, B
P2Be the upstream bandwidth of father's node, bandwidth difference threshold value B
ThresholdB by formula
Threshold=γ B
pCalculate wherein 0<γ<1, B
pBe the upstream bandwidth of session node, line duration difference Δ T=|T by formula between node
P2-T
P1| calculate, wherein T
P1Be the line duration of session node, T
P2Be the line duration of father's node, line duration difference limen value T
ThresholdT by formula
Threshold=θ T
pCalculate wherein 0<θ<1, T
pIt is the line duration of session node.
7. P2P Streaming Media nerve of a covering topological structure method of adjustment according to claim 1, it is characterized in that: child nodes is replaced probability by formula among the step S2-6-3
Calculate, wherein, CF
iBe the child nodes number of this child nodes i current service, PF
iBe the current father's node number of this child nodes i, μ, ν are two non-negative constants.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2010105524645A CN101997922B (en) | 2010-11-19 | 2010-11-19 | Cost optimization-based P2P streaming media coverage network topology structure adjustment method |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2010105524645A CN101997922B (en) | 2010-11-19 | 2010-11-19 | Cost optimization-based P2P streaming media coverage network topology structure adjustment method |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN101997922A CN101997922A (en) | 2011-03-30 |
| CN101997922B true CN101997922B (en) | 2012-11-21 |
Family
ID=43787492
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN2010105524645A Expired - Fee Related CN101997922B (en) | 2010-11-19 | 2010-11-19 | Cost optimization-based P2P streaming media coverage network topology structure adjustment method |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN101997922B (en) |
Families Citing this family (14)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102255811B (en) | 2011-07-14 | 2014-03-12 | 华为技术有限公司 | Method, device and system for obtaining costs between nodes |
| CN102547395B (en) * | 2011-12-31 | 2014-02-26 | 上海聚力传媒技术有限公司 | Method and device for determining video data source of network player |
| WO2014101147A1 (en) * | 2012-12-28 | 2014-07-03 | 华为技术有限公司 | Bandwidth parameter adjustment method, gateway and enforcement functional entity |
| CN103236978B (en) * | 2013-04-17 | 2016-03-23 | 清华大学 | The determination method and apparatus of AS topology top layer autonomous system node |
| CN103581329B (en) * | 2013-11-14 | 2016-08-17 | 中国科学院大学 | The construction method of peer-to-peer network flow medium live system topological structure based on sub-clustering |
| CN105430028B (en) * | 2014-09-09 | 2019-03-29 | 阿里巴巴集团控股有限公司 | Service calling method, providing method and node |
| CN108874820B (en) * | 2017-05-11 | 2021-11-30 | 广东爱瓦力科技股份有限公司 | System file searching method |
| CN107733802B (en) * | 2017-09-18 | 2020-11-13 | 深圳市盛路物联通讯技术有限公司 | Node control method and system of distributed network topology structure |
| CN109348243B (en) * | 2018-11-14 | 2021-01-22 | 广州虎牙信息科技有限公司 | Subscription processing method and device, live broadcast system, storage medium and computer equipment |
| CN110278455A (en) * | 2019-06-18 | 2019-09-24 | 洛阳师范学院 | The intensive request processing method of video system disseminated based on requirement forecasting and resource |
| CN111010709B (en) * | 2019-12-10 | 2023-03-10 | 上海智格网通信科技有限公司 | Method for optimizing overhead time of wireless ad hoc networking protocol |
| CN111866078B (en) * | 2020-06-19 | 2023-04-18 | 上海墨珩网络科技有限公司 | Networking method and system for dynamic heterogeneous P2P network |
| CN114567638B (en) * | 2022-02-14 | 2023-09-01 | 珠海迈科智能科技股份有限公司 | Method for dynamically adjusting sharing strategy according to actual network of node |
| CN115550973B (en) * | 2022-11-30 | 2023-04-11 | 嘉兴域途科技有限公司 | 4G/5G multi-terminal video communication network topology structure determination method and device |
Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101355591A (en) * | 2008-09-12 | 2009-01-28 | 中兴通讯股份有限公司 | P2P network and scheduling method thereof |
| CN101483604A (en) * | 2009-02-16 | 2009-07-15 | 华为技术有限公司 | Method, apparatus and system for resource list sending |
-
2010
- 2010-11-19 CN CN2010105524645A patent/CN101997922B/en not_active Expired - Fee Related
Patent Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101355591A (en) * | 2008-09-12 | 2009-01-28 | 中兴通讯股份有限公司 | P2P network and scheduling method thereof |
| CN101483604A (en) * | 2009-02-16 | 2009-07-15 | 华为技术有限公司 | Method, apparatus and system for resource list sending |
Non-Patent Citations (7)
| Title |
|---|
| 0n Reducing Mesh Delay for Peer-to-PeerLive Streaming;Dongni Ren,ET AL;《INFOCOM 2008. The 27th Conference on Computer Communications. IEEE 》;20080418;P1058-1066 * |
| Dongni Ren,ET AL.0n Reducing Mesh Delay for Peer-to-PeerLive Streaming.《INFOCOM 2008. The 27th Conference on Computer Communications. IEEE 》.2008,P1058-1066. |
| Magharei, N.et al.Mesh or Multiple-Tree: A Comparative Study of Live P2P Streaming Approaches.《INFOCOM 2007. 26th IEEE International Conference on Computer Communications. IEEE 》.2007,P1424-1432. |
| Mesh or Multiple-Tree: A Comparative Study of Live P2P Streaming Approaches;Magharei, N.et al;《INFOCOM 2007. 26th IEEE International Conference on Computer Communications. IEEE 》;20070512;P1424-1432 * |
| Outreach: peer-to-peer topology construction towards minimized server bandwidth costs;Small, T.ET AL;《Selected Areas in Communications, IEEE Journal on》;20070115;第25卷(第1期);P35-45 * |
| Small, T.ET AL.Outreach: peer-to-peer topology construction towards minimized server bandwidth costs.《Selected Areas in Communications, IEEE Journal on》.2007,第25卷(第1期),P35-45. |
| Yongqiong Zhu，et al.Adaptive routing for P2P networks using reinforcement learning.《Computer Science and Information Technology (ICCSIT), 2010 3rd IEEE International Conference on》.2010,第7卷P37-41. * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN101997922A (en) | 2011-03-30 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN101997922B (en) | Cost optimization-based P2P streaming media coverage network topology structure adjustment method | |
| Wu et al. | Social attribute aware incentive mechanism for device-to-device video distribution | |
| Miller et al. | A control-theoretic approach to adaptive video streaming in dense wireless networks | |
| CN101640699A (en) | P2P streaming media system and streaming media downloading method thereof | |
| CN105340234A (en) | Adaptive resource management for multi-screen video applications over cable wi-fi networks | |
| Wu et al. | vSkyConf: Cloud-assisted multi-party mobile video conferencing | |
| Tsompanidis et al. | Mobile network traffic: A user behaviour model | |
| Su et al. | Incentive mechanisms in p2p media streaming systems | |
| CN102572721B (en) | Mobility management method, system and equipment for group terminals | |
| Kryftis et al. | Resource usage prediction algorithms for optimal selection of multimedia content delivery methods | |
| CN106134130A (en) | The system and method estimated for the dynamic effective speed of real-time video flow | |
| CN106385641A (en) | SDN-based live broadcast video streaming media distribution method | |
| Zhong et al. | Joint optimal multicast scheduling and caching for improved performance and energy saving in wireless heterogeneous networks | |
| Zhang et al. | Graph theory-based QoE-driven cooperation stimulation for content dissemination in device-to-device communication | |
| CN103916328B (en) | flow control method and system for content distribution network and peer-to-peer network | |
| Wainer et al. | Improving video streaming over cellular networks with DASH-based device-to-device streaming | |
| CN109951723A (en) | The method of adjustment of root node, device and storage medium in peer-to-peer network live broadcast system | |
| CN103780693B (en) | The best copy server selection method and system of a kind of utilization User collaborative sensing | |
| Ren et al. | Joint social, energy and transfer rate to select cluster heads in D2D multicast communication | |
| El Marai et al. | Online server-side optimization approach for improving QoE of DASH clients | |
| Xiao et al. | User preference aware resource management for wireless communication networks | |
| Xing et al. | Collaborative content distribution in 5G mobile networks with edge caching | |
| CN107800567B (en) | Method for establishing P2P streaming media network topology model of mixed mode | |
| Bracciale et al. | A push-based scheduling algorithm for large scale P2P live streaming | |
| Wang et al. | Qos-Awareness variable neighbor selection for mesh-based P2P live streaming 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 | ||
| 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: 20121121 Termination date: 20141119 |
|
| EXPY | Termination of patent right or utility model |