IN THE UNITED STATES PATENT AND TRADEMARK OFFICE
`
`VEEAM 1031
`Veeam v. Symantec
`Case No: IPR2013-00150
`
`
`In re inter partes review of:
`U.S. Patent 7,093,086 to Hans van
`Rietschote.
`Filed: February 14, 2013
`
`For: Disaster Recovery and Backup
`using Virtual Machines
`
`Case Nos. IPR2013-00150
`Atty. Docket: 2907.020IPR0
`
`
`
`
`
`
`Declaration of Dr. Prashant Shenoy in Support of Petitioner’s Opposition to the
`Motion to Amend
`
`
`
`I, Prashant Shenoy, declare as follows:
`
`1.
`
`I have been retained by Sterne, Kessler, Goldstein, and Fox PLLC on
`
`behalf of Veeam Software Corporation (“Veeam”) for the above-captioned inter
`
`partes review proceedings. I understand that these proceedings involve U.S. Patent
`
`No. 7,093,086 (“the ’086 Patent”) entitled “Disaster Recovery and Backup using
`
`Virtual Machines,” and that the ’086 Patent is currently assigned to Symantec
`
`Corporation.
`
`2.
`
`An updated version of my Curriculum Vitae is attached as Appendix
`
`A to this Declaration, which contains further details on my education, experience,
`
`

`

`
`publications, and other qualifications to render an expert opinion. My work on this
`
`declaration is being billed at a rate of $435.00 per hour, with reimbursement for
`
`actual expenses. My compensation is not contingent upon the outcome of this inter
`
`partes review.
`
`3.
`
`I understand that the Board instituted inter partes review of claims 1,
`
`11, 12, and 22 of the ’086 Patent on 5 separate grounds. I have reviewed, and I am
`
`familiar with all of the prior art supporting those grounds, including the Board’s
`
`Decision on Institution. The grounds of rejection instituted by the Board include
`
`the following:
`
`4.
`
`Claims 1, 11, 12, and 22 are anticipated by Lim et al (“Lim”)
`
`(provided at VEEAM 1004).
`
`5.
`
`Claims 1, 11, 12, and 22 are anticipated by the “VMware ESX Server:
`
`User’s Manual” (“ESX”) (provided at VEEAM 1005).
`
`6.
`
`Claims 1, 11, 12, and 22 are anticipated by “Getting Started Guide:
`
`VMware 2.0 for Linux,” (“GSG”) (provided at VEEAM 1006).
`
`
`Case: IPR2013-00150
`
`
`
`
`– 2 –
`
`
`
`
`
`
`
`
`
`2907.020IPR0
`
`
`

`

`
`Claims 1, 11, 12, and 22 are anticipated “Checkpoint for Network
`
`7.
`
`Transferable Computer” by Suzaki (“Suzaki”) (English translation provided at
`
`VEEAM 1008).
`
`8.
`
`Claims 11 and 22 are obvious over Suzaki in view of “Integrating
`
`Checkpointing and Transaction Processing,” by Wang (“Wang”) (provided at
`
`VEEAM 1010).
`
`9.
`
`I also understand that the Symantec has filed a contingent Motion to
`
`Amend (“Motion to Amend”), proposing substitute claims 31-34 should the Board
`
`find the challenged claims unpatentable, as well as a Response in opposition to the
`
`petition filed in February 2013. I have reviewed the Response and Motion to
`
`Amend, as well as Dr. Green’s (Patent Owner’s expert) declarations in support of
`
`the Response and Motion to Amend, including proposed substitute exhibit C
`
`(“Green Dec.”) and his deposition transcript (“Green Tr.”). I have been asked to
`
`provide my technical review, analysis, and insight regarding the Motion to Amend
`
`and corresponding opinions of Dr. Green.
`
`The Capture of State While a Virtual Machine is Executing
`
`10.
`
`I understand that Patent Owner has proposed an amendment in
`
`substitute claims 32 and 33 that require the virtual machine to be executing during
`
`Case: IPR2013-00150
`
`
`
`
`– 3 –
`
`
`
`
`
`
`
`
`
`2907.020IPR0
`
`
`

`

`
`the capturing step. (Motion to Amend, p. 3.) However, it is my opinion that the
`
`virtual machine cannot be executing continuously during the entire capturing step.
`
`11. Processors typically include a number of memory storage areas
`
`known as registers. (See Green Tr., 237:6-10.) The registers are responsible for
`
`holding data used for processing instructions on the processors, among other
`
`things. Thus, to capture state of a processor one must also capture the state of the
`
`registers. As Dr. Green explained during his cross-examination, processors have
`
`more than one register, and the registers are constantly being changed based on the
`
`current instruction or instructions that are being executed by the processor. (Green
`
`Tr., 254:13-18.) It naturally follows that to capture state one must stop, at least
`
`momentarily, a register from being updated while it is being “captured,” or else the
`
`data could be inconsistent.
`
`12.
`
`Instructions typically require the use of at least one register in the
`
`processor for execution, and typically require many. Thus, if an instruction is being
`
`executed on the processor, one would have to capture numerous registers at once,
`
`or possibly all registers to ensure consistency of the processor state because it is
`
`very difficult to determine which registers are currently being used on the
`
`processor. This takes time, and in the meantime, the processor (i.e. virtual
`
`
`Case: IPR2013-00150
`
`
`
`
`– 4 –
`
`
`
`
`
`
`
`
`
`2907.020IPR0
`
`
`

`

`
`processor) would have to be suspended from execution until all the registers are
`
`copied.
`
`13. During his cross-examination Dr. Green explained that one could
`
`capture the processor registers using similar techniques to those that the ’086
`
`patent describes for capturing memory in some of its embodiments. (Green Tr.,
`
`255:3-17.) In other words, one could create a separate area to hold new updates to
`
`the registers. But, creating such an area also takes time, and in the meantime,
`
`updates must be suspended to the processor until the new “area” is created or an
`
`inconsistent state will be created on the processor. Further even if such an area
`
`were preallocated (i.e. created before the capture began), the process of instructing
`
`the virtual machine to redirect its updates to the new area also takes a period of
`
`time, during which the virtual machine could not execute.
`
`14. The same issues hold true if one were to capture memory contents of a
`
`running virtual machine. For example, with respect to capturing memory contents
`
`while the virtual machine is executing, certain embodiments of the ’086 patent
`
`describe creating a new area in memory to hold updates to the memory. But
`
`creating such an area or setting up redirection of updates to it also takes time, and
`
`
`Case: IPR2013-00150
`
`
`
`
`– 5 –
`
`
`
`
`
`
`
`
`
`2907.020IPR0
`
`
`

`

`
`during that time period no writes to memory can be occurring or else a consistent
`
`view of memory cannot be captured.
`
`Lim
`
`15. Lim describes capturing the state of a virtual machine as part of a
`
`checkpointing process. Specifically, to capture the state of the virtual machine, the
`
`“[S]tate extraction . . . extracts the machine state and saves it in storage . . . as the
`
`initial checkpoint S0.” (Lim, 18:5-8.)
`
`16. After the state is captured, Lim describes that the state can be copied
`
`to a separate destination over a network: “[T]he state vector of a first virtual
`
`machine VM1 . . . could be transferred over any conventional transmission
`
`medium to any other architecturally similar virtual machine VM2 and loaded into
`
`that virtual machine as its initial state. . . .” (Lim, 21:44-49.) By transmitting state
`
`information over a network to a remote destination, Lim discloses copying state
`
`information to a separate storage device.
`
`17. Lim discloses creating a log of uncommitted updates for keeping track
`
`of changes while the virtual machine is executing with the express purpose of
`
`using the log for capturing state. Lim explains that “[i]n the preferred embodiment
`
`. . . , only one state vector—the initial vector S0—need be stored in its entirety;
`
`Case: IPR2013-00150
`
`
`
`
`– 6 –
`
`
`
`
`
`
`
`
`
`2907.020IPR0
`
`
`

`

`
`subsequent states are represented not as entire state vectors, but rather as vectors of
`
`state changes using copy-on-write techniques.” (Lim, 23:52-55.) For example,
`
`“[f]or state which is large and changes slowly, such as disk contents, it is more
`
`efficient to keep a log of the changes instead of a copy of the entire contents.”
`
`(Lim, 11:67-12:3.) Lim further discloses that the updates can be uncommitted:
`
`“[t]his log [of changes] can then be discarded to roll back the transaction, or it can
`
`be saved, or it can be applied to the first checkpoint to commit the transaction.”
`
`(Lim, 11:53-56.) Until the log is applied (i.e. committed) the changes remain
`
`uncommitted because the log can be simply discarded and the changes would be
`
`lost.
`
`18. Lim also discloses creating memory COW areas. Lim explains that
`
`the total state of the virtual machine is captured in a state vector or checkpoint.
`
`(Lim, 6:48-52.) The total state includes “state information . . . of the virtual
`
`memory.” (Lim, 6:42-43.) But the state can include a lot of data, so to increase
`
`efficiency, Lim describes using copy-on-write techniques such that “only updates
`
`to the state vectors from checkpoint to checkpoint need be stored.” (Lim, 19:59-
`
`61.) One way Lim describes of accomplishing copy-on-write is by creating a log
`
`of changes: “rather than storing the entire system state at both the beginning and
`
`end of a transaction, a log can be kept of changes to the computer system state, that
`
`
`Case: IPR2013-00150
`
`
`
`
`– 7 –
`
`
`
`
`
`
`
`
`
`2907.020IPR0
`
`
`

`

`
`is, of any changes to any of the elements of S0,” which includes the contents of
`
`memory because S0 is the total machine state. (Lim, 11:50:54.) In other words,
`
`after a checkpoint, subsequent updates that occur while the virtual machine is
`
`executing are stored in a separate log of changes.
`
`19. The log of changes can be stored in memory, and thus constitute a
`
`memory area: “The number of complete state vectors that can be stored at any one
`
`time will therefore be determined by the amount of available storage (for example,
`
`in a dedicated memory partition).” (Lim, 19:51-55.) Therefore, since state vectors
`
`store “updates” (i.e. writes to memory), and are also themselves stored in “a
`
`dedicated memory partition,” Lim discloses “creating a memory area to capture
`
`writes to a memory” for the express purpose of performing copy-on-write.
`
`20. Lim also teaches “a backup program” that “interfaces with a
`
`separately executing virtual machine kernel.” Specifically, Lim repeatedly
`
`describes a program that “initiates” Lim’s checkpoints by communicating with
`
`Lim’s virtual machine monitor. For example, Lim describes that “the virtual
`
`machine monitor . . . [is] directed using known techniques to generate a checkpoint
`
`and store the state vector.” (Lim, 22:62-65.) In other words, a checkpoint can be
`
`initiated by directing the virtual machine monitor to do so.
`
`
`Case: IPR2013-00150
`
`
`
`
`– 8 –
`
`
`
`
`
`
`
`
`
`2907.020IPR0
`
`
`

`

`
` Lim describes that one way to initiate such a checkpoint is using a
`
`21.
`
`graphical user interface: “[f]or example, a conventional icon or menu item or
`
`keyboard command could be included in some portion of a standard display such
`
`as a tool bar. Whenever the user selects, for example ‘clicks’ on, the icon, a
`
`checkpoint request signal would then be passed to the virtual machine monitor,
`
`which would then immediately take or ‘set’ a checkpoint.” (Lim, 26:43-49.) A
`
`person of ordinary skill in the art would have understood this graphical user
`
`interface must be separate from the virtual machine kernel because virtual machine
`
`monitors of the type described in Lim do not themselves have a user interface. The
`
`types of virtual machines described in Lim have a separate interface such as a
`
`console system or web interface similar what is described in ESX. (See ESX, p.
`
`82.)
`
`22. But to the extent the Board were to find that Lim does not disclose
`
`that its “graphical user interface” embodiment is separate from the virtual machine
`
`monitor (i.e. the VM Kernel), it is my opinion that making such a graphical user
`
`interface separate would have been obvious to a person of ordinary skill in the art
`
`at the time of the ’086 patent’s invention. Lim already describes that its VM kernel
`
`can be “directed” using “known techniques” to initiate a checkpoint, but doesn’t
`
`explicitly define these known techniques besides describing the graphical user
`
`
`Case: IPR2013-00150
`
`
`
`
`– 9 –
`
`
`
`
`
`
`
`
`
`2907.020IPR0
`
`
`

`

`
`interface embodiment. However, at the time of the ’086 invention, it was well
`
`understood to those of ordinary skill in the art that graphical user interfaces could
`
`be separated from their underlying processes using client-server techniques.
`
`23.
`
`It would have been obvious to those having ordinary skill in the art
`
`that Lim’s virtual machine monitor could execute multiple virtual machines, and
`
`that it would be have been desirable to checkpoint them.
`
`Li
`
`24.
`
`I have also reviewed “Low-Latency, Concurrent Checkpointing for
`
`Parallel Programs” to Li et al. (“Li”). Li was published in August 1994 in the IEEE
`
`Transactions on Parallel and Distributed Systems, more than 7 years prior to the
`
`filing date of the ’086 patent.
`
`25. Li describes an improved checkpointing algorithm that imposes a very
`
`small overhead on a target program. That is, Li’s algorithm executes concurrently
`
`with the target program executing on the underlying computing system to be
`
`checkpointed. Any interruptions to the target program “are for small, fixed periods
`
`of time (under 0.1s in [Li’s] implementation)”. (Li , p. 874).
`
`
`Case: IPR2013-00150
`
`
`
`
`– 10 –
`
`
`
`
`
`
`
`2907.020IPR0
`
`
`

`

`26. Li accomplishes
`
`
`these goals using a copy-on-write
`
`(COW)
`
`checkpointing algorithm. The copy-on-write checkpointing algorithm of Li creates
`
`a separate address space in main memory. (Li, p. 875.) The algorithm then copies
`
`the state of a processor while the processor is frozen, and sets page protection flags
`
`of pages in main memory to read-only. (Id.) The algorithm then “unfreezes the
`
`processors and starts a separate copier thread that copies pages to the new address
`
`space and resets the pages’ protection to ‘read-write.’” (Id.) The effect of this
`
`copier thread is that the old memory space is frozen (i.e. captured), which enables
`
`it to be copied to a checkpoint file. If an executing program tries to write to a page
`
`while its protection is set to read-only, the write takes place in the new address
`
`space instead of the frozen original memory space. When the contents of the main
`
`memory are completely copied to the new address space, the main memory
`
`checkpoint is complete and copied to disk. (Li, pp. 874-875).
`
`Fig. 1 (partial) of Li at 875
`
`
`
`– 11 –
`
`
`
`
`
`
`
`
`
`2907.020IPR0
`
`
`
`Case: IPR2013-00150
`
`
`

`

`
`27. As shown in Li's Figure 1 (above), the copy-on-write algorithm
`
`creates the “New Address Space” and copies CPU states to this new address space
`
`while the processor is frozen. Then, the processors are restarted, and the data in the
`
`original address space is copied to the new address space. If a process tries to write
`
`to a page in memory in the original address space, a copy of that page is written to
`
`the new address space, before the page can be written to in the original address
`
`space.
`
`28. A person of ordinary skill in the art would have been motivated to
`
`combine Lim and Li. First, both Lim and Li relate to checkpointing, and are thus
`
`within the same field of endeavor. Specifically, Li discloses checkpointing
`
`software processes, and Lim discloses checkpointing virtual machines running in a
`
`virtual machine monitor, which itself is a process. Second, Lim’s checkpoints
`
`require an interruption of the processor to capture the total machine state. (See
`
`Lim, 10:30-32.) A person of ordinary skill in the art would have been motivated to
`
`improve upon this interruption by minimizing it so that the virtual machine could
`
`execute for as long of a period as possible during checkpointing. Li teaches such an
`
`improvement by describing a checkpoint algorithm for minimizing the disruption
`
`to running software processes. Thus, a person of ordinary skill in the art would
`
`have been motivated to improve upon Lim’s checkpointing by combining it with
`
`
`Case: IPR2013-00150
`
`
`
`
`– 12 –
`
`
`
`
`
`
`
`2907.020IPR0
`
`
`

`

`Li’s low-latency checkpointing to minimize disruption to the running virtual
`
`machine in Lim.
`
`Conclusion
`
`In signing this declaration, I recognize that the declaration will be filed as
`
`evidence in a contested case before the Patent Trial and Appeal Board of the
`
`United States Patent and Trademark Office. I hereby declare that all statements
`
`made herein of my own knowledge are true and that all statements made on
`
`information and belief are believed to be true; and further that these statements
`
`were made with the knowledge that willful false statements and the like so made
`
`are punishable by fine or imprisonment, or both, under Section 1001 of Title 18 of
`
`the United States Code.
`
`Executed on (cid:9)
`
`b 2.4 2I4 (cid:9)
`
`at wash m qfan t
`
`Dr. Prashant Shenoy
`
`Case: 1PR2013-00150 (cid:9)
`
`-13- (cid:9)
`
`2907.020IPRO
`
`

`

`  
`
`Appendix A
`
`

`

`Prashant Shenoy
`
`Department of Computer Science
`140 Governor’s Drive
`University of Massachusetts
`Amherst, MA 01003-4610
`
`URL: http://www.cs.umass.edu/˜shenoy
`E-mail : shenoy@cs.umass.edu
`Phone: (413) 577-0850
`Fax: (413) 545-1249
`
`Research Interests
`Operating and Distributed systems, Sensor networks, Mobile and Multimedia systems, Sustainability
`
`Education
`
`August 1998
`
`Doctor of Philosophy (Ph.D.), Department of Computer Sciences,
`The University of Texas of Austin.
`Dissertation title: Symphony: An Integrated Multimedia File System
`Advisor: Prof. Harrick M. Vin.
`December 1994 Master of Science (M.S) in Computer Sciences
`The University of Texas of Austin.
`Bachelor of Technology (B.Tech), Department of Computer Science and Engineering
`The Indian Institute of Technology, Bombay, India.
`
`July 1993
`
`Work Experience
`• Fall 2011: Visiting Researcher, NICTA, Sydney, Australia
`• 9/2009-present: Professor, Department of Computer Science, University of Massachusetts Amherst.
`• 9/2004-8/2009: Associate Professor, Department of Computer Science, University of Massachusetts Amherst.
`• 9/1998-8/2004: Assistant Professor, Department of Computer Science, University of Massachusetts Amherst.
`• 8/1995-8/1998: Graduate Research Assistant, Department of Computer Sciences, University of Texas at
`Austin.
`• 5/1995-8/1995: Summer Intern, AT&T Bell Laboratories, Murray Hill, NJ.
`• 8/1994-5/1995: Teaching Assistant, Department of Computer Sciences, University of Texas at Austin.
`• 5/1994-8/1994: Summer Intern, Microsoft Research, Redmond, WA.
`
`Honors and Awards
`• Elected as the Fellow of the IEEE, 2013
`• Distinguished member of the ACM, 2009.
`• Keynote Spearker, ACM ICPE 2013 conference
`• Keynote Speaker, ACM GreenMetrics 2013
`
`

`

`• Keynote Speaker, IEEE E6 Energy Workshop, 2012.
`• Keynote speaker, TCS Excellence in Computer Science (TECS) Week, January 2012.
`• Best paper, ACM/IEEE IWQOS symposium, Montreal, 2013
`• Best paper runner-up, ACM eEnergy conference, Berkeley, CA, 2013
`• Best papers of IEEE PerCom 2012 conference (one of three papers chosen for this honor).
`• Best paper, IEEE COMSNETS 2012 conference, India.
`• Best paper, ACM Sigcomm GreenNets 2011 workshop, Toronto, Canada.
`• Our Memory Buddies paper adjudged one of the four best papers of ACM VEE 2009.
`• Best paper, Usenix 2007 annual technical conference.
`• Best Paper, ACM Multimedia 2005, Singapore.
`• Paper co-authored with a student won Best Student Paper, IEEE Autonomic Computing conference (ICAC)
`2005.
`• Best Paper, IEEE Web Information Systems Engineering Conference, 2002. Forwarded to a fast-track issue of
`World Wide Web Journal.
`• Best Paper in Performance/Systems Category and Finalist for overall Best Paper, World Wide Web Conference,
`May 2002. Forwarded to a fast-track issue of IEEE Transactions on Knowledge and Data Engineering.
`• Paper co-authored with a student was Best Student Paper Finalist, ACM Multimedia 2005.
`• Lilly Foundation Teaching Fellowship, August 2001.
`• IBM Faculty Partnership Award, June 2000, June 2001 and June 2003.
`• National Science Foundation (NSF) CAREER Award, April 2000.
`• Best Doctoral Dissertation of 1998-99, Department of Computer Sciences, University of Texas at Austin.
`• MCD Graduate Fellowship, Department of Computer Sciences, University of Texas at Austin, 1993-95.
`• Institute Medal recipient for being the top ranking graduating student, Department of Computer Science and
`Engineering, Indian Institute of Technology, Bombay, July, 1993.
`
`Book Chapters
`
`B1. Michael Zink and Prashant Shenoy, “Caching and Distribution Issues for Streaming Content Distribu-
`tion Networks,” X. Tang, J. Xu, and S T. Chanson (eds), Springer, 2005.
`
`B2. Harrick Vin and Prashant Shenoy, “Storage Architectures for Digital Imagery,” Image Databases:
`Search and Retrieval of Digital Imagery, V. Castelli and L. Bergman (eds), John Wiley, 2002.
`
`B3. Prashant Shenoy and Harrick Vin, “Media Servers,” Readings in Multimedia Computing, K Jeffay and
`H. Zhang (eds), Morgan Kaufman Publishers, August 2001.
`
`

`

`Journal Publications
`
`J1. Tian Guo, Upendra Sharma, Prashant Shenoy, Timothy Wood, Sambit Sahu, ”Cost-aware Cloud Burst-
`ing for Enterprise Applications,” ACM Transactions on Internet Technology (TOIT), 2014 (to appear).
`
`J2. Prashant Shenoy, ”Multimedia Systems Research: The First Twenty Years and Lessons for the Next
`Twenty,” ACM Transactions on Multimedia Computing, Communications and Applications (ACM TOM-
`CCAP), Special Issue on 20 Years of ACM Multimedia, vol 9, no 1s, October 2013.
`
`J3. R. Singh, P. Shenoy, M. Natu, V. Sadaphal and H. Vin, ”Analytical Modeling for What-if Analysis in
`Complex Cloud Computing Applications,” ACM Sigmetrics Performance Evaluation Review, Special
`Issue on Cloud Computing, Vol 40, no 4, pages 53-62, March 2013
`
`J4. A. Mishra, D. Irwin, P. Shenoy, J. Kurose, T. Zhu, ”GreenCharge: Managing Renewable Energy in
`Smart Buildings,” IEEE Journal on Selected Areas in Communications (JSAC), Special Series on Smart
`Grid Communications, 31(7): 1281-1293, July 2013.
`
`J5. B. Li, E. Mazur, Y. Diao, A. McGregor and P. Shenoy, “SCALLA: A Platform for Scalable One-Pass
`Analytics using MapReduce,” ACM Transactions on Database Systems (TODS), 37:4, December 2012.
`Special Issue of Best Papers of Sigmod 2011.
`
`J6. Peter Desnoyers, Timothy Wood, Prashant Shenoy, Rahul Singh, Sangameshwar Patil, and Harrick Vin,
`“Modellus: Automated Modeling of Complex Internet Data Center Applications,” ACM Transactions
`on the Web (TWEB), 6(2), 1-19, May 2012.
`
`J7. T. Wood, K K Ramakrishnan, P. Shenoy, K Van der Merwe, “Enterprise Ready Virtual Cloud Pools:
`Vision, Oppurtunities and Challenges,” The Computer Journal, Oxford Univ. Press, vol 55, number 8,
`pages 1-10, October 2012.
`
`J8. Navin Sharma, David Irwin, Prashant Shenoy and Michael Zink, “MultiSense: Proportional-Share for
`Mechanically Steerable Sensor Networks,” Multimedia Systems Journal (MMSJ), vol 18, pages 425-
`444, October 2012.
`
`J9. Y. Nie, R. Cocci, Z. Cao, Y. Diao, and P. Shenoy “SPIRE: Efficient Data Interpretation and Compression
`over RFID Streams,” IEEE Trans. on Knowledge and Data Engineering (TKDE), vol 24, number 1,
`pages 141-155, 2012.
`
`J10. Zhao Cao, Charles Sutton, Yanlei Diao, and Prashant Shenoy,”Distributed Inference and Query Pro-
`cessing for RFID Tracking and Monitoring” PVLDB Journal, vol 4, number 5, pages 326-337, March
`2011.
`
`J11. Xiaotao Liu, Mark D. Corner, Prashant Shenoy, “Ferret: An RFID-enabled pervasive multimedia appli-
`cation,” Ad Hoc Networks, 9(4), 2011.
`
`J12. Jeremy Gummeson, Deepak Ganesan, Prashant Shenoy and Mark Corner, “An Adaptive Link Layer
`for Heterogeneous Multi-radio Mobile Sensor Networks,” IEEE Journal on Selected Areas in Commu-
`nications (JSAC), Special Issue on Simple Wireless Sensor Networking Solutions, vol 28, no 7, pages
`1094-1104 Sept 2010.
`
`J13. Gaurav Mathur, Peter Desnoyers, Paul Chukiu, Deepak Ganesan and Prashant Shenoy, “Ultra Low
`Power Data Storage for Sensor Networks,” ACM Transaction on Sensor Networks (TOSN), 2009.
`
`

`

`J14. David Yates, Erich Nahum, James F. Kurose, Prashant Shenoy, “Data Quality and Query Cost in Per-
`vasive Sensing Systems”, Elsevier Pervasive and Mobile Computing Journal, Special Issue of Selected
`Papers from IEEE Percom’08, 2009.
`
`J15. Ming Li, Deepak Ganesan and Prashant Shenoy, “PRESTO: Feedback-driven Data Management in
`Sensor Networks,” IEEE/ACM Transactions on Networking (TON), October 2009.
`
`J16. Xiaotao Liu, Mark D. Corner, and Prashant Shenoy, “SEVA: Sensor Enhanced Video Annotation,” ACM
`Transactions on Multimedia Computing, Communications and Applications (ACM TOMCCAP), August
`2009.
`
`J17. Bhuvan Urgaonkar, Prashant Shenoy, and Timothy Roscoe. “Resource Overbooking and Application
`Profiling in a Shared Internet Hosting Platform,” ACM Transactions on Internet Technologies (TOIT),
`2008.
`
`J18. Xiaotao Liu, Prashant Shenoy, and Mark D. Corner, “Chameleon: Application Level Power Manage-
`ment,” IEEE Transactions on Mobile Computing, 7(8):995-1010, August 2008.
`
`J19. Bhuvan Urgaonkar and Prashant Shenoy “Cataclysm: Scalable Overload Policing for Internet Applica-
`tions,” Elsevier Journal of Network and Computer Applications (JNCA), vol 31, pages 891-920, July
`2008.
`
`J20. B. Wang, J. Kurose, P. Shenoy and D. Towsley, “Multimedia Streaming via TCP: An Analytic Per-
`formance Study,” ACM Transactions on Multimedia Computing, Communications and Applications
`(TOMCCAP), 4(2), April 2008.
`
`J21. A. Chandra and P. Shenoy. “Hierarchical Scheduling for Symmetric Multiprocessors,” IEEE Trans. On
`Parallel and Distributed Systems (TPDS), 19(3), pp 418-431, March 2008.
`
`J22. Bhuvan Urgaonkar, Prashant Shenoy, Abhishek Chandra, Pawan Goyal, and Timothy Wood, “Agile
`Dynamic Provisioning of Multi-tier Internet Applications”, ACM Transactions on Adaptive and Au-
`tonomous Systems (TAAS), Vol. 3, No. 1, pages 1-39, March 2008.
`
`J23. B. Urgaonkar, A. Rosenberg and P. Shenoy, “Application Placement on a Cluster of Servers”, Interna-
`tional Journal of Foundations of Computer Science, Vol. 18, No. 5, pages 1023-1041, October 2007
`
`J24. Z. Ge, P. Ji and P. Shenoy, “Design and Analysis of a Demand Adaptive and Locality Aware Streaming
`Media Server Cluster” ACM/Springer Multimedia Systems Journal, 13( 3), pages 235-249, September
`2007
`
`J25. B. Urgaonkar, G. Pacifici, P. Shenoy, M. Spreitzer and A. Tantawi, “Analytic Modeling of Multi-tier
`Internet Applications,” ACM Transactions on the Web (TWEB), 1(1):1–25, May 2007.
`
`J26. H. Li, K. Ramamritham, P. Shenoy, R. Grupen, J. Sweeney, “Resource Management for Real-time
`Tasks in Mobile Robotics,” Special Issue on Dynamic Resource Management in Distributed Real-Time
`Systems, Journal of Systems and Software, 80:962-971, May 2007
`
`J27. X. Liu, J. Lan, P. Shenoy and K. Ramamritham, “Consistency Maintenance in Dynamic Overlay Net-
`works,” Computer Networks, Special Issue on Overlay Distribution Structures and their Applications,
`50(6), pp 859-876, April 2006.
`
`

`

`J28. A. Chandra, P. Pradhan, R. Tewari, S. Sahu and P. Shenoy, “An Observation-based Approach Towards
`Self-managing Web Servers” Computer Communications, 2006.
`
`J29. Y. Guo, Z. Ge, B. Urgaonkar, P. Shenoy and D. Towsley, “Dynamic Cache Reconfiguration Strategies
`for Cluster-based Streaming Proxies,” Computer Communications, 29(8), pp 1174-1188, May 2006.
`
`J30. J. Arnold, B.N. Levine, R. Manmatha, F. Lee, P. Shenoy, M.-C. Tsai, T.K. Ibrahim, D. OBrien, D.A.
`Walsh, “Information Sharing in Out-of-Hospital Disaster Response: The future role of information
`technology”, Journal of Pre-Hospital and Disaster Medicine, 19(2):201-207, Sept 2004.
`
`J31. Sheetal Shah, Krithi Ramamritham and Prashant Shenoy, “Resilient and Coherency Preserving Dissem-
`ination of Dynamic Data Using Cooperating Peers,” IEEE Trans. on Knowledge and Data Engineering,
`Special Issue on Peer-to-Peer Data Management, 16(7):799-812 July 2004.
`
`J32. Aameek Singh, Abhishek Trivedi, Krithi Ramamritham and Prashant Shenoy, “PTC : Proxies that
`Transcode and Cache in Heterogeneous Web Client Environments,” World Wide Web Journal, Special
`Issue on WISE 2002 papers, 7(1):2-28 2004.
`
`J33. Bhuvan Urgaonkar and Prashant Shenoy, “Sharc: Managing CPU and Network Bandwidth in Shared
`Clusters,” IEEE Trans. on Parallel and Distributed Systems (TPDS), 15(1):2-17, January 2004.
`
`J34. P Shenoy, P Goyal, S Rao and H Vin, “Design Considerations for the Symphony Integrated File Sys-
`tem”, ACM/Springer Multimedia Systems Journal, volume 9, no 4, November 2003
`
`J35. M. Bradshaw, B. Wang, S. Sen, L. Gao, J. Kurose, P. Shenoy, and D. Towsley, “Periodic Broadcast
`and Patching Services: Implementation, Measurement and Analysis in an Internet Streaming Media
`Testbed,” ACM/Springer Multimedia Systems Journal, Special Issue on Multimedia Distribution, 9(1),
`pages 78-93, July 2003.
`
`J36. Prashant Shenoy, Pawan Goyal, Sriram Rao and Harick Vin, “Design Considerations for the Symphony
`Integrated Multimedia File System,” ACM/Springer Multimedia Systems Journal, 9(4), pages 337- 352,
`October 2003.
`
`J37. Venkata Duvvuri, Prashant Shenoy and Renu Tewari, “Adaptive Leases: A Strong Consistency Mech-
`anism for the World Wide Web,” IEEE Transactions on Knowledge and Data Engineering (TKDE),
`15(5), pages 1266-1276, September 2003.
`
`J38. Anoop Ninan, Purushottam Kulkarni, Prashant Shenoy, Krithi Ramamritham and Renu Tewari, “Scal-
`able Consistency Maintenance in Content Distribution Networks using Cooperative Leases,” IEEE
`Transactions of Knowledge and Data Engineering, 15(4), pages 813-828, July/August 2003.
`
`J39. Pavan Deolasee, Amol Katkar, Ankur Panchbudhe, Krithi Ramamritham and Prashant Shenoy “Adap-
`tive Push-Pull of Dynamic Web Data,” IEEE Transactions on Computers, 51(6) pages 652-668, June
`2002.
`
`J40. Mohammad S. Raunak, Prashant Shenoy, Pawan Goyal, Krithi Ramamritham and Puru Kulkarni, “Im-
`plications of Proxy Caching for Provisioning Servers and Networks,” IEEE Journal on Selected Areas in
`Communications (JSAC), Special Issue on Internet Proxy Services, 20(7), pages 1276-1289, September
`2002.
`
`

`

`J41. Prashant Shenoy, Pawan Goyal and Harrick M. Vin, “Architectural Considerations for Next Generation
`File Systems”, ACM/Springer Multimedia Systems Journal, 8(4), pages 270-283, July 2002
`
`J42. Prashant Shenoy and Harrick M. Vin, “Cello: A Disk Scheduling Framework for Next Generation
`Operating Systems,” Real Time Systems Journal: Special Issue on Flexible Scheduling of Real-Time
`Systems, 22(1) pages 9-47, January 2002.
`
`J43. Prashant J. Shenoy and Harrick M. Vin, “Failure Recovery Algorithms for Multimedia Servers,” ACM/Springer
`Multimedia Systems Journal, 8(1) pages 1-19, January 2000.
`
`J44. Prashant J. Shenoy and Harrick M. Vin, “Efficient Striping Techniques for Variable Bit-rate Continuous
`Media File Servers,” Performance Evaluation Journal, 38:(3), pages 175-200, December 1999.
`
`J45. Prashant J. Shenoy and Harrick M. Vin, “Efficient Support for Interactive Operations in Multi-resolution
`Video Servers,” ACM/Springer Multimedia Systems Journal, 7(3), pages 241–251, July 1999.
`
`J46. Prashant J. Shenoy, Pawan Goyal, and Harrick M. Vin, “Issues in Multimedia Server Design,” ACM
`Computing Surveys (Special Issue : Symposium on Multimedia Systems), 27(4), pages 636–639, De-
`cember 1995.
`
`Refereed Conference and Workshop Publications
`
`C1. Tian Guo, Vijay Gopalakrishnan, K. K. Ramakrishnan, Prashant Shenoy, Arun Venkataramani, Se-
`ungjoon Lee, ”VMShadow: Optimizing The Performance of Latency-sensitive Virtual Desktops in Dis-
`tributed Clouds,” Proceedings of ACM Multimedia Systems 2014 (MMSYS 2014), Singapore, March
`19-21 2014
`
`C2. Vimal Mathew, Ramesh K. Sitaraman, Prashant Shenoy, ”Reducing Energy Costs in Internet-Scale
`Distributed Systems Using Load Shifting,” Proceedings of IEEE COMSNETS 2014, Bangalore, India,
`January 2014
`
`C3. Ye Xu, David Irwin, and Prashant Shenoy ”Incentivizing Advanced Load Scheduling in Smart Homes,”
`Proceedings of ACM BuildSys 2013, Rome, Italy, November 2013
`
`C4. Dong Chen, Sean Barker, Adarsh Subbaswamy, David Irwin, and Prashant Shenoy ”Non-Intrusive Oc-
`cupancy Monitoring using Smart Meters,” Proceedings of ACM BuildSys, Rome, Italy, November 2013
`
`C5. Upendra Sharma, Prashant Shenoy and Sambit Sahu, ”A Flexible Elastic Control Plane for Private
`Clouds,” Proceedings of the ACM Cloud and Autonomics Conference (CAC 2013), August 2013.
`
`C6. V. Mathew, R. Sitaraman, and P. Shenoy, ”Energy-Efficient Content Delivery Networks using Cluster
`Shutdown,” Proceedings of the IEEE International Green Computing Conference (IGCC), Arlington,
`VA, June 2013
`
`C7. S. Barker, S. Kalra, D. Irwin, P. Shenoy, ”Empirical Characterization and Modeling of Electrical Loads
`in Smart Homes,” Proceedings of the IEEE Internati