Virtual appliance content distribution for a global infrastructure cloud service

Proceedings - IEEE INFOCOM

Volumn , Issue , 2010, Pages

  Epstein, Amir ^a   Lorenz, Dean H ^a   Silvera, Ezra ^a   Shapira, Inbar ^a  

^a IBM HAIFA RESEARCH LAB   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATE SOLUTION; CLOUD COMPUTING; CONTENT DISTRIBUTION; CUSTOMER VALUES; DISK IMAGES; EFFICIENT ALGORITHM; ERROR BOUND; FUNDAMENTAL PROPERTIES; GLOBAL CLOUDS; GLOBAL INFRASTRUCTURE; LOWER COST; NETWORK BANDWIDTH; ON TIME; OPTIMIZATION PROBLEMS; SERVICE LEVELS; STORAGE CAPACITY; USEFUL PROPERTIES; VIRTUAL APPLIANCE; VIRTUAL SERVERS;

ALGORITHMS; DISTRIBUTED COMPUTER SYSTEMS; ERROR ANALYSIS; FLAVORS; OPTIMIZATION; SALES;

CUSTOMER SATISFACTION;

EID: 77953310852     PISSN: 0743166X     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/INFCOM.2010.5462176     Document Type: Conference Paper

References (27)

1. M. Armbrust, A. Fox, R. Griffith, A. D. Joseph, R. Katz, A. Konwinski, G. Lee, D. Patterson, A. Rabkin, I. Stoica, and M. Zaharia, "Above the clouds: A berkeley view of cloud computing," University of California, Tech. Rep., 2009.
2. Amazon Elastic Compute Cloud (EC2), http://aws.amazon.com/ec2.
3. Google App Engine, http://code.google.com/appengine.
4. E. Kotsovinos, T. Moreton, I. Pratt, R. Ross, K. Fraser, S. Hand, and T. Harris, "Global-scale service deployment in the XenoServer platform," in Proceedings of the First Workshop on Real, Large Distributed Systems (WORLDS'04), Dec. 2004.
5. D. C. Verma, Content Distribution Networks: An Engineering Approach. New York, NY, USA: John Wiley & Sons, Inc., 2002.
6. A. Vakali and G. Pallis, "Content delivery networks: Status and trends," IEEE Internet Computing, vol. 7, no. 6, pp. 68-74, 2003.
7. I. Lazar and W. Terrill, "Exploring content delivery networking," IT Professional, vol. 3, no. 4, pp. 47-49, 2001.
8. J. M. Almeida, D. L. Eager, M. C. Ferris, andM. K. Vernon, "Provisioning content distribution networks for streaming media," in INFOCOM, 2002.
9. R. Cohen, L. Katzir, and D. Raz, "Scheduling algorithms for a cache pre-filling content distribution network," in INFOCOM, vol. 2, 2002, pp. 940-949.
10. M. Rabinovich and O. Spatschek, Web caching and replication. Boston, MA, USA: Addison-Wesley Longman Publishing Co., Inc., 2002.
11. S. Androutsellis-Theotokis and D. Spinellis, "A survey of peer-to-peer content distribution technologies," ACM Comput. Surv., vol. 36, no. 4, pp. 335-371, 2004.
12. J. Moore, "An n job, one machine sequencing algorithm for minimizing the number of late jobs," Management Science, vol. 15, pp. 102-109, 1968.
13. R. Karp, "Reducibility among combinatorial problems," in Complexity of Computer Computations, R.E. Miller and J.W. Thatcher, Eds. New York, NY: Plenum, 1972, pp. 85-103.
14. E. Lawler and J. Moore, "A functional equation and its application to resource allocation and sequencing problems," Management Science, vol. 16, pp. 77-84, 1969.
15. S. Sahni, "Algorithms for scheduling independent tasks," Journal of the Association for Computing Machinery, vol. 23, pp. 116-127, 1976.
16. J. Lenstra, A. R. Kan, and P. Brucker, "Complexity of machine scheduling problems," Annals of Discrete Mathematics, vol. 1, pp. 343-362, 1977.
17. H. Kise, T. Ibaraki, and H. Mine, "A solvable case of the one-machine scheduling problem with ready and due times," OPERATIONS RESEARCH, vol. 26, pp. 121-126, 1978.
18. E. Lawler, "Scheduling a single machine to minimize the number of late jobs," unpublished manuscript.
19. A. Bar-Noy, S. Guha, J. Naor, and B. Schieber, "Approximating the throughput of multiple machines in real-time scheduling," SIAM Journal on Computing, vol. 31, pp. 331-352, 2001.
20. A. Bar-Noy, R. Bar-Yehuda, A. Freund, J. Naor, and B. Schieber, "A unified approach to approximating resource allocation and scheduling," Journal of the ACM, vol. 48, pp. 1069-1090, 2001.
21. P. Berman and B. Dasgupta, "Multi-phase algorithms for throughput maximization for real-time scheduling," Journal of Combinatorial Optimization, vol. 4, pp. 307-323, 2000.
22. F. Spieksma, "On the approximability of an interval scheduling problem," Journal of Scheduling, vol. 2, pp. 215-227, 1999.
23. J. Chuzhoy, R. Ostrovsky, and Y. Rabani, "Approximation algorithms for the job interval selection problem and related scheduling problems," Math. Oper. Res., vol. 31, pp. 730-738, 2006.
24. B. Kalyanasundaram and K. Pruhs, "Speed is as powerful as clairvoyance," J. ACM, vol. 47, no. 4, pp. 617-643, 2000.
25. C. Phillips, C. Stein, E. Torng, and J. Wein, "Optimal time-critical scheduling via resource augmentation," Algorithmica, vol. 32, no. 2, pp. 163-200, 2002.
26. IBM Tivoli® Provisioning Manager, http://www.ibm.com/software/- tivoli/products/prov-mgr.
27. IBM® Systems Director VMControl, http://www.ibm.com/systems/- management/director/plugins/vmcontrol/index.html.