CN1901504A - Data dispatching method of stream medium request broadcast system - Google Patents
Data dispatching method of stream medium request broadcast system Download PDFInfo
- Publication number
- CN1901504A CN1901504A CNA2006100195255A CN200610019525A CN1901504A CN 1901504 A CN1901504 A CN 1901504A CN A2006100195255 A CNA2006100195255 A CN A2006100195255A CN 200610019525 A CN200610019525 A CN 200610019525A CN 1901504 A CN1901504 A CN 1901504A
- Authority
- CN
- China
- Prior art keywords
- data
- node
- time
- partner
- enter step
- 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.)
- Granted
Links
Images
Landscapes
- Data Exchanges In Wide-Area Networks (AREA)
- Two-Way Televisions, Distribution Of Moving Picture Or The Like (AREA)
Abstract
This invention discloses a datas dispatching method in a flow media broadcast-selection system, in which, the nodes carryout the following steps: 1, obtaining all data needed for dispatch in the data buffer region, 2, computing the overtime of all data in the dispatched data set, 3, computing the initial value of the dispatch bandwidth and that of the current service ability of all fellow nodes, 4, judging if the time interval of the current and the time tested of the data buffer region last time is greater than the dispatch period, 5, taking out a datum to be dispatched in the set, 6, judging if the overtime is greater than the dispatch period, 6, judging if the overtime of the data is greater than the system current time, 7, dispatching the data to a certain fellow node adaptively, 8, sending the data request to a video server, 9, judging if there are data needed to be dispatched in the buffer region, 10, judging if the play is finished.
Description
Technical field
The invention belongs to computer streaming media service technical field, relate to peer-to-peer network and the crossing domain that the streaming media on demand technology combines, be specifically related to a kind of data dispatching method of demand stream media system.
Background technology
Traditional based on the streaming media on demand service system under " server-client " pattern in, the media video of user's program request is left concentratedly on a video server.When the user of program request increased gradually, the load of video server sharply increased, and the available resources of server, the particularly network bandwidth become the bottleneck of system.When the service ability of video server reaches in limited time, just can not be that other users serve again, the scale of system is also corresponding to be restricted, so the demand stream media system of traditional mode does not have good expandability.
In recent years, along with the rise of peer-to-peer network technology, the system that the mode that the peer-to-peer network technology is combined with stream media technology has solved tradition " server-client " pattern gets poor expandability, the deficiency that service ability is limited.In the demand stream media system based on peer-to-peer network, each peer node all can the buffer memory video data, and the user of the same video of program request is many more, and data redundant on the network are just many more.The user of each program request can make full use of the resource of other user nodes in the peer-to-peer network, particularly network bandwidth resources, obtains data from these users.Like this, the load of the server of video will reduce.The performance of whole system and extensibility just also can improve.
At present, VOD system based on peer-to-peer network has P2VOD (T.Do, K.A.Hua, and M.Tantaoui. " P2VoD:providing fault tolerant video-on-demandstreaming in peer-to-peer environment ", in Proc.of IEEE ICC ' 04, Paris, France, Jun.2004.) and P2Cast (Y.Guo, K.Suh, J.Kurose, andD.Towsley. " P2Cast:Peer-to-peer Patching Scheme for VoD Service ", in Proc.of the 12th World Wide Web Conference (WWW ' 03), Budapest, Hungary, May 2003.) or the like.They utilize node resource in the peer-to-peer network well to solve the bottleneck problem of video server, but they also exist common shortcoming, be that the topological organizational form that system adopts is a tree, this topological organizational form, at first very complicated in the maintenance of topology, secondly each user has only an ISP, can not well utilize the resource in the peer-to-peer network.Be convenient to safeguard and have based on structureless topological structure, each node can have a plurality of ISPs that the advantage of data is provided, but in based on the VOD system of non-structure peer-to-peer network, also exist and need the urgent problem that solves: when the data of request have a plurality of partner nodes to provide data, the reasonable distribution of how to dispatch, and make full use of the resource of these nodes; How to make data avoid being dispatched to video server for the load that reduces server as far as possible.
Summary of the invention
The object of the present invention is to provide a kind of data dispatching method of demand stream media system, this method has solved the scheduling problem that data are provided to individual node simultaneously based on a plurality of partner nodes under the non-structure peer to peer environment.
The data dispatching method of a kind of demand stream media system provided by the invention, arbitrary node A carries out data dispatch according to following steps in the system:
(1) node A obtains needs all data S of dispatching in the data buffer zone
i, i=1,2 ..., r, all data S
iConstitute the data dispatching S set; R is the number of data in the data dispatching S set.
(2) node A calculates all the data S in the data dispatching S set
iTime-out time T
Mi
(3) node A calculates all partner node P
jThe initial value W of scheduling bandwidth W
0jWith current service ability C
jInitial value C
0j, W
0j=R/k, j=1 wherein, 2 ..., k, k are the number of the partner node of A; R is the stream bit rate of video; C
J0=W
j* T
e, T
eBe dispatching cycle;
(4) node A judges that whether current time in system and data buffer zone were scheduled the interval of time of checking last time greater than T dispatching cycle
e, if enter step (5); Otherwise enter step (10);
(5) node A takes out the data S of the needs scheduling of data dispatch collection S
i, the initial value of i is 1; If all partner node P of A
j, j=1,2 ..., there is data S in k in its data buffer zone
iThe number of partner node greater than 0, execution in step (7) then; Otherwise, enter step (6);
(6) node A judgment data S
iTime-out time T
MiWhether greater than the current time in system, if then enter step (8), otherwise enter step (9);
(7) node A according to step (7.1)-(7.3) with data S
iAdaptive scheduling arrives certain partner node;
(7.1) node A adjusts the partner node P of A
jScheduling bandwidth W
j, j=1 wherein, 2 ..., k;
(7.2) node A calculated data S
iThe service ability G that needs consumption
i, G
i=L
i+ H, wherein, L
iBe data S
iSize, the size in encapsulated data packet packet header when H is transfer of data;
(7.3) the partner node P of node A current service ability value maximum in its partner node
bRequest msg S
i, 1≤b≤k, and revise partner node P
bCurrent service ability C
b, make C
b=C
b-G
iEnter step (9);
(8) node A sends data S to video server
iRequest, enter step (9)
(9) make i=i+1, judge whether i＞r,, otherwise enter step (5) if enter step (10);
(10) whether decision node A plays end, if then finish, otherwise get back to step (4).
Above-mentioned steps (2) adopts following formula to calculate time-out time T
Mi:
T
Mi=T
Ui-T, wherein, i-1,2 ..., r (I)
T
Mi=T
Ui-T+ Δ T, wherein, i=1,2 ..., r (II),
Wherein, T
UiBe the position of these data in video media file, T is current reproduction time, and Δ T is the time-out time amount trimmed.
Above-mentioned steps (7.1) adopts following process to adjust the partner node P of A
jScheduling bandwidth W
j:
(B1) node A obtains partner node P
jSuccessful continuously times N of dispatching
j
(B2) judge the successfully times N of scheduling
jWhether greater than N
a, N
aBe the fiducial value of successful scheduling times, if then enter step (B3), otherwise enter step (B4);
(B3) make W
j=W
j+ Δ W, Δ w is the bandwidth change constant, enters step (7.2).
(B4) make W
j=W
j-Δ W enters step (7.2).
Dispatching method of the present invention by the scheduling bandwidth of self adaptation adjustment partner node, makes full use of the resource of node in the peer-to-peer network, the load that has alleviated video service servers.Particularly, the present invention has following feature:
(1) stability
When a plurality of partner nodes can provide data for node A, the resource that can make full use of each partner node is obtained data, when some partner nodes left or can not provide data, node A can also obtain data from other partner node, has guaranteed the stability of video playback.
(2) adaptivity
Be not quite similar for node A provides the service ability of the partner node of data, the variation of the service ability that dispatching method of the present invention can the self adaptation partner node is constantly adjusted.
(3) load balancing
Node A can make full use of the resource of each partner node, in the process of data dispatching, considers the service ability of each partner node, does balanced data allocations, has guaranteed the load balancing between the partner node.
(4) extensibility
Node A is having under the situation of partner node data dispatch to partner node, have only when data in partner node, do not exist or the overtime ability of data dispatch with data dispatch to video server, reduce the load of video server, thereby improved the extensibility of system.
Description of drawings
Fig. 1 is the general flow chart of dispatching method of the present invention;
Fig. 2 is the flow chart of adaptive scheduling of the present invention.
Embodiment
The present invention is further detailed explanation below in conjunction with accompanying drawing and example.
As shown in Figure 1, arbitrary node A carries out data dispatch according to following steps in the demand stream media system:
(1) node A obtains needs all data S of dispatching in the data buffer zone
i, i=1,2 ..., r, all data S
iConstitute the data dispatching S set; R is the number of data in the data dispatching S set.
(2) node A calculates all the data S in the data dispatching S set
iTime-out time T
Mi
Data S
iTime-out time T
MiWith the position T of these data in video media file
UiRelevant with current reproduction time T, employing formula (I) or (II) calculating:
T
Mi=T
Ui-T, wherein, i=1,2 ..., r (I)
T
Mi=T
Ui-T+ Δ T, wherein, i=1,2 ..., r (II)
Δ T is the time-out time amount trimmed, by system decision is set, and value is for being-5-+5 usually.
(3) node A calculates its all partner node P
jScheduling bandwidth W
jInitial value W
0jWith current service ability C
jInitial value C
0j, j=1 wherein, 2 ..., k, k are that number " partner " node of the partner node of A is meant the node that has the required data of node A in " neighbours " node, promptly the current reproduction time T of node A satisfies T
1＜T＜T
2, T wherein
1Be the original position of " neighbours " nodal cache data, T
2Be its final position." neighbours " node is meant that the difference of reproduction time of its reproduction time and node A is less than the node of benchmark reproduction time difference.It is poor that system sets a benchmark reproduction time according to the buffer memory capacity of node, and common scope is 100 seconds-600 seconds.
Partner node P
jScheduling bandwidth W
jRelevant with the performance of its machine with actual available upstream bandwidth, its initial value W
0jDetermine by the stream bit rate R of video and the number k of partner node, be calculated as follows:
W
0j＝R/k
Partner node P
jCurrent service ability C
jRelevant with available upstream bandwidth, its initial value C
J0By scheduling bandwidth W
jWith T dispatching cycle
eDecision is calculated as follows:
C
j0＝W
j*T
e
Dispatching cycle T
eIn the time interval of the system that is meant double inspection data buffer zone, relevant with the hardware configuration and the network bandwidth of node, value is 10-20 second usually.
(4) node A judges that whether current time in system and data buffer zone were scheduled the interval of time of checking last time greater than T dispatching cycle
e, if enter step (5); Otherwise enter step (10).
(5) node A takes out the data S of the needs scheduling of data dispatch collection S
i, the initial value of i is 1.If all partner node P of A
j, j=1,2 ..., there is data S in k in its data buffer zone
iThe number of partner node greater than 0, execution in step (7) then; Otherwise, enter step (6);
(6) node A judgment data S
iTime-out time T
MiWhether greater than the current time in system, if then enter step (8), otherwise enter step (9);
(7) node A is with data S
iAdaptive scheduling is to certain partner node, and concrete steps are as follows:
(7.1) node A transfers partner node P
jScheduling bandwidth W
j, j=1 wherein, 2 ..., k, concrete steps are as follows:
(B1) node A obtains partner node P
jSuccessful continuously times N of dispatching
j
Previous dispatching cycle interior nodes A to partner node P
jAll request of data of initiating, these data all can both be from partner node P before following one-period arrives
jObtain, the present invention is called successfully scheduling.
(B2) judge the successfully times N of scheduling
jWhether greater than N
a, N
aBe the fiducial value of successful scheduling times, be provided with relevantly by system that usually value is 5-7.If then enter step (B3), otherwise enter step (B4).
(B3) make W
j=W
j+ Δ W, Δ W are the bandwidth change constant, are provided with relevantly by system, and usually value is 32-64, enters step (7.2).
(B4) make W
j=W
j-Δ W enters step (7.2)
(7.2) node A calculated data S
iThe service ability G that needs consumption
i, be calculated as follows:
G
i＝L
i+H；
Wherein, L
iBe data S
iSize, the size in encapsulated data packet packet header when H is transfer of data, by program transmission control protocol decision, value is the 20-30 byte usually.
(7.3) the partner node P of node A current service ability value maximum in its partner node
b, request msg S
i, 1≤b≤k, and revise this partner node P
bCurrent service ability C
b, C
b=C
b-G
i, enter step (9);
(8) node A sends data S to video server
iRequest, enter step (9)
(9) i=i+1 judges whether i＞r, if enter step (10), otherwise enters step (5);
(10) whether decision node A plays end, if then finish, otherwise get back to step (4).Example:
Utilize data dispatching method in the peer-to-peer network set forth in the present invention, the laboratory provides 1 video server, and the logical PC node of 10 Daeporis.Table 1 is the hardware configuration of video server and PC:
| Machine name | CPU | Internal memory | Hard disk | The network bandwidth |
| Video server | PIIII 2.0G | 2G | 300G | 100M |
| PC 1-10 | PIIII 1.7G | 256M | 40G | 10M |
Table 1
PC 1-10 is called node 1, node 2 ... node 10.These 10 nodes are watched same video, and video code rate is 500 (units: kb/s).The value of dispatching cycle is 10 seconds.In certain moment, we choose node 1 observed data scheduling situation, and this moment, node 1 had 5 partner nodes, and these 5 partner nodes are respectively nodes 2, node 4, node 5, node 7, node 10.Initial schedule bandwidth=the video code rate of each partner node/partner node number=500/5=100 (unit: kb/s).When calculating the service ability that the data of scheduling need consume, the size of transmission controlling packets is 25 bytes.The Δ W value of using when adjusting scheduling bandwidth is 32, the fiducial value N of successful scheduling times
aValue is 5.By through several dispatching cycles, present node 2,4,5,7,10 scheduling bandwidth is respectively: 132,132,196,228,164 (units: kb/s).Node 1 calculates the current service ability of these several partner nodes:
Partner node 2 service ability=132kb/s*10s/8=165KB
Partner node 4 service ability=132kb/s*10s/8=165KB
Partner node 5 service ability=196kb/s*10s/8=245KB
Partner node 7 service ability=228kb/s*10s/8=285KB
Partner node 10 service ability=164kb/s*10s/8=205KB
Content shown in the table 2 is the current data dispatching collection S of node 1, the size of data and in the situation that exists of partner node.Last classifies the distribution condition of the data that obtain by dispatching method of the present invention as.
| Data | Size of data (unit: KB) | The partner node that has these data | The data allocations situation |
| S1 | 70 | 2，4，5，7，10 | Node 7 |
| S2 | 60 | 2，10 | Node 10 |
| S3 | 50 | 4，7 | Node 7 |
| S4 | 80 | 2，4，5，10 | Node 5 |
| S5 | 75 | 2，4，10 | Node 4 |
| S6 | 60 | 4，7，10 | Node 5 |
| S7 | 80 | 5，7，10 | Node 7 |
| S8 | 70 | Do not have | Video server |
| S9 | 80 | 2 | Node 2 |
Table 2
Through repeatedly test, each node in the peer-to-peer network all adopts data dispatching method of the present invention, and each node can both make full use of the resource of partner node, and accomplishes the scheduling of load balancing, reduce the pressure of video server simultaneously, improved the performance of whole system.
Claims (3)
1, a kind of data dispatching method of demand stream media system, arbitrary node A carries out data dispatch according to following steps in the system:
(1) node A obtains needs all data S of dispatching in the data buffer zone
i, i=1,2 ..., r, all data S
iConstitute the data dispatching S set; R is the number of data in the data dispatching S set.
(2) node A calculates all the data S in the data dispatching S set
iTime-out time T
Mi
(3) node A calculates all partner node P
jThe initial value W of scheduling bandwidth W
0jWith current service ability C
jInitial value C
0j, W
0j=R/k, j=1 wherein, 2 ..., k, k are the number of the partner node of A; R is the stream bit rate of video; C
J0=W
j* T
e, T
eBe dispatching cycle;
(4) node A judges that whether current time in system and data buffer zone were scheduled the interval of time of checking last time greater than T dispatching cycle
e, if enter step (5); Otherwise enter step (10);
(5) node A takes out the data S of the needs scheduling of data dispatch collection S
i, the initial value of i is 1; If all partner node P of A
j, j=1,2 ..., there is data S in k in its data buffer zone
iThe number of partner node greater than 0, execution in step (7) then; Otherwise, enter step (6);
(6) node A judgment data S
iTime-out time T
MiWhether greater than the current time in system, if then enter step (8), otherwise enter step (9);
(7) node A according to step (7.1)-(7.3) with data S
iAdaptive scheduling arrives certain partner node;
(7.1) node A adjusts the partner node P of A
jScheduling bandwidth W
j, j=1 wherein, 2 ..., k;
(7.2) node A calculated data S
iThe service ability G that needs consumption
i, G
i=L
i+ H, wherein, L
iBe data S
iSize, the size in encapsulated data packet packet header when H is transfer of data;
(7.3) the partner node P of node A current service ability value maximum in its partner node
bRequest msg S
i, 1≤b≤k, and revise partner node P
bCurrent service ability C
b, make C
b=C
b-G
iEnter step (9);
(8) node A sends data S to video server
iRequest, enter step (9)
(9) make i=i+1, judge whether i＞r,, otherwise enter step (5) if enter step (10);
(10) whether decision node A plays end, if then finish, otherwise get back to step (4).
2, method according to claim 1 is characterized in that: step (2) employing formula is calculated time-out time T
Mi:
T
Mi=T
Ui-T, wherein, i=1,2 ..., r (I)
T
Mi=T
Ui-T+ Δ T, wherein, i=1,2 ..., r (II),
Wherein, T
UiBe the position of these data in video media file, T is current reproduction time, and Δ T is the time-out time amount trimmed.
3, method according to claim 2 is characterized in that: step (7.1) adopts following process to adjust the partner node P of A
jScheduling bandwidth W
j:
(B1) node A obtains partner node P
jSuccessful continuously times N of dispatching
j
(B2) judge the successfully times N of scheduling
jWhether greater than N
a, N
aBe the fiducial value of successful scheduling times, if then enter step (B3), otherwise enter step (B4);
(B3) make W
j=W
j+ Δ W, Δ w is the bandwidth change constant, enters step (7.2).
(B4) make W
j=W
j-Δ W enters step (7.2).
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CNB2006100195255A CN100477641C (en) | 2006-06-30 | 2006-06-30 | Data dispatching method of stream medium request broadcast system |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CNB2006100195255A CN100477641C (en) | 2006-06-30 | 2006-06-30 | Data dispatching method of stream medium request broadcast system |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN1901504A true CN1901504A (en) | 2007-01-24 |
| CN100477641C CN100477641C (en) | 2009-04-08 |
Family
ID=37657251
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CNB2006100195255A Expired - Fee Related CN100477641C (en) | 2006-06-30 | 2006-06-30 | Data dispatching method of stream medium request broadcast system |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN100477641C (en) |
Cited By (14)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101170506B (en) * | 2007-12-06 | 2010-06-02 | 北京广视通达网络技术有限公司 | A P2P stream media data dispatching method based on response drive |
| CN101287102B (en) * | 2007-04-13 | 2010-06-30 | 中国科学院声学研究所 | Stored stream media data downloading method based on elastic overlapping network |
| CN101562737B (en) * | 2009-05-19 | 2010-12-29 | 华中科技大学 | Multi-code rate dispatching method in peer-to-peer live broadcast system |
| CN101321265B (en) * | 2007-06-07 | 2011-03-16 | 中兴通讯股份有限公司 | Method and system for implementing peer-to-peer network media order frame-across broadcast mode |
| CN102098223A (en) * | 2011-02-12 | 2011-06-15 | 浪潮(北京)电子信息产业有限公司 | Method, device and system for scheduling node devices |
| CN101383764B (en) * | 2008-10-15 | 2011-06-29 | 中国电信股份有限公司 | Wideband service network application access method, access system and access gateway |
| CN101409679B (en) * | 2008-11-12 | 2011-09-21 | 中兴通讯股份有限公司 | Method for dynamically regulating data block request in point-to-point stream medium |
| CN101651966B (en) * | 2009-09-10 | 2012-04-04 | 中兴通讯股份有限公司 | Play method and device of mobile P2P client |
| CN101753980B (en) * | 2010-02-05 | 2012-04-18 | 上海悠络客电子科技有限公司 | Method for realizing quasi real-time network video based on p2p technology |
| CN101682741B (en) * | 2007-07-02 | 2012-05-09 | 松下电器产业株式会社 | Stream transmission server and stream transmission system |
| CN102739796A (en) * | 2012-07-02 | 2012-10-17 | 卢林发 | Terminal ad loading method based on media cloud platform |
| CN102752647A (en) * | 2012-07-02 | 2012-10-24 | 卢林发 | Uninterrupted playback method for high definition video advertisement |
| CN102801757A (en) * | 2011-05-25 | 2012-11-28 | 英业达股份有限公司 | Processing method and system for data de-duplication of point-to-point transmission |
| CN110971942A (en) * | 2018-09-28 | 2020-04-07 | 杭州海康威视数字技术股份有限公司 | Data transmission method and device |
-
2006
- 2006-06-30 CN CNB2006100195255A patent/CN100477641C/en not_active Expired - Fee Related
Cited By (16)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101287102B (en) * | 2007-04-13 | 2010-06-30 | 中国科学院声学研究所 | Stored stream media data downloading method based on elastic overlapping network |
| CN101321265B (en) * | 2007-06-07 | 2011-03-16 | 中兴通讯股份有限公司 | Method and system for implementing peer-to-peer network media order frame-across broadcast mode |
| CN101682741B (en) * | 2007-07-02 | 2012-05-09 | 松下电器产业株式会社 | Stream transmission server and stream transmission system |
| CN101170506B (en) * | 2007-12-06 | 2010-06-02 | 北京广视通达网络技术有限公司 | A P2P stream media data dispatching method based on response drive |
| CN101383764B (en) * | 2008-10-15 | 2011-06-29 | 中国电信股份有限公司 | Wideband service network application access method, access system and access gateway |
| CN101409679B (en) * | 2008-11-12 | 2011-09-21 | 中兴通讯股份有限公司 | Method for dynamically regulating data block request in point-to-point stream medium |
| CN101562737B (en) * | 2009-05-19 | 2010-12-29 | 华中科技大学 | Multi-code rate dispatching method in peer-to-peer live broadcast system |
| CN101651966B (en) * | 2009-09-10 | 2012-04-04 | 中兴通讯股份有限公司 | Play method and device of mobile P2P client |
| CN101753980B (en) * | 2010-02-05 | 2012-04-18 | 上海悠络客电子科技有限公司 | Method for realizing quasi real-time network video based on p2p technology |
| CN102098223A (en) * | 2011-02-12 | 2011-06-15 | 浪潮(北京)电子信息产业有限公司 | Method, device and system for scheduling node devices |
| CN102801757A (en) * | 2011-05-25 | 2012-11-28 | 英业达股份有限公司 | Processing method and system for data de-duplication of point-to-point transmission |
| CN102739796A (en) * | 2012-07-02 | 2012-10-17 | 卢林发 | Terminal ad loading method based on media cloud platform |
| CN102752647A (en) * | 2012-07-02 | 2012-10-24 | 卢林发 | Uninterrupted playback method for high definition video advertisement |
| CN110971942A (en) * | 2018-09-28 | 2020-04-07 | 杭州海康威视数字技术股份有限公司 | Data transmission method and device |
| CN110971942B (en) * | 2018-09-28 | 2021-08-17 | 杭州海康威视数字技术股份有限公司 | Data transmission method and device |
| US11589101B2 (en) | 2018-09-28 | 2023-02-21 | Hangzhou Hikvision Digital Technology Co., Ltd. | Data transmission method and apparatus |
Also Published As
| Publication number | Publication date |
|---|---|
| CN100477641C (en) | 2009-04-08 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN1901504A (en) | Data dispatching method of stream medium request broadcast system | |
| CN1314250C (en) | A robust point to point based stream scheduling method | |
| CN1645858A (en) | Service system for distributed reciprocal flow media and realizing method for requesting programm | |
| CN1490980A (en) | Apparatus and method for stream-oriented multimedia data transmission | |
| CN1767636A (en) | Content distribution method, program, and information processing apparatus | |
| CN100338915C (en) | Message mirroring method and network equipment with message mirroring function | |
| CN101068336A (en) | Coordinate connection stream media direct broadcasting system and device | |
| CN1416244A (en) | System and method of network self adaption real time multimedia flow transfer way | |
| Xiao et al. | Layerp2p: A new data scheduling approach for layered streaming in heterogeneous networks | |
| CN1822548A (en) | Distribtive flow managing method based on counter network | |
| CN105554528A (en) | Method and apparatus for grouping bullet screen users in live broadcasting room | |
| CN1874284A (en) | Distributed type clustering method in use for constructing cluster type peer-to-peer network | |
| CN101047696A (en) | Network flow media data playing method and system | |
| CN101068214A (en) | Route convergent method and equipment | |
| WO2013004191A1 (en) | Message push method and instant communication server | |
| CN101079809A (en) | An Ethernet service processing method in Gbit passive optical network | |
| CN1897745A (en) | Equilibrium method for transmitting MBMS service data | |
| CN1874489A (en) | Network organization method of overlapped multichannels in video on demand system of peer-to-peer network | |
| CN101047476A (en) | Method and device for selecting modulation mode | |
| CN1588927A (en) | Method for large scale multimedia cut-in net gate | |
| CN101035088A (en) | Method, system and access device for realizing the intercommunication of two layers of local specific service | |
| CN111866438A (en) | User experience driven transcoding and multicast routing method and device for multi-party video conference | |
| CN1741499A (en) | Virtual circuit exchanging method based on MAC studying | |
| CN1889448A (en) | Method and system for crossing virtual local network group broadcasting under assigned source group broadcasting protocol extraneous group broadcasting mode | |
| CN1614931A (en) | Digital medium delivering method based on IP network |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| 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: 20090408 Termination date: 20110630 |