CN1535536A - System for network data transmission - Google Patents

Abstract

This invention describes a new method and system for delivering data over a network to a large number of clients, which may be suitable for building large-scale Video-on-Demand (VOD) systems. In current VOD systems, the client may suffer from a long latency before starting to receive the requested data that is capable of providing sufficient interactive functions, or the reverse, without significantly increasing the network load. The method utilizes two groups of data streams, one responsible for minimizing latency while the other one provides the required interactive functions. In the anti-latency data group, uniform, or non-uniform or hierarchical staggered stream intervals may be used. The system being realized based on this invention may have a relatively small startup latency while users may enjoy most of the interactive functions that are typical of video recorders including fast-forward, forward-jump, and so on. Furthermore, this invention may also be able to maintain the number of data streams, and therefore the bandwidth, required.

Description

System in order to network data transmission

Invention field

The present invention makes a kind of method and system that relates to network transmission data, particularly transmits a large amount of repeating datas and gives a large number of users, for example VOD (Video-on-Demand) system.

Background of invention

Current VOD systems face several challenges.One of them is how to provide for example forward/backward and the interactive flexibly service of jump forward/backward to hundreds and thousands of ten thousand user.Simultaneously, when Internet resources are bandwidth when being limited, the burden that the service of this function can not emphasis network.Further, each client is all wished when the film selecting to play broadcast as quickly as possible.Current VOD system and its possible shortcoming are described below.

1. clocklike stream is similar to VOD (NVOD) at interval

The NVOD system is a kind of staggered multileaving of flowing by regular stream interval T (Fig. 1).These streams by diversification, and are distributed to the user with a kind of mechanism of diversification (for example: time division multi, frequency division is polynary, sign indicating number divides polynary, it is polynary or the like that wavelength divides) on the identical or different physical medium.Described distribution mechanism comprises point-to-point, point-to-multipoint and other modes.Each stream is clocklike resolved into small fragment under interval T, and these small fragments are denoted as 1,2,3 respectively ..., N.The information content is duplicated by all streams and is being carried by this N fragment and distributes to the user.Content is duplicated by each stream.Arrange such cross-current pattern by clocklike flowing at interval, make the user can receive the initial stand-by period of the information content at any time less than interval T.Certainly, in such system, can not provide any interaction to the user.If a User break information content promptly suspended broadcast, the user can not return to the same broadcast point when suspending just now once more, can only skip some contents and keep the continuation of multileaving stream and play.

2. irregular stream is accurate VOD (QVOD) at interval

QVOD is a kind of staggered multileaving stream with abnormal flow interval T (Fig. 2).These streams by diversification, and are distributed to the user with a kind of mechanism of diversification (for example: time division multi, frequency division is polynary, sign indicating number divides polynary, it is polynary or the like that wavelength divides) on the identical or different physical medium.Described distribution mechanism comprises point-to-point, point-to-multipoint and other modes.Unlike the stream existence at every moment of NVOD system, stream produces according to the customer requirements content in the QVOD system.User's demand is the bound and unified service of quilt stream i at the time interval Ti that determines, stream interval T 1, and T2 ... Ti ... be irregular.These streams (stream 1 arrives i etc.) are created when by customer requirements and are just deleted immediately after the content transmission finishes.Stream constantly produces under user's requirement.By using this cross-current of arranging through abnormal flow interval T i, the special group user who begins in interval T i is guaranteed received content in interval T i (initial wait).Same, in such system, can not provide any interaction to the user.If a User break information content promptly suspended broadcast, the user can not return to the same broadcast point when suspending just now once more, can only skip some contents and keep the continuation of multileaving stream and play.

3. distributing interactive network structure (DINA)

DINA system touch upon applicant's PCT application PCT/IB00/001857 and 001858 method and system of describing.In this DINA system, interaction function comprises skip forward/back, jumps forward/jump backward, put slowly and or the like a plurality of multileaving video data streams that cooperate a plurality of described interactive service contracts can be provided.Though interaction function can be provided to the user by the DINA system, if the initial wait of every user's request is reduced the burden that will increase network.This is by the stream interval determination of multileaving data flow.Generally speaking, the increase of the increase of data flow number and that offered load that is brought is along with stream minimizing at interval increases.

In NVOD and QVOD system, when user wants to watch content in the stream, will simply insert in many cross-currents, and share with first-class simultaneously with other users.Such scheduling is simple and efficient, and its problem is initial stand-by period that two aspects one are very big and user's ineffective activity.

For first difficulty, the user will take long to before demand is serviced and wait for the stream interval T, wait a few minutes or several hours possibly, and this stand-by period depend on that stream at interval.Though stream at interval may be very little, such as a few second, this will mean still that system's same content of having nothing for it but provides a large amount of stream.Required fluxion is

The length of R represent content, T representative stream at interval.Although the little initial stand-by period may cause higher transmission bandwidth and cost.The DINA system may face such problem.

Second kind of difficult problem is exactly that the user watches multipoint transmission stream can not interrupt stream freely, because also have other user watching with first-class.Therefore, NVOD and QVOD system can not allow the interaction of similar VCR, for example: suspend, recover, reset, put F.F. or the like slowly.These systems hinder the introducing and the development of the interactive medium of new model.In the last few years, a kind ofly provide the popular approach of the interactive operation of similar VCR to provide a kind of set-top box to NVOD and QVOD system, this set-top box provides memory cell, and the content of broadcasting all is stored in the memory.Such system's shortcoming is higher system cost and operational problem, such as storage failure and problem of management.

Above content does not provide solution for existing VOD system.Particularly current VOD system can not offer client/user with desirable interaction function, and realizes short zero-time with the offered load of minimum.Therefore, a purpose for addressing the above problem of the present invention that Here it is.Bottom line, the objective of the invention is provides a kind of useful selection for the public.

Summary of the invention

Therefore, in the broadest sense, the invention provides a kind of method and a kind of corresponding system and be used on network, transmitting data, and the data of an initial stand-by period to user's transmission are arranged at least one client.The included method of the present invention has following a few step:

-generate at least one anti-data flow of waiting for, comprise the data leading part that at least one is received by the client;

-generating at least one interactive data stream, it comprises that at least one remainder data can merge the user after receiving that at least a portion is counter to wait for data flow.

Anti-data flow and the interactive data stream waited for can be generated by at least one anti-waiting signal maker and at least one interactive signal maker respectively.

The present invention provides a kind of method and corresponding system to be used for transmitting data by at least one client of network item on the other hand, comprise partition data fragment step, this step is divided into k data segment that comprises a head part and a portion to data, and this head part comprises the last data of carrying out the sheet segment trailer of a part, so that client merges it when receiving k data fragment.

K data fragment generated by signal generator.

The present invention provides a kind of method and corresponding system to be used for transmitting data by a network at least one client on the other hand, and the stand-by period of this client is used for initialization and sends the data of client to, may further comprise the steps:

-generate at least one instead to wait for that data flow comprises at least one leading part, to receive data used for client;

The leading part data of-client of looking ahead are as prefetch data;

-generate at least one interactive data stream, be included as that client provides at least one remainder so that merge with leading part.

This invention also provides a kind of method and corresponding system to be used for transferring data at least one user on network to comprise the method that this produces a plurality of anti-wait data flow, wherein should anti-wait for that data flow comprised:

-one lead data stream, the leading fragment that comprises the leading part of at least one these data constantly repeats in this lead data stream; And

-a plurality of end data streams, each this end data stream:

The remainder that contains the leading part of these data; And

In this end data stream, be repeated continuously, and wherein each continuous end data stream is staggered by an anti-latency period.

The present invention also provides a kind of method and a corresponding system to be used for transmitting data by network at least one client.This method comprises and generates M the anti-data flow of waiting for from 1 to M, a m ^ThAnti-wait data flow has F _mIndividual fragment, F _mAnd m ^ThBe fibonacci number; And F _mIndividual fragment is at m ^ThThe anti-wait in the data flow constantly repeated.

Another aspect of the present invention provides a kind of method and a corresponding system to be used for transmitting data by network at least one client.Data are divided into K fragment, and wherein each fragment is transmitted in network needs with a time T.Method comprises the individual anti-data flow of waiting for of generation M, and wherein each data flow comprises 1 to K anti-wait data slot, and the anti-data slot of waiting for is fitted in M the anti-wait data flow, to such an extent as to instead waiting for k in the data flow ^ThLeading fragment repeats down with anti-latency period≤kT.

The present invention more provides a kind of method to be used for receiving by network the data of at least one client.The data of transmission are divided into k fragment, and each fragment need be transmitted in network with time T.Data are divided into two group data streams, and the anti-data flow of waiting for comprises M anti-wait data flow, and interactive data stream comprises N interactive data stream.Receive data and comprise following step:

Data request of-generation.Request can be proposed by a processor of client;

-client is connected to ground data flow such as M is anti-and receives data each anti-wait in data flow of M.Client or receiver can connect the anti-data flow of waiting for by a connector.

The present invention also provides a kind of method and corresponding system to be used for receiving by network the data of at least one client, described data comprise a leading part and a remainder, and remainder is transmitted at least one interactive data stream and comprises the steps:

-look ahead leading part as prefetch data in client, fetch data and deposit in the buffer with client;

-by processor remainder and prefetch data are merged.

Optionally, instead wait for data flow, also can generate by the request of client except can constantly generating.

Further embodiment of above-mentioned each method and system and option will be corresponding to following each joint explanations, read this explanation after, be obvious for those skilled in the art.

Description of drawings

Preferred embodiment of the present invention will describe in detail described in figure below:

Fig. 1 NVOD system data flow structure chart.

Fig. 2 QVOD system data flow structure chart.

The overall system structure figure of Fig. 3 data communication system of the present invention.

The data flow layout plan of Fig. 4 data communication system structure 1 of the present invention.

The data flow layout plan of Fig. 5 data communication system structure 2 of the present invention.

The data flow layout plan of Fig. 6 data communication system structure 3 of the present invention.Notice that group II data flow is arranged and the difference of the 4th, 5 figure.

Another group I data flow layout plan of Fig. 7 structure 3.

The data flow layout plan of the group I of the structure 4 of Fig. 8 data communication system of the present invention.

The another kind of data flow layout plan of the group I of the structure 4 of Fig. 9 data communication system of the present invention.

The data flow layout plan of Figure 10 data communication system structure 5 of the present invention.The special data flow of group I shown in the figure is arranged and is combined structure 1 and 3.

The system construction drawing of Figure 11 data communication system multileaving of the present invention data flow maker.

The structure chart of the receiver of Figure 12 data transmission system of the present invention.

The comparison diagram of Figure 13 local storage and transmission bandwidth.

Optional " request " method figure of Figure 14 structure 1.

Optional " request " method figure of Figure 15 structure 2.

Optional " request " method figure of Figure 16 structure 3.

Embodiment

The present invention describes in detail by the example in the legend.Though some noun is understood for those skilled in the art, below table 1 shown abbreviation or label and the meaning thereof that in specification, occurs.

Abbreviation/label	Meaning
		????VOD	Video on-demand system
????NVOD	Approximate video on-demand system
		????QVOD	Pseudo video-on-demand system
????DINA	Distributing interactive network structure is as the method and system in PCT application PCT/IB00/001857 and 001858 description

????VCR	Video cartridge
		????STB	Set-top box
????DDVR	Nothing is coiled digital video recorder, system client
		????IVOD	Video on-demand system immediately, the systematic name that the present invention is possible
????J	Indivedual anti-data slice hop counts (structure 4) of waiting for the anti-wait data slice hop count (structure 1 to 3) in the data flow or will transmitting the data leading part
		????K	Transmit the data slice hop count of data
????M	(group I) anti-data flow of waiting for
		????N	(group II) interactive data stream
????Q	The data volume that tendency to develop is sent
		????R	By the needed time of network transmission data Q
????S	Data volume in each data slot
		????T	Transmit the needed time of each data slot by network
????A	The quantity of data flow in group I (1)
		????C	The number of data slot in group's 1 (1) data flow
????B	The quantity of data flow in group I (2)
		????D	The number of data slot in group's 1 (2) data flow
????E	The data slice hop count of thick hop interval

Employed abbreviation of table 1 and label

Though below all be to describe the video data that is used for transmitting, other multi-form data also can transmit in system of the present invention, for example, voice data or software program, or their mixture.For example, the present invention can be as the operating system software of demand exploitation by a large number of users on the network.Further, the present invention can be used for the data that a data communication system is controlled a large amount of repeated contents, for example the 3D target that still repeats of the many complexity of control in a computer video bus.Even the present invention can not be restricted to and only transmit digital data.

The present invention, multithread multileaving technology is used to overcome current as the difficult problem in the VOD system described in " background technology ".By using this technology, the user is allowed to similar VCR interaction and not be used in set-top box interpolation memory cell and need not store down the user in daily all the elements of watching.

Fig. 3 has shown the structure of system.Multileaving stream is produced by the multicast services unit.Stream on physical medium by diversification and be assigned to terminal use in the distributed network.Each terminal use, a set-top box (STB) is arranged, for example DDVR selects most stream for processing.By arranging that being the content of carrying by stream is a kind of mode (just as Fig. 4-10) of hope, when initial wait when the user provides interaction function can be reduced.DDVR needs enough bandwidth, and buffer area and disposal ability are handled multithread.

Data communication system of the present invention is called as the IVOD system and the NVOD system is alike.Certainly, there are to descend the different of some in IVOD with the NVOD system:

1. content is how to be placed on the cross-current,

2. how cross-current produces,

3.DDVR be how to select and handle most cross-currents and come reply content.

More than be used for " interlocking " of whole specification describedly being meant that each data flow began to transmit data conditions in the different time.Therefore, two frames of the data flow of two vicinities, the frame is here represented repetitive in each data flow, is separated by the time interval.

In the broadest sense, data transmission method and system can be described to provide the group I of two population group data streams, group II.Group I is a data flow, can be called as anti-wait data flow, can be used to reduce the initial stand-by period of transmission desired data.Group I data flow is generated by at least one anti-waiting signal maker.Group II data flow can be referred to as interactive data stream, is used to the user that required interaction function is provided.Group II data flow is generated by at least one interactive signal maker.But the interaction function application reference people's who is provided by group II PCT application PCT/IB00/001857 and 001858, wherein content is incorporated this case into to do reference data.The operation of interaction function is not that the description content of asking among the present invention here just not is described in further detail.

The IVOD system operation uses the following example can be by best explanation: each example all is available IVOD system, but they locate all to have difference detailed under different balances.These examples only are intended to show that the operation principle of IVOD system is not to describe unique working method of IVOD system.

In ensuing example, total Q the data total transmission time of the content that is transmitted is R.Content, such as be film.Q data are broken down into k data fragment, and wherein the data volume of each data slot is S.Each data slot is T by the time of network.Q and S are unit with the Mbytes, and R and T are unit with time.Consideration for convenience, Q data fragment marked respectively from 1 to K.Therefore $K=\frac{R}{T}.$ Q data can be divided into leading part and remainder.In many cases, the anti-data flow of waiting for of group I only comprises leading part.Group's II interactive data stream comprises the whole of remainder or Q data, and this is selected when the design system by the system manager.

Should be noted that if the individual data fragment comprises different data volumes suppose that they all need time T to transmit, native system still can be worked.This will be to realize by the transmission rate of controlling the individual data fragment.Certainly, described other data slot preferably has uniform data amount S, because it is convenient to become on engineering like this.On the other hand, it is more difficult than having the different transmission times to make data slot that unified data volume S is arranged in native system.

Though the method and system of a kind of data set of the following transmission of narrating (for example film) is a kind of technology described above, also can substitute and be used for transmitting some data set, this depends on for example restriction of bandwidth.

A. Double fluid IVOD system (structure 1)

The feature of this simplest IVOD system is the double fluid operation.Double fluid is meant that each user can receive maximum two multileaving data flow at any time.In most of the time, the user receives only a data flow.

Data slot is placed on the cross-current as shown in the figure.Two flock-mate cross-flows are arranged.I is counter waits for that each frame has J data fragment on the data flow for the group.T is that anti-latency period also is the upper bound of the initial stand-by period of IVOD system.Each anti-wait data flow staggers at each anti-latency period T, though anti-latency period can be configured to be different from arbitrarily the value of T.

In this special example, J be 16 and T be 30 seconds.So the frame in the data flow of group I repeated they oneself after promptly 8 minutes JT time.Total total M stream in group I.

N interactive data stream is arranged in group II interactive data stream, and they staggered an interactive time interval.Though the interactive time interval can be arranged to be worth arbitrarily, for the convenient interactive time interval on the engineering is preferably JT (for example being 8 minutes in this example).The length of supposing content is R (R is 120 minutes here), and is total in group II so at least $\frac{R}{\mathrm{JT}}=15$ Individual stream.The load that the value of N may will emphasis network there is no need greater than this example but this.

When the user at time t ₁View content will be selected a stream (stream I at the DDVR of client from group I _i) and in group II, select a stream (stream II _j) insert.When client is connected to I _iAnd/or II _j, data flow will be handled by DDVR, and data slot is got up by the fragment sequence buffer memory.Cross-current with effective crowd of I of stream interval T makes the minimum initial stand-by period equal T.

Optionally, user or client receive only stream I _iAnd waiting for that all data at leading part are received begins to receive stream II after finishing again _jSealed the stream of group I as DDVR after, it will seek suitable group II immediately to insert.In this special example, the data flow of each group II preferably only comprises the remainder of Q data.

The method of incoming data stream can find in the DINA technology.After access was finished, DDVR no longer needed the stream of crowd I, the dependence stream II that DDVR is unique _jCarry out following watching.This just makes the minimized optimal scheme of network burden.

Should be noted that the user can begin following interaction request after system start-up, comprise and suspending and recovery, fall back, put slowly.Certainly, jump forward and backward and be limited in stream among crowd I or the stream among the group II (at any special time).This problem can be solved by the fine tuning system parameters.For example, the data flow of group I can comprise few people and be ready the content seen, such as the copyright announcement.

The quantity altogether that flows in this IVOD system is System configuration is under the perfect condition $M=N=J=\sqrt{\frac{R}{T}},$ And provide total number of best stream

B. Double fluid IVOD system (structure 2)

The still double fluid operation of the feature of second kind of IVOD system example.Beginning, it is the fragment of T that content is divided into K unified length, these fragments are labeled as 1 respectively to K.As shown in Figure 5, described fragment is placed on the cross-current.

In this structure, two groups of cross-currents are arranged equally.On each frame in the anti-wait data flow of group I J fragment arranged all, and this frame repeats in each stream.In this example, J still be chosen as 16 and T be 30 seconds.This structure is characterised in that a data flow among crowd I, and stream I1 only comprises fragment 1 in all time slots.Stream I2 to I9 comprises fragment 2 to 17.We can say that also fragment 1 can be regarded the lead data stream of the leading fragment that comprises leading part as.Fragment 2 to 9 can be regarded the data flow that majority is finished as, and it comprises J the remaining leading part of fragment.The stream of group I can be selected blanking time arbitrarily, but because preferably is arranged to T as the reason in the structure 1.Stream I2 to I9 repeats oneself (for example 8 minutes in this example) behind time JT.

In this specific example, in order to merge lead data stream and end data stream smoothly, group I should contain altogether at least $M=\frac{\mathrm{<figure-callout\; id="2"\; label="J"\; filenames="A0281476500511.png,A0281476500541.png"\; state="\{\{state\}\}">J</figure-callout>}}{2}+1$ Individual stream.M can less than this number but this will cause unnecessary network burden.This part should be system manager's a design option.

Though the leading part fragment only contains a lead-in cable in Fig. 5, must know that this lead data stream can contain the lead-in cable above, as section 1 to 4.Then above-mentioned 4 times of can be considered T about the counter condition of waiting for data flow of group I of second kind of structure.Simultaneously, this change can not influence the interactive data stream of crowd II.In this case, the user may experience a bigger initial stand-by period.On the other hand, in fact M can reduce, and can be $M=\frac{\mathrm{<figure-callout\; id="8"\; label="J"\; filenames="A0281476500641.png,A0281476500651.png"\; state="\{\{state\}\}">J</figure-callout>}}{8}+1,$ With smooth merging lead data stream and end data stream.Though this may not be that we are desirable, this should be the option of system manager's decision when design.

For group II stream, the arrangement of stream can be identical with previous example with tissue, and identical setting and changing also can be used in this example.

When a user in time t _iThe beginning view content, the DDVR that is positioned at client will be linked on the stream I1 immediately.Because lead-in cable repeats every time T, so the upper bound of initial stand-by period also is T.After the total data, DDVR also will insert group one of them of I end data stream immediately in receiving lead-in cable.Here be I2 to I9.For convenience of explanation, select stream I _iAnother kind of replacement scheme is: if the permission of DDVR ability, DDVR is one of them of access lead data flow and group I end data stream simultaneously.In the latter's the situation, two streams get up each fragment buffer by the DDVR processing and with the fragment sequence number.

DDVR also will insert wherein first-class (being stream II2 here) of group II.The time of DDVR access group II stream is selected constantly:

1. immediately following after the access lead data flow promptly flows I1

2. immediately following after inserting an end stream

3. after DDVR is received leading part content in group I data flow fully

Generally speaking, DDVR should be at least and then in group I stream all Data Receiving finish or by inserting one of them that group II flows after the client terminal playing.

Total data in the group I data flow all is received and cushions, and DDVR flows one of them merging with group II again.This folding is described in the DINA technology.After the merging, can no longer need the stream of this group I (promptly to flow I _i), and DDVR can only rely on group II stream to finish watching subsequently, to save bandwidth.Described in the DINA technology, the interaction request that receives any permission at any time can be satisfied as previous.

Stream adds up in the IVOD system Under perfect condition $N=\frac{R}{\mathrm{JT}},$ Given optimum structure is $J=\sqrt{2K}+1=\sqrt{\frac{2\mathrm{<figure-callout\; id="1"\; label="R\; T\; +"\; filenames="A0281476500511.png,A0281476500541.png"\; state="\{\{state\}\}">R</figure-callout>}}{T}}+1.$

C. Double fluid IVOD system (structure 3)

The 3rd its feature of embodiment of IVOD system also is a kind of double fluid operation, and its fragment is arranged in the hierarchy type periodic frame structure, and wherein the size of frame depends on fibonacci number.This content is split into K fragment with regular length T once more, and fragment marks with 1 to N respectively.As shown in Figure 6, these fragments are placed on the cross-current.Altogether by the cross-current of two groups.

In this structure, group I data flow contains the leading part data and has J fragment.Must be noted that use in this J value and structure 1 and the structure 2 slightly different.Total M group's I data flow also is labeled as 1 to M.To each group I data flow I _m, wherein the m unlabeled data flows the integer of number, and the given frame period is F _m, F wherein _mBe m fibonacci number.Several fibonacci numbers of beginning are shown in the 2nd table.Fibonacci number has F _Y=F _Y-1+ F _Y-2Character, wherein y be one by 3 the beginning integers.Group I data flow is set at T as isostructure 1 and structure 2 at interval.In this example, have 12 group I data flow.For group II data flow, the arrangement of data flow is similar with aforesaid embodiment to tissue, but for the ease of illustrating, group II data flow is by fragment 81 beginnings.

????j	????1	????2	????3	????4	????5	????6	????7	????8	????9	????10	????11	????12
													????Fj	????1	????2	????3	????5	????8	????13	????21	????34	????55	????89	????144	????233

Table 2 fibonacci number

Although have many variations, its operation principle with reference to the following stated can be best explanation.When a user in time T _iThe beginning view content, the DDVR that is positioned at client will be linked on two the data flow I1 and I2 of crowd I immediately.The fragment 1 of data flow I1 and the fragment 2 of data flow I2 or fragment 3, these two data fragments all are buffered.This moment, buffer area had two fragments, and the frame length of data flow I2 is 2, used the method described in the DINA technology, and data flow I2 can be merged smoothly.So the upper bound of initial stand-by period is T.After fragment 1 was received, DDVR was with incoming data stream I2 and I3.Because of having only two fragments among the data flow I2, fragment 3 becomes available if not being cushioned after and then fragment 2 is finished on data flow I2 exactly when receiving fragment 2.After both all were received and finish in fragment 2 and fragment 3, DDVR was with incoming data stream 3 and 4, and this program continues as previously described.Two data flow are handled by DDVR and extra fragment also relies on their sequence number to cushion.

In above-mentioned discussion,, be T to such an extent as to make the stand-by period upper bound for initial film hypothesis DDVR connects the 1st data flow and the 2nd data flow.Yet if the user wishes that he can select to insert earlier m and m+1 data flow, wherein m is the Any Digit greater than 1.This moment, the user still can view content, but may be perplexed by the bigger stand-by period.Some user may prefer like this, and for example he may wish to skip the first few minutes of film.

Further, as structure 2, each data slot transmits the content that comprises more than a described K data fragment as shown in Figure 6.For example, in fact each data block shown in Figure 6 comprises 5 data fragments.Then above-mentionedly can be considered 5 times of T about the counter time conditions of waiting for data flow of group I of the third structure, this variation does not have influence on the interactive data stream of crowd II.In this example, the user may be subjected to the misery brought because of the long startup stand-by period.

As optional method, m is not must be since 1 place, if the user can accept to start for a long time to wait for and the data adjustment.For example, system management can be removed among Fig. 6 top 4 data flow among the group I, and under the situation of software transmission, such arrangement is not allowed to, and perhaps the user can not receive complete software in addition.But this can be accepted under the situation of video transmission, if can be accepted by the copyright owner the modification of video.

Via according to fibonacci number F _mSet up the cycle of the frame of this stream, at stream I _M-1After being received, the F that DDVR should cushion _m=F _M-1+ F _M-2Individual time slot.Use as the DINA technology described in the merging method, owing to data flow I _mThe size of frame just in time is F _m, data flow I _M-1Data flow I can be merged to smoothly _m

It should be noted that because the arrangement of dual data stream after receiving m fragment, just has m fragment to be cushioned.In case the segments that is cushioned surpasses group II data flow size at interval, DDVR begins to merge on group II data flow, can save bandwidth (in the case, 8 minutes group II data flow need 80 fragments at interval) so at least.After the merging, can no longer need this group I stream (promptly to flow I _i), and DDVR can only depend on group II stream to finish watching subsequently, to save bandwidth.Described in the DINA technology, the interaction request of any permission of Jie Shouing at any time all can be satisfied as previous.

Do not have best parameter in this in the structure.In order to save bandwidth, should there be group II data flow.Yet, according to data volume that DDVR received and cushioned what and decide, the user can only enjoy limited interaction function.Specifically, the user can only use time-out, recover, falls back, puts slowly and jump backward, but the function that can not use F.F. and jump forward.

The number M of required group I data flow is by the decision of group II data fluxion, group II data fluxion then according to the difference of each system by artificial decision.A given initial stand-by period T, the required data flow sum of this IVOD system can determine from the table lookup required frame size that contains relevant fibonacci number.For merging indivedual group I data flow smoothly, minimal data stream sum is necessary for M to make $F_M\&GreaterEqual;\frac{2K}{N}.$ M can count less than this but do the phenomenon that the military order user feels " LOF " like this.M can count but do like this and can produce unnecessary network burden greater than this.This part should be left the design option of system manager's decision for.

Use this technology, be spaced apart 8 minutes then initial stand-by period T in group II stream and can be low to moderate 6 seconds (average out to 3 seconds).For a content of two hours, required data flow sum can be low to moderate 26.

The mode that another population I data flow is arranged as shown in Figure 7.Attention is after data flow 4, and the frame structure of data flow is only followed the fibonacci number sequence.

D. Multithread IVOD system (structure 4)

Aforementioned three embodiment show several possible execution mode of double-current IVOD system.In fact, many other possible execution modes are arranged in the IVOD system, the maximum fluxion that must insert simultaneously and handle according to the DDVR of fragment arrangements different in the different data flow and user terminal in every and deciding.Aforementioned three embodiment ratios are easier to understand and realize, are not the best but make its used fluxion for the restriction that at most only can insert and handle two streams any preset time.In present this structure, be used for illustrating a kind of multithread IVOD system of preferred number stream.

Be to suppose that all streams that carry content are all received and handle and realize by terminal use DDVR in this structure.Fig. 8 shows the rise junior three ten the sections possible a kind of optimal layout mode of method in variant stream based on harmonic progression.Each section be labeled as 1,2,3 ..., by that analogy.Under the situation of only using best fluxion, guarantee that the abundant and necessary condition of the initial stand-by period upper bound in a time slot interval is: the layout of section must satisfy, to all j values of 1 to J, section j (being j the section that leading part is counted by beginning) must repeat in every j time slot or less time.For example, for making the initial stand-by period upper bound within an interval T anti-the waiting period, section 1 must repeat at all time slots.Therefore having a stream all only is made up of section 1.Therefore receive after first section in order to make, second section can get immediately, and section 2 must repeat at each time slot.In like manner, section 3 must repeat at per three time slots, and section j must repeat at every j time slot.For j＞1, section j can have than requiring also high repetition rate.The waiting period that promptly j section being can be with one anti-the time interval≤jT repeats.Notice that " anti-waiting period the time interval " speech definition in structure 4 is different with the definition in structure 1 to 3.

Because we suppose that all streams are all inserted and handle by DDVR, go up unimportant so which stream each section is placed in.Each section is by the DDVR buffering and rearrange suitable order.The time slot of Fig. 9 empty can comprise any data or even keep blank.

As isostructure 3, this structure there is no optimal parameter.If desire is saved bandwidth, then should there be group II data flow.Yet, according to data volume that DDVR received and cushioned what and decide, the user can only enjoy limited interaction function.This may not be gratifying situation.Required group I data flow number M is by the decision of group II data flow number, and group II data flow number is then complied with various system factors with artificial decision.Carrying J the required stream sum M of time slot data can be by adding harmonic progression feasible by 1 to J $M\&GreaterEqual;{\mathrm{\&Sigma;}}_{j=1}^{j=J}\left(\frac{1}{j}\right)$ Obtain.When J was big number, this approximated γ+ln (J) greatly, and wherein γ is Euler's constant (≈ 0.5772K).Although J can be made as greater than Any number of being wanted, for the convenience on the engineering, the order $J=\frac{K}{N}$ Preferable, it is the data hop count in the interactive time interval.This by time slot of initial stand-by period to one of constraint at interval with the best fluxion of interior palpus.

Further, as situation in structure 2 and 3, transmit the content that comprises more than a described K data fragment at each data slot shown in Fig. 8.For instance, each data block as shown in Figure 8 all comprises 10 data fragments.Then above-mentionedly can be considered 10 times of T about the counter time conditions of waiting for data flow of group I of the 4th kind of structure, this variation does not have influence on the interactive data stream of crowd II.In this example, the user may be subjected to the misery brought because of the long startup stand-by period.

Equally, optionally, if the user can stand the long startup stand-by period, j may be not necessarily will be since 1 but from greater than 1 value.For instance, system management can be removed first three data stream among crowd I in Fig. 8.When transmitting software, be not allow such arrangement and layout, otherwise the user can not receive complete software.Certainly, when video Data Transmission, if the copyright owner allows to transmit such finishing video data, the method for such arrangement is can be received.

Optionally, in the example 5 j may be not necessarily will be since 1 but from greater than 1 value.Certainly, this only means that first data slot is being repeated every 5T rather than T anti-the wait at interval in Fig. 8, and ensuing j data fragment is repeated (5+j) T anti-the wait at interval.This selection should be considered to a technology in this specification.

Based on this best multithread condition, stream is divided into two groups once more, and group I and group II are to produce an IVOD system.The fragment arrangement of group I stream as shown in Figure 8.The fragment arrangement of group II stream is consistent with the fragment arrangement of group II stream among the arbitrary figure of the 4th to 6 figure.Watch request when a user sends one, all groups I stream should be received and handle by DDVR.In addition, a suitable group II stream also should be access in and handle.This allows group's I stream (m of a beginning fragment is positioned over this) successfully to merge to a single group II stream.Another kind of scheme is for waiting until that just inserting cogroup II after all data of leading part contained in the group I stream receive by client DDVR flows.

After a group II stream interval (this value deliberately is set as JT once more in this case), all groups I stream just can no longer need, and the user only needs a single group II stream can continue rating.The same with precedent, by using many streams of group II, in case system comes into operation, the user can send any admissible interactive request, comprises suspending and recovering, fall back, reach and put slowly.

As isostructure 3, as previously explained, be that to set up an IVOD system be possible on the basis fully with group I stream.So, fluxion can reduce and minimize the startup stand-by period.Yet the user of this kind system may be subject to limited interaction function, as discussing in the structure 3.Moreover the buffer size of DDVR must be big as whole data, and to present structure, the demand of DDVR disposal ability is bigger.For which kind of system of configuration is the option of waiting until ISP's decision.

Moreover should be noted that the Fibonacci that this kind multithread arrangement can be used to replace in the structure 4 flows sequence (group I stream) with the required stream number of further reduction.Condition is the data that DDVR must have enough buffering areas and disposal ability to receive with buffering and processing.The 3rd tabular in next joint goes out some result of all various structures.

Be depicted as a kind of non-optimization multithread arrangement of logarithm stream technology as the 9th figure.

E. Mix two-two/many-double-current IVOD system (structure 5)

Structure 3 and structure 4 showed that a kind of and structure 1 and structure 2 are compared and used suitable fluxion but have the extremely short IVOD system that starts the stand-by period.Yet structure 1 or structure 2 also has the unexistent advantage of structure 3 or structure 4 one simultaneously, and their allow in first stream interlude, allow exactly from flowing to the thick jump of stream, and structure 3 or structure 4 can't be accomplished.In actual life, the first few minutes in a data source contains many headers and information usually, and many users may want with skipping.Therefore, it is significant providing the limited at least skip capability of user.

By integrated structure 1 or structure 2 and structure 3 or structure 4,, still can create a kind of IVOD system with limit skip capability even without the help of an outside unicast stream.The cross-current of three groups closes in this IVOD system, is crowd I (1) and I (2).Group I (1) data flow contains the data flow that adds up to A is responsible for distributing the data with C section.Similarly, group I (2) data flow contains the data flow that adds up to B is responsible for distributing the data with D section, and each stream in its B data flow staggers with a thick hop interval.In this thick hop interval E section arranged.

Consider a concrete example, suppose that clip size T is 6 seconds.Order group I (1) contains just like structure 3 described preceding 7 Fibonaccis streams.Order group I (2) contains just like structure 1 described 8 group I stream, transmits fragment 11 to 90, and has the cross-current interval of 10 fragments.Noticing that group I (2) can contain data slot 1 to 90, is unnecessary although may it seems.Therefore the frame period of group I (2) stream is 80 fragments or 8 minutes, and this it allows user to be connected at DDVR to carry out a thick interactive operation that jumps in group I data flow for the thick frame period of jumping.The group II stream of structure 5 is identical with the group II stream of other structure.In this particular case, each group II stream is begun until whole ED by fragment 1.The layout of this stream and fragment as shown in figure 10.

The hierarchy type arrangement of planting stream and fragment thus as can be seen, the user can begin and start the stand-by period at any time is a fragment (being 6 seconds in this example).Moreover when DDVR is connected in crowd I stream, the user can do thick the jump any time in start cycle.As preceding a kind of structure, it is preferable to be defined as first group II stream time within (being the time point of 0 minute time point to 9 minute) at interval start cycle.Each thick jump was separated by 1 minute, and this was determined by the thick jump frame period.So the user can utilize this kind layout to skip header.To the particular example of Figure 10, keep one the two needed stream of hour data to add up to 30.

Although Figure 10 only is presented at the combination of group structure of I data flow 1 and structure 3, concerning those skilled in the art, following combination obviously also is feasible:

A. structure 4 and 1

B. structure 3 and 2

C. structure 4 and 2

Required group I (1) data flow number, i.e. A can be by E is made as in structure 3 and structure 4 Decide.Just, in group I (1),, then should there be A data flow to make F among the group I (1) if use structure 3 _A〉=2E.If use structure 4, then $A\&GreaterEqual;{\mathrm{\&Sigma;}}_{c=1}^{c=C}\frac{1}{C}.$ As isostructure 4, the data segment sum C that tendency to develop is sent in group I (1), it is preferable to equal E.As structure 3 and structure 4, the demand of equal number data flow also is applied on crowd I (1).

Once more, be the option of waiting until ISP's decision for dispose which kind of combination actually.

Structure 1,2 and 3 selections of disposing

Setting up a VOD system is used for providing service for a large number of users, anti-wait data flow is as previously described constantly generated so that system can constantly use these stream under preferable situation, perhaps at least in the topmost time (as 6-11 point in the morning) provide so that the user inserts.On the other hand, if several thousand users are arranged in system, wherein has only seldom the relevant user of amount, or the frequency specific program seldom of being filed a request by the user, if the anti-data flow of waiting for is just according to user's requirement and generation can further alleviate the burden of network.This optional method helps structure 1,2 and 3.Described these are described in Figure 14,15 and 16.In these figure, the data slot of grey is represented those data slot or data flow of being produced by customer requirements.

In structure 1, group I is counter, and the data flow of waiting for is staggered by an anti-data flow interval T of waiting for.Certainly, the anti-wait data flow of not every group I as described above constantly all operates or provides at all.They produce according to user's demand, and these demands are submitted to once every time T.If the user files a request for described data in other words, will begin to locate the anti-data flow of waiting for of generation at interval at the anti-stream of waiting for of the next one in an anti-wait is flowed at interval.An example referring to Figure 14, thinks that the user's data request time is 2T, 3T, 16T.In this article, the user's data request be respectively at 1T to 2T, 2T is to 3T, 15T is to carrying out between the 16T.Therefore, in this example, the transmission of having only stream 2,3 and 16 to be generated or to produce and in system, concentrate, at this moment flow 1 and 4-15 be closed.As shown in Figure 14, group I data flow does not have conventional stream at interval.

This idea can be extended in structure 2 and 3.

In structure 2, be not in each all lead data stream that produces and end data stream, the lead data fragment to be arranged all.They only produce when customer requirements.Example shown in Figure 15, each lead data stream interrelates with corresponding end data stream, and this technology was narrated in preamble, and this point also can realize by common programming technique.Corresponding end data stream should generate when generating its lead data stream.

Same, in structure 3, the not all F that in group I, distributes _mFragment all is generated at every turn.Just as shown in Figure 16.This is in a kind of technology described in the preamble, and this technology and group data fragment have relation, and can realize by common programming technique.All corresponding F _mData slot should generate when client is filed a request.Especially, F _(m+1)Fragment is at a last F _mFragment is received by preceding generation.

Further, after DDVR is introduced in group II data flow, the anti-data flow of waiting for will be moved to end and then reduce the use of bandwidth.

Basic demand as structure 4 is exactly all data flow that the user should be able to be connected to crowd I, above the described method that produces data flow by " demand " in structure 4, do not use.

Some extra bandwidth can be saved though this optional method is compared with structure in the past, still several problems can't be solved.The first, the load that this will increase the weight of the work of service end and handle request, and can complicated program and execution.The second, if do not consider the bandwidth of demand in the design phase, this may make resolution system surpass its operating load.The 3rd, this optional method will become structure in the past when client's request amount is very huge, does not promptly compare with original structure to change.

The bells and whistles of independent data slot

For helping the unlikely data that cause of stream translation to lose in a large number, each data segment begins during conversion, and this part can be described as head, can contain the repeating data of the afterbody part that appears at the front section of being close to.The data volume that repeats partly to carry is T ' (normalization of stream data rate), the wherein delay of T ' for causing during stream translation.Typically, T ' can be 10-20 millisecond grade.

There are following several system requirements in the IVOD system

A. this server must produce suitable multithread, with any at structure 1 to 5 illustrational pattern, the maybe pattern that may design.

B. distribution network must have enough capacity to carry all necessary this terminal user DDVR that flow to.

C. terminal user DDVR must have enough bandwidth, buffering area, reach disposal ability to deal with multithread.This DDVR also must have enough storage areas with the data from this at least one group of multithread buffering II stream interval.

These factors may influence this service provides to select to dispose which kind of structure.

The thought of no dish DVR

Generally speaking, this receiving terminal DDVR can have a processor to propose content request, reaches a connector to connect this group I and II data flow.

For structure 1 and 2, DDVR may need to comprise the group I data flow that a buffer receives with buffering.For structure 3 and 4, DDVR must comprise the data that a buffer is received by group I data flow with buffering.This processor also will be responsible for deal with data to place data according to suitable order.

Use the multithread notion, the receiving system of client, promptly receiver can not need any hard disk holder.At this STB, i.e. user/receiver, the internal memory of unique needs or buffer can be random access memory to cushion the stream data of equivalence at interval.Suppose a stream interval of 8 minutes, a 1Mb/sMPEG-4 is flowed the random access memory that this needs 60MB approximately.This technology can need the video on demand techniques of a big hard disk (arriving 60GB sometimes greatly) to form contrast at STB with many.Therefore, this IVOD system seems a no dish DVR In the view of the user.Yet the supplier of this system can select the user is provided storage body or other consistency medium of extra hard disk form, or uses miscellaneous equipment because of needing buffering and receiving data.

Must notice again that DDVR has several options

At first, DDVR can be configured to make it to play the data that receive with the speed lower than data transmission rate.This data transmission rate contains at each data segment under the situation of equal amount of data and can be expressed as In this embodiment, this DDVR may must have big buffer to hold this with the data that receive.

Secondly, this DDVR can be provided in the data that comprise in its local buffer or obtain at least one part group I data flow in advance, is the leading part that data are sent in tendency to develop, during sometime.This type of data can be described as " obtaining data in advance ".If need, if this DDVR have enough sizes buffer this obtain data in advance and can comprise all data that this group I data flow is comprised.A kind of extreme case is that the data content that will transmit video data may upgrade every day, or surpass once every day.To this particular case, obtain data in advance and may upgrade every day.Can be made as any value of desiring this update time, its scope can by one day in addition 1 year.From during the peak as midnight after (for example 01:00-06:00) or 10:00 to upgrade between 15:00 obtain data in advance may be preferable, the network activity of customer requirements of resulting from this moment may be minimum.This process can begin with customary voice procedure by this anti-waiting signal generator, this interactive signal generator or by this user itself.So do, data flow sum required in waiting time and the network can reduce again.This may particular importance for the video on-demand system that transmits the mass data set.

Trades space-time-bandwidth

The IVOD system of this invention stores body (space) at the DDVR buffer, open the beginning wait for (time), and required stream (transmission bandwidth) between the balance relation is arranged.This is shown by table 3 and more can be illustrated by Figure 13.

In Figure 13, this end points 1 can be understood that its all data of existing video on-demand system are transmitted and be stored in this STB then, no matter whether the user initiates a data request.In this embodiment, this STB must have a sizable buffer.This may increase the manufacturing cost of STB.

End points 2 can be represented the system as structure 1 to 5 explanation, and under this a kind of structure, the requirement of this STB be can be minimum, and this system may be bigger to bandwidth requirement simultaneously.

End points 3 can be represented the mixing of end points 1 and end points 2 systems.

Select the decision of which " end points " to can be design option according to various factors, these factors comprise available bandwidth, this STB specification, stand-by period and interactive regional demand or the like.

Content size L=1 hour
									Required fluxion
At interval staggered		6 minutes	7 minutes	8 minutes	10 minutes	15 minutes
							Double fluid	Structure (1) T=30 second (the thick jump=1 minute)	????22	????23	??24	??26	????34

	Structure (2) T=30 second (the thick jump=2 minutes)	????17	????17	????17	????17		????20
								Structure (3) T=6 second (not allowing thick jump)	????20	????19	????18	????17		????16
	Structure (5) T=6 second (the thick jump=1 minute)	????23	????23	????23	????23		????26
								Structure (5) T=6 second (the thick jump=2 minutes)	????22	????22	????21	????20		????21
	Multithread structure (4)	Optimum structure T=6 second (not allowing thick jump)	????15	????14	????13	????12									????10
Optimum structure T=6 second (the thick jump=1 minute)								????20	????20	????20	????20		????23
		Optimum structure T=6 second (the thick jump=2 minutes)	????18	????18	????17	????16								????17
Content size=2 hour
										Required fluxion
At interval staggered		6 minutes	7 minutes	8 minutes	10 minutes	15 minutes
								Double fluid	Structure (1) T=30 second (the thick jump=1 minute)	????32	????31	????31	????32	????????38
Structure (2) T=30 second (the thick jump=2 minutes)	????27	????25	????24	????23	????????24
							Structure (3) T=6 second (not allowing thick jump)		????30	????27	????26	????23	????????20
Structure (5) T=6 second (the thick jump=1 minute)	????33	????31	????30	????29	????????32
							Structure (5) T=6 second (the thick jump=2 minutes)		????32	????30	????28	????26	????????25
Multithread structure (4)	Optimum structure T=6 second (not allowing thick jump)	????25	????22	????20	????18	????????14
								Optimum structure T=6 second (the thick jump=1 minute)	????31	????29	????27	????27	????????28
	Optimum structure T=6 second (the thick jump=2 minutes)	????28	????26	????24	????22	????????21

Table 3. buffer stores body (space), initial wait (time), reaches the balance of required stream (transmission bandwidth)

Be applied to cable TV, global broadcast, reach broadcasting-satellite system

The IVOD system of this invention can existing cable TV, global broadcast, and broadcasting-satellite system on directly use.Need only do minimum modification to existing capital construction, this non-interactive broadcasting or NVOD system can change an IVOD system into.Both all can utilize the advantage of multithread idea simulation and digital transmission system.Yet, below discuss the system configuration of digital transmission system will only be described.

In these digit broadcasting systems, this radio frequency transmission frequency band is divided into 6MHz (NTSC) or 8MHz (PAL) channel usually.Cable TV, global broadcast, and broadcasting-satellite system in 100 channels of surpassing can be arranged.Figure 11 shows a typical system configuration of this multistream system.It and existing broadcast system are closely similar.The transmission unit that has only head end, it can be described as a kind of anti-wait assembly, and the receiving element of client, and promptly this user/receiver must be revised.At this head end, be not the transmission analog signal in each channel, but transmit digital signal such as QAM.The typical case, a radio-frequency channel can be put into 30-40Mb/s.Suppose to have 2 hours content, at first available MPEG-4 or other compression algorithm become bit rate to be about the digital signal of 1Mb/s this analog-signal transitions.Use this Fibonacci double fluid (structure 3) or should the best be in harmonious proportion multithread IVOD idea (structure 4), can in single radio-frequency channel, put into 30 to 40 IVOD streams.This PAL/NTSC/SECAM standard of this content basis is put into different radio-frequency channels keeping the compatibility with existing system, and each radio-frequency channel can comprise the content of a few hours.

At user's end, this set-top box must tuned radio-frequency arrive this interested specific radio frequency channel.This cable modem leaches this 30-40Mb/s digital stream and deciphers two streams (to the Fibonacci double-current system) simultaneously or decipher all mediation multithread (to being in harmonious proportion multistream system) then.The 12nd figure shows the calcspar of this STB/ cable modem.This STB/ cable modem is similar to other this STB/ cable modem except its processing unit.This processing unit can be handled at least 2 multithread but not a single stream simultaneously.Stream through deciphering will be buffered within the STB and this content will be rebuilt according to the sequence number of fragment.Utilize hundreds of available channels in the typical broadcast system, this was convertible into 200 hours or the above full interactive program that can be taken by unlimited a plurality of users.

When preferred embodiment of the present invention is described in detail by embodiment, those skilled in the art are revised and use and will take place.Yet when proceeding to following right application range, very easily understanding so modification and using is in category of the present invention.Moreover the present invention's embodiment should not be interpreted as only being confined to embodiment or graphic.

Claims (141)

1. one kind in order to have the stand-by period to begin the transmitting system of these data to this client by network transmission data at least one client, comprises:

At least one anti-waiting signal generator, it comprises at least one leading part that is used for the data that a client received to be used for producing at least one anti-wait data flow; And

At least one interactive signal generator, receive the part of at least one anti-wait data flow after, be used for producing interactive data and flow it and comprise at least one remainder that is used for these data that this client merges.

2. the system as claimed in claim 1, wherein:

These data are divided into the K section, and each is partly transmitted by network needs time T;

Should wait for instead that data flow comprised M the anti-data flow of waiting for; And

This interactive data stream comprises N interactive data stream.

3. the system as claimed in claim 1, wherein:

Should wait for instead that data flow only contained the leading part of these data;

This interactive data stream contains the whole of these data.

4. system as claimed in claim 2, wherein:

This M is anti-to be waited for that in the data flow each contains this anti-wait in the data flow and repeats identical in fact data continuously, and wherein each continuous anti-wait data flow is staggered by an anti-latency period; And

Each of this N interactive data stream is to repeat continuously in this interactive data stream, and wherein each continuous interactive data flows by an interaction time interval and staggers.

5. system as claimed in claim 4, wherein:

In the individual anti-wait data flow of this M each has the J section; And

This anti-latency period 〉=T.

6. system as claimed in claim 4 wherein should the interaction time interval 〉=JT.

7. system as claimed in claim 5, wherein M 〉=J.

8. system as claimed in claim 7, wherein M=J.

9. system as claimed in claim 6, wherein $N\&GreaterEqual;\frac{R}{\mathrm{JT}}.$

10. system as claimed in claim 9, wherein $N=\frac{R}{\mathrm{JT}}.$

11. as claim 8 or 10 described systems, wherein $M=N=J=\sqrt{\frac{R}{T}}.$

12. system as claimed in claim 4, wherein each data flow of this N interactive data stream contains this data whole of tool K section.

13. system as claimed in claim 4, wherein each stream of this N interactive data stream only contains the remainder of these data.

14. system as claimed in claim 4, wherein:

When this client proposed request for these data, this client was connected to this M anti-any one that wait in the data flow; And

This client is connected to any one in this N the interactive data stream.

15. system as claimed in claim 2 wherein should wait for instead that data flow comprised:

I. a lead data flows, and the lead-in cable that contains the leading part of at least one these data is repeated in this lead data stream continuously; And

II. many end data flow, each end data stream:

The remainder that contains the leading part of these data; And

In this end data stream, be repeated continuously, and wherein each continuous end data stream is staggered by an anti-latency period;

In this interactive data stream, each of this N interactive data stream is repeated continuously, and wherein each continuous interactive data stream was staggered by an interactive time interval.

16. system as claimed in claim 15, wherein

Each this end data stream has the J section; And

The time interval 〉=T waiting period that this being anti-.

17. system as claimed in claim 15 wherein should the interaction time interval 〉=JT.

18. system as claimed in claim 16, wherein $M\&GreaterEqual;\frac{J}{2}+1.$

19. system as claimed in claim 18, wherein $M=\frac{J}{2}+1.$

20. system as claimed in claim 17, wherein $N\&GreaterEqual;\frac{R}{\mathrm{JT}}.$

21. system as claimed in claim 20, wherein $N=\frac{R}{\mathrm{JT}}.$

22. as claim 19 or 21 described systems, wherein $J=\sqrt{2K}.$

23. system as claimed in claim 15, wherein each of this N interactive data stream contains this data whole of tool K section.

24. system as claimed in claim 15, wherein each of this N interactive data stream only contains the remainder of these data.

25. system as claimed in claim 15, wherein:

When this client proposed request for these data, this client was connected to this lead data stream;

This client is connected to any one in this end data stream subsequently; And

This client is connected to any one in this N the interactive data stream.

26. system as claimed in claim 2, wherein:

-in this interactive data stream, each of this N interactive data stream is repeated continuously, and wherein each continuous interactive data flowed by an interactive time interval $=\frac{\mathrm{KT}}{N}$ Stagger;

-produce this anti-the waiting period data flow 1 so make to M

One m ^ThData flow has F waiting period of anti- _mSection, wherein F _mBe a m ^ThFibonacci number; And

In this m ^ThThe waiting period of anti-in the data flow, this F _mDuan Lianxu is repeated.

27. system as claimed in claim 26, wherein:

-when this client proposed request for these data, this client was connected to this m at least ^ThAnd (m+1) ^ThThe anti-data flow of waiting for;

-at least at this m ^ThAnd (m+1) ^ThThe anti-interior data of data flow of waiting for are buffered in this client;

-this client is connected to continuous anti-wait data flow subsequently; And

All data in this client receives this leading part.

28. system as claimed in claim 27, wherein:

After all data in this client receives this leading part, this client is connected to any one in this N the interactive data stream.

29. system as claimed in claim 26, wherein each of this N interactive data stream contains this data whole of tool K section.

30. system as claimed in claim 26, wherein each of this N interactive data stream contains the remainder of these data of tool K section.

31. system as claimed in claim 26, wherein $F_M\&GreaterEqual;\frac{2K}{N}.$

32. system as claimed in claim 26, wherein m is since 1.

33. system as claimed in claim 26, wherein m is since 4, and should repeat 1 ^St, 2 ^NdAnd 3 ^RdAnti-wait data flow has following structure:

34. system as claimed in claim 2, wherein:

In this interactive data stream, each of this N interactive data stream is repeated continuously, and wherein each continuous interactive data flowed by an interactive time interval $=\frac{\mathrm{KT}}{N}$ Stagger;

This M anti-the wait in the data flow,

I. to contain label be 1 to J lead data section to the leading part of these data; And

II. this lead data section is distributed in the anti-data flow of waiting for of this M, so makes this anti-time interval≤jT anti-waiting period that waits in data flow repeat a j ^ThLead-in cable.

35. system as claimed in claim 34, wherein:

When this client proposed request for these data, this client was connected to all these M the anti-data flow of waiting for; And

Be buffered in this client at this M the anti-leading part of these data of data flow of waiting for.

36. system as claimed in claim 35, wherein:

After all data in this client receives this leading part, this client is connected to any one in this N the interactive data stream.

37. system as claimed in claim 34, wherein each of this N interactive data stream contains this data whole of tool K section.

38. system as claimed in claim 34, wherein each of this N interactive data stream only contains the remainder of these data.

39. system as claimed in claim 34, wherein $M\&GreaterEqual;\underset{j=1}{\overset{j=J}{\mathrm{\&Sigma;}}}\left(\frac{1}{j}\right)$ And $J=\frac{K}{N}.$

40. system as claimed in claim 34, this M six arrangements instead waiting for data flow that wherein contain this lead data section are as follows:

Wherein clear band contains any data.

41. system as claimed in claim 2, wherein this M the anti-data flow of waiting for contains the leading part of these data; And

More comprising two group data streams, is 1 ^StThe anti-data flow and 1 of waiting for of group ^NdThe anti-data flow of waiting for of group.

42. system as claimed in claim 41, wherein:

This is 1 years old ^StThe anti-data flow of waiting for has the A individual 1 from 1 to A ^StThe anti-data flow of waiting for, wherein

I. an a ^ThAnti-wait data flow has F _aSection, and F _aBe an a ^ThFibonacci number; And

II. in this a ^Th1 ^StIn the anti-wait data flow, this F _aDuan Lianxu is repeated,

These are 2 years old ^NdThe anti-data flow of waiting for has B individual 2 ^NdThe anti-data flow of waiting for, wherein in this 2 ^NdThis B individual 2 in the anti-wait data flow ^NdAnti-each that wait for data flow contains and repeats identical in fact data continuously, and wherein each continuous 2 ^NdThe anti-data flow of waiting for was staggered by a thick frame period of jumping;

So make when this client and be connected to this B 2 ^NdWhen instead waiting for data flow, this client can be carried out a thick skip functionality.

43. system as claimed in claim 42, wherein:

When this client proposed request for these data, this client was connected to this a at least ^ThAnd (a+1) ^Th1 ^StThe data flow waiting period of anti-;

To being less than this a ^ThAnd (a+1) ^Th1 ^StThe anti-interior data of data flow of waiting for are buffered in this client;

This client is connected to continuous 1 subsequently ^StThe anti-data flow of waiting for;

Be received in this A individual 1 up to this client ^StAnti-all data of waiting in the data flow.

44. system as claimed in claim 43, wherein:

This client be received in this 1 ^StAfter anti-all data of waiting in the data flow, this client is connected to this B individual 2 ^NdAnti-any one that wait in the data flow; And

Be received in the B individual 2 of this connection in this client ^NdAfter anti-all data of waiting in the data flow, this client is connected to any one in this N the interactive data stream.

45. system as claimed in claim 42, wherein each of this N interactive data stream contains this data whole of tool K section.

46. system as claimed in claim 42, wherein each of this N interactive data stream only contains the remainder of these data.

47. system as claimed in claim 42, the frame period of wherein should slightly jumping comprises E data segment, and F _A〉=2E.

48. system as claimed in claim 42, wherein a is since 1.

49. system as claimed in claim 42, wherein a is since 4, and should repeat 1 ^St, 2 ^NdAnd 3 ^RdAnti-wait data flow has following structure:

50. system as claimed in claim 41, wherein:

-this is 1 years old ^StThe anti-data flow of waiting for has the A individual 1 from 1 to A ^StThe anti-data flow of waiting for, wherein

I. an a ^ThAnti-wait data flow has F _aSection, wherein F _aBe an a ^ThFibonacci number; And

II. in this a ^Th1 ^StIn the anti-wait data flow, this F _aDuan Lianxu is repeated,

-these are 2 years old ^NdThe anti-data flow tool B individual 2 that waits for ^NdThe anti-data flow of waiting for, it comprises

I. a lead data flows, and the lead-in cable that contains the leading part of at least one these data in this lead data stream is repeated continuously; And

II. many end data flow, each end data stream:

The remainder that contains the leading part of these data; And

In this end data stream, be repeated continuously, and wherein each continuous end data stream was staggered by a thick frame period of jumping,

So make when this client and be connected to this B 2 ^NdWhen instead waiting for data flow, this client can be carried out a thick jump interaction function.

51. system as claimed in claim 50, wherein:

When this client proposed request for these data, this client was connected to this a at least ^ThAnd (a+1) ^Th1 ^StThe anti-data flow of waiting for;

To being less than this a ^ThAnd (a+1) ^Th1 ^StThe anti-interior data of data flow of waiting for are buffered in this client;

This client is connected to continuous 1 subsequently ^StThe anti-data flow of waiting for;

Be received in this A individual 1 up to this client ^StAnti-all data of waiting in the data flow.

52. system as claimed in claim 51, wherein:

This client be received in this 1 ^StAfter anti-all data of waiting in the data flow, this client is connected to this lead data stream;

This client is connected to any one in this end data stream subsequently; And

Be received in this B individual 2 in this client ^NdAfter anti-all data of waiting in the data flow, this client is connected to any one in this N the interactive data stream.

53. system as claimed in claim 50, wherein each of this N interactive data stream contains this data whole of tool K section.

54. system as claimed in claim 50, wherein each of this N interactive data stream only contains the remainder of these data.

55. system as claimed in claim 50, the frame period of wherein should slightly jumping comprises E data segment, and F _A〉=2E.

56. system as claimed in claim 50, wherein a is since 1.

57. system as claimed in claim 50, wherein a is since 4, and should repeat 1 ^St, 2 ^NdAnd 3 ^RdAnti-wait data flow has following structure:

58. system as claimed in claim 41, wherein:

This is 1 years old ^StThe anti-data flow of waiting for has A individual 1 ^StThe anti-data flow of waiting for, wherein,

I. this A individual 1 ^StThe anti-data flow of waiting for contains 1 to C 1 ^StData segment; And

II. in this 1 ^StData segment system is distributed in this A individual 1 ^StThe anti-data flow of waiting for so makes in this A individual 1 ^StThe anti-wait in the data flow repeated a c through an anti-latency period≤cT ^ThLead-in cable;

These are 2 years old ^NdThe anti-data flow of waiting for has B individual 2 ^NdThe anti-data flow of waiting for, wherein in this 2 ^NdThis B individual 2 in the anti-wait data flow ^NdAnti-each that wait for data flow contains and repeats identical in fact data continuously, and wherein each continuous 2 ^NdThe anti-data flow of waiting for was staggered by a thick frame period of jumping;

So make when this client and be connected to this B 2 ^NdWhen instead waiting for data flow, this client can be carried out a thick jump interaction function.

59. system as claimed in claim 58, wherein:

When this client proposed request for these data, this client system was connected to all these A 1 ^StThe anti-data flow of waiting for; And

In this A individual 1 ^StThe leading part of anti-these data of wait data flow is buffered in this client always and is received in this A individual 1 to this client ^StAnti-all data of waiting in the data flow.

60. system as claimed in claim 59, wherein:

This client be received in this 1 ^StAfter anti-all data of waiting in the data flow, this client is connected to this B individual 2 ^NdAnti-any one that wait in the data flow;

Be received in this B individual 2 in this client ^NdAfter anti-all data of waiting in the data flow, this client is connected to any one in this N the interactive data stream.

61. system as claimed in claim 58, wherein each of this N interactive data stream contains the whole of these data of tool K section.

62. system as claimed in claim 58, wherein each of this N interactive data stream only contains the remainder of these data.

63. system as claimed in claim 58, the frame period of wherein should slightly jumping comprises E data segment, and $A\&GreaterEqual;\underset{c=1}{\overset{c=E}{\mathrm{\&Sigma;}}}\left(\frac{1}{c}\right).$

64. system as claimed in claim 58, wherein this A individual 1 ^StSix arrangements of anti-wait data flow are as follows:

Wherein clear band contains any data.

65. system as claimed in claim 41, wherein:

-this is 1 years old ^StThe anti-data flow of waiting for has A individual 1 ^StThe anti-data flow of waiting for, wherein,

I. this A individual 1 ^StThe anti-data flow of waiting for contains C individual 1 ^StData segment; And

II. in this 1 ^StData segment is distributed in this A individual 1 ^StThe anti-data flow of waiting for so makes in this A individual 1 ^StThe anti-wait in the data flow repeated a c through an anti-latency period≤cT ^ThLead-in cable;

-these are 2 years old ^NdThe anti-data flow of waiting for has B individual 2 ^NdThe anti-data flow of waiting for, it comprises

I. a lead data flows, and the lead-in cable that contains the leading part of at least one these data is repeated in this lead data stream continuously; And

II. many end data flow, each end data stream:

The residue section that contains the leading part of these data; And

In this end data stream, be repeated continuously, and wherein each continuous end data stream was staggered by a thick frame period of jumping,

So make when this client and be connected to this B 2 ^NdWhen instead waiting for data flow, this client can be carried out a thick jump interaction function.

66. as the described system of claim 65, wherein:

When this client proposed request for these data, this client was connected to all these A 1 ^StThe anti-data flow of waiting for; And

In this A individual 1 ^StThe leading part of anti-these data of wait data flow is buffered in this client always and is received in this A individual 1 to this client ^StAnti-all data of waiting in the data flow.

67. as the described system of claim 66, wherein:

This client be received in this 1 ^StAfter anti-all data of waiting in the data flow, this client is connected to this B individual 2 ^NdThe anti-lead data stream of waiting in the data flow;

This client is connected to any one in this end data stream subsequently; And

Be received in this B individual 2 that step F connects in this client ^NdAfter anti-all data of waiting in the data flow, this client is connected to any one in this N the interactive data stream.

68. as the described system of claim 65, wherein each of this N interactive data stream contains this data whole of tool K section.

69. as the described system of claim 65, wherein each of this N interactive data stream only contains the remainder of these data.

70. as the described system of claim 65, the frame period of wherein should slightly jumping comprises E data segment, and $A\&GreaterEqual;\underset{c=1}{\overset{c=E}{\mathrm{\&Sigma;}}}\left(\frac{1}{c}\right).$

71. as the described system of claim 67, wherein this A individual 1 ^StSix arrangements of anti-wait data flow are as follows:

Wherein clear band contains any data.

72. as any one described system in the claim 2,4,15,26,34,41,42,50,58 or 65, wherein each in this K data segment contains a head and an afterbody, and this head contains this and then some of the data of the afterbody of leading portion, helps the merging of this K data segment when client receives.

73., wherein obtain in advance to a part that is less than data in this leading part in this client system as any one described system in the claim 2,4,15,26,34,41,42,50,58 or 65.

74. one kind in order to comprise one in order to these data are divided into the signal generator of K data segment via network transmission data to the system of at least one client, each data segment needs a time T to transmit in network, wherein each in this K data segment contains a head and an afterbody, and this head contains this and then some of the data of the afterbody of leading portion, helps the merging of this K data segment when client receives.

75. one kind in order to have the stand-by period to begin the transmitting system of these data to client via network transmission data at least one client, comprises:

At least one anti-waiting signal generator, it comprises at least one leading part that is used for a client received data to be used for producing at least one anti-wait data flow;

One buffer is used for obtaining in advance this leading part as obtaining data in advance in this client, reach

At least one interactive signal generator is used for producing at least one interactive data and flows it and contain at least one remainder that this client merges these these data of leading part that is used for.

76., wherein during a update time, upgrade this and obtain data in advance as the described system of claim 75.

77., should be between a non-peak period during update time wherein as the described system of claim 76.

78. as the described system of claim 76, wherein this obtains data renewal every day once in advance.

79. one kind in order to comprise at least one anti-waiting signal generator that is used for producing a plurality of anti-wait data flow via the network delivery data to the system of at least one client, this anti-data flow of waiting for comprises:

One lead data stream, the lead-in cable that contains at least one this data leading part is repeated in this lead data stream continuously; And

A plurality of end data streams, each end data stream:

The remainder that contains this data leading part; And

In this end data stream, be repeated continuously, and wherein each continuous end data stream is staggered by an anti-latency period.

80. as the described system of claim 79, wherein:

When this client proposed request for these data, this client was connected to this lead data stream; And

This client is connected to any one in this end data stream subsequently.

81. as the described system of claim 79, wherein these data are divided into the signal generator of K data segment, each data segment needs a time T in network delivery, and this anti-latency period 〉=T.

82. one kind in order to comprise at least one anti-waiting signal generator that is used for producing a plurality of anti-wait data flow via the network delivery data to the system of at least one client, wherein should wait for instead that data flow comprised:

From 1 to M anti-data flow, wherein m of waiting for ^ThAnti-wait data flow has F _mSection, and F _mBe a m ^ThFibonacci number; And in this m ^ThIn the anti-wait data flow, this F _mDuan Lianxu is repeated.

83. as the described system of claim 82, wherein:

When this client proposed request for these data, this client was connected to this m at least ^ThAnd (m+1) ^ThThe anti-data flow of waiting for;

At least this m ^ThAnd (m+1) ^ThThe anti-interior data buffering of data flow of waiting for is in this client;

This client is connected to continuous anti-wait data flow subsequently; And

Receive all data up to this client.

84. as the described system of claim 82, wherein m is since 1.

85. as the described system of claim 82, wherein m is since 4, and should repeat 1 ^St, 2 ^NdAnd 3 ^RdAnti-wait data flow has following structure:

86. one kind in order to arrive the system of at least one client via the network delivery data, these data are divided into K data segment, each data segment needs a time T in network delivery, comprises at least one signal generator that is used for producing a plurality of anti-wait data flow, wherein should wait for instead that data flow comprised:

M the anti-data flow of waiting for contains 1 to K anti-data segment of waiting for, should wait for instead wherein that data segment is distributed in this M the anti-data flow of waiting for, so made and repeats a k in this anti-wait in the data flow through an anti-latency period≤kT ^ThLead-in cable.

87. as the described system of claim 86, wherein:

This client system is connected to all these M the anti-data flow of waiting for; And

When this client proposes request for these data, instead wait for that data buffering in the data flow is in this client to this M.

88. as the described system of claim 86, M six arrangements instead waiting for data flow that wherein contain this lead data section are as follows:

Wherein clear band contains any data.

89. basis such as claim 2 comprise in order to receive via the receiver of network delivery at least one client data:

One processor is used for proposing the request for these data; And

At least one connector is used for connecting this client and instead waits for data flow and be received in this M anti-wait data flow data to this M is individual.

90. as the described receiver of claim 89, wherein:

After this receiver was received in all data of this M anti-wait data flow, this connector was connected to this N interactive data stream.

91. as the described receiver of claim 89, wherein the data of this leading part are received continuously.

92. as the described receiver of claim 89, wherein this receiver connects at least two anti-wait data flow simultaneously.

93., more comprise as the described receiver of claim 92:

One buffer is used for cushioning that these two of connecting this client are anti-waits for data flow and continuously by data that this client received.

94. as the described receiver of claim 93, wherein this buffer comprises random access memory and hard disc of computer.

95. as the described receiver of claim 93, wherein this buffer is made up of random access memory.

96. as the described receiver of claim 89, wherein this receiver connects all anti-wait data flow simultaneously.

97., more comprise as the described receiver of claim 96:

One buffer is used for cushioning the data that should instead wait for data flow that connect client; And

Wherein this processor is suitably rearranged this buffered data in proper order according to one.

98. as the described receiver of claim 97, wherein this buffer comprises random access memory and hard disc of computer.

99. as the described receiver of claim 97, wherein this buffer is made up of random access memory.

100. as the described receiver of claim 89, wherein in this client system obtain in advance to a part that is less than data in this leading part as obtaining data in advance.

101., wherein during a update time, upgrade this and obtain data in advance as the described receiver of claim 100.

102., should be 01:00-06:00 during update time wherein as the described receiver of claim 101.

103., should be 10:00-15:00 during update time wherein as the described receiver of claim 101.

104. one kind in order to receive via the receiver of network delivery at least one client data, wherein these data comprise a leading part and a remainder, and this remainder is transmitted by at least one interactive data stream, comprises:

One buffer is used for obtaining in advance this leading part as obtaining data in advance in this client; And

One processor is used for that this is obtained data in advance and to this remainder.

105., wherein during a update time, upgrade this and obtain data in advance as the described receiver of claim 104.

106., should be between a non-peak period during update time wherein as the described receiver of claim 105.

107. as the described receiver of claim 105, wherein this obtains data renewal every day once in advance.

108. one kind in order to have the stand-by period to begin the transmitting system of these data to client via network transmission data at least one client, comprises:

-at least one anti-waiting signal generator, it comprises at least one leading part that is used for a client received data to be used for producing at least one anti-wait data flow;

-at least one interactive signal generator is used for producing at least one interactive data and flows the remainder that it contains at least one described data, is used for the part that this client is incorporated at least one the anti-latency data stream after the reception;

Wherein:

The leading part of-described data

Can in the anti-wait stream interval of rule, be generated; And

Send the request of described data at least one client after, and be generated in the next one anti-wait stream time interval the earliest.

109. as the described system of claim 108, wherein:

-the described data of a time R of needs by Network Transmission are divided into the k section, and each section needs time T in Network Transmission;

-anti-the data flow of waiting for comprises M the anti-data flow of waiting for, wherein each anti-data flow of waiting for

Comprise same in fact data

In the anti-latency period of rule, produce; And

After the client sends request of data, generate in the next one anti-wait stream time interval the earliest;

-interactive data stream comprises N interactive data stream, and wherein each of N interactive data stream constantly is being repeated in described interactive data stream, and each continuous interactive data stream was interlocked when interactive time interval.

110. as the described system of claim 109, wherein:

In the individual anti-wait data flow of-M each all has J section; And

-anti-latency period 〉=T.

111. as the described system of claim 110, the wherein interactive time interval 〉=JT.

112. as the described system of claim 111, wherein M 〉=J.

113. as the described system of claim 110, wherein $N\&GreaterEqual;\frac{R}{\mathrm{JT}}.$

114. as the described system of claim 113, wherein $M=N=J=\sqrt{\frac{R}{T}}.$

115. as the described system of claim 109, each interactive data stream during N interactive data flows all comprises the total data of K section.

116. as the described system of claim 109, wherein each of this N interactive data stream only contains the remainder of these data.

117. as the described system of claim 109, wherein:

-when the user sends request of data, the user will be connected to M the anti-data flow of waiting for into its generation;

-user is connected to any one in N the interactive data stream;

-after the user was connected in N interactive data stream one, generate for the user M anti-waited for that data flow also will be terminated.

118. as the described system of claim 108, wherein:

-the described data of a time R of needs by Network Transmission are divided into the k section, and each section needs time T in Network Transmission;

-anti-the data flow of waiting for comprises M the anti-data flow of waiting for, comprising:

I. a lead data flows

In the leading part of described data, comprise a lead-in cable at least;

Can in the anti-latency period of rule, produce;

After client is sent request of data, be generated in the next one anti-wait stream time interval the earliest;

II. many end data flow, and each end data stream comprises:

The remainder that comprises described direct data part;

Corresponding with a lead-in cable;

When generating, corresponding lead-in cable also generates thereupon;

Comprise N interactive data stream during-interactive data flows, wherein each interactive data flows in described interactive data stream and constantly is being repeated, and each continuous interactive data stream is interlocked during the time interval in interaction.

119. as the described system of claim 118, wherein:

-each end data stream all has J section;

-anti-latency period 〉=T.

120. as the described system of claim 119, the wherein interactive time interval 〉=JT.

121. as the described system of claim 119, wherein $M\&GreaterEqual;\frac{J}{2}+1.$

122. as the described system of claim 120, wherein $N\&GreaterEqual;\frac{R}{\mathrm{JT}}.$

123. as the described system of claim 120, wherein $J=\sqrt{2K}.$

124. as the described system of claim 118, each interactive data stream during wherein N interactive data flows all comprises the total data of K section.

125. as the described system of claim 118, wherein each of this N interactive data stream only contains the remainder of these data.

126. as the described system of claim 118, wherein:

-when the user sends request of data, the user will be connected to M the anti-data flow of waiting for into its generation;

-user is connected to any one in N the interactive data stream;

-user is connected to any one in N the interactive data stream;

-after the user is connected in N interactive data stream one, the corresponding end data stream in lead data section river that generates for the user also will be terminated.

127. as the described system of claim 108, wherein

-the described data of a time R of needs by Network Transmission are divided into the k section, and each section needs time T in Network Transmission;

-interactive data stream comprises N interactive data stream, and wherein each interactive data stream constantly is being repeated in described interactive data stream, and each continuous interactive data stream is in the interactive time interval $=\frac{\mathrm{KT}}{N}$ In time, interlocked;

-anti-the data flow of waiting for comprises M the anti-data flow of waiting for

One m ^ThAnti-wait data flow has F _mSection, and F _mBe a m ^ThFibonacci number;

F _mData segment can generate in the anti-wait stream interval of rule;

When the user sends request to described data, first F _mSection is generated at interval at the next one anti-wait stream the earliest;

At F _mBefore all data are received by the user in the section, the F of back _(m+1)Section is produced.

128. as the described system of claim 127, wherein

-after the user sent requests for data, it was connected to m at least ^Th(m+1) ^ThThe anti-data flow of waiting for;

-m ^Th(m+1) ^ThAnti-wait data flow is cushioned in client;

-before the total data of leading part has been received, client will continue to connect the anti-wait data flow of back.

129. as the described system of claim 127, wherein:

-client will be connected to any one in N the interactive data stream after receiving the total data of leading part;

-after user side was connected in N interactive data stream one, M anti-waited for that data flow will be terminated.

130. as the described system of claim 127, wherein each in N interactive data stream is all comprising K data fragment whole of described data.

131. as the described system of claim 127, each during wherein N interactive data flows only comprises the remainder of described data.

132. as the described system of claim 127, wherein $F_m\&GreaterEqual;\frac{2K}{N}.$

133. as the described system of claim 127, wherein m is since 1.

134. as the described system of claim 127, wherein m since 4 and should repeat 1 ^St, 2 ^NdAnd 3 ^RdAnti-wait data flow has following structure:

135. one kind generates a plurality of anti-wait data flow and is used for transmitting the anti-waiting signal maker of data by network at least one user, wherein instead waits for that data flow comprises:

-one lead data stream

In the leading part of described data, comprise a leading fragment at least;

Can generate by the anti-latency period of rule;

After the user filed a request to described data, this lead data stream was generated at interval at the next one anti-wait stream the earliest;

-a plurality of end data streams, each end data stream:

The remainder that comprises described data leading part;

Corresponding with a leading fragment;

When being generated, corresponding leading fragment just generates this end stream.

136. as the described anti-waiting signal maker of claim 135, wherein

-user is connected to lead data stream when the user files a request to described data;

-user is connected to corresponding end data stream in succession.

137. as the described anti-waiting signal maker of claim 135, wherein said data are divided into k fragment, each fragment needs time T to transmit in network, and anti-latency period 〉=T.

138. one kind for transmitting the anti-waiting signal maker that data generate M anti-wait data flow at least one user, wherein on network

-one m ^ThAnti-wait data flow has F _mSection, and F _mBe a m ^ThFibonacci number;

-Di F _mData segment can generate in the anti-wait stream interval of rule;

-when the user sends request to described data, first F _mSection is generated at interval at the next one anti-wait stream the earliest;

-following F _M+1Data slot is at F _mThe data of fragment are generated before all being received by the user.

139. as the described anti-waiting signal maker of claim 138, wherein:

-when the user sends request to described data, connect at least and go up m ^Th(m+1) ^ThThe anti-data flow of waiting for;

-m at least ^Th(m+1) ^ThData in the anti-wait data flow are buffered in user side;

-user connects ensuing anti-wait data flow and is received by the user fully up to the data of leading part.

140. as the described anti-waiting signal maker of claim 138, wherein m is since 1.

141. as the described anti-waiting signal maker of claim 138, wherein m since 4 and should repeat 1 ^St, 2 ^NdAnd 3 ^RdAnti-wait data flow has following structure:

Images