| US 7,590,751 B2 | ||
| Method for delivering large amounts of data with interactivity in an on-demand system | ||
| Kwok-Wal Cheung, Hong Kong (Hong Kong Special Administrative Region of the People's Republic of China, The); Kwong-Wing Raymond Chan, Hong Kong (Hong Kong Special Administrative Region of the People's Republic of China, The); Gin-Man Chan, Hong Kong (Hong Kong Special Administrative Region of the People's Republic of China, The); and Wing-Kal Lam, Hong Kong (Hong Kong Special Administrative Region of the People's Republic of China, The) | ||
| Assigned to Dinastech IPR Limited, Hong Kong SAR (China) | ||
| Filed on Oct. 17, 2006, as Appl. No. 11/581,493. | ||
| Application 11/581493 is a division of application No. 09/917638, filed on Jul. 31, 2001, granted, now 7,174,384. | ||
| Prior Publication US 2007/0067484 A1, Mar. 22, 2007 | ||
| Int. Cl. G06F 15/16 (2006.01) | ||
| U.S. Cl. 709—231 [709/220; 709/223; 375/240.12] | 38 Claims |

| 1. A method for transmitting data over a network to at least one client having a latency time to initiate transmission of
said data to the client, including the steps of:
generating a plurality of anti-latency data streams containing at least a leading portion of the data for receipt by the client;
and
generating a plurality of interactive data streams containing at least a remaining portion of said data for the client to
merge into after receiving at least a portion of an anti-latency data stream, wherein said plurality of interactive data streams
provides interactive functions to a user,
wherein said data is fragmented into K segments each requiring a time T to transmit over the network;
the anti-latency data stream includes M anti-latency data streams; and
the interactive data streams includes N interactive data streams,
where K, M and N are integers,
wherein each of the N interactive data streams is repeated continuously within said interactive data stream, and wherein each
successive interactive data stream is staggered by an
![]() the anti-latency data streams 1 to M are generated such that
an mth anti-latency data stream has Fm segments, wherein Fm is an mth Fibonacci number; and
the Fm segments are recreated continuously within the mth anti-latency data stream,
wherein m starts from 1.
|