Response
`
`FIGURE10
`
`
`
`Hander->Qualifier
`
`WO 00/48100
`
`PCT/GB00/00487
`
`9/10
`
`oo
`
`=o
`
`S
`Zz°—
`an
`
`Handler->Change
`
`SUBSTITUTE SHEET (RULE 26)
`
`IPR2022-01228
`IPR2022-01228
`EXHIBIT 1003 - PAGE 1851
`EXHIBIT 1003 - PAGE 1851
`
`

`

`d,
`
`oow
`
`=oQ
`
`FIGURE11
`
`Handler->Requalifier
`
`
`
`Handler->IleldResponse
`
`WO 00/48100
`
`PCT/GB00/00487
`
`10/10
`
`
`
`txts,efc.,
`
`o.an
`Ca
`fa
`
`o z= =o
`
`o aNJ 3= =e
`
`SUBSTITUTE SHEET (RULE26)
`
`IPR2022-01228
`IPR2022-01228
`EXHIBIT 1003 - PAGE 1852
`EXHIBIT 1003 - PAGE 1852
`
`

`

`(12) INTERNATIONAL APPLICATION PUBLISHED UNDER THE PATENT COOPERATION TREATY(PCT)
`
`(19) World Intellectual Property Organization
`International Bureau
`
`(43) International Publication Date
`17 August 2000 (17.08.2000)
`
`
`
`PCT
`
`UACATAATAA
`
`(10) International Publication Number
`WO 00/48100 A3
`
`(51) International Patent Classification’:
`17/60, 9/46
`
`GO6F 17/30,
`
`(74) Agent: LOVELESS, Ian, Mark; Reddie & Grose, 16
`Theobalds Road, London WC1X 8PL (GB).
`
`(21) International Application Number:
`
`PCT/GB00/00487
`
`(22) InternationalFiling Date: 14 February 2000 (14.02.2000)
`
`(25) Filing Language:
`
`(26) Publication Language:
`
`English
`
`English
`
`(30) Priority Data:
`9903314.4
`
`12 February 1999 (12.02.1999)
`
`GB
`
`except US):
`all designated States
`(for
`(71) Applicant
`UNIPOWER SYSTEM LIMITED [GB/GB]; Gate
`House, Ist floor, 1 Farringdon Street, London EC4M 7LH
`(GB).
`
`(72) Inventor; and
`(75) Inventor/Applicant (for US only): HOUBART, Hanafi
`[GB/GB}; 28 Grove Road, Rickmansworth, Herts. WD3
`2ED (GB).
`
`(81) Designated States (national): AE, AL, AM, AT, AU, AZ,
`BA,BB, BG, BR, BY, CA, CH, CN, CR, CU, CZ, DE, DK,
`DM,EE,ES, FI, GB, GD, GE, GH, GM, HR, HU,ID, IL,
`IN, 1S, JP, KE, KG, KP, KR, KZ, LC, LK, LR, LS, LT, LU,
`LV, MA, MD, MG, MK, MN, MW, MX, NO, NZ, PL, PT,
`RO,RU, SD, SE, SG,SI, SK, SL, TJ, TM, TR, TT, TZ, UA,
`UG, US, UZ, VN, YU, ZA, ZW.
`
`(84) Designated States (regional): ARIPO patent (GH, GM,
`KE, LS, MW, SD, SL, SZ, TZ, UG, ZW), Eurasian patent
`(AM,AZ, BY, KG, KZ, MD, RU, TJ, TM), European patent
`(AT, BE, CH,CY, DE, DK,ES, FI, FR, GB, GR,IE, IT, LU,
`MC, NL, PT, SE), OAPI patent (BF, BJ, CF, CG, CI, CM,
`GA, GN, GW, ML, MR, NE, SN, TD, TG).
`
`Published:
`With international search report.
`
`(88) Date of publication of the international search report:
`28 December 2000
`
`[Continued on next page]
`
`
`(54) Title: TRANSACTION SYSTEM
`
`
`
`Local
`Object
`
`User
`Store [44]
`
`
`Business
`
`Objects
`[24]
`
`
`
`
`
`
`
`Client/User
`a
`Owners
`lutstanding
`RDBMS
`Transactions [36]
`
`
`
`
`
`Invite Queve |p
`[16]
` [18]
`
`
`
`
`Server/User
`
`
`Transactions
`
`
`Gl
`Pending
`
`
`
`{12]
`Database
`Transaction
`
`
`
`
`Queue [30]
`[321
`
`
`
` a
`
`ACES
`
`O00/48100A3
`
`(57) Abstract: A system for processing requests in a request-response client-server computer network is provided includingare-
`quest qualifier for qualifying each received request as either an actionable request for which action should be taken and a response
`issued, or a deferrable request for which action should be delayed and a response deferred until an actionable -state is reached. This
`allows a decision to be taken at the server as to whether a requesting client requires data immediately, or whether a response at a
`later time, such as notifying a change in data, is appropriate. When appropriate, responses are provided allowing clients to keep an
`up to date view of shared data. The system is particularly applicable to a transaction system, and in particular to a transaction system
`operating across the Internet or a network running Internet Protocol. The invention overcomes problems with push technology and
`does not require modifications to HTTP protocol.
`
`IPR2022-01228
`IPR2022-01228
`EXHIBIT 1003 - PAGE 1853
`EXHIBIT 1003 - PAGE 1853
`
`

`

`WO 00/48100 A3_MUIRT RAINIER CMA Ait
`
`for two-letter codes and other abbreviations, refer to the "Guid-
`ance Notes on Codes andAbbreviations" appearing at the begin-
`ning ofeach regular issue of the PCT Gazette.
`
`IPR2022-01228
`IPR2022-01228
`EXHIBIT 1003 - PAGE 1854
`EXHIBIT 1003 - PAGE 1854
`
`

`

`INTERNATIONAL SEARCH REPORT
`
`A. CLASSIFICATION OF SUBJECT MATT
`Ipc 7
`GOBFI7/30
`GO6F17/60
`
`GO6F9/46
`
`According to Intemational Patent Classification (IPC) or to both national classification and IPC
`B. FIELDS SEARCHED
`Minimum documentation searched (classification system followed byclassification symbols)
`IPC 7
`GOQ6F
`HO4L
`
`Inte:
`
`onai Apptication No
`
`PCT/GB 00/00487
`
`Documentation searched other than minimum documentation to the extent that such documents are included in the fields searched
`
`Electronic data base consulted during the international search (nameof data base and, wherepractical, search terms used)
`
`INSPEC, EPO-Internal, WPI Data,
`
`IBM-TDB
`
`C. DOCUMENTS CONSIDERED TO BE RELEVANT
`
`
`
`Category °|Citation of document, with indication, where appropriate, of the relevant passages Relevant to claim No.
`
`E Form PCTHASA/210 (second sheet) (July 1992)
`
`WURMAN P. R., WALSH W. E., WELLMAN M. P.,
`O'MALLEY K. A.:
`"A CONTROL ARCHITECTURE
`FOR FLEXIBLE INTERNET AUCTION SERVERS"
`UNIVERSITY OF MICHIGAN, ARTIFICIAL
`INTELLIGENCE LABORATORY,
`‘Online!
`6 February 1999 (1999-02-06), pages 1-12,
`XP002145391
`Retrieved from the Internet:
`<URL:http://ai.eecs.umich.edu/peop]e/wew/P
`apers/AB_Architecture2.ps.Z>
`‘retrieved on 2000-08-09!
`page 5; figure 2
`page 7,
`line 1 - line 18
`page 8,
`line 24 - line 27
`page 9,
`line 8, paragraph 3.3.1 -page 10,
`last line
`
`-/--
`
`Further documentsare listed in the continuation of box C.
`
`Patent family members are listed in annex.
`
`° Special categories of cited documents:
`
`"A* document defining the general state of the art which is not
`considered to be of particular relevance
`"E" earier document but published on or after the intemational
`filing date
`"L" document which may throw doubts on priority ciaim(s) or
`which is cited to establish the publication date of another
`citation or other special reason (as specified)
`“O" document referring to an oral disclosure, use, exhibition or
`other means
`“P" document published priorto the intemational
`later than the priority date claimed
`Date of the actuai compietion of the intemationai search
`
`filing date but
`
`22 August 2000
`Name and mailing address of the ISA
`European Patent Cffice, P.B. 5818 Patentlaan 2
`NL - 2280 HV Rijswijk
`Tel. (+31—70) 340-2040, Tx. 31 651 epo ni,
`Fax: (431-70) 340-3016
`
`-
`.
`-
`|
`"T" fater document published after the intemational filing date
`or pronty date and notin conflict with the application but
`cited to understand the pnnciple or theory underlying the
`invention
`"x" document of particular relevance; the claimed invention
`cannot be considered novel or cannot be considered to
`involve an inventive step when the document is taken aione
`“Y" document of particular relevance; the claimed invention
`cannot be considered to involve an inventive step when the
`document is combined with one or more other such docu—
`ments, such combination being obvious to a person skilled
`In the art.
`"&" document member of the same patent family
`Date of mailing of the international search report
`
`05/09/2000
`Authonzed officer
`
`Archontopoulos,
`
`IPR2022-01228
`IPR2022-01228
`page 1 of#iIBIT 1003 - PAGE 1855
`EXHIBIT 1003 - PAGE 1855
`
`

`

`INTERNATIONAL SEARCH REPORT
`
`
`
` Inte onal Apptication No
`PCT/GB 00/00487
`
`
`
`
`
` WURMAN P. R., WELLMAN M.iiaWALSH W. E.
`
`
`
`
`Citation of document, with indication,where|Statonofsesunentwinnseaionanereolerelvarkpassagesappropriateofthe relevant passages Relevanttoclaim No.
`
`
`"THE MICHIGAN INTERNET AUCTIONBOT: A
`
`
`CONFIGURABLE AUCTION SERVER FOR HUMAN AND
`
`
`SOFTWARE AGENTS”
`
`
`PROCEEDINGS OF THE SECOND INTERNATIONAL
`
`
`CONFERENCE ON AUTONOMOUS AGENTS
`
`
`(AGENTS-98), MINNEAPOLIS, MN, USA,
`
`
`‘Online! May 1998 (1998-05), pages
`
`
`301-308, XP002145392
`
`
`Retrieved from the Internet:
`
`
`<URL:ftp://ftp.eecs.umich.edu/people/wel Im
`
`
`an/agent s98wurman. ps.Z>
`
`
`‘retrieved on 2000-08-09!
`
`
`page 2, column 2,
`line 16 - line 29
`
`
`page 3,
`left--hand column,
`line 7 - line 20
`
`
`page 4,
`left-hand column; figure 2
`
`
`page 4,
`left-hand column,
`line 20
`
`
`-right-hand column,
`line 5
`
`
`page 5, right-hand column,
`line 38 - line
`
`
`
`
`, right-hand column, line 18 - line
`
`
`
`page 7, column 1,
`line 1, paragraph 7 -
`line 3
`
` “EFFECTIVE LOCKING SCHEME FOR REAL-TIME
`
`
`APPLICATIONS"
`IBM TECHNICAL DISCLOSURE BULLETIN, US,
`IBM
`CORP.,
`NEW YORK,
`
`
`vol. 36, no. 6B,
`1 June 1993 (1993-06-01),
`
`
`pages 319-320, XP000377398
`
`
`ISSN: 0018--8689
`the whole document
`
`US 5 649 099 A (NICHOLS DAVID A
`ET AL)
`
`15 July 1997 (1997-07-15)
`
`
`
` line 54 -column 16,
`
`
`column 15,
`
`line 18
`
`Form PCT/SA/210 (continuation of second sheet) (July 1992)
`
`IPR2022-01228
`IPR2022-01 228
`page 2 HyAIBIT 1003 - PAGE 1856
`EXHIBIT 1003 - PAGE 1856
`
`

`

`INTERNATIONAL SEARCH REPORT
`inte
`‘onal Application No
`
`
`intormation on patent family members
`
`
`
`PCT/GB 00/00487
`
`cited in search report
`
`date
`
`member(s)
`
`date
`
`
`
`US 5649099
`
`A
`
`15-07-1997
`
`NONE
`
`Form PCTSA/210 (patent family annex) (July 1992)
`
`IPR2022-01228
`IP R2022-01 228
`EXHIBIT 1003 - PAGE 1857
`EXHIBIT 1003 - PAGE 1857
`
`

`

`(12) INTERNATIONAL APPLICATION PUBLISHED UNDER THE PATENT COOPERATION TREATY (PCT)
`
`(19) World Intellectual Property Organization
`International Bureau
`
` UN ETA
`
`(43) International Publication Date
`(10) International Publication Number
`31 May 2001 (31.05.2001)
`PCT
`WO 01/38984 Al
`
`
`(51) International Patent Classification’:
`HOAN 7/14
`
`GO6F 11/00,
`
`(72)
`(75)
`
`(21) International Application Number:
`
`PCT/US00/32551
`
`(22) International Filing Date:
`29 November 2000 (29.11.2000)
`
`(25) Filing Language:
`
`(26) Publication Language:
`
`English
`
`English
`
`Inventors; and
`Inventors/Applicants (for US only): BROWN, Julian
`[GB/GB]; 19 Ascham Road, Cambridge CB4 2BD (GB).
`RAND, Ricky [GB/GB]; Orchard House, 40 Barrington
`Road, Foxton, Cambridge CB2 6SJ (GB). CLARK, Paul
`[GB/GB]; The Old Mill, Mount Hawk, Truro, Cornwall
`TR4 8BL (GB).
`
`(74)
`
`Agents: RZUCIDLO,Eugene,C.et al.; Greenberg Trau-
`rig LLP, 885 Third Avenue, 21St Floor, New York, NY
`10022-4834 (US).
`
`(30) Priority Data:
`60/167,873
`60/170,388
`
`29 November 1999 (29.11.1999)
`13 December 1999 (13.12.1999)
`
`US
`US
`
`(81)
`
`(71) Applicants (for all designated States except US): FU-
`TURE TV TECHNOLOGIES, LTD. [GB/GB]; Dublin
`dE). RZUCIDLO, Eugene, C.
`[US/US]; Greenberg
`Traurig LLP, 885 Third Avenue, New York, NY 10022
`(US).
`
`Designated States (national): AE, AG, AL, AM, AT, AU,
`AZ, BA, BB, BG, BR, BY, BZ, CA, CH, CN, CR, CU, CZ,
`DE, DK, DM,DZ,EE, ES, FI, GB, GD, GE, GH, GM, HR,
`HU,ID,IL,IN,IS, JP, KE, KG, KP, KR, KZ, LC, LK, LR,
`LS, LT, LU, LV, MA, MD, MG, MK,MN, MW, MX,MZ,
`NO,NZ, PL, PT, RO, RU, SD, SE, SG, SI, SK, SL, TJ, T™,
`TR, TT, TZ, UA, UG, US, UZ, VN, YU, ZA, ZW.
`
`[Continued on next page]
`
`
`(54) Title: A SYSTEM AND METHODFOR MAINTAINING FAULT TOLERANCE WHEN DELIVERING MEDIA ON DE-
`MAND
`
` MonrtorR
` 200
`PEDIA
`STREAN
`
`
`Detect
`IAcTERROpNEh,
`
`210
`
`2s
`
`DETECT
`
`(57) Abstract: A system and methodis disclosed to deliver media on demand overa net-
`work. In particular, the present inventionutilizes replication and redundancy to provide
`inherent fault tolerance to a subscriber of a media on demand system over a network.
`A plurality of copies of a subscriber selected media content are provided on a network.
`Whena subscriber selects a particular selection of media contentto use, a first copy of
`the selected media contentis transmitted to the subscriber. This transmission is moni-
`toredfor interruptions(200). If an interruption is detected (205), the point of interruption
`in the transmission of the subscriber selected media content is determined. The location
`of a second copyof the subscriber selected media content on the network is determined
`(225) subsequently transmitted to the subscriber over the network, commencing from
`the point of interruption in the transmission ofthefirst copy of the subscriber selected
`media content.
`
`IPR2022-01228
`IPR2022-01228
`EXHIBIT 1003 - PAGE 1858
`EXHIBIT 1003 - PAGE 1858
`
` 20s
`(RTEREGPTIGAS
`220
`
`
`
`i
`MOTTE
`gree MER |
`OP
`(ATER
`EN
`
`
`
`CAATAA
`WO01/38984Al
`
`

`

`wo 01/38984 Ad
`
`—_IMMIUININITOMOTETA
`
`(84) Designated States (regional): ARIPO patent (GH,GM, — Before the expiration of the time limit for amending the
`KE, LS, MW, MZ, SD, SL, SZ, TZ, UG, ZW), Eurasian
`claims and to be republished in the event of receipt of
`patent (AM, AZ, BY, KG, KZ, MD, RU, TJ, TM), European
`amendments.
`patent (AT, BE, CH, CY, DE, DK, ES, FI, FR, GB, GR,IE,
`IT, LU, MC, NL, PT, SE, TR), OAPI patent (BF, BJ, CF,
`CG,Cl, CM, GA, GN, GW, ML, MR,NE, SN, TD, TG).
`
`For two-letter codes and other abbreviations, refer to the "Guid-
`ance Notes on Codes andAbbreviations" appearing at the begin-
`Published:
`
`—__With international search report. ning ofeach regular issue ofthe PCT Gazette.
`
`IPR2022-01228
`IPR2022-01228
`EXHIBIT 1003 - PAGE 1859
`EXHIBIT 1003 - PAGE 1859
`
`

`

`WO01/38984
`
`PCT/US00/32551
`
`A SYSTEM AND METHOD FOR MAINTAINING FAULT TOLERANCE
`
`WHEN DELIVERING MEDIA ON DEMAND
`
`CROSS-REFERENCE TO RELATED APPLICATION
`
`This application claims priority from U.S.
`provisional applications numbers 60/170,388 filed
`December 13, 1999 and 60/167,873 filed November 29,1999,
`
`the disclosures of which are incorporated herein by
`
`reference.
`
`FIELD OF THE INVENTION
`
`This invention relates generally to a system and
`
`method to deliver media on demand over a network.
`
`In
`
`invention utilizes replication,
`the present
`particular,
`redundancy and/or rate pacing to provide inherent fault
`
`tolerance to a subscriber of a media on demand system
`
`over a network.
`
`BACKGROUND OF THE INVENTION
`
`Consumer demand for enhanced on-site digital
`
`information and communication services are
`entertainment,
`growing rapidly.
`These services, colloquially referred
`to as media on demand services, encompass many prior
`
`audio and video services, and may include: basic
`
`television service, AM/FM broadcast radio, premium
`
`television and video service, PPV programming, video-on-
`
`demand (VOD), audio-on-demand (AOD),
`
`interactive video
`
`and television (IVT), video games and other entertainment
`
`programs, educational information and programs,
`scientific and other database research, “home-shopping”,
`
`infomercials,
`
`Internet access and the like.
`
`Media on demand holds out
`
`the promise that almost
`
`every movie or musical composition ever made will be
`available to a subscriber of the media on demand service.
`
`Instead of driving to a video rental or music store to
`
`select a movie or recorded musical work to play,
`
`the
`
`IPR2022-01228
`IPR2022-01228
`EXHIBIT 1003 - PAGE 1860
`EXHIBIT 1003 - PAGE 1860
`
`

`

`WO 01/38984
`
`PCT/US00/32551
`
`subscriber will be able to select any movie or musical
`
`composition stored in the systems media server library,
`
`and have that movie delivered to them over traditional
`
`distribution networks (i.e. cable systems,
`
`telephone
`
`networks, satellite systems, etc.).
`
`The use of various
`
`distribution networks to delivery media content to
`
`subscribers is well known in the art.
`
`U.S. patent No.5,905,522 to Lawler, U.S. patent No.
`
`5,675,738 to Suzuki et al., U.S. patent No. 5,629,732 to
`
`Moskowitz et al., U.S. patent No. 5,606,359 to Youden et
`
`al., U.S. patent No. 5,790,174 to Richard, III et al.;
`
`and U.S. patent No. 5,550,577 to Verbiest et al.,
`
`describe various media on demand services.
`
`A fundamental aspect of a media on demand system is
`
`the provision of a large amount of data from a data
`
`storage system to many users almost simultaneously
`
`without significant processing time or delay.
`
`In
`
`addition, another aspect of a media on demand system is
`
`to provide inherent fault tolerance against delivery
`
`interruptions of the media content provided to
`subscribers.
`
`SUMMARY OF THE INVENTION
`
`The present invention, a system and method for
`
`maintaining fault tolerance when delivering media on
`
`demand through redundancy, replication and/or rate pacing
`
`is directed to system and method that satisfies the need
`
`to provide media on demand subscribers with reliable
`
`media replete with inherent fault tolerance.
`
`In a preferred embodiment of the present invention,
`
`the instant method comprises the steps of:
`
`(i) providing
`
`a plurality of copies of media content on the network;
`
`(ii) providing a method for determining the location of a
`
`plurality of a particular selected media content on the
`
`network;
`
`(i111) providing a first copy of the particular
`
`IPR2022-01228
`IPR2022-01228
`EXHIBIT 1003 - PAGE 1861
`EXHIBIT 1003 - PAGE 1861
`
`

`

`WO 01/38984
`
`PCT/US00/32551
`
`selected media content to a subscriber through a network
`
`transmission;
`(iv) providing a method for detecting an
`interruption of the transmission of the particular
`selected media content to the subscriber;
`(v) selecting a
`
`second copy of the particular selected media content; and
`(vi)
`transmitting the second copy of the particular
`
`selected media content
`
`to the subscriber over the
`
`network.
`
`According to the present
`
`invention,
`
`the overall
`
`network is completely flexible in topology, and may
`
`consist of a number of differently sized arrays of
`
`clusters or individual clusters, connected together in
`
`any convenient manner, geographically distributed if
`required.
`In a preferred embodiment of the invention,
`each array of clusters is treated as an independent
`region in a hierarchical organization, and advertises
`itself as a unit to the higher-level network. See
`
`provisional patent application to Rand et al.,
`Application No. 60/155,388, entitled “A System and Method
`for Large-Scale, Distributed, Personalized Media on
`Demand” for a detailed description of the network
`
`architecture.
`
`Once a media subscriber selects an item of media
`
`content to receive, a request for the selected item of
`
`media content is made to a network manager.
`
`The
`
`selection may be made by a location-independent name.
`The network manager determines at least one media
`
`server holding a copy of the selected media content out
`of a plurality of possible media servers using the
`location- independent name. Determining the location of
`the media content comprises sending a request to a first
`
`mapping server to look up a media server holding a copy
`of the selected item of media in a map held by the first
`
`mapping server.
`
`Each mapping server maintains a list of
`
`IPR2022-01228
`IPR2022-01228
`EXHIBIT 1003 - PAGE 1862
`EXHIBIT 1003 - PAGE 1862
`
`

`

`WO01/38984
`
`PCT/US00/32551
`
`all media content
`
`in its region, and the distance (hops)
`
`of the media content from the network manager.
`
`If known
`
`at the first mapping server,
`
`the request is responded to
`
`directly with the address of the first media server
`
`holding a copy of the selected media content.
`
`If not
`
`known at the first mapping server,
`
`the request
`
`is
`
`Gelegated to a second mapping server. This process is
`
`continued until a mapping server determines the location
`
`of the selected media on a media server and the distance
`
`(hops) of the media content from the network manager.
`
`The network manager then directs the closest media server
`
`maintaining the selected media content to deliver the
`
`media content to the subscriber.
`
`If during the presentation of the selected media to
`
`the subscriber the media delivery stream is interrupted,
`
`the network manager is notified of this event and
`
`determines the point
`
`in time the media server ceased
`
`delivery of the media content stream.
`
`A request is then
`
`made to the network manager to find a different copy of
`
`the selected media.
`
`Similar to above,
`
`the network manager determines the
`
`location of the selected media content by sending a
`
`request
`
`to a first mapping server to determine a media
`
`server holding a different copy of the selected media
`
`content.
`
`If known at the first mapping server,
`
`the
`
`request is responded to directly with the address of the
`
`next closest media server holding the different copy of
`
`the selected media content.
`
`If not known at the first
`
`mapping server,
`
`the request is delegated to a second
`
`mapping server. This process is continued until a
`
`mapping server determines the location of the different
`
`copy of the selected media content on a media server. The
`
`media server is then directed to deliver the closest
`
`different copy of the selected media content to the
`
`IPR2022-01228
`IPR2022-01228
`EXHIBIT 1003 - PAGE 1863
`EXHIBIT 1003 - PAGE 1863
`
`

`

`WO01/38984
`
`PCT/US00/32551
`
`requesting subscriber at the exact point
`
`in time of the
`
`media content stream that the original copy of the media
`
`content ceased delivery.
`
`In one embodiment of the invention,
`
`the change from
`
`one media source to another media source appears seamless
`
`with the addition of a buffer storage system.
`
`In another
`
`embodiment of the invention,
`
`the buffer storage system
`
`employs rate pacing with a feedback loop to assist in
`
`replenishment of the buffer storage system.
`
`BRIEF DESCRIPTION OF THE DRAWINGS
`
`FIGURE 1 shows an illustrative block diagram
`
`depicting a minimal embodiment of a media on demand
`
`system in accordance with the invention.
`
`FIGURE 2 shows a block diagram depicting the fault
`
`tolerance method according to one embodiment of the
`
`present
`
`invention.
`
`DETAILED DESCRIPTION OF THE INVENTION
`
`A minimal embodiment of a media on demand system in
`
`accordance with one embodiment of the present
`
`invention
`
`is shown in Figure 1. This minimal embodiment is show for
`
`the purpose of clarity. However,
`
`the system comprising
`
`the present
`
`invention is designed to scale well beyond
`
`the size depicted here.
`
`Figure 1 shows two clusters, Cl
`
`and C2 connected by packet switch network N1.
`
`There are
`
`common elements and differences in each network.
`
`Common
`
`elements include packet switches PS1 and PS2, and cluster
`
`or network managers CM1 and CM2.
`
`Packet switches PS1 and PS2 are high-bandwidth
`
`packet switches such as are known in the art, and provide
`
`internal links within each cluster and also inter-cluster
`
`links via packet switch network Ni.
`
`Cluster manager unit CM1l is an industrialized
`
`computer hosting at least mapping server MAP1. Cluster
`
`IPR2022-01228
`IPR2022-01228
`EXHIBIT 1003 - PAGE 1864
`EXHIBIT 1003 - PAGE 1864
`
`

`

`WO 01/38984
`
`PCT/US00/32551
`
`manager unit CM2 is an industrialized computer hosting at
`
`least mapping server MAP2.
`
`Mapping server MAP1 obtain maps of content
`
`availability from media servers MS11 and MS12 connected
`
`to local packet switch PS1. Similarly, mapping server
`
`MAP2 obtain maps of content availability from media
`
`servers MS21 and MS22 connected to local packet switch
`
`PS2. Mapping servers MAP1 and MAP2 then broadcast
`
`advertisements of the content and services resident on
`
`their media servers to corresponding mapping services in
`
`other clusters in network region 1 through a flooding
`
`process such as is known in the art for routing topology
`
`advertisement. Conversely, on receipt of content and
`
`service advertisements from other clusters, mapping
`
`servers MAP1 and MAP2 generate a global map of the
`
`availability of content and services for use by the
`
`cluster managers CM1 and CM2 respectively.
`
`Media servers MS11, MS12, MS21 and MS22 are units
`
`which store items of media content as files on hard disks
`
`or other memory devices, and which can be instructed to
`
`deliver the items of media content as a plurality of
`
`interleaved, substantially regular streams of data onto a
`
`network.
`
`Such units are well known in the prior art, and
`
`may be constructed from commonly available computer
`
`equipment or custom hardware as is required.
`
`Cluster Cl also provides a cache media server CMS13
`
`through which items of media content are directed the
`
`first time they are requested, and from which they can be
`
`served directly without using external network bandwidth
`
`on subsequent requests from subscribers on the same
`cluster.
`
`In cluster Cl, subscriber access network SAN1 may be
`
`one of a number of mechanisms for distribution of high-
`
`speed data to residential or business subscribers, well
`
`IPR2022-01228
`IPR2022-01228
`EXHIBIT 1003 - PAGE 1865
`EXHIBIT 1003 - PAGE 1865
`
`

`

`WO 01/38984
`
`PCT/US00/32551
`
`known in the art,
`
`including but no limited to ADSL over
`
`traditional telephony and QAM/MCNS over traditional
`
`community antenna television networks.
`
`The subscriber interface is set top box STB1. A
`
`minimal embodiment of STB1 comprises: a microprocessor,
`
`random access memory and non-volatile storage for boot
`
`software; a network interface connected to subscriber
`
`access network SAN1; an input device to input commands to
`
`STBi; and a media player output to play audio and/or
`
`video on a media player, such as a television or stereo.
`
`According to the present invention,
`
`the overall
`
`network is completely flexible in topology, and may
`
`consist of a number of differently sized arrays of
`
`clusters or individual clusters, connected together in
`
`any convenient manner, geographically distributed if
`
`required. See provisional patent application to Rand et
`
`al., Application No. 60/155,388, entitled “A System and
`
`Method for Large-Scale, Distributed, Personalized Media
`
`on Demand” for a further description of the network.
`
`Once a media subscriber selects an item of media
`
`content to receive, a request for the selected item of
`
`media content is made to a network cluster manager.
`
`The
`
`selection may be made by a location-independent name.
`
`The system and method of selecting and delivering media
`
`on demand to a subscriber is fully described ina
`
`provisional patent application to Rand et al.,
`
`Application No. 60/155,388, entitled “A System and Method
`
`for Large-Scale, Distributed, Personalized Media on
`
`Demand” which is incorporated by reference herein.
`
`Initial Delivery of Media
`
`A subscriber provides input
`
`to set top box STB1 for
`
`a selection of media content.
`Set
`top box STB1 transmits
`this selection to cluster manager CM1 through subscriber
`
`access network SAN1 and packet switch PS1. Cluster
`
`IPR2022-01228
`IPR2022-01228
`EXHIBIT 1003 - PAGE 1866
`EXHIBIT 1003 - PAGE 1866
`
`

`

`WO 01/38984
`
`PCT/US00/32551
`
`manager CM1
`
`transmits this selection to mapping server
`
`MAP1 and receives a list of all available media
`
`responsive to the subscriber’s selection in the region,
`
`and the distance (hops)
`
`from cluster manager CM1 to the
`
`media server maintaining the requested media.
`
`Ina
`
`preferred embodiment of the invention,
`
`the list for
`
`multiple copies of the selected media is maintained in
`
`hierarchical order,
`
`from the closest media server to the
`
`furthest media server.
`
`In another preferred embodiment
`
`of the invention, all copies of the selected media
`
`equidistant from the cluster manager are arranged ina
`
`round-robin fashion.
`
`If the requested media content is known at mapping
`
`server MAP1 (i.e.
`
`in region 1),
`
`the request is responded
`
`to directly with the address of the first media server
`
`holding a copy of the selected media content.
`
`If not
`
`known at mapping server MAP1 (i.e. not within region 1),
`
`cluster manager CM1i communicates the subscriber's
`
`selection to a cluster manager
`
`(not shown) outside of the
`
`region through packet switch work N1. This process is
`
`continued until a mapping server determines the location
`
`of the selected media on a media server and the distance
`
`(hops) of the media content from cluster manager CMl1.
`
`The cluster manager for the mapping server determining
`
`the location of the subscriber’s selected media content
`
`provides this information to cluster manager CM1 through
`
`packet switch network Nil.
`
`For the purpose of example, it is assumed that
`
`mapping server MAP1 determines the following locations
`
`for the subscriber’s media request made through cluster
`
`manager CM1, and communicates this information to cluster
`
`manager CM1.
`
`LOCATION
`
`LOCATION OF
`
`DISTANCE (HOPS) TO
`
`SUBSCRIBER'S
`
`IPR2022-01228
`IPR2022-01228
`EXHIBIT 1003 - PAGE 1867
`EXHIBIT 1003 - PAGE 1867
`
`

`

`WO01/38984
`
`PCT/US00/32551
`
`REQUEST
`
`
`
`
`
`2
`
`MS-21
`
`2
`
`The requesting cluster manager then directs the
`
`closest media server maintaining the selected media
`
`content
`
`to deliver the media content to the subscriber
`
`through the set top box.
`
`The transmission of the media
`
`content is originally at a higher rate than the normal
`
`subscriber user rate to fill a buffer located in the set
`
`top box.
`
`The transmission rate of the media content
`
`then
`
`slows as the buffer in the set top box fills.
`
`The
`
`request is made through the cluster manager for the
`
`cluster maintaining the selected media content.
`
`The cluster manager then communicates the
`
`origination (location) of this media stream to the
`
`subscriber's set top box receiving the selected media
`
`content stream. Knowing the origination of the selected
`
`media stream,
`
`the step top box can then communicate
`
`directly with the media server for the purpose of
`
`controlling media delivery operations, such as fast-
`
`forward,
`
`rewind, stop and play, and provide dynamic rate
`
`pacing to facilitate fault tolerance in the delivery
`rate.
`
`By way of the above referenced example, cluster
`
`manager CM1 communicates with media server MS-11 and
`
`requests the subscriber's selected media content to be
`
`delivered to set top box STB1 through subscriber access
`
`network SAN1. Cluster manager CM1 also communicates with
`
`set top box STB1 and provides the dispatch location
`
`(MS11)
`
`for the subscriber’s selected media.
`
`The transmission of the media is monitored and
`
`tracked as some multiple of a finite unit to determine
`
`IPR2022-01228
`IPR2022-01228
`EXHIBIT 1003 - PAGE 1868
`EXHIBIT 1003 - PAGE 1868
`
`

`

`WO 01/38984
`
`PCT/US00/32551
`
`10
`
`the amount of media transmitted. Any number cf unit
`
`types may be used to monitor the media transmitted.
`
`In
`
`one embodiment of the invention,
`
`the aggregate
`
`transmission or subscriber receive time (in seconds,
`
`minutes, etc.) is used to monitor and track the selected
`
`media stream units.
`
`In another embodiment of the
`
`invention the frames transmitted or received
`
`(particularly for video applications) are used to monitor
`
`and track the selected media stream units.
`
`In still a
`
`further embodiment of the invention,
`
`the bytes of data
`
`transmitted or received are used to monitor and track the
`
`selected media stream units.
`
`Any number of equipment forming the network can
`
`monitor the transmission of the requested media content.
`
`In a preferred embodiment of the invention, set top box
`
`STB1 monitors the transmission of the requested media
`
`content.
`
`In another embodiment of the invention, cluster
`
`manager CM1 monitors the transmission of the requested
`
`media content.
`
`In still a further embodiment of the
`
`invention, media server MS-11 monitors the transmission
`
`of the requested media content
`
`In a preferred embodiment of the invention, set top
`
`box STB1 includes a buffer which stores a finite quantity
`
`of transmission units of the selected media content.
`
`Fault Tolerance
`
`A block diagram showing a method to maintain fault
`
`tolerance according to one embodiment of the invention is
`
`shown in figure 2.
`
`The illustrated method monitors a
`
`media stream being transmitted to the subscriber as shown
`
`in step 200.
`
`If set top box STB1 detects an
`
`interruption in the selected media content data stream
`
`originating from media server MS11 as shown in step 205,
`
`it automatically transmits a stop command to media server
`
`MS11,
`
`followed by a momentary rewind command and a play
`
`IPR2022-01228
`IPR2022-01228
`EXHIBIT 1003 - PAGE 1869
`EXHIBIT 1003 - PAGE 1869
`
`

`

`WO 01/38984
`
`PCT/US00/32551
`
`11
`
`command, as shown in step 210.
`
`If the set top box STB
`
`still detects an interruption in the selected media
`
`content data stream, as shown in step 215 it:
`
`(i)
`
`notifies cluster manager CM1 of the interruption, step
`
`220;
`
`(ii) provides the interruption point, i.e. unit
`
`location in the transmission of the interruption,
`
`to
`
`cluster manager CM1, step 225; and (iii) requests another
`
`copy of the selected media content to cluster manager
`
`CM1, step 230.
`
`The unit location of the transmission
`
`interruption is provided as a multiple of the units used
`
`to monitor and track the transmission.
`
`In one embodiment
`
`of the invention,
`
`the units are a function of the
`
`selected media transmitted by the media server.
`
`In
`
`another embodiment of the invention,
`
`the units are
`
`functions of the selected media received by the set top
`
`box.
`
`Cluster manager CM1 then communicates with mapping
`
`server MAP1 to determine the location of the next media
`
`server maintaining a copy of the selected media content.
`
`Once prompted by cluster manager CM1, mapping server MAP1
`
`determines the next closest media server maintaining a
`
`copy of the selected media content.
`
`For the purpose of
`
`the above example, mapping server MAP1 determines that
`
`media server MS21 maintains the next closest copy of the
`
`selected media content. Cluster manager CM1 then
`
`communicates with cluster manager CM2 and requests that a
`
`copy of the selected media content be delivered from
`
`media ser