CFP last date
20 June 2024
Reseach Article

Upright load allocation for Cloud Computing via various Performance Options

Published on April 2012 by Amit Batra, Rajender Kumar, Arvind Kumar
International Conference on Recent Advances and Future Trends in Information Technology (iRAFIT 2012)
Foundation of Computer Science USA
IRAFIT - Number 1
April 2012
Authors: Amit Batra, Rajender Kumar, Arvind Kumar
8d8c57a9-07d6-4510-8cb5-98a08263622f

Amit Batra, Rajender Kumar, Arvind Kumar . Upright load allocation for Cloud Computing via various Performance Options. International Conference on Recent Advances and Future Trends in Information Technology (iRAFIT 2012). IRAFIT, 1 (April 2012), 6-11.

@article{
author = { Amit Batra, Rajender Kumar, Arvind Kumar },
title = { Upright load allocation for Cloud Computing via various Performance Options },
journal = { International Conference on Recent Advances and Future Trends in Information Technology (iRAFIT 2012) },
issue_date = { April 2012 },
volume = { IRAFIT },
number = { 1 },
month = { April },
year = { 2012 },
issn = 0975-8887,
pages = { 6-11 },
numpages = 6,
url = { /proceedings/irafit/number1/5846-1002/ },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Proceeding Article
%1 International Conference on Recent Advances and Future Trends in Information Technology (iRAFIT 2012)
%A Amit Batra
%A Rajender Kumar
%A Arvind Kumar
%T Upright load allocation for Cloud Computing via various Performance Options
%J International Conference on Recent Advances and Future Trends in Information Technology (iRAFIT 2012)
%@ 0975-8887
%V IRAFIT
%N 1
%P 6-11
%D 2012
%I International Journal of Computer Applications
Abstract

Cloud computing looks to deliver software as a provisioned service to end users, but the underlying infrastructure must be sufficiently scalable and robust. In our work, we focus on large-scale enterprise cloud systems and examine ho-w enterprises may use a service-oriented architecture (SOA) to provide a streamlined interface to their business processes. To scale up the business processes, each SOA tier usually deploys multiple servers for load distribution and fault tolerance, a scenario which we term horizontal load distribution. One limitation of this approach is that load cannot be distributed further when all servers in the same tier are loaded. In complex multitiered SOA systems, a single business process may actually be implemented by multiple different computation pathways among the tiers, each with different components, in order to provide resilience and scalability. Such multiple implementation options gives opportunities for vertical load distribution across tiers. In this chapter, we look at a novel request routing framework for SOA-based enterprise computing with multiple implementation options that takes into account the options of both horizontal and vertical load distribution.

References
  1. Bent, R., & Van Hentenryck, P. (2004). Regrets Only! Online stochastic optimization under time constraints. Nineteenth National Conference on Artificial Intelligence, San Jose, CA.
  2. Buco, M. J., Chang, R. N., Luan, L. Z., Ward, C., Wolf, J. L., Yu, P. S., et al. (2003). Managing ebusiness on demand sla contracts in business terms using the cross-sla execution manager sam. ISADS, Washington, DC, 157–164.
  3. Business Process Execution Language for Web Services (Version 1.1), (2005).
  4. Casati, F., Ilnicki, S., Jin, L., Krishnamoorthy, V., & Shan, M.-C. (2000). Adaptive and Dynamic Service Composition in eFlow. Proceedings of CAISE, Stockholm, Sweden, 13–31.
  5. Costa, L., & Oliveira, P. (2001). Evolutionary algorithms approach to the solution of mixed integer nonlinear programming problems. Computers and Chemical Engineering, 25(2–3), 257–266.
  6. Davis, L. (1985). Job shop scheduling with genetic algorithms. Proceedings of the International Conference on Genetic Algorithms, Pittsburgh, PA.
  7. DeCandia, G., Hastorun, D., Jampani, M., Kakulapati, G., Lakshman, A., Pilchin, A., Sivasubramanian, S., Vosshall, P., & Vogels, W. (2007). Dynamo: Amazon's highly available key-value store. Proceedings of SOSP, Washington D.C., 205–220.
  8. Dewri, R., Ray, I., Ray, I., & Whitley, D. (2008). Optimizing on-demand data broadcast scheduling in pervasive environments. Proceedings of EDBT, Nantes, France, 559– 569.
  9. Dikaiakos, M., Pallis, G., Katsaros, D., Mehra, P., & Vakali, A. (2009). Cloud computing: Distributed internet computing for it and scientific research. IEEE Internet Computing, 13(5), 10–13.
  10. Goldberg, D. (1989). Genetic algorithms in searth, optimization, and machine learning. Dordrecht: Kluwer.
  11. Holland, J. (1992). Adaptation in natural and artificial systems. Cambridge, MA: MIT Press.
  12. Lima, R., Francois, G., Srinivasan, B., & Salcedo, R. (2004). Dynamic optimization of batch emulsion polymerization using MSIMPSA, a simulated-annealingbased algorithm. Industrial and Engineering Chemistry Research, 43(24), 7796–7806.
  13. Oliveira, R., & Salcedo, R. (2005). Benchmark testing of simulated annealing, adaptive random search and genetic algorithms for the global optimization of bioprocesses. International Conference on Adaptive and Natural Computing Algorithms, Coimbra, Portugal.
  14. Phan, T., & Li, W.-S. (2008a). Dynamic materialization of query views for data warehouse workloads. Proceedings of the International Conference on Data Engineering, Long Beach, CA.
  15. Ponnekanti, S., & Fox, A. (2004). Interoperability among Independently Evolving Web Services. Proceedings of Middleware, Toronto, Canada.
  16. Shankar, M., De Miguel, M., & Liu, J. W.-S. (2004). An end-to-end qos management architecture Proceedings of the Fifth IEEE Real Time Technology and Applications Symposium, Vancouver, British Columbia, Canada, p. 176.
Index Terms

Computer Science
Information Sciences

Keywords

Service Oriented Architecture (soa) Chromosome Ga(genetic Algorithm) Servers Per Service Time Server Completion Time(?)