CN100440866C - Segment transmit dispatch in data-driven overlay network - Google Patents
Segment transmit dispatch in data-driven overlay network Download PDFInfo
- Publication number
- CN100440866C CN100440866C CNB2005100866838A CN200510086683A CN100440866C CN 100440866 C CN100440866 C CN 100440866C CN B2005100866838 A CNB2005100866838 A CN B2005100866838A CN 200510086683 A CN200510086683 A CN 200510086683A CN 100440866 C CN100440866 C CN 100440866C
- Authority
- CN
- China
- Prior art keywords
- segmentation
- request
- node
- priority
- sequence number
- 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
- 230000011218 segmentation Effects 0.000 claims abstract description 107
- 238000000034 method Methods 0.000 claims description 35
- 230000005540 biological transmission Effects 0.000 claims description 10
- 238000013461 design Methods 0.000 abstract description 2
- 238000010586 diagram Methods 0.000 description 3
- 238000002474 experimental method Methods 0.000 description 2
- 230000006978 adaptation Effects 0.000 description 1
- 239000012141 concentrate Substances 0.000 description 1
- 230000001419 dependent effect Effects 0.000 description 1
- 238000011161 development Methods 0.000 description 1
- 230000018109 developmental process Effects 0.000 description 1
- 230000000694 effects Effects 0.000 description 1
- 239000012634 fragment Substances 0.000 description 1
- 238000011160 research Methods 0.000 description 1
- 238000012546 transfer Methods 0.000 description 1
- 238000011144 upstream manufacturing Methods 0.000 description 1
Images
Landscapes
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The present invention designs the technical field of an overlay network of application layers, which is characterized in that in a data-driven overlay network, after segmentation supply nodes receive segmentation requests transmitted by segmentation request nodes, a priority is distributed to the segmentation requests according to the sequence number of request segmentations; when a user has a higher requirement to a playing fluent degree, a higher priority is endowed for the segmentation requests with higher sequence number of the request segmentations; when the user has a higher requirement to playing delay, the higher priority is endowed for the segmentation requests with lower sequence number of the request segmentations; then, each segmentation request is stored in a request queue; when the segmentation supply node needs to dispatch the segmentations to be transmitted, a request segmentation with the highest priority is selected in the request queue; all transmitting bandwidths are used for transmitting the corresponding segmentations to the corresponding segmentation request nodes. The present invention can effectively enhance user satisfaction degree of playing stream media.
Description
Technical field
Segment transmit dispatch method in the data-driven overlay network belongs to Internet technical field, relates in particular to application layer overlay network technology.
Background technology
Along with the use of the Internet is more and more universal, the especially real-time live Streaming Media of multimedia application is just in development by leaps and bounds.Application with other types is compared, and in real time live Streaming Media needs the higher network bandwidth and stronger node transfer capability.
The IP multicast is a more satisfactory scheme of supporting that real-time live broadcast stream media is used.But the IP multicast has changed " clean culture " principle of traditional the Internet, and a series of problem such as problems such as multicast management, congested control and billing model all are not well solved.So dispose the IP scale of internet scale is a very thing of difficulty.The researcher has turned to application layer multicast subsequently.Application layer multicast is based upon end system to multicast tree, rather than on the router.Application layer multicast has overcome the shortcoming of IP multicast groups difference, and better flexibility can be provided.But the node of application layer has great unsteadiness.The instability of node may cause the continuous variation of overlay network topology.This is for concerning the exigent real-time live broadcast stream media of fluency is used very big negative effect being arranged.
Structureless overlay network can solve the node problem of unstable better, because its data forwarding is no longer dependent on multicast tree.The data-driven overlay network is exactly a kind of in the non-structure overlay network.In the data-driven overlay network, the father/child who does not pre-define, and node such as upstream/downstream relation.Each node is all followed partner node swap data available information, selects best certain data sementation of partner node request then.If a node has been received the segmentation request, just should send to requesting node to corresponding segmentation.Like this, in the data-driven overlay network, be the propagation of the availability directed flow medium of data, and do not rely on certain fixing structure.Therefore the data-driven overlay network can still be supported comparatively smooth stream media broadcast in dynamic network environment.
Media Stream is divided into a lot of segmentations.Each node is chosen a best node and is asked certain segmentation from partner node, this request is sent to segmentation and node is provided and is stored in segmentation and provide in the request queue of node.In order to improve the propagation quality of Streaming Media, research before this generally concentrates on aspects such as member management, availability of data information exchange and segmentation request scheduling.But the different dispatching methods to the request in the request queue may can cause different stream media broadcast quality equally.The present invention proposes to take the preferential segment transmit dispatch method of high sequence number when the user has relatively high expectations to playing fluency; When the user has relatively high expectations to playout-delay, take the low preferential segment transmit dispatch method of sequence number.Improve user satisfaction with this.
Summary of the invention
The objective of the invention is to design data and drive the dispatching method that segmentation sends in the overlay network, to improve the user satisfaction of stream media broadcast in the data-driven overlay network.
Method proposed by the invention is characterised in that: it is that the segmentation request that receives distributes priority that the segmentation in the data-driven overlay network provides node, when the user has relatively high expectations to playing fluency is that higher priority is given in the higher segmentation request of demand staging sequence number, is that higher priority is given in the lower segmentation request of demand staging sequence number when playout-delay is had relatively high expectations.When the scheduling segmentation sent, the method for taking to send successively according to the height of segmentation Request Priority sent to requesting node to corresponding segmentation.The present invention is used in all segmentations and provides on the node, and it comprises following implementation step:
(1) initialization: segmentation provides the node service data to drive the overlay network agreement;
(2) segmentation provides node to receive the segmentation request, and be that it distributes priority, when the user has relatively high expectations to playing fluency is that higher priority is given in the higher segmentation request of demand staging sequence number, is that higher priority is given in the lower segmentation request of demand staging sequence number when the user has relatively high expectations to playout-delay;
In live broadcast stream media was used in real time, Media Stream just began to play after some the most forward segmentations all arrive, if the segmentation request of therefore low sequence number is endowed higher priority, most of node can obtain short playout-delay; If the segmentation request of high sequence number is endowed higher priority, then Media Stream can obtain comparatively smooth broadcast after the segmentation of low sequence number arrives.
(3) segmentation provides node that the segmentation request is stored in the request queue;
(4) when segmentation provides the node scheduling segmentation to send, from request queue, select the highest request of priority, send bandwidth with all and send corresponding segment to the respective request node;
Because each segmentation only is only available (no matter be used for playing or be used for transmitting) after all arriving requesting node, so the segmentation sending method of taking to send successively is with taking the segmentation sending method of proportional bandwidth to compare, can make the higher request of priority when obtaining better services, not damage the lower service that request obtained of priority;
(5) after current segmentation transmission finishes, carry out the segment transmit dispatch of a new round.
We weigh the propagation quality of real-time live broadcast stream media with the notion of user satisfaction.User satisfaction is by the decision of the factor of two aspects: the one, and the streaming media playing fluency, the 2nd, streaming media playing postpones.Streaming media playing fluency on certain node is defined as the ratio of the segmentation sum of the number of fragments that arrived and Streaming Media before the time limit is play in segmentation, represent with Pc; Streaming media playing postpones to be defined as the broadcast moment of all segmentations on this node and the mean value of its broadcast on source node difference constantly, represents with Pd.User satisfaction defines the preference of playing fluency and playout-delay according to the user.If the user only requires the broadcast fluency, then user satisfaction may be defined as U=Pc*100%; If the user only requires playout-delay, then user satisfaction may be defined as U=T/ (T+Pd) * 100%; If the user requires to play fluency and playout-delay on an equal basis, then user satisfaction may be defined as U=Pc*T/ (T+Pd) * 100%
Analysis and experiment show that when the user had relatively high expectations to playing fluency, the preferential priority assignment method of high sequence number can improve user satisfaction; When the user had relatively high expectations to playout-delay, the low preferential priority assignment method of sequence number can improve user satisfaction.
Description of drawings
Fig. 1. segmentation sending method schematic diagram;
Req: segmentation request, b: always send bandwidth
Fig. 2. Request Priority distributes schematic diagram;
Req: segmentation request
Fig. 3. the segment transmit dispatch flow chart.
Embodiment
In the data-driven overlay network, each node is followed other node switching availability of data information, and determines in view of the above from the data of which certain segmentation of partner node request.The segmentation request arrives segmentation and provides in the request queue of node.When segmentation provides the node decision to send segment data,, just need dispatch these requests if a plurality of requests are arranged in the segmentation request queue.Here have two problems to need to consider: the one, under the situation of the priority of the request of distributing, how to send these segmentations; The 2nd, how to be these request distribution priority.
If distributed the priority of request, have two kinds of common methods to send segmentation: the one, send successively according to the height of priority; The 2nd, carry out proportional bandwidth according to priority and distribute, send simultaneously then.The transmission bandwidth of supposing the segmentation sending node is b, then successively sending method and proportional bandwidth sending method more as shown in Figure 1.
We come these two kinds of segmentation sending methods of comparison with an example, and the schematic diagram of this process can be referring to Fig. 3.Suppose that it is q that segmentation provides node, at t=0 constantly, 3 requests are arranged: node a demand staging s in its request queue
a, node b demand staging s
b, node c demand staging s
cThe transmission bandwidth of node q is 6Mbps, and each section length is 6M, and the priority of distributing for these 3 requests is respectively 9,6 and 3.If take sending method successively, node q at first sends segmentation s with whole bandwidth
aTo node a, after finishing, transmission sends segmentation s with whole bandwidth again
bTo node b, after finishing, transmission sends segmentation s with whole bandwidth again
cTo node c.Like this, segmentation s
aArrive time, the segmentation s of node a
bArrive time and the segmentation s of node b
cThe moment that arrives node c was respectively 1 second, 2 seconds and 3 seconds.And if take the proportional bandwidth sending method, node q sends segmentation s with the bandwidth of 3Mbps respectively in the moment of t=0
aTo node a, with the bandwidth transmission segmentation s of 2Mbps
bTo node b, with the bandwidth transmission segmentation s of 1Mbps
cTo node c.During second, node a receives whole segmentation at t=2, and node q sends segmentation sb to node b with the bandwidth of 4Mbps respectively simultaneously, with the bandwidth transmission segmentation s of 2Mbps
cTo node c.During second, node b receives whole segmentation at t=2.5, and q sends segmentation s with the bandwidth of whole 6Mbps simultaneously
cTo node c.During second, node c receives whole segmentation at t=3.Like this, take segmentation s after this method
aArrive time, the segmentation s of node a
bArrive time and the segmentation s of node b
cThe moment that arrives node c was respectively 2 seconds, 2.5 seconds and 3 seconds.Through comparing, obviously the method that sends successively is better than the method for ratio bandwidth, because in the higher acquisition request better service of priority, the request that priority is lower does not incur loss.If there is new request to arrive in node sends the process of certain segmentation, then new request is placed in the request queue, up to current segmentation send finish after, carry out the segment transmit dispatch of next round again.
For the priority of request for allocation, three kinds of possible selections are arranged.First method is to arrive request queue request early to be endowed higher priority, and we can be referred to as the FIFO scheduling; Second method is that the higher request of demand staging sequence number is endowed higher priority, and we are referred to as high sequence number priority scheduling; The third method is that the lower request of demand staging sequence number is endowed higher priority, and we are referred to as low sequence number priority scheduling.Three kinds of priority assignment methods more as shown in Figure 2.
In live broadcast stream media was used in real time, Media Stream just began to play after some the most forward segmentations all arrive, if the segmentation request of therefore low sequence number is endowed higher priority, most of node can obtain short playout-delay; If the segmentation request of high sequence number is endowed higher priority, then Media Stream can obtain comparatively smooth broadcast after the segmentation of low sequence number arrives.Enlightened by this, we propose to take high sequence number priority scheduling method when the user has relatively high expectations to playing fluency; When the user has relatively high expectations to playout-delay, take low sequence number priority scheduling method.The adaptation function of sequence number and priority is arbitrarily, as long as can satisfy in high sequence number priority scheduling, priority increases along with the increase of sequence number; In low sequence number priority scheduling, priority is less along with the increase of sequence number.Such as, if node i demand staging s, its priority can be assigned to Pr (i, s)=(s+1), its priority can be assigned to Pr (i, s)=1/ (s+1) in low sequence number priority scheduling in high sequence number priority scheduling.By simulated experiment, if we find that the user has relatively high expectations to playing fluency, high sequence number priority scheduling can reach higher user satisfaction than low sequence number priority scheduling and FIFO scheduling; If the user has relatively high expectations to playout-delay, low sequence number priority scheduling can reach higher user satisfaction than high sequence number priority scheduling and FIFO scheduling.
In conjunction with the segmentation sending method that sends successively, and according to different the require different priority assignment methods taked of user to playing fluency and playout-delay.
Claims (1)
1. the segment transmit dispatch method in the data-driven overlay network is characterized in that, this method realizes that according to corresponding data-driven overlay network agreement described method contains following steps successively in the data-driven overlay network:
Step 1. initialization: segmentation provides node to move described data-driven overlay network agreement;
The segmentation request that step 2. segmentation provides node to receive to be arranged in the segmentation requesting node of described data-driven overlay network to send, and according to the request the sequence number of segmentation in Media Stream distribute priority, is that high priority is given in the high segmentation request of demand staging sequence number the user to playing that fluency requires when high, and the user playout-delay being required when high is that high priority is given in the low segmentation request of demand staging sequence number;
This segmentation of step 3. provides node that each segmentation request is stored in the segmentation request queue;
When step 4. provides the node scheduling segmentation to send when segmentation, from the segmentation request queue, select the segmentation request that priority is the highest, provide all transmission bandwidth of node to send corresponding segmentation to corresponding segmentation requesting node with segmentation;
Step 5. is returned step 4 after current segmentation transmission finishes, carry out the segment transmit dispatch of a new round.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CNB2005100866838A CN100440866C (en) | 2005-10-21 | 2005-10-21 | Segment transmit dispatch in data-driven overlay network |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CNB2005100866838A CN100440866C (en) | 2005-10-21 | 2005-10-21 | Segment transmit dispatch in data-driven overlay network |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN1747448A CN1747448A (en) | 2006-03-15 |
| CN100440866C true CN100440866C (en) | 2008-12-03 |
Family
ID=36166778
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CNB2005100866838A Expired - Fee Related CN100440866C (en) | 2005-10-21 | 2005-10-21 | Segment transmit dispatch in data-driven overlay network |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN100440866C (en) |
Families Citing this family (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN100469187C (en) * | 2007-01-26 | 2009-03-11 | 中国科学技术大学 | A satisfaction-based multi-user scheduling method in the multi-antenna system |
| CN101588287B (en) * | 2008-05-20 | 2011-11-16 | 华为技术有限公司 | Method, device and system for scheduling and downloading peer-to-peer network data |
| CN102821311B (en) * | 2012-05-30 | 2015-07-15 | 浙江宇视科技有限公司 | Video data packet priority setting method and device |
| CN103929684B (en) * | 2013-01-14 | 2018-06-15 | 华为技术有限公司 | A kind of method, player and terminal based on Streaming Media option code flow point section |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20030028623A1 (en) * | 2001-08-04 | 2003-02-06 | Hennessey Wade L. | Method and apparatus for facilitating distributed delivery of content across a computer network |
| US20030204602A1 (en) * | 2002-04-26 | 2003-10-30 | Hudson Michael D. | Mediated multi-source peer content delivery network architecture |
| CN1529504A (en) * | 2003-10-13 | 2004-09-15 | 周良勇 | Television programme on-line broad casting method |
| CN1538309A (en) * | 2003-09-02 | 2004-10-20 | 竺红卫 | Non-homogeneous multi media flow transmission regulation method based on priority regulation |
-
2005
- 2005-10-21 CN CNB2005100866838A patent/CN100440866C/en not_active Expired - Fee Related
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20030028623A1 (en) * | 2001-08-04 | 2003-02-06 | Hennessey Wade L. | Method and apparatus for facilitating distributed delivery of content across a computer network |
| US20030204602A1 (en) * | 2002-04-26 | 2003-10-30 | Hudson Michael D. | Mediated multi-source peer content delivery network architecture |
| CN1538309A (en) * | 2003-09-02 | 2004-10-20 | 竺红卫 | Non-homogeneous multi media flow transmission regulation method based on priority regulation |
| CN1529504A (en) * | 2003-10-13 | 2004-09-15 | 周良勇 | Television programme on-line broad casting method |
Also Published As
| Publication number | Publication date |
|---|---|
| CN1747448A (en) | 2006-03-15 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN101292467B (en) | Application-level routing protocol for multiparty audio-video conferencing | |
| Ren et al. | On reducing mesh delay for peer-to-peer live streaming | |
| CN101331739B (en) | Method and device for transmitting contents of an equity network | |
| CN105340234B (en) | The adaptive resource management of multi-screen Video Applications is used in cable Wi-Fi network | |
| WO2009153945A1 (en) | Communication channel building device and n-tree building method | |
| CN106464680A (en) | Bandwidth management in a content distribution network | |
| CN101589586B (en) | Recalculating airtime quota in wlan to use up bandwidth | |
| CN100459502C (en) | Dynamic copying and sending device of asymmetric cross net section multiple path data stream | |
| KR20120068314A (en) | Method for providing peering suggestion list, method for establishing p2p network, p2p application apparatus, terminal for establishing p2p network and network apparatus | |
| CN100440866C (en) | Segment transmit dispatch in data-driven overlay network | |
| JP2011515908A (en) | Distributed hierarchical clustered peer-to-peer live streaming system | |
| Zhao et al. | Enabling P2P one-view multiparty video conferencing | |
| CN101325510B (en) | Control method and apparatus for active dynamic distribution of unicast and multicast resource | |
| Chen et al. | Coordinated media streaming and transcoding in peer-to-peer systems | |
| CN102158767B (en) | Scalable-coding-based peer to peer live media streaming system | |
| Pang et al. | Content harvest network: Optimizing first mile for crowdsourced live streaming | |
| Mostafavi et al. | A stochastic approximation resource allocation approach for HD live streaming | |
| CN101645924A (en) | Selection method of cooperative nodes in P2P system | |
| Dubin et al. | A fair server adaptation algorithm for HTTP adaptive streaming using video complexity | |
| He et al. | Modeling and analysis of multi-channel P2P VoD systems | |
| Kamiyama et al. | Multicast pre-distribution in VoD services | |
| Kamiyama et al. | Parallel video streaming optimizing network throughput | |
| Xiao et al. | Toward systematical data scheduling for layered streaming in peer-to-peer networks: Can we go farther? | |
| Wang et al. | Minimizing the worst-case playback delay in VoD services over passive optical networks | |
| Li et al. | Peer-to-peer streaming scheduling to improve real-time latency |
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 | ||
| C17 | Cessation of patent right | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20081203 Termination date: 20111021 |