WO 00/48100
`
`PCT/GB00/00487
`
`-35-
`
`time stamp in the refresh command is contemporaneous with
`
`the global TxTs at the server, a 40 second resistant
`
`timeout is exerted at the server before responding to the
`
`refresh request. This is implemented by the hoid ring
`
`previously described.
`
`If during the period of the
`
`resistant timeout,
`
`the content of the HTML page at the
`
`server is modified by another viewer,
`
`the modified page is
`
`returned to the browser as the response to the refresh
`
`request. This is by the process of qualification and
`
`requalification previously described.
`
`If during the
`
`period of the resistant timeout,
`
`the content of the HTML
`
`the server will
`page at the server does not change,
`respond to the request with either: a true refresh of the
`same page by resubmitting the original, or near original
`
`data to the browser; or issue an HTTP Code 204 response
`
`indicating no change in page status or content.
`
`In the manner described a plurality of IUAs
`
`1 have a near
`
`contemporaneous shared view of a Web page. This is view
`
`is also kept up to date as soon as the Web page changes.
`
`IPR2022-01227
`IPR2022-01227
`EXHIBIT 1003 - PAGE 01831
`EXHIBIT 1003 - PAGE 01831
`
`

`

`WO 00/48100
`
`PCT/GB00/00487
`
`Claims:
`
`-36-
`
`10
`
`15
`
`20
`
`25
`
`A system for processing requests in a request-
`
`response client-server computer network in which a
`
`plurality of clients communicate with a server by
`
`issuing requests to read or write data, comprising:
`
`-
`
`-
`
`-
`
`a request receiver for receiving a plurality of
`
`requests from the clients;
`a request analyser for analysing each of the
`
`plurality of requests in turn passed from the
`
`request receiver;
`
`a request 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;
`
`-
`
`a state indicator for indicating,
`
`for each
`
`deferrable request, when the actionable state is
`
`reached such that each such deferrable request
`
`is requalified as an actionable request; and
`
`-
`
`a response indicator for indicating for each
`
`actionable request to the server that each such
`
`actionable request should be actioned and a
`
`response provided.
`
`A system according to claim 1, wherein the request
`
`analyser comprises a request queue store for storing
`
`requests in order of arrival of requests at the
`
`request receiver.
`
`A system according to claim 2 or 3, wherein the
`
`request analyser comprises a request retriever for
`
`retrieving requests from the request queue store in
`
`order of arrival at the request receiver and for
`
`IPR2022-01227
`IPR2022-01227
`EXHIBIT 1003 - PAGE 01832
`EXHIBIT 1003 - PAGE 01832
`
`

`

`WO 00/48100
`
`PCT/GBO00/00487
`
`-37-
`
`passing the requests so retrieved to the request
`qualifier.
`
`A system according to claim 1,
`
`2 or 3, wherein the
`
`request analyser is arranged to determine whether the
`request is to read or write data.
`
`A system according to claim 4, further comprising a
`controller for controlling operation of the request
`analyser,
`request qualifier, state indicator and
`response indicator, and for optionally suspending
`operation of each, if the request analyser determines
`that the-next-request is to write data, until the
`data has been written.
`
`A system according to any preceding claim, wherein
`the request analyser is arranged to extract from each
`request a time indicator indicative of when the last
`transaction providing a response from the server to
`
`the client occurred.
`
`A system according to claim 6, wherein the time
`indicator is a time stamp.
`
`A system according to claim 6 or 7, wherein the
`request qualifier is arranged to compare the
`extracted time indicator with the time the requested
`data was last modified.
`
`A system according to claim 8, wherein the request
`qualifier is arranged to qualify a request as an
`actionable request if the time indicator indicates a
`time earlier than the time the requested data was
`last modified.
`
`10
`
`15
`
`20
`
`25
`
`30
`
`IPR2022-01227
`IPR2022-01227
`EXHIBIT 1003 - PAGE 01833
`EXHIBIT 1003 - PAGE 01833
`
`

`

`WO 00/48100
`
`PCT/GB00/00487
`
`- 38 -
`
`10.
`
`A system according to claim 8 or 9, wherein the
`
`request qualifier is arrange to qualify the request
`
`as deferrable if the time indicator indicates a time
`
`later than or equal to the time the requested data
`
`was last modified.
`
`ll.
`
`A system according to any of claims 6 to 10, wherein
`
`the state indicator comprises a held request store
`
`for storing deferrable requests in time indicator
`
`order.
`
`12.
`
`A system according to claim 11, wherein the state
`
`indicator comprises a held request retriever for
`
`retrieving requests from the held request store in
`
`time indicator order,
`
`the qualifier being arranged to
`
`qualify by comparing the time the requested data was
`last modified with the time indicator,
`the state
`
`indicator arranged to indicate that an actionable
`
`state is reached if the time indicator indicates a
`
`time older than the time the requested data was last
`
`modified.
`
`13.
`
`A system according to claim 12, wherein the held
`
`request retriever is arranged to periodically
`
`retrieve requests from the held request store.
`
`14.
`
`A system according to claim 12 or 13, wherein the
`
`held request retriever is arranged to retrieve
`
`requests from the held request store in response to a
`
`notification from the server that data stored at the
`
`server has changed.
`
`10
`
`15
`
`20
`
`15.
`
`A method for processing requests in a request-—
`
`response client-server computer network in which a
`plurality of clients communicate with a server by
`
`U2 in
`
`issuing requests to read or write data, comprising:
`
`IPR2022-01227
`IPR2022-01227
`EXHIBIT 1003 - PAGE 01834
`EXHIBIT 1003 - PAGE 01834
`
`

`

`WO 00/48100
`
`PCT/GB00/00487
`
`-39-
`
`~
`
`-
`
`-
`
`receiving a plurality of requests from the
`
`clients at a receiver;
`
`analysing each of the plurality of requests
`
`passed from the request receiver in a request
`
`analyser;
`
`qualifying each request in a request qualifier
`
`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;
`
`-
`
`indicating from a state indicator, for each
`
`Geferrable request, when the actionable state is
`
`reached such that each such deferrable request
`
`is requalified as an actionable request; and
`
`-
`
`indicating from a response indicator for each
`
`actionable request to the server that each such
`
`actionable request should be actioned and a
`
`response provided.
`
`10
`
`15
`
`20
`
`16.
`
`A method according to claim 15, wherein the step of
`
`analysing further comprises storing requests ina
`
`request queue store in order of arrival of the
`
`requests at the request receiver.
`
`25
`
`17.
`
`A method according to claim 15, or 16, wherein the
`
`step of analysing further comprises retrieving
`
`requests from the request queue store in order of
`
`arrival at the request receiver and passing the
`
`requests so retrieved to the request qualifier.
`
`18.
`
`A method according to any of claims 15, 16 or 17,
`
`wherein the step of analysing further comprises
`
`determining whether the request is to read or write
`data.
`
`IPR2022-01227
`IPR2022-01227
`EXHIBIT 1003 - PAGE 01835
`EXHIBIT 1003 - PAGE 01835
`
`

`

`WO00/48100
`
`PCT/GB00/00487
`
`- 40 -
`
`19.
`
`A method according to claim 18, further comprising
`
`controlling operation of the request analyser,
`
`request qualifier, state indicator and response
`indicator with a controller, and optionally
`
`suspending operation of each, if the request analyser
`determines that the next request is to write data,
`
`until the data has been written.
`
`20.
`
`A method according to any of claims 15 to 19, wherein
`
`the step of analysing each request comprises
`extracting from each request a time indicator
`indicative of when the last transaction providing a
`
`response-from-the server to the client occurred.
`
`21.
`
`A method according to claim 20, wherein the time
`
`indicator is a time stamp.
`
`22.
`
`A method according to claim 20 or 21 wherein,
`
`for a
`
`request to read data,
`
`the request qualifier compares
`
`the extracted time indicator with the time the
`
`requested data was last modified.
`
`23.
`
`A method according to claim 22, wherein the request
`
`qualifier qualifies the request as an actionable
`request if the time indicator indicates a time
`
`earlier than the time the requested data was last
`
`modified.
`
`24.
`
`A method according to claim 22 or 23 wherein the
`
`request qualifier qualifies the request as a
`
`deferrable request if the time indicator indicates a
`
`time later than or equal
`
`to the time the requested
`
`data was last modified.
`
`10
`
`15
`
`25
`
`30
`
`IPR2022-01227
`IPR2022-01227
`EXHIBIT 1003 - PAGE 01836
`EXHIBIT 1003 - PAGE 01836
`
`

`

`WO00/48100
`
`PCT/GB00/00487
`
`-4]-
`
`25.
`
`A method according to any of claims 20 to 24, further
`
`comprising storing deferrable requests in a held
`request store in time indicator order.
`
`26.
`
`A method according to claim 25, further comprising
`
`retrieving requests from the held request store,
`comparing the time indicator of the requests with the
`time the requested data was last modified, wherein
`
`the actionable state is reached if the time indicator
`
`indicates a time earlier than the time the requested
`
`data was last modified.
`
`27.
`
`A method”according to claim 26, wherein the step of
`
`retrieving comprises periodically retrieving requests
`
`from the held request store.
`
`28.
`
`A method according to claim 26 or 27, wherein the
`
`step of retrieving comprises retrieving requests from
`the held request store in response to a notification
`
`from the server that data stored at the server has
`
`changed.
`
`29.
`
`A request-response client-server computer network
`comprising a plurality of clients and a server with
`which the client communicate by issuing requests to
`
`read or write data, comprising:
`
`at each client:
`
`—
`
`-
`
`a client data store holding data provided from
`
`the server; and
`
`a request provider for issuing requests to read
`
`or write data to the server;
`
`at each server:
`
`-
`
`-
`
`a server data store holding a master copy of
`
`data provided to each client;
`
`a request receiver for receiving a plurality of
`
`10
`
`15
`
`20
`
`25
`
`35
`
`requests from the clients;
`
`IPR2022-01227
`IPR2022-01227
`EXHIBIT 1003 - PAGE 01837
`EXHIBIT 1003 - PAGE 01837
`
`

`

`WO 00/48100
`
`PCT/GB00/00487
`
`-
`
`-
`
`-
`
`-
`
`-42-
`
`a request analyser for analysing each of the
`plurality of requests in turn passed from the
`request receiver;
`a request 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;
`
`a state indicator for indicating, for each
`deferrable request, when the. actionable state is
`reached such that each such deferrable request
`isrequalified as an actionable request; and
`a response indicator for indicating for each
`actionable request that each such actionable
`request should be actioned by the server and a
`response provided from the server.
`
`30.
`
`31.
`
`A network according to claim 29, wherein the request
`analyser comprises a request queue store for storing
`requests in order of arrival of requests at the
`
`request receiver.
`
`A network according to claim 29 or 30, wherein the
`request analyser comprises a request retriever for
`retrieving requests from the request queue store in
`order of arrival at the request receiver and for
`
`passing the requests so retrieved to the request
`
`qualifier.
`
`32.
`
`A network according to claim 29, 30 or 31, wherein
`
`the request analyser is arranged to determine whether
`
`the request is to read or write data.
`
`10
`
`15
`
`20
`
`25
`
`30
`
`IPR2022-01227
`IPR2022-01227
`EXHIBIT 1003 - PAGE 01838
`EXHIBIT 1003 - PAGE 01838
`
`

`

`WO 00/48100
`
`PCT/GB00/00487
`
`-43-
`
`33.
`
`A network according to claim 32, further comprising a
`
`controller for controlling operation of the request
`
`request qualifier, state indicator and
`analyser,
`response indicator, and for optionally suspending
`operation of each, if the request analyser determines
`that the next request is to write data, until the
`
`data has been written.
`
`10
`
`34.
`
`A network according to any of claims 29 to 33,
`
`wherein the request provider is arranged to issue
`
`requests to read data from the server data store,
`each request including a time indicator indicative of
`when thelast transaction providing a response from
`
`the server to the client occurred.
`
`15
`
`35.
`
`A network according to any of claims 29 to 34,
`
`wherein the request analyser further comprises means
`for extracting from each request the time indicator.
`
`20
`
`25
`
`30
`
`35
`
`36.
`
`A network according to claim 35, wherein the time
`
`indicator is a time stamp.
`
`37.
`
`A network according to claim 35 or 36, wherein the
`
`request qualifier is arranged to compare the
`extracted time indicator with the time the requested
`
`data was last modified in the server data store.
`
`38.
`
`A network according to claim 37, wherein the request
`
`qualifier is arranged to qualify a request as an
`actionable request if the time indicator indicates a
`
`time earlier than the time the requested data was
`
`last modified in the server data store.
`
`39.
`
`A network according to claim 37 or 38, wherein the
`
`request qualifier is arrange to qualify the request
`
`as deferrable if the time indicator indicates a time
`
`IPR2022-01227
`IPR2022-01227
`EXHIBIT 1003 - PAGE 01839
`EXHIBIT 1003 - PAGE 01839
`
`

`

`WO 00/48100
`
`PCT/GB00/00487
`
`- 44.
`
`later than or equal
`
`to the time the requested data
`
`was last modified.
`
`40.
`
`A network according to any of claims 35 to 39,
`
`wherein the state indicator comprises a held request
`
`store for storing deferrable requests in time
`
`indicator order.
`
`41.
`
`A network according to claim 40, wherein the state
`
`indicator comprises held request retriever for
`
`periodically retrieving requests from the held
`
`the qualifier being arranged to
`request store,
`qualifyby comparing the time the requested data was
`last modified with the time indicator,
`the state
`
`indicator arranged to indicate that an actionable
`
`state is reached if the time indicator indicates a
`
`time older than the time the requested data was last
`
`modified.
`
`42.
`
`A network according to claim 34, wherein each client
`
`is arranged to repeatedly issue requests to read data
`
`from the server data store and to write the data
`
`received to the client data store.
`
`43.
`
`A network according to claim 42, wherein the client
`
`data store and server data store hold structured
`
`data.
`
`44,
`
`A network according to claim 43, wherein the
`
`structured data in the client data store forms a
`
`Client database, and the time indicator is indicative
`
`of when the Last transaction providing a response
`
`from the server to the client occurred.
`
`45.
`
`A network according to claim 43 or 44, wherein the
`
`structured data in the server data store forms a
`
`10
`
`15
`
`20
`
`25
`
`IPR2022-01227
`IPR2022-01227
`EXHIBIT 1003 - PAGE 01840
`EXHIBIT 1003 - PAGE 01840
`
`

`

`WO 00/48100
`
`PCT/GB00/00487
`
`- 45 -
`
`server database, and each portion of the server
`
`database includes a time field indicating the time at
`
`which the portion of data was last modified.
`
`46.
`
`A network according to claim 42, wherein te client
`
`data store and server data store hold unstructured
`
`data.
`
`47.
`
`A network according to claim 42, wherein the
`
`unstructured data is a page of HTML data.
`
`48.
`
`A computer program product for controlling a computer
`
`in a réquest-response client-server computer network
`
`in which a plurality of clients communicate with a
`
`server by issuing requests to read or write data,
`
`comprising a recording medium readable by the
`computer; and means recorded on the recording medium
`
`for directing the computer to:
`
`-
`
`-
`
`-
`
`receive a plurality of requests from the clients
`
`at a receiver;
`
`analyse each of the plurality of requests passed
`
`from the request receiver in a request analyser;
`
`qualify each request
`
`in a request qualifier as
`
`either an actionable request for which action
`
`should be taken and a response issued, or a
`
`10
`
`15
`
`25
`
`deferrable request for which action should be
`
`delayed and a response deferred until an
`
`actionable state is reached;
`
`-
`
`indicate from a state indicator,
`
`for each
`
`deferrable request, when the actionable state is
`
`reached such that each such deferrable request
`
`is requalified as an actionable request; and
`
`_
`
`indicate from a response indicator for each
`
`actionable request
`
`to the server that each such
`
`actionable request should be actioned and a
`
`tad WN
`
`response provided.
`
`IPR2022-01227
`IPR2022-01227
`EXHIBIT 1003 - PAGE 01841
`EXHIBIT 1003 - PAGE 01841
`
`

`

`WO 00/48100
`
`PCT/GB00/00487
`
`~ 46 -
`
`49.
`
`50.
`
`51.
`
`52.
`
`A computer program product according to claim 48,
`wherein the step of analysing further comprises
`storing requests in a request queue store in order of
`arrival of the requests at the request receiver.
`
`A computer program product according to claim 48, or
`49, wherein the step of analysing further comprises
`retrieving requests from the request queue store in
`order of arrival at the request receiver and passing
`the requests so retrieved to the request qualifier.
`
`A computér program product according to any of claims
`48, 49 or 50, wherein the step of analysing further
`comprises determining whether the request is to read
`or write data.
`
`A computer program product according to claim 51,
`means further comprising a control subroutine for
`controlling operation of the request analyser,
`request qualifier, state indicator and response
`indicator with a controller, and suspending operation
`
`the
`
`if the request analyser determines that the
`of each,
`next request is to write data, until the data has
`been written.
`
`53.
`
`A computer program product according to any of claims
`48 to 52, wherein the step of analysing each request
`comprises extracting from each request a time
`indicator indicative of when the requesting client
`
`last received a response from the server.
`
`54.
`
`A computer program product according to claim 53,
`wherein the time indicator is a time stamp.
`
`10
`
`15
`
`20
`
`25
`
`IPR2022-01227
`IPR2022-01227
`EXHIBIT 1003 - PAGE 01842
`EXHIBIT 1003 - PAGE 01842
`
`

`

`WO 00/48100
`
`PCT/GB00/00487
`
`10
`
`15
`
`20
`
`55.
`
`56.
`
`57.
`
`58.
`
`59.
`
`-47-
`
`A computer program product according to claim 53 or
`54 wherein,
`for a request to read data,
`the request
`qualifier compares the extracted time indicator with
`the time the requested data was last modified.
`
`A computer program product according to claim 55,
`wherein the request qualifier qualifies the request
`as an actionable request if the time indicator
`indicates a time older than the time the requested
`
`data was last modified.
`
`A computer program product according to claim 55 or
`56 wherein therequest qualifier qualifies the
`request as a deferrable request if the time indicator
`indicates a time younger than the time the requested
`
`data was last modified.
`
`A computer program product according to any of claims
`53 to 57, further comprising storing deferrable
`requests in a held request store in time indicator
`order.
`
`A computer program product according to claim 58,
`further comprising periodically retrieving requests
`from the held request store, comparing the time
`indicator of the requests with the time the requested
`
`data was last modified, wherein the actionable state
`
`is reached if the time indicator indicates a time
`
`older than the time the requested data was last
`
`modified.
`
`60.
`
`to 14, wherein
`A system according to any of claims 1
`the requests and responses are HTTP requests and
`
`responses.
`
`IPR2022-01227
`IPR2022-01227
`EXHIBIT 1003 - PAGE 01843
`EXHIBIT 1003 - PAGE 01843
`
`

`

`WO 00/48100
`
`PCT/GB00/00487
`
`-~ 48 -
`
`61.
`
`A method according to any of claims 15 to 28, wherein
`
`the requests and responses are HTTP requests and
`
`responses.
`
`62.
`
`A network according to any of claims 29 to 47 wherein
`
`the requests and responses are HTTP requests and
`
`responses.
`
`63.
`
`A computer program product according to any of claims
`48 to 59 wherein the requests and responses are HTTP
`
`requests and responses.
`
`5
`
`10
`
`IPR2022-01227
`IPR2022-01227
`EXHIBIT 1003 - PAGE 01844
`EXHIBIT 1003 - PAGE 01844
`
`

`

`WO 00/48100
`
`PCT/GB00/00487
`
`SJ9UMQ
`
`SWdaY
`
`
`
`41aSf/ABAIBS
`
`SUOIJESUBIL
`
`[zt]
`
`Jasn
`
`ssouisng
`
`syalqo
`
`HOLIMS
`
`Tz]
`
`1/10
`
`[zz
`
`]siasp
`
`BAY|
`
`
`
`[og]21035
`
`3X9}U0Z19S
`
`
`
`[9z]a}eb9|0q
`
`
`
`[oz]ajebojeq
`
`peau;
`
`Tdanotd
`
`je907
`
`
`palqoJeysew
`(7=VATWald
`[ge]suonoesuel)
`
`[ve]dwing
`
`
`[Zp]sojeo1doy
`[se]sdoureyuo)
`
`aseqeyeg
`
`[pt]21035
`ayoe)
`[op]siasn
`
`onealenema!
`pelqo
`eg
`
`
`Hulpuej}s}no
`
`SS]enondaiAUy
`
`[st]
`
`Jasn/uat|d
`
`3qUM
`
`aM
`
`ajebajaq
`
`|
`
`[ot]
`
`Bulpuad
`
`uolpesuely
`
`
`
`[oe]anand
`
`je007
`
`[ze]
`
`
`
`SUBSTITUTE SHEET (RULE26)
`
`IPR2022-01227
`IPR2022-01227
`EXHIBIT 1003 - PAGE 01845
`EXHIBIT 1003 - PAGE 01845
`
`
`
`
`
`
`
`
`
`

`

`WO 00/48100
`
`PCT/GB00/00487
`
`2/10
`
`¢
`
`BID
`
`Jase
`
`eyed
`
`2la~
`
`abuey)
`
`anant)
`
`oe
`
`LOZ~|anandysanbey
`
`NS|
`
`Vtaunoldjelodwa}
`|anan?)ILpollajaq
`ory~|ASNOdS3u
`YOLVOIGNI
`
`ayeIpawwy]
`
`asuodsay
`
`SUBSTITUTE SHEET (RULE26)
`
`IPR2022-01227
`IPR2022-01227
`EXHIBIT 1003 - PAGE 01846
`EXHIBIT 1003 - PAGE 01846
`
`
`
`
`
`

`

`WO 00/48100
`
`PCT/GB00/00487
`
`3/10
`
`Adod
`
`aseqeyeqd
`
`Zaungld
`
`J0.19UIWUOD-F
`
`uoneoddy
`
`
`
`
`
`Spl]AYOUMS
`
`IO|Svj|
`
`asequied
`
`
`
`SUBSTITUTE SHEET (RULE 26)
`
`IPR2022-01227
`IPR2022-01227
`EXHIBIT 1003 - PAGE 01847
`EXHIBIT 1003 - PAGE 01847
`
`
`

`

`WO00/48100
`
`PCT/GB00/00487
`
`4/10
`
`FIGURE 3 LES
`— |e
`
`EIGURE 4
`
`Thread Ring=>joa
`
`SUBSTITUTE SHEET (RULE26)
`
`IPR2022-01227
`IPR2022-01227
`EXHIBIT 1003 - PAGE 01848
`EXHIBIT 1003 - PAGE 01848
`
`

`

`WO 00/48100
`
`PCT/GB00/00487
`
`5/10
`
`FIGURE 5
`
`ia?
`IOA \
`
`—\
`
`
`
`
`
`Queue Ring
`
`Hold Ring
`
`¢ (ay
`
`Queue Ring
`
`(et
`
`Hold Ring
`
`Change Ring
`
`( lo
`
`HRQ
`
`A
`
`SUBSTITUTE SHEET (RULE26)
`
`IPR2022-01227
`IPR2022-01227
`EXHIBIT 1003 - PAGE 01849
`EXHIBIT 1003 - PAGE 01849
`
`

`

`WO 00/48100
`
`6/10
`
`PCT/GBO00/00487
`
`
`(oA
`
`
`
`
`eet ~
`
`
`FIGURE 7
`
`Queue Ring
`
`Hold Ring
`
`
`
`SUBSTITUTE SHEET (RULE 26)
`
`IPR2022-01227
`IPR2022-01227
`EXHIBIT 1003 - PAGE 01850
`EXHIBIT 1003 - PAGE 01850
`
`

`

`WO 00/48100
`
`PCT/GB00/00487
`
`7/10
`
`OU!
`
`
`
`asuodsayyapuIpatuuyc-1a[puny]
`
`QWuAIA
`
`JOYTUNAY<1pPurzy
`
`
`
`
`
`SUBSTITUTE SHEET (RULE26)
`
`IPR2022-01227
`IPR2022-01227
`EXHIBIT 1003 - PAGE 01851
`EXHIBIT 1003 - PAGE 01851
`
`

`

`8/10
`
`FIGURE9
`
`WO 00/48100
`
`PCT/GB00/00487
`
`Ifandler->Qualifier
`
`SUBSTITUTE SHEET (RULE26)
`
`IPR2022-01227
`IPR2022-01227
`EXHIBIT 1003 - PAGE 01852
`EXHIBIT 1003 - PAGE 01852
`
`

`

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

`

`WO 00/48100
`
`PCT/GB00/00487
`
`10/10
`
`Itaunold
`
`OU
`
`JayyEnboyy<-19]puell]
`
`
`
`astiodsayyppay]<-ta]pueyy
`
`astodsayon)NvjIq<-l9[puLyy
`
`
`
`“999‘SIX
`
`SUBSTITUTE SHEET (RULE26)
`
`IPR2022-01227
`IPR2022-01227
`EXHIBIT 1003 - PAGE 01854
`EXHIBIT 1003 - PAGE 01854
`
`

`

`(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-01227
`IPR2022-01227
`EXHIBIT 1003 - PAGE 01855
`EXHIBIT 1003 - PAGE 01855
`
`

`

`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-01227
`IPR2022-01227
`EXHIBIT 1003 - PAGE 01856
`EXHIBIT 1003 - PAGE 01856
`
`

`

`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-01227
`IPR2022-01227
`page 1 of 2EXHIBIT 1003 - PAGE 01857
`EXHIBIT 1003 - PAGE 01857
`
`

`

`INTERNATIONAL SEARCH REPORT
`
`
`
` Inte onal Apptication No
`PCT/GB 00/00487
`
`
`
`
`
` WURMAN P. R.,iiaM. P., WALSH 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-01 227
`IPR2022-01227
`page 2 of 2XHIBIT 1003 - PAGE 01858
`EXHIBIT 1003 - PAGE 01858
`
`

`

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

`

`(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