CN1296358A - Patch method supporting multi-broadcasting video ordering system interactivity - Google Patents

Patch method supporting multi-broadcasting video ordering system interactivity Download PDF

Info

Publication number
CN1296358A
CN1296358A CN 00134538 CN00134538A CN1296358A CN 1296358 A CN1296358 A CN 1296358A CN 00134538 CN00134538 CN 00134538 CN 00134538 A CN00134538 A CN 00134538A CN 1296358 A CN1296358 A CN 1296358A
Authority
CN
China
Prior art keywords
stream
client
repairing
formation
mutual
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
Application number
CN 00134538
Other languages
Chinese (zh)
Other versions
CN1124742C (en
Inventor
马华东
康·G·申(KangG.Shin)
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Beijing University of Posts and Telecommunications
Original Assignee
Beijing University of Posts and Telecommunications
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by Beijing University of Posts and Telecommunications filed Critical Beijing University of Posts and Telecommunications
Priority to CN 00134538 priority Critical patent/CN1124742C/en
Publication of CN1296358A publication Critical patent/CN1296358A/en
Application granted granted Critical
Publication of CN1124742C publication Critical patent/CN1124742C/en
Anticipated expiration legal-status Critical
Expired - Fee Related legal-status Critical Current

Links

Images

Landscapes

  • Two-Way Televisions, Distribution Of Moving Picture Or The Like (AREA)

Abstract

The present invention relates to an interactive as far as possible patching method for supporting multiple broadcast video requesting system. The work process of said method is divided into the following three stages: (1) demand stage of customer for permitting one to enter; (2) interactive stage; and (3) combination stage. Said method is characterized by broadening original patching technique mainly for eliminating service time-delay in multiple broadcast VOD system to continuous interactive operation of customer for supporting multiple broadcast video requresting system so as to provide an effective supporting method for making multiple broadcast video requesting system implement true video request service. Besides, it provides a novel dynamic combination algorism for supporting interactive combination of patching flow and multiple broadcast flow, and said algorism can obviously raise combination efficiency of information flow.

Description

Support the method for repairing and mending as possible of multi-broadcasting video ordering system interactivity
The present invention relates to a kind of video on-demand system, exactly, relate to a kind of method for repairing and mending as possible of supporting the multi-broadcasting video ordering system interactivity, belong to the multimedia communications system technical field.
Video request program (VoD) technology is widely used in fields such as home entertaining, digital library, film program request, teleshopping, remote teaching.Video on-demand system is that program request equipment 3 of being positioned at client by transmission network 1, video server 2 and Duo Tai etc. constitutes (referring to Fig. 1).In concept, very video-on-demand service allows the long-distance user at any time with any one video frequency program of interactive mode program request arbitrarily.Traditional video on-demand system is for each user asks to distribute a channel appointed, so that true video-on-demand service to be provided.But its service retractility is poor, make server handle up and the network bandwidth be linear growth with number of users, service performance has limitation.Multicast (multicast) technology provides a kind of effective some transmission means to multiple spot, referring to Fig. 2, use the video on-demand system of multicasting technology (to be called for short multicast VoD system,) be to utilize the customer management module 22 in the video server 2 to carry out interactive maintenance simultaneously by the program request equipment 3 that transmission network 1 and mutual more than 4 pairs of control channel are positioned at client, Video service module 20 then can be play by transmission network Multicast Channel 5 of 1 formation and while a video frequency program that is stored in the video memory 21 to program request equipment 3 transmission of a plurality of clients, the video data of transmission constitutes a multicast stream on Multicast Channel 5, so, this system has good client's retractility and service performance, and this performance is particularly outstanding in the order program service of hot programs.
Now, basic multicast VoD system is that to adopt isochronic interval (as 5 minutes) and batch processing mode be that the client of one group of same video frequency program of program request dispatches a multicast stream and serves, and is a kind of quasi-video request program service.Multicast VoD system will provide true video-on-demand service to solve two problems: the one, the service of zero propagation is provided for the client; The 2nd, support the client to use the real-time, interactive function of similar home video tape recording, as broadcast/recovery, stop/pause/termination, F.F./rewinding, search/reverse search, slow motion etc. forward.
In order to eliminate the service time-delay in the multicast VoD service, " Patching:A multicast technique for truevideo-on-demand services " (" repairing: a kind of multicasting technology towards true video-on-demand service " publishes in Proc.ACMMultimedia ' 98, pp.191--200, Bristol, U.K., Sept.1998.) proposed a kind of repairing technique, this repairing technique is to support dynamic multicast VoD service.When using this technology, client device can be simultaneously from two channel data download streams, when new request arrives, by the immediate multicast stream of buffering in the customer equipment buffering area and this request time, begin to play the program the beginning part of the delay through repairing the channel download simultaneously, client's request just can be served immediately.Time difference (promptly 2 minutes) between the start-up time (as 9 o'clock) that a request time (as 9: 2) that its length service time of repairing channel only is new client and a nearest multicast are flowed.After the video data of repairing channel plays, then begin to play the multicast stream video data that is buffered.Use the time period of repairing technique to be called the repairing window between two multicast streams.Under the situation of start-up time of a known multicast video flowing, the next multicast stream (promptly selecting to repair the length w of window) of when dispatching the same video program is a key issue that influences systematic function.Yet, in above-mentioned mending course, the channel between server 2 and the network 1 just is used for repairing the video frequency program part that the client incurs loss through delay, and that is to say, existing repairing technique is only supported the order request admission control process, and interactivity is not then taked any corresponding assurance and repairing measure.
Support the customer interaction aspect about multicast VoD system, just (" using multicast transmission that a kind of telescopic interactive video order program service is provided " publishes in IEEE Journal of Selected Areas onCommunications at document " The use of multicast deliveryto provide a scalable and interactive video-on-demand service " at present, Vol.14, No.6, pp.1110--1122, Aug.1996.) proposing in increases a buffering area at customer equipment, be used to cushion the video flowing that has received, to support the mutual of finite length." The split and merge protocolfor interactive video-on-demand " (" the separation agreement on merging that is used for the interactive video program request " publishes in IEEEMultimedia, Oct.-Dec.1997, Pages 51-62.) then proposes a kind of interactive operation is separated merging with normal play method, used Multicast Channel and interactive channel to serve client's normal play and reciprocal process respectively.Though these two kinds of methods can solve the problem of the continuous interactive operation of client in the multi-broadcasting video ordering system, but, the former provides the time span of interactive operation to be confined to the ability of buffering area, the latter's efficiency of service is lower, required bandwidth is linear growth with mutual number, can't solve the order program service of the high hot programs of client's program request rate well, this also is a problem of being badly in need of solution in the multi-broadcasting video ordering system.
The purpose of this invention is to provide a kind of (Best EffortPatching of repairing as possible that supports the multi-broadcasting video ordering system interactivity, BEP) method, this method is mainly used in the order program service that solves the high hot programs of client's program request rate, realizes true VoD service to support the client.
The object of the present invention is achieved like this: a kind of method for repairing and mending as possible of supporting the multi-broadcasting video ordering system interactivity, and this method mainly solves the order program service of the high hot programs of client's program request rate, it is characterized in that: its course of work is divided into following three phases:
(1) the client requests access stage: at first, adopt traditional repairing technique,,, share nearest multicast stream by repairing the program The initial segment of incuring loss through delay to the client requests between two multicast streams in succession by dispatching a video frequency program multicast stream blanking time;
(2) the mutual stage: when the client carries out judging at first whether customer interaction has the mutual of picture transmission when mutual, as not, user interactions does not need allocated channel; Belonging to as customer interaction has the mutual of picture transmission, then when mutual time span is less than the time span of customer equipment buffering area support, does not need to distribute the repairing channel to the client; In case the customer interaction time span surpasses the time span that the customer equipment buffering area is supported, then server distributes one to repair channel support customer interaction to the client;
(3) merging phase: surpass in the customer interaction time span under the time span situation of customer equipment buffering area support, the client finishes its video flowing of mutual back and must merge in the regular multicast stream; If the client has used a repairing channel to carry out alternately, then immediate multicast stream is downloaded and cushioned to customer equipment on one side, continue to use simultaneously above-mentionedly to be used for mutual repairing channel and to begin to download and displaying video stream remedies gap between two streams of current customer interaction stream and multicast stream, flow to the merging that multicast is flowed alternately to finish from the expectation broadcast point; Otherwise server repairs the merging that channel is finished customer interaction stream and multicast stream for one of client's otherwise allocated, makes the client obtain real-time continuous interactive service, in this merging process, adopts a kind of dynamic merging method, to significantly improve combined efficiency.
The operating procedure of wherein said dynamic merging method is described below:
At first set a merging formation and have following data structure:
Struct?Mqueue{
Element*head; / * owner record pointer */
Int offset; / * formation shift time */
Int lifetime; / * formation repairing stream life span */
Int latime; The up-to-date client's of/* joining day */
}
In following algorithm: Q is for merging collection of queues; C is mutual client; N is a multicast stream sequence number; T is the time of advent of mutual client C; The operating procedure that then dynamically merges method is:
The 1st step: the shift time amount x that obtains mutual client C expectation broadcast point and multicast stream n broadcast point;
The 2nd step: choose some formation q0 in merging formation, this formation is that the time demand of its desired repairing channel reached the shortest merging formation after the repairing stream of mutual client C merged to wherein.The representation formula of this formation q0 is:
q0=Max q∈Q{Min{q.offset+q.lifetime-x-(t-q.latime),q.offset}
q.offset≤x<q.offset+q.lifetime-(t-q.latime)}
The 3rd step: as if finding above-mentioned formation q0, C is flowed in the repairing of mutual client C merge among the q0, promptly add the record of repairing stream C, and the information of modification q0 is as follows at formation q0 afterbody:
delta=t-q0.latime;q0.latime=t;
The life span of repairing stream C is changed to x-q0.offset;
If x>q0.lifetime-delta, then q0.lifetime=x;
Client C is earlier from repairing stream C downloading and playing video data, download the video data during also buffer queue q0 repairing is flowed simultaneously, through x-q0.offset after the time, play that formation q0 repairs data downloaded in the stream in the buffer area, and beginning is downloaded simultaneously and data among the n are flowed in the buffer memory multicast; Changeed for the 5th step.
The 4th step: as can not find above-mentioned formation q0, then newly-generated one merges formation, and the owner record of this formation is the information of the repairing stream C of mutual client C, and it is as follows that the information of formation q0 is set:
Q0.offset=x; Q0.lifetime=x; Q0.latime=t; Formation is repaired stream and is repairing stream C;
Client C flows C downloading and playing video data from repairing, and the data among download simultaneously and the buffer memory multicast stream n;
The 5th step: finish.
The main feature of (BEP) method of repairing as possible of support multi-broadcasting video ordering system interactivity of the present invention is: the repairing technique that will be mainly used in the service time-delay of eliminating in the multicast VoD system originally is extended for the continuous interactive operation of supporting client in the multi-broadcasting video ordering system, provides a kind of effective support method thereby realize true video-on-demand service for multi-broadcasting video ordering system; And, being used for supporting the merging process of mutual repairing stream and multicast stream to propose a kind of new dynamic merge algorithm, this algorithm can improve the combined efficiency of information flow significantly.
Further specify the course of work of the present invention, method step, feature and effect below in conjunction with accompanying drawing:
Fig. 1 is that the structure of the video on-demand system of use is at present formed schematic diagram.
Fig. 2 is the data flow state schematic diagram of the present multi-broadcasting video ordering system that uses.
Fig. 3 is the main flow chart of method for repairing and mending as possible of the present invention.
Fig. 4 is the sub-process figure in " alternately " of the present invention stage.
Fig. 5 is the sub-process figure in " merging " stage of the present invention.
Fig. 6 is customer equipment buffering area and interactive operation schematic diagram among the present invention.
Fig. 7 is used for the channel of forward direction when mutual and the schematic diagram of repairing the window relation for the present invention.
Fig. 8 is used for the channel of back when mutual and the schematic diagram of repairing the window relation for the present invention.
Fig. 9 is the dynamic merge algorithm schematic diagram of the present invention.
Referring to Fig. 3-Fig. 5, the present invention is a kind of method for repairing and mending as possible of supporting the multi-broadcasting video ordering system interactivity, and this method is mainly used in the order program service that solves the high hot programs of client's program request rate, and its course of work is divided into following three phases:
(1) the client requests access stage: at first, adopt traditional repairing technique,,, share nearest multicast stream by repairing the program The initial segment of incuring loss through delay to the client requests between two multicast streams in succession by dispatching a video frequency program multicast stream blanking time.
(2) the mutual stage: after the client is by the access service, just can carry out interactive operation at any time.Carry out when mutual the client, judge at first whether customer interaction has the mutual of picture transmission, as not, user interactions does not need allocated channel; Belonging to as customer interaction has the mutual of picture transmission, then when mutual time span is less than the time span of customer equipment buffering area support, does not need to distribute the repairing channel to the client; In case the customer interaction time span surpasses the time span that the customer equipment buffering area is supported, then server distributes one to repair channel support customer interaction to the client.
Introduce the job step of supporting customer interaction and merging phase in the method for repairing and mending as possible of the present invention below in detail.
Referring to customer interaction process sub-process figure shown in Figure 4, wherein interactive operation can be divided into the operation (as suspending, stopping F.F., rewinding) of no picture transmission and the operation (as searching for reverse search, slow motion forward) of picture transmission is arranged.In addition, whether greater than the normal transmission speed of video flowing, interactive operation can be divided into forward direction operation (F.F., search forward) and back according to playback rate in mutual to operation (time-out stops for reverse search, rewinding, slow motion).
When the client carries out when mutual, if mutual time span be less than the time span that the customer equipment buffering area supports (referring to shown in Figure 6 after mutual recovery point or claim mutual expectation broadcast point A to be positioned within the represented customer equipment buffering area of diagonal line hatches part wherein), then server does not need to distribute the repairing channel to the client, and promptly the client utilizes its equipment buffering area just can guarantee continuous interactive fully.In case the time span of customer interaction surpass the length that the customer equipment buffering area supports (referring to shown in Figure 6 after mutual recovery point or claim mutual expectation broadcast point C1 or C2 to be positioned at outside the represented customer equipment buffering area of diagonal line hatches part wherein), then server needs to distribute one to repair channel to the client, be used to support customer interaction and mutual after interactive stream and the multicast merging of flowing.Be divided into two kinds of situations again it is discussed respectively this moment:
The interactive operation of A, no picture transmission: when mutual expectation broadcast point is positioned at outside the customer equipment buffering area (being that the customer equipment buffering area can not guarantee continuous interactive fully), in reciprocal process, do not distribute the repairing channel.After finishing alternately, distribute one to repair channel for this client, use this interactive stream of repairing the channel client will be integrated in the multicast stream nearest with it by server.
Referring to Fig. 7, a client's former broadcast point is positioned at P0 among the multicast stream n, after using a forward direction interactive operation (as F.F.), the normal play point of multicast stream n becomes P (n), but client's mutual expectation broadcast point is to be positioned at multicast stream n-i and the broadcast point P (n-i) of n-i-1 and the A (i 〉=0) between the P (n-i-1).Attention: the time difference between multicast stream n and the n-i is i * w, and the sequence number of the multicast stream of back scheduling is greater than the sequence number of the multicast stream of scheduling earlier.In mutual, do not need to distribute the repairing channel to this client.And after finishing alternately, this video client stream will merge in its nearest multicast stream n-i-1, then server distributes one to repair channel for this client, the part that the client uses this repairing channel download and broadcast user interactions desired point A and multicast stream n-i-1 to differ, the video data among the n-i-1 is flowed in download and buffer memory multicast on the other hand, after repairing stream plays, then play the multicast stream video data that is buffered.The length of the repairing channel that such merging generally need be used is | P (n-i-1)-A|, this length correspondence of repairing channel the grid part among the multicast stream n-i-1 among Fig. 7.
For the back to interactive operation, referring to shown in Figure 8, it is to be positioned at multicast stream n+i and the broadcast point P (n+i) of n+i-1 and the A (i 〉=0) P (n+i-1) between of back in multicast stream n scheduling except mutual desired point, video client stream will merge in its nearest multicast stream n+i-1 after finishing alternately, server is for length service time of the repairing channel of this client's distribution | and outside P (n+i-1)-A|, all the other steps are consistent with the forward direction interactive operation.
B, the interactive operation of picture transmission is arranged: in case the customer equipment buffer stores demand that needs exceeds the ability of customer equipment buffering area alternately, server distribute one to repair channel will for this client, be used for alternately and merging phase.Mutual stage client uses the repairing channel of monopolizing to carry out interactive operation; And when merging phase, this repairing channel is used for the merging of interactive stream and multicast stream.
Referring to Fig. 7, a client uses a time to be the forward direction of t mutual (as search forward) among the multicast stream n, and the broadcast point of this customer interaction expectation is A, and the normal play point of multicast stream n then becomes P (n).The length of the repairing channel that the mutual stage uses is t-t0 (t>t0), here t0 does not need to repair the time span of passage client buffer district with regard to supported sweep forward, t0=dr/ (SP-1), dr is the length of the video flowing that will play of this customer equipment buffering area buffer memory when beginning alternately, and SP is an accelerated factor.
To interactive operation (as reverse search), referring to shown in Figure 8, if be t to the mutual time behind the client, customer interaction expectation broadcast point is A for the back, and the normal play point of multicast stream n becomes P (n).The length of the repairing channel that the mutual stage uses is t-t0 (t>t0), here t0 does not need to repair the time span of passage client buffer district with regard to supported sweep backward, t0=dr/ (SP+1), dr is the length of the video flowing of having play of customer equipment buffering area buffer memory when beginning alternately, and SP is an accelerated factor.
(3) merging phase: surpass in the customer interaction time span under the time span situation of customer equipment buffering area support, the client finishes its video flowing of mutual back and must merge in the regular multicast stream; If the client has used a repairing channel to carry out alternately, then immediate multicast stream is downloaded and cushioned to customer equipment on one side, continue to use simultaneously above-mentionedly to be used for mutual repairing channel and to begin to download and displaying video stream remedies gap between two streams of current customer interaction stream and multicast stream, flow to the merging that multicast is flowed alternately to finish from the expectation broadcast point; Otherwise server repairs the merging that channel is finished customer interaction stream and multicast stream for one of client's otherwise allocated, makes the client obtain real-time continuous interactive service, in this merging process, adopts a kind of dynamic merging method, to significantly improve combined efficiency.
The interactive operation merging process that picture transmission arranged in as possible method for repairing and mending of the present invention is identical with the merging process of the interactive operation of no picture transmission.Use dynamic merging method of the present invention, can improve combined efficiency.
Referring to shown in Figure 9, P (n) is the broadcast point of multicast stream n, is a (0<a<w, w is for repairing the time span of window) as if a mutual client A expectation broadcast point and multicast stream n broadcast point shift time, and this client need use the repairing channel to incorporate multicast stream n into.It repairs stream and is designated as stream A, divides expression with the lattice portion in the first trip in Fig. 9.The life span of this stream A is a, when merging is carried out, such as t 1After minute, other mutual clients' interactive stream also needs to merge among the multicast stream n.Suppose that some new mutual client B expectation broadcast points and the shift time of multicast stream broadcast point P (n) are b, if t 1Less than the life span a that repairs stream A, and t 1<2a-b then makes back mutual repairing stream (be designated as stream B, partly represent it with the oblique line of the second row downside in Fig. 9) share the grid part of stream A, and the time coexistence parts of two streams A, B just are to reduce the use that it repairs channel.In this case, stream A will be expanded, so that its life span is b, and the life span of stream B is set to b-a.This new client can be simultaneously from stream A and stream B foradownloaded video flow data, after playing stream B data, the video data of the stream A of this client B device plays buffer memory, and begin from multicast stream n, to download and the buffer memory video flowing, for after the assembling section of repairing client B plays, then play and from multicast stream n, download and the video flowing of buffer memory among the stream A.It should be noted that customer equipment only possesses the ability of downloading two streams simultaneously and playing a stream.So the merging of repairing stream can be proceeded down, and the user logging that is merged merges in the formation at one.
Consider a new mutual client's merging process now.Suppose that q is the merging formation of multicast stream n, the element of q (element) record adds repairing stream information wherein, the formation shift time (offset) of q is the shift time of its first user expectation broadcast point and multicast stream n broadcast point, the head of q (head) is recorded as first client who initially sets up this formation and repairs stream information, and the life span of q (lifetime) initially is changed to first client and repairs the life span of stream and may repair stream new client and add fashionable change.If t is up-to-date client's joining day (latime), then repair stream and add this formation as no other client, will after adding the life span of formation, t discharge.
As shown in Figure 9, when a new mutual client C wished to add the merging formation q of multicast stream n, known x was the expectation broadcast point of client C and the shift time of multicast stream n broadcast point, and be t+t the time of advent of client C 2If q.offset≤x<q.offset+q.lifetime-t 2, the repairing stream of client C (being designated as stream C) adds and merges formation; Otherwise the repairing stream of client C can not join formation q.
Add when merging formation at the repairing of client C stream, can be by two kinds of these formations of condition managing:
Situation 1: as x>q.lifetime-t 2The time, the life span that meaning formation q repairs stream (stream A) is not enough to merge stream C, so the life span of stream A must be expanded.After promptly flowing the C merging, the life span of stream C is changed to x-q.offset, and puts q.lifetime=x, q.latime=t+t 2The client at first plays the video data of stream C simultaneously from stream A and C foradownloaded video data, and after the time, the client begins to play the video data of stream A through x-q.offset, and from multicast stream n foradownloaded video data.In this situation, be q.offset+q.lifetime-t the service time of the savable repairing channel of dynamic merging method of the present invention 2-x.
Situation 2: as x≤q.lifetime-t 2The time, the life span that meaning formation q repairs stream (stream A) is enough to merge stream C, so the life span of stream A is not expanded.After promptly flowing the C merging, the life span of stream C is changed to x-q.offset, and puts q.latime=t+t 2, q.lifetime is constant.The client downloads consistent with situation 1 with the order of playing video data from stream A with stream C and multicast stream n.In this situation, be q.offset the service time of the savable repairing channel of dynamic merging method of the present invention.
If stream C can not be added in the existing merging formation, a new formation of being initiated as owner record by stream C is established, and the repairing stream of initial formation is exactly to flow C.Stream C will be integrated in the formation with the saving of maximum repairing channel owing to may there be a lot of merging formations while.
The operating procedure of dynamic merging method of the present invention is described below:
At first set a merging formation and have following data structure:
Struct?Mqueue{
Element*head; / * owner record pointer */
Int offset; / * formation shift time */
Int lifetime; / * formation repairing stream life span */
Int latime; The up-to-date client's of/* joining day */
}
In following algorithm: Q is for merging collection of queues; C is mutual client; N is a multicast stream sequence number; T is the time of advent of mutual client C; The operating procedure that then dynamically merges method is:
The 1st step: the shift time amount x that obtains mutual client C expectation broadcast point and multicast stream n broadcast point;
The 2nd step: choose some formation q0 in merging formation, this formation is that the time demand of its desired repairing channel reached the shortest merging formation after the repairing stream of mutual client C merged to wherein.The representation formula of this formation q0 is:
q0=Max q∈Q{Min{q.offset+q.lifetime-x-(t-q.latime),q.offset}|
q.offset≤x<q.offset+q.lifetime-(t-q.latime)}
The 3rd step: as if finding above-mentioned formation q0, C is flowed in the repairing of mutual client C merge among the q0, promptly add the record of repairing stream C, and the information of modification q0 is as follows at formation q0 afterbody:
delta=t-q0.latime;q0.latime=t;
The life span of repairing stream C is changed to x-q0.offset;
If x>q0.lifetime-delta, then q0.lifetime=x;
Client C is earlier from repairing stream C downloading and playing video data, download the video data during also buffer queue q0 repairing is flowed simultaneously, through x-q0.offset after the time, play that formation q0 repairs data downloaded in the stream in the buffer area, and beginning is downloaded simultaneously and data among the n are flowed in the buffer memory multicast; Changeed for the 5th step.
The 4th step: as can not find above-mentioned formation q0, then newly-generated one merges formation, and the owner record of this formation is the information of the repairing stream C of mutual client C, and it is as follows that the information of formation q0 is set:
Q0.offset=x; Q0.lifetime=x; Q0.latime=t; Formation is repaired stream and is repairing stream C;
Client C flows C downloading and playing video data from repairing, and the data among download simultaneously and the buffer memory multicast stream n;
The 5th step: finish.
The present invention has utilized computer to carry out the analogue simulation test, the result of test shows, method for repairing and mending as possible of the present invention significantly is better than " The split and merge protocol for interactive video-on-demand " and (publishes in IEEE Multimedia on performance, Oct.-Dec.1997, Pages 51-62.) interactive operation of introducing in separates the method that merges with normal play, also be better than proposing in " Providing unrestricted VCR capability in multicast video-on-demand systems " (publish in Proc.IEEE International Conference on MultimediaComputing and System ' 98, June-July 1998.) based on the improved separation of subscriber equipment buffering area merging method.

Claims (2)

1, a kind of method for repairing and mending as possible of supporting the multi-broadcasting video ordering system interactivity, this method mainly solves the order program service of the high hot programs of client's program request rate, it is characterized in that: its course of work is divided into following three phases:
(1) the client requests access stage: at first, adopt traditional repairing technique,,, share nearest multicast stream by repairing the program The initial segment of incuring loss through delay to the client requests between two multicast streams in succession by dispatching a video frequency program multicast stream blanking time;
(2) the mutual stage: when the client carries out judging at first whether customer interaction has the mutual of picture transmission when mutual, as not, user interactions does not need allocated channel; Belonging to as customer interaction has the mutual of picture transmission, then when mutual time span is less than the time span of customer equipment buffering area support, does not need to distribute the repairing channel to the client; In case the customer interaction time span surpasses the time span that the customer equipment buffering area is supported, then server distributes one to repair channel support customer interaction to the client;
(3) merging phase: surpass in the customer interaction time span under the time span situation of customer equipment buffering area support, the client finishes its video flowing of mutual back and must merge in the regular multicast stream; If the client has used a repairing channel to carry out alternately, then immediate multicast stream is downloaded and cushioned to customer equipment on one side, continue to use simultaneously above-mentionedly to be used for mutual repairing channel and to begin to download and displaying video stream remedies gap between two streams of current customer interaction stream and multicast stream, flow to the merging that multicast is flowed alternately to finish from the expectation broadcast point; Otherwise server repairs the merging that channel is finished customer interaction stream and multicast stream for one of client's otherwise allocated, makes the client obtain real-time continuous interactive service, in this merging process, adopts a kind of dynamic merging method, to significantly improve combined efficiency.
2, the method for repairing and mending as possible of support multi-broadcasting video ordering system interactivity as claimed in claim 1, it is characterized in that: the operating procedure of wherein said dynamic merging method is described below:
At first set a merging formation and have following data structure:
Struct?Mqueue{
Element*head; / * owner record pointer */
Int offset; / * formation shift time */
Int lifetime; / * formation repairing stream life span */
Int latime; The up-to-date client's of/* joining day */
}
In following algorithm: Q is for merging collection of queues; C is mutual client; N is a multicast stream sequence number; T is the time of advent of mutual client C; The operating procedure that then dynamically merges method is:
The 1st step: the shift time amount x that obtains mutual client C expectation broadcast point and multicast stream n broadcast point;
The 2nd step: choose some formation q0 in merging formation, this formation is that the time demand of its desired repairing channel reached the shortest merging formation after the repairing stream of mutual client C merged to wherein.The representation formula of this formation q0 is:
q0=Max q∈Q{Min{q.offset+q.lifetime-x-(t-q.latime),q.offset}|
q.offset≤x<q.offset+q.lifetime-(t-q.latime)}
The 3rd step: as if finding above-mentioned formation q0, C is flowed in the repairing of mutual client C merge among the q0, promptly add the record of repairing stream C, and the information of modification q0 is as follows at formation q0 afterbody:
delta=t-q0.latime;q0.latime=t;
The life span of repairing stream C is changed to x-q0.offset;
If x>q0.lifetime-delta, then q0.lifetime=x;
Client C is earlier from repairing stream C downloading and playing video data, download the video data during also buffer queue q0 repairing is flowed simultaneously, through x-q0.offset after the time, play that formation q0 repairs data downloaded in the stream in the buffer area, and beginning is downloaded simultaneously and data among the n are flowed in the buffer memory multicast; Changeed for the 5th step.
The 4th step: as can not find above-mentioned formation q0, then newly-generated one merges formation, and the owner record of this formation is the information of the repairing stream C of mutual client C, and it is as follows that the information of formation q0 is set:
Q0.offset=x; Q0.lifetime=x; Q0.latime=t; Formation is repaired stream and is repairing stream C;
Client C flows C downloading and playing video data from repairing, and the data among download simultaneously and the buffer memory multicast stream n;
The 5th step: finish.
CN 00134538 2000-12-11 2000-12-11 Patch method supporting multi-broadcasting video ordering system interactivity Expired - Fee Related CN1124742C (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN 00134538 CN1124742C (en) 2000-12-11 2000-12-11 Patch method supporting multi-broadcasting video ordering system interactivity

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN 00134538 CN1124742C (en) 2000-12-11 2000-12-11 Patch method supporting multi-broadcasting video ordering system interactivity

Publications (2)

Publication Number Publication Date
CN1296358A true CN1296358A (en) 2001-05-23
CN1124742C CN1124742C (en) 2003-10-15

Family

ID=4596261

Family Applications (1)

Application Number Title Priority Date Filing Date
CN 00134538 Expired - Fee Related CN1124742C (en) 2000-12-11 2000-12-11 Patch method supporting multi-broadcasting video ordering system interactivity

Country Status (1)

Country Link
CN (1) CN1124742C (en)

Cited By (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN100432965C (en) * 2005-03-11 2008-11-12 北京凯诚高清电子技术有限公司 Network player
CN101803379B (en) * 2007-08-06 2013-05-01 三星电子株式会社 Video on demand service method, video on demand receiver, and video on demand server
CN109348430A (en) * 2018-10-29 2019-02-15 电子科技大学 Multicasting schedule method towards the more content base station cells of multichannel
CN114124798A (en) * 2020-04-27 2022-03-01 慧与发展有限责任合伙企业 Multicast routing summarization

Cited By (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN100432965C (en) * 2005-03-11 2008-11-12 北京凯诚高清电子技术有限公司 Network player
CN101803379B (en) * 2007-08-06 2013-05-01 三星电子株式会社 Video on demand service method, video on demand receiver, and video on demand server
CN109348430A (en) * 2018-10-29 2019-02-15 电子科技大学 Multicasting schedule method towards the more content base station cells of multichannel
CN109348430B (en) * 2018-10-29 2020-05-12 电子科技大学 Multicast scheduling method for multi-channel multi-content base station cell
CN114124798A (en) * 2020-04-27 2022-03-01 慧与发展有限责任合伙企业 Multicast routing summarization

Also Published As

Publication number Publication date
CN1124742C (en) 2003-10-15

Similar Documents

Publication Publication Date Title
CN1244080C (en) Adaptive bandwidth system and method for broadcast data
CN1242625C (en) digital video broadcasting
US7523482B2 (en) Seamless digital channel changing
Gao et al. Threshold-based multicast for continuous media delivery
CN1372666A (en) Universal STB architectures and control method
CN1926867A (en) System and method providing enhanced features for streaming video-on-demand
JP5596669B2 (en) Content replacement method and apparatus for live works
CN1655609A (en) Method and system for recording videoconference data
CN101068336A (en) Coordinate connection stream media direct broadcasting system and device
CN1842160A (en) Rapid media channel changing mechanism and access network node comprising same
CN101444089A (en) Method and apparatus for maximizing 'last mile' bandwidth through non-real-time personal video recorder (PVR) transmission in internet protocol television (IPTV) systems
Wang et al. Wrap harmonic broadcasting and receiving scheme for popular video service
Ma et al. Best-effort patching for multicast true VoD service
CN1124742C (en) Patch method supporting multi-broadcasting video ordering system interactivity
Guan et al. A two-level patching scheme for video-on-demand delivery
JP3560556B2 (en) Delivery method of video contents by multicast video on demand
Ma et al. A new scheduling scheme for multicast true VoD service
Chen et al. Multiple videos broadcasting scheme for near video-on-demand services
Krunz et al. Efficient support for interactive scanning operations in MPEG-based video-on-demand systems
Xiang et al. Piecewise patching for time-shifted TV over HFC networks
Lee Channel folding-an algorithm to improve efficiency of multicast video-on-demand systems
Wu et al. A reverse-order scheduling scheme for broadcasting continuous multimedia data over a single channel
Psannis et al. Transmitting additional data of MPEG-2 compressed video to support interactive operations
Jeong et al. Simple architecture and performandce efficient reverse fast staggered brodadcasting scheme for video-on-demand systems
CN1622471A (en) Method for determining motion vector and macroblock type

Legal Events

Date Code Title Description
C10 Entry into substantive examination
SE01 Entry into force of request for substantive examination
C06 Publication
PB01 Publication
C14 Grant of patent or utility model
GR01 Patent grant
C19 Lapse of patent right due to non-payment of the annual fee
CF01 Termination of patent right due to non-payment of annual fee