Cloud Computing in Space

Published Online:https://doi.org/10.1287/ijoc.2015.0652

References

  • Albin SL (1982) On Poisson approximations for superposition arrival processes in queues. Management Sci. 28(2):126–137.LinkGoogle Scholar
  • Anhalt F, Primet PV-B (2009) Analysis and experimental evaluation of data plane virtualization with Xen. Mauri JL, Casares V, Tomas R, Serra T, Dini O, eds. Internat. Conf. Networking Services (ICNS’06) (IEEE, Piscataway, NJ), 198–203.CrossrefGoogle Scholar
  • Bertsimas DJ, Van Ryzin G (1991) A stochastic and dynamic vehicle routing problem in the Euclidean plane. Oper. Res. 39(4):601–615.LinkGoogle Scholar
  • Buttazzo G, Lipari G, Abeni L, Caccamo M (2005) Soft Real-Time Systems: Predictability vs. Efficiency, Series in Computer Science (Springer, New York).Google Scholar
  • Cherkasova L, Gupta D, Vahdat A (2007) Comparison of the three CPU schedulers in Xen. SIGMETRICS Performance Evaluation Rev. 35(2):42–51.CrossrefGoogle Scholar
  • Cohen JW (1982) The Single Server Queue, North-Holland Series in Applied Mathematics and Mechanics (North-Holland, Amsterdam).Google Scholar
  • Craciunas S, Haas A, Kirsch C, Payer H, Röck H, Rottmann A, Sokolova A, Trummer R, Love J, Sengupta R (2010) Information-acquisition-as-a-service for cyber-physical cloud computing. Proc. 2nd Conf. Hot Topics Cloud Comput. (USENIX Association, Berkeley, CA).Google Scholar
  • Daley D, Vere-Jones D (1988) An Introduction to the Theory of Point Processes, Vol. 1 (Springer-Verlag, New York).Google Scholar
  • Dantzig GB, Ramser JH (1959) The truck dispatching problem. Management Sci. 6(1):80–91.LinkGoogle Scholar
  • Gupta P, Kumar P (2000) The capacity of wireless networks. IEEE Trans. Inform. Theory 46(2):388–404.CrossrefGoogle Scholar
  • Høst-Madsen A, Nosratinia A (2005) The multiplexing gain of wireless networks. 2005 IEEE Internat. Sympos. Inform. Theory (IEEE, Piscataway, NJ), 2065–2069.CrossrefGoogle Scholar
  • Huang J, Sengupta R (2013) Stability of dynamic traveling repairman problem under polling-sequencing policies. Eur. Control Conf. (ECC) (IEEE, Piscataway, NJ), 614–619.CrossrefGoogle Scholar
  • Huang J, Sengupta R (2015) System time distribution of dynamic traveling repairman problem under the PART-n-TSP policy. Eur. Control Conf. (ECC) (IEEE, Piscataway, NJ). Forthcoming.CrossrefGoogle Scholar
  • Jain R, Chiu D-M, Hawe WR (1984) A quantitative measure of fairness and discrimination for resource allocation in shared computer system. White Paper DEC-TR-301, Eastern Research Laboratory, Digital Equipment Corporation, Hudson, MA.Google Scholar
  • Kesavan M, Gavrilovska A, Schwan K (2010) On disk I/O scheduling in virtual machines. Proc. 2nd Conf. I/O Virtualization (USENIX Association, Berkeley, CA).Google Scholar
  • Khinchin AY (1969) Mathematical Methods in the Theory of Queueing. Griffin’s Statistical Monographs and Courses (Griffin, New York).Google Scholar
  • Kirsch C, Pereira E, Sengupta R, Chen H, Hansen R, Huang J, Landolt Fet al. (2012) Cyber-physical cloud computing: The binding and migration problem. DATE ’12: Proc. Conf. Design, Automation Test Eur. (EDA Consortium, San Jose, CA), 1425–1428.CrossrefGoogle Scholar
  • Loynes R (1962) The stability of a queue with non-independent inter-arrival and service times. Math. Proc. Cambridge Philos. Soc. 58(3):497–520.CrossrefGoogle Scholar
  • Moyal P (2008) Convex comparison of service disciplines in real time queues. Oper. Res. Lett. 36(4):496–499.CrossrefGoogle Scholar
  • Pavone M, Arsie A, Frazzoli E, Bullo F (2009) Equitable partitioning policies for robotic networks. IEEE Internat. Conf. Robotics Automation (ICRA ’09) (IEEE, Piscataway, NJ), 2356–2361.Google Scholar
  • Popek GJ, Goldberg RP (1974) Formal requirements for virtualizable third generation architectures. Comm. ACM 17(7):412–421.CrossrefGoogle Scholar
  • Rochwerger B, Breitgand D, Epstein A, Hadas D, Loy I, Nagin K, Tordsson Jet al. (2011) Reservoir—When one cloud is not enough. Computer 44(3):44–51.CrossrefGoogle Scholar
  • Rosenblum M (2004) The reincarnation of virtual machines. Queue 2(5):34–40.CrossrefGoogle Scholar
  • Shenker S, Wroclawski J (1997) General characterization parameters for integrated service network elements. RFC 2215, RFC Editor, Internet Society, Reston, VA.Google Scholar
  • Somasundara AA, Ramamoorthy A, Srivastava MB (2004) Mobile element scheduling for efficient data collection in wireless sensor networks with dynamic deadlines. Proc. 25th IEEE Internat. Real-Time Systems Sympos. (RTSS ’04) (IEEE, Piscataway, NJ), 296–305.CrossrefGoogle Scholar
  • Takagi H (1991) Queueing Analysis: A Foundation of Performance Evaluation, Vacation and Priority Systems, Queueing Analysis, Vol. 1 (North-Holland, Amsterdam).Google Scholar
  • Wierman A (2007) Scheduling for today’s computer systems: Bridging theory and practice. Ph.D. thesis, Carnegie Mellon University, Pittsburgh.Google Scholar
  • Ye K, Jiang X, Ye D, Huang D (2010) Two optimization mechanisms to improve the isolation property of server consolidation in virtualized multi-core servers. Proc. 2010 IEEE 12th Internat. Conf. High Performance Comput. Cluster (HPCC) (IEEE, Piscataway, NJ), 281–288.Google Scholar
  • Zhong A, Jin H, Wu S, Shi X, Gao W (2012) Performance implications of non-uniform VCPU-PCPU mapping in virtualization environment. Cluster Comput. 16(3):347–358.CrossrefGoogle Scholar
  • Zhou F, Goel M, Desnoyers P, Sundaram R (2011) Scheduler vulnerabilities and attacks in cloud computing. NCA 2011: 2011 IEEE Internat. Sympos. Network Comput. Appl. (IEEE, Piscataway, NJ), 123–130.CrossrefGoogle Scholar
INFORMS site uses cookies to store information on your computer. Some are essential to make our site work; Others help us improve the user experience. By using this site, you consent to the placement of these cookies. Please read our Privacy Statement to learn more.