throbber
In re Patent Application of: McCueet al
`Serial No.: 13/588,084
`Filed: 08/17/2012
`
`REMARKS
`
`Claims 46-67 were pending. Claim 64 has been cancelled. New claim 68 has been
`
`added.
`
`Claim 53 has been rejected under 35 USC 112, second paragraph. Claim 53 has been
`
`amended to removethe term “‘at arbitrary time intervals”, and thus is believed to conform with
`
`35 USC 112. No new matter has been added.
`
`Claims 46 and 55 have been rejected under 35 USC 103(a) as being unpatentable over
`
`Daoudet al. (US 7,984,147), in view of Zuniga (US 2005/0245243), in view of Hunter et al. (US
`
`7,242,809), and further in view of Griffin (US 2007/0124331). This rejection is respectfully
`
`traversed.
`
`In particular, it is respectfully submitted that Daoudet al. do not teach computer readable
`
`code, which when executed by a computer, causes said computer to send a request to a network-
`
`based server, the request including a unique identifier for identifying an audio stream, and to
`
`load a list of library servers receivedfrom the network-basedserver, the list of library servers
`
`determined in dependence uponthe uniqueidentifier, as defined in claim 46.
`
`Daoudetal. teach program code for selecting a requested level of service for a
`
`transaction 200 and program codefor assigning the requested level of service. Referring to
`
`column 8, lines 31-50, Daoudet al. teach that the transaction 200 is received at a load balancer
`
`300, which reads the requested level of service and selects a server (e.g., 512) based on a server
`
`index 600. Referring to column 6, lines 22-50, the server index is a multi-dimensional array
`
`stored in memory accessible by the load balancer, and is used to determine the server in the
`
`server pool that can best provide the requested level of service. The server pool is managed by
`
`the load balancer 300.
`
`

`

`In re Patent Application of: McCueet al
`Serial No.: 13/588,084
`Filed: 08/17/2012
`
`Daoudet al. do not teach computer readable code, which when executed by a computer,
`
`causes said computer to send a request to a network-based server andto loada list oflibrary
`
`servers receivedfrom the network-based server.
`
`\n fact, since the server index taught by Daoud
`
`et al. is stored in memory accessible by the load balancer 300, and appears to be managed by the
`
`load balancer 300, it is respectfully submitted that the program code of the load balancer 300
`
`already has access to the server index and thus does not send a request to a network-based server
`
`and load a list of library servers receivedfrom the network-based server, as defined in claim 46
`
`of the instant application. For example, it is respectfully submitted that the load balancer
`
`software cannotloada list of library servers received from a network-based server because the
`
`load balancer manages/creates the server pool/server index. In addition, it is respectfully
`
`submitted that one of ordinary skill in the art would never interpret the memory accessible by the
`
`load balancer 300 to be a network-based server, since at column 7, lines 22-30 Daoudetal.
`
`define a server as any computer or device that managesresources(e.g., which memory alone
`
`cannot do). It is further submitted that the one of ordinary skill in the art would neverinterpret
`
`the program code for selecting a requested level of service for a transaction 200 and program
`
`code for assigning the requested level of service to be computer readable code, which when
`
`executed by a computer, causes said computer to send a request to a network-based server, and
`
`to loadalist of library servers receivedfrom the network-based server. For example, referring to
`
`column6, lines 45-55, only the load balancer accesses the server index (i.e., the program code
`
`for assigning the requested level of service never interacts with the server index).
`
`Notably, providing computer readable code, which when executed by a computer, causes
`
`said computer to send a request to a network-based server and to loada list oflibrary servers
`
`receivedfrom the network-based server, provides client-based performance management. As
`
`discussed in paragraphs [65]-[67] of the instant application, client-based performance
`
`managementis an important factor in ensuring the integrity of the audio stream available to the
`
`user. Advantageously, since the serverstatistics are created and maintainedin the client only,
`
`the client software selects the server using performancedata that is specific to the client. For
`
`example, as discussed in paragraph [67], this client-based performance management allows the
`
`time of operations such as logging in, getting the file, and/or getting the file size to be used to
`
`select the server. More specifically, the entire time for the transaction (e.g., from the original
`
`8
`
`

`

`In re Patent Application of: McCueet al
`Serial No.: 13/588,084
`Filed: 08/17/2012
`
`request to a response from the request) is used to select the server. Accordingly,this client-based
`
`performance managementis able to balance network and server loads on the basis of
`
`performance defined by the client. In contrast, Daoudet al. only teaches resource managing and
`
`does not provide client-based performance management wherein the transaction is
`
`evaluated/monitored from the client side(i.e., the speed of the transaction between the load
`
`balancer and the origin of the transaction is ignored).
`
`Since Daoudet al. do not teach computer readable code, which when executed by a
`
`computer, causes said computer to send a request to a network-based server, the request
`
`including a uniqueidentifier for identifying an audio stream, andto loadalist of library servers
`
`received from the network-basedserver,the list of library servers determined in dependence
`
`upon the unique identifier, as defined in claim 46, it is respectfully submitted that the
`
`combination provided by the cited references does not teach the combination of elements found
`
`in claim 46 and that a prima facie case of obviousnesshas not been established. Accordingly,
`
`claim 46 and claims 47-57, which depend therefrom, are believed to be patentable.
`
`In addition,it is respectfully submitted that modifying the combination of Daoud, Zuniga,
`
`and Hunter in view of Griffin does not provide the invention defined in claim 46, for the
`
`following reasons.
`
`First, as discussed supra, Daoudet al. teach a first program code for selecting a requested
`
`level of service for a transaction for assigning the requested level of service and a second
`
`program code used bythe load balancer. It is respectfully submitted that the first and second
`
`program codesare different codes and are provided on separate non-transitory computer readable
`
`storage media. For example, as is well know to those of ordinary skill in the art, load balancing
`
`is typically provided by dedicated software or hardware(e.g., a load balancing engine) thatis
`
`disposed far from the origin of the transaction (e.g., is often coupled to a port where external
`
`clients connect to access services). Further support that the first and second program codesare
`
`provided on separate non-transitory computer readable storage media is found in Daoud at
`
`column6, lines 45-50, wherein it is stated that the transaction is received by the load balancer,
`
`and that the service tag is read using suitable program code. Sincethe first and second program
`
`9
`
`

`

`In re Patent Application of: McCueet al
`Serial No.: 13/588,084
`Filed: 08/17/2012
`
`codes are provided on separate non-transitory computer readable storage media, it is respectfully
`
`submitted that the cited combination cannot teach a non-transitory computer readable storage
`
`medium including computer readable code, which when executed by a computer, causes said
`
`computer to: send a request to a network-based server, load a list of library servers received
`
`from the network-based server, and downloada first digital audio filefrom the plurality of
`
`digital audio files for playback with a media player, as defined in claim 46. For example,if the
`
`first program codefor selecting a requested level of service for the transaction is modified in
`
`view of Griffin to downloada first digital audio file from the plurality of digital audiofiles for
`
`playback with a media player, the combination will not provide program code usedto load a list
`
`oflibrary servers(1.e., as discussed supra, the server index taught by Daoudis only accessible by
`
`the load balancer). In contrast, if the second program code used by the load balancer is modified
`
`in view of Griffin to downloada first digital audio file, the combination will not provide
`
`computer readable code that causes said computer to send a request to a network-based server
`
`and to loadalist of library servers receivedfrom the network-basedserver(e.g., as discussed
`
`supra the load balancer does notreceive the list of library servers from a network-based server).
`
`Furthermore,it is respectfully submitted that one of ordinary skill in the art would never modify
`
`the second program code used by the load balancer to downloada first digital audio file because
`
`the load balanceris used solely for managing the internet load (e.g., in a server farm) in a
`
`transparent mannerand because it would be pointless for a load balancer to download an audio
`
`file for playback with a media player. In fact, modifying the program codeof a load balancer to
`
`download an audiofile for playback with a media player would slow downthe transaction,
`
`whichis in direct contrast to the focus of Daoudetal. (e.g., to improve service using level of
`
`service assigned).
`
`Second, referring to paragraph [0020], Griffin teaches downloading and storing content
`
`files, each of which has a bookmark associated therewith. It is respectfully, submitted that one
`
`of ordinary still in the art would understand that each of these content files represents a single,
`
`complete unit(1.e., that the contentfiles stored on the content server taught by Griffin are not
`
`digital audio files including different segments of an audio stream). Accordingly,it is
`
`respectfully submitted that one of ordinary skill in the art would never interpret Griffin to teach
`
`“downloada first digital audio file from the plurality of digital audio files for playback with a
`
`10
`
`

`

`In re Patent Application of: McCueet al
`Serial No.: 13/588,084
`Filed: 08/17/2012
`
`media player, each digital audio file in the plurality of digital audio files including a different
`
`segmentof the audio stream” as defined in claim 46 of the instant invention. It is further
`
`submitted that one of ordinary skill in the art would not find it obvious to modify the teachings of
`
`Daoud, Zuniga and Hunter in view of Griffin, because Griffin teaches away from providing “a
`
`plurality of digital audio files for playback with a media player, each digital audio file in the
`
`plurality of digital audio files including a different segment of the audio stream’, by specifying
`
`that a separate bookmarkfile is created for each contentfile (e.g., see paragraph [0020]).
`
`Accordingly, claim 46 and claims 47-57, which dependtherefrom, are believed to be patentable.
`
`In addition, with specific regard to claim 55, it is respectfully submitted that the cited
`
`combination doesnot teach “downloada first digital audio file from the plurality of digital audio
`
`files for playback with a media player, each digital audiofile in the plurality of digital audio files
`
`including a different segment of the audio stream” and “download a second other digital audio
`
`file from a second library server for playback with the media player.” More specifically,it is
`
`respectfully submitted that no combination ofthe cited references teaches downloading different
`
`segments of an audio stream from different libraries.
`
`With specific regard to claim 57, it is respectfully submitted that Arons does not teach
`
`small digital audio files and thus cannot teach “wherein the computer determinesthefirst digital
`
`audiofile for playback using a time offset external to the descriptorfile and the at least one of
`
`the start time, end time, and play time of each digital audiofile in the plurality of digital audio
`
`files.” For example, referring to section 3.9 on page 20 of the SpeechSkimmer document, Arons
`
`teachesthat a single file is created that containsall of the segmentation data. In the samesection,
`
`on page 21, it is specifically stated that audio data are read from the soundfile.
`
`Applicant would like to thank the Examinerfor indicating that claim 64 would be
`
`allowable if rewritten in independent form, includingall of the limitations of the base claim and
`
`any intervening claims. The subject matter of claim 64 has been written in independent form as
`
`amended claim 58. In addition, amended claim 58 corrects the phrase “resident with the
`
`computer” to --resident within the computer--. Claim 64 has been cancelled. No new matter
`
`11
`
`

`

`In re Patent Application of: McCueet al
`Serial No.: 13/588,084
`Filed: 08/17/2012
`
`has been added. Accordingly, claim 58 and claims 59-63, which depend therefrom, are believed
`
`to be patentable.
`
`Claims 65 and 66 have been rejected under 35 USC 103(a) as being unpatentable over
`
`Zuniga in view of Daoudet al. Claim 67 have been rejected under 35 USC 103(a) as being
`
`unpatentable over Zuniga in view of Daoudetal. and in view of Thiagarajan et al (US
`
`20030221194). These rejections are respectfully traversed.
`
`First, it is respectfully submitted that Daoudet al. do not teach a size ofeach digital
`
`audiofile in the plurality ofdigital audio files selected in dependence upon network throughput
`
`rates, as stated on page 24 of the Office Action. In fact, referring to column 5, lines 33-36
`
`Daoudet al. specify that “the requested level of service may also be based on characteristics or
`
`parameters of the transaction 200 itself. For example, large processing requests can be assigned
`
`to faster servers.” In other words, Daoudet al. teach the opposite of a size ofeach digital audio
`
`file in the plurality ofdigital audio files selected in dependence upon network throughputrates,
`
`by teachingthat the size of the transaction is innate and that larger processing requests will be
`
`assigned to faster servers. In contrast, the instant application teachesthat selecting the size of
`
`each small audiofile in dependence upon network throughput rates allows the small audiofile to
`
`be transferred from the server to the client in a period of time that does not cause appreciable
`
`consternation on behalfof the user (e.g., see paragraph [46] of the instant application).
`
`Second,it is respectfully submitted one of ordinary skill in the art would notfind it
`
`obvious to modify Zuniga and/or the other cited references to allow a size ofeach digital audio
`
`file in the plurality ofdigital audio files to be selected in dependence upon network throughput
`
`rates, and in particular to allow each digital audiofile in the plurality ofdigital audiofiles to be
`
`downloadedand begin playing in less than about 5 seconds, as defined in claim 65.
`
`In fact,it is
`
`respectfully submitted that Zuniga teaches away from a size ofeach digital audio file in the
`
`plurality ofdigital audio files selected in dependence upon network throughput rates and to
`
`allow each digital audiofile in the plurality ofdigital audio files to be downloaded and begin
`
`playing in less than about 5 seconds, by specifying at paragraph [0032] that the highest priority
`
`audio content is delivered within the hour or within minutes. In addition, from paragraphs
`
`12
`
`

`

`In re Patent Application of: McCueet al
`Serial No.: 13/588,084
`Filed: 08/17/2012
`
`[0024] and [0038] it is clear that Zuniga believes that audio books have the lowest delivery
`
`priority and that this type of content will be delivered over a period not exceeding a few days.
`
`Accordingly, it is clear that one of ordinary skill in the art would never consider modifying
`
`Zuniga such that a size ofeach digital audio file in the plurality ofdigital audio files is selected
`
`in dependence upon network throughput rates to allow each digital audio file in the plurality of
`
`digital audio files to be downloaded andbegin playing in less than about 5 seconds. In fact, it is
`
`respectfully submitted that Zuniga teaches away from selecting a size of each digital audiofile in
`
`the plurality ofdigital audio files to be selected to allow each digital audio file in the plurality of
`
`digital audio files to be downloaded and begin playing in less than about 5 seconds by proposing
`
`a different solution (e.g., delivery priority) to coordinating delivery of audio content.
`
`Accordingly, claim 65 and claims 66-67, which dependtherefrom, are believed to be patentable.
`
`In addition, with specific regard to claim 67, it is respectfully submitted that Thiagarajan
`
`does not teach a non-transitory computer readable storage medium having computer code
`
`configured to cause a computer to purge the downloadeddigital audio files in dependence upon
`
`an amount of memory available. Referring to the abstract, paragraph [0003], and paragraph
`
`[0055], Thiagarajan teaches streaming and a pause buffer. It is respectfully submitted that one of
`
`ordinary skill in the art would neverinterpret the use of a pause buffer (e.g., configured as a
`
`circular, or ring, buffer on the hard disk memory as described in paragraph [0003]) to be
`
`equivalent to purging downloadeddigital audio files. For example, a circular, or ring, buffer
`
`typically writes over data in volatile memory (RAM)and does not purge downloadedfiles. In
`
`addition, it is respectfully submitted that one of ordinary skill in the art would neverinterpret the
`
`data within the pause buffer to be equivalent to one or more downloadeddigital audio files. For
`
`example, as is well knownin theart, the data that is being streamed needsto be processed for
`
`rendering andis generally understood to be a frame or packet, rather than a digital audiofile.
`
`In addition, claim 52 has been amendedto provide proper antecedence, claims 66 and 67
`
`have been amendedfor consistency, and new claim 68 has been added. An example of support
`
`for new claim 68 is found in claim 48. No new matter has been added. Since new claim 68
`
`13
`
`

`

`In re Patent Application of: McCueet al
`Serial No.: 13/588,084
`Filed: 08/17/2012
`
`depends from claim 46, whichis believed to be patentable, it is respectfully submitted that new
`
`claim 68 is also patentable.
`
`In view of the above comments, early and favorable reconsideration of the application is
`
`respectfully requested.
`
`Should any minor informalities need to be addressed, the Examiner is encouragedto
`
`contact the undersigned attorney at the telephone numberlisted below.
`
`The Commissioner is hereby authorized to charge any additional fees which may be
`
`required, or credit any overpayment, to Deposit Account No: 50-2810.
`
`Please associate this application with Customer No: 24949.
`
`Respectfully submitted,
`
`NM Oude
`
`Neil Teitelbaum
`Regn No: 38,793
`
`Teitelbaum & MacLean
`Registered Patent Agents Limited
`280 Sunnyside Avenue
`Ottawa, Ontario
`Canada K1S OR8
`
`(613) 523 3784
`Tel:
`(613) 523 6799
`Fax:
`nt@patents.org
`Email:
`Website: www.patents org
`
`JMC/Imf
`
`14
`
`

This document is available on Docket Alarm but you must sign up to view it.


Or .

Accessing this document will incur an additional charge of $.

After purchase, you can access this document again without charge.

Accept $ Charge
throbber

Still Working On It

This document is taking longer than usual to download. This can happen if we need to contact the court directly to obtain the document and their servers are running slowly.

Give it another minute or two to complete, and then try the refresh button.

throbber

A few More Minutes ... Still Working

It can take up to 5 minutes for us to download a document if the court servers are running slowly.

Thank you for your continued patience.

This document could not be displayed.

We could not find this document within its docket. Please go back to the docket page and check the link. If that does not work, go back to the docket and refresh it to pull the newest information.

Your account does not support viewing this document.

You need a Paid Account to view this document. Click here to change your account type.

Your account does not support viewing this document.

Set your membership status to view this document.

With a Docket Alarm membership, you'll get a whole lot more, including:

  • Up-to-date information for this case.
  • Email alerts whenever there is an update.
  • Full text search for other cases.
  • Get email alerts whenever a new case matches your search.

Become a Member

One Moment Please

The filing “” is large (MB) and is being downloaded.

Please refresh this page in a few minutes to see if the filing has been downloaded. The filing will also be emailed to you when the download completes.

Your document is on its way!

If you do not receive the document in five minutes, contact support at support@docketalarm.com.

Sealed Document

We are unable to display this document, it may be under a court ordered seal.

If you have proper credentials to access the file, you may proceed directly to the court's system using your government issued username and password.


Access Government Site

We are redirecting you
to a mobile optimized page.





Document Unreadable or Corrupt

Refresh this Document
Go to the Docket

We are unable to display this document.

Refresh this Document
Go to the Docket