Optimization for QoS on Web-Service-Based Systems with Tasks Deadlines 1
|
|
- Derick Higgins
- 8 years ago
- Views:
Transcription
1 Optimization for QoS on Web-Service-Based Systems with Tasks Deadlines 1 Luís Fernando Orleans Departamento de Engenharia Informática Universidade de Coimbra Coimbra, Portugal lorleans@dei.uc.pt Pedro Nuno Furtado Departamento de Engenharia Informática Universidade de Coimbra Coimbra, Portugal pnf@dei.uc.pt Abstract Web-Services-based parallel systems (WSB-P) should exhibit predictable behavior by guaranteeing Quality-of-Service parameters. One of the important requirements of predictability is that requests (tasks) should have maximum acceptable response time thresholds, which we denote as deadlines in this paper. In order to provide QoS, a WSB-P should try to guarantee these deadlines. Such policy affects the way the system should be designed, because all task durations must be under the deadline, and also how tasks are distributed among the servers. This way, it is desirable to use a load balancing algorithm that tries to both maximize the throughput and minimize the missed deadlines. This paper shows, with the help of a simulator, how the number of concurrent executions (CE) in the WSB-P plays a crucial role in the pursuit of the objective and how the optimal CE can be determined. load-balancing; deadlines; QoS; simulation; web-services I. INTRODUCTION Web-Services-based parallel systems (WSB-P) should exhibit predictable behavior by guaranteeing Quality-of- Service parameters. One of the important requirements of predictability is that requests (tasks) should have maximum acceptable response time thresholds, which we denote as deadlines in this paper. In order to provide QoS, a WSB-P should try to guarantee these deadlines. Such policy affects the way the system should be designed, because all task durations must be under the deadline, and also how tasks are distributed among the servers. This way, it is desirable to use a load balancing algorithm that tries to both maximize the throughput and minimize the missed deadlines. This paper shows, with the help of a simulator, how the number of concurrent executions (CE) in the WSB-P plays a crucial role in the pursuit of the objective and how the optimal CE can be determined. Both traditional LWR and Round-Robin (RR) provide no control over the concurrent executors (CE) number on the system, which means that every request that arrives is immediately put into execution, no matter how many requests are already running on the servers. This policy is known as best-effort, i.e., for all requests that arrive, the system will do its best to handle them, though providing no response time guarantees. Using a simple linear analysis, if a request would take 1 second to run alone, in a server that already has 1 requests running it will take 1 seconds to complete. In a 1. This work was supported by the Adapt-DB project FCT POSC/EIA/5515/24. system where tasks have deadlines, this behaviour is unacceptable, as the number of missed-deadlines highly depends on the CE number. To reduce the number of missed-deadlines in WSB-P, one can add new servers to the cluster and upgrades on all servers, improving the computing capacity of the system as a whole. These are modifications of the installed capacity. They do not happen instantaneously, may lead to expensive over-capacity options to deal with peaks.5% of the time and on themselves do not provide the answer to meeting the deadlines with heavy traffic. No matter what the installed capacity is, the problem occurs whenever the rate of requests arrivals is sufficiently large (traffic peaks) to mean that each node will have to process several requests simultaneously. A logical solution to reduce the number of misseddeadlines is to adapt the load-balancing algorithms, making them to limit the CE number of the system. This way, there will be only an adaptable number of concurrent requests interfering on each others execution. The requests that arrive while the system is saturated, i.e., the maximum CE value has been reached, give rise to a system busy notification. The actual CE depends on the deadline tightness (how tight is the deadline). This paper describes a model where requests may be accepted or rejected by the system at the moment of their arrival, depending on the current load. This mechanism of acceptance or rejection is called admission control mechanism. Our objective is to design approaches that are completely external to the controlled system. Since a request is accepted, it has to be fully executed before its deadline. Otherwise, its execution will be cancelled (or killed). It is supposed that all requests are not preemptible. This way, once a task is assigned to a server, it will run on the same server until its completion. Finally, all tasks are independent, as their executions do not block each other. This work is about load-balancing in QoS systems, so the best algorithm will be the one which combines good throughput and low number of killed tasks. II.RELATED WORK There are plenty of works about load-balancing and QoS, most of them leading to already accepted and consolidated
2 conclusions. Although these are almost exhausted themes, their combination seems to be an area where there are very few research results. A. Load-Balancing Many load-balancing algorithms have been studied, where most of them try to maximize throughput or minimize the mean response time of requests. Reference [1] proposes an algorithm called TAGS, which is supposed to be the best choice when task sizes are unknown and they all follow a heavy-tailed distribution. This is not the case for the scenario analyzed in this paper, because task sizes must be below a deadline threshold. It is also shown in [1] that, when task sizes are not heavy-tailed, Least Work Remaining has a higher throughput then TAGS. In fact, [2] and [3] claim that Least- Work Remaining is optimal when task sizes are exponential and unknown. The algorithm SITA-E [4] has the best performance when task sizes are known and are heavy-tailed. In cases where task sizes are not heavy-tailed, Least-Work-Remaining presents a better throughput. B. Quality of Service (QoS) In real distributed systems, task sizes are heavy-tailed. This means that a very small portion of all tasks are responsible for half of the load [5]. In models with deadlines, like the one analyzed in this paper, occurs a similar distribution. Most of all tasks are very small ones. And there is a small number of big tasks, but these all are under the deadline limit, i.e., they're maximum duration is the same as the deadline's. Reference [6] presents a model where the number of concurrent requests within the system is restricted. When this number is reached, the subsequent requests are enqueued. But this model has no concerns about deadlines or rejection of requests. It also does not show a way to load-balance the arriving tasks, since it is a single-server architecture. Quality-of-Service was also studied for Web Servers. In [15] the authors propose session-based Admission Control (SBAC), noting that longer sessions may result in purchases and therefore should not be discriminated in overloaded conditions. They propose self-tunable admission control based on hybrid or predictive strategies. [14] uses a rather complex analytical model to perform admission control. There are also approaches proposing some kind of service differentiation: [12] proposes architecture for Web servers with differentiated services; [13] defines two priority classes for requests, with corresponding queues and admission control over those queues. [17] proposes an approach for Web Servers to adapt automatically to changing workload characteristics and [16] proposes a strategy that improves the service to requests using statistical characterization of those requests and services. Comparing to our own work, all the works referenced above except [16] are either intrusive, require extensive modifications to systems, or use analytical models that may not provide guarantees against real system. The work in [16] does not consider deadlines and does not adapt constantly as ours does, instead it fixes the maximum throughput capacity when it runs the test runs. III.LOAD BALANCING ALTERNATIVES Load balancing is a fundamental basic building block for construction of scalable systems with multiple processing elements. There are several proposed load-balancing algorithms, but on of the most common in practice is also one of the simplest ones - Round-Robin (RR). This algorithm produces a kind of static load-balancing functionality, as the tasks are distributed round-the-table with no further considerations. We consider not only RR as also Least-Work- Remaining (LWR), as this algorithm is supposed to be the best choice when task sizes are not heavy-tailed. Our proposal is for adapted versions of both RR and LWR, including as a parameter the CE value. We are concerned with guaranteeing specified acceptable response time limits, which we denote as deadlines. The number of concurrent executions is a crucial variable when deadlines are involved, because as we increase the number of concurrent executions we have a larger probability of missing the deadlines. For this reason, the algorithms have a control over the maximum number of concurrent executors (CE) within the system, which varies from 1 to. In the following we describe each load balancing algorithm we compare considering deadlines and rejection: Round-Robin (RR) for each task that arrives: if SUM(tasks) <= EC next_server := server_list ->first send (task, next_server) server_list -> move_to_end(next_server) else NOT_ADMITTED(task) Least-Work-Remaining (LWR) for each task that arrives: if SUM(tasks) <= EC next_server := server_list ->least_utilized send (task, next_server) else NOT_ADMITTED(task) IV.EXPERIMENTAL ANALYSIS Due to the large number of parameters involved, it becomes necessary to formally describe the simulation model that was used in this work. The simulator, constructed in University of Coimbra, has the following parameters : Number of servers. Processing capacity of each server. Tasks arrival rate. Mean task size.
3 Number of maximum tasks being processed concurrently. Maximum amount of time a task can execute (deadline). Load-balancing algorithm. In this paper, a system with 3 identical servers was simulated. The deadline time was set to 1 seconds and the duration of each request follows an exponential distribution with mean 2 (we generated tasks with durations between.1 and 1 seconds). In addition, all tasks have the same priority. The concurrency model is linear, which means that a task will take twice longer if it shares the server with another task, it will take three times longer in case of two other tasks and so forth. The simulator implements the two algorithms: Least- Work-Remaining (LWR), Round-Robin (RR). We will compare the performance of these and all results are presented as an arithmetic mean of 3 rounds of simulation. To eliminate the transient phase, the data obtained in the first 1 minutes of the simulation was discarded. Only the results obtained in the next 3 minutes were considered. Figure 1 shows the simulated architecture Figure RR - Best-Effort (%) RR performance when submitted to a Best-Effort load-balancing mechanism LWR - Best-Effort (%) A. Simulation results This section contains the results obtained with the simulator. Figures 2 and 3 shows how the system performs when the chosen algorithms are LWR and RR, when there is no CE control, i.e., in a best-effort way. The first thing to be noticed is that the performances are very similar for all alternatives, due to the low variability of task sizes provided by the exponential distribution. Since the system is under high load, with 1 tasks arriving per second, the number of killed tasks increases as the number of the CE increases. In both algorithms the throughput is low: not even 2% of the submitted tasks get fully executed. On the other hand, figures 4 and 5 shows how the system performs when the admission control mechanism is enabled. Although the throughput did not increased, the number of killed tasks got significantly lower, since there is a large number of rejected tasks. In other words, the system is trying to admit only the requests it can execute. Figure 3 LWR performances when submitted to a Best-Effort loadbalancing mechanism Another interesting point to notice on the graphics displayed in figures 4 and 5 is that the maximum throughput is reached with very low CE values. In fact, for LWR, it is reached with 4 CE, while for RR it is needed 6 CE for obtaining the best performance. At this values, the percentage of killed tasks is very low, (1,94% for RR and,42% for LWR), which means that, since a task is admitted by the system, it has a huge probability to be completely executed. But how do these algorithms behave if tasks durations are not exponential? In fact, [6] claims that tasks durations in a distributed/parallel system are not exponential, but they follow a heavy-tailed distribution, such as a Pareto distribution. 1 Round-Robin Figure 1. Simulated architecture. Figure 4 Round-Robin with admission control mechanism
4 1 Least-Work Remaining 1 Least-Work Remaining Figure 5 Least-Working Remaining with admission control mechanism This means that a minuscule fraction of the very largest jobs comprise half of the total system load. This distribution is not applied in the scenario being studied in this paper, because we limit the task duration to a value below 1 seconds (variability is limited). But what would happen if the number of small tasks is much greater than the number of big tasks? Figures 6 and 7 show how the algorithms would perform in such a situation, where tasks durations follow a bounded- Pareto [4] distribution, with the exponent of the power law α =.6, the smallest possible observation, k =.1 and the largest possible observation, p = 8. As can be noticed, the performance of LWR and RR are still close. Since the number of small tasks is much, much greater than the number of big tasks, the throughput is better than the exponential case, where there can be clearly identified that the main reason for the poor performance of the exponential model is the existence of too many big tasks - not present in a Pareto distribution. In the Pareto-like models, a good approach to determine the best CE value is measuring the difference between ended tasks and killed tasks and. Using this trick, the best CE value in RR is 24 (the difference is 31,5: 43,13% ended tasks minus 11,63% killed tasks) and the best CE value in LWR is 25 when their difference is 32,33 (44,42% ended tasks minus 12,9% killed tasks) Round-Robin Figure 6. Round-Robin performance in a system with an admission control mechanism and tasks durations follow a Pareto distribution Figure 7 Least-Work-Remaining performance in a system with an admission control mechanism and tasks durations follow a Pareto distribution V.CONCLUSIONS AND FUTURE WORK Distributing the load on parallel systems following QoS adaptability principles is a new, challenging task. Most of the existing algorithms try to equally load-balance the requests, but offer no guarantees about the response time, handling all requests in a best-effort way. Since tasks may have maximum acceptable response times (deadlines), it turns out that response time is a crucial concern. In this paper we showed how the well known loadbalancing algorithms Least-Work-Remaining and Round- Robin poorly perform when tasks have deadlines. Most of the submitted tasks are killed, and a very few of them get completely executed. This happens because the interference caused by the concurrent executions (CE) within the same server and was showed that these CE number do not need to be high to reach the maximum throughput. So, the best CE value is the smallest value where the maximum throughput is reached. These are also CE values where the number of killed tasks is very low. This paper also showed how these well-known algorithms behave in a more realistic scenario, where the number of short-duration tasks is much greater than the long-duration tasks. In such models, the number of killed tasks is always below the number of ended tasks, and the optimal CE is the point where the difference between these two values are maximal. As future works, we expect to study an efficient way to estimate the duration of requests. This could be added to an implementation of an algorithm in order to identify and classify the tasks according with their sizes. This way, the load-balancing algorithm could try to avoid the short tasks from being blocked by long tasks. REFERENCES [1] Harchol-Balter, M.: Task assignment with unknown duration.. Journal of the ACM, 22, p.49 [2]. Nelson, R., Philips, T.: An approximation to the response time for shortest queue routing. Performance Evaluation Review, 1989, p [3]. Nelson, R., Philips, T.: An approximation for the mean response time for shortest queue routing with general interarrival and service times.
5 Performance Evaluation, 1993, pp [4]. Harchol-Balter, M., Crovella, M., Murta, C.:On choosing a task assignment policy for a distributed server system. Journal of Parallel and Distributed Computing,1999, v.59 n.2, [5] Harchol-Balter, M., Downey, A.: Exploiting process lifetime distributions for dynamic load-balancing. ACM Transactions on Computer Systems, [6] Schroeder, B., Harchol-Balter, M.: Achieving class-based QoS for transactional workloads. ICDE, 26, p.. [7] Crovella, M., Bestavros, A.Self-similarity in World Wide Web traffic: Evidence and possible causes IEEE/ACM Transactions on Networking, 1997, pp [8] Knightly, E., Shroff, N.: Admission Control for Statistical QoS: Theory and Practice. IEEE Network, 1999, vol. 13, no. 2, pp [9] Barker, K., Chernikov, A., Chrisochoides, N. Pingali, K.: A Load Balancing Framework for Adaptive and Asynchronous Applications. IEEE Transactions on Parallel and Distributed Systems, 24, Vol. 15, No. 2 [1] Serra, A., Gaïti, D., Barroso, G., Boudy, J.: Assuring QoS Differentiation and Load-Balancing on Web Servers Clusters. IEEE Conference on Control Applications, 25, pp [11] Cardellini, V. Casalicchio, Colajanni, M., Yu, P.S.: The State of the Art in Locally Distributed Web-Server Systems. ACM Computing Surveys, 22, Vol [12] Bhatti N. and R. Friedrich. Web server support for tiered services. IEEE Network, 13(5):64 71, September [13] Bhoj, Rmanathan, and Singhal. Web2K: Bringing QoS to Web servers. Tech. Rep. HPL-2-61, HP Labs, May 2. [14] Chen X., P. Mohapatra, and H. Chen. An admission control scheme for predictable server response time forweb accesses. In Proceedings of the 1th World Wide Web Conference, Hong Kong, May 21. [15] Cherkasova and Phaal. Session-based admission control: A mechanism for peak load management of commercial Web sites. IEEE Req. on Computers, 51(6), Jun 22. [16] Elnikety S., Nahum E., Tracey J.; Zwaenepoel W., A Method for Transparent Admission Control and Request Scheduling in E-Commerce Web Sites, WWW24: The Thirteenth International World Wide Web Conference, New York City, NY, USA, May 24. [17] Pradhan P., R. Tewari, S. Sahu, A. Chandra, and P. Shenoy. An observation-based approach towards self managing Web servers. In International Workshop on Quality of Service, Miami Beach, FL, May 22.
Fair load-balance on parallel systems for QoS 1
Fair load-balance on parallel systems for QoS 1 Luis Fernando Orleans, Pedro Furtado CISUC, Department of Informatic Engineering, University of Coimbra Portugal {lorleans, pnf}@dei.uc.pt Abstract: Many
More informationA Low Cost Two-Tier Architecture Model For High Availability Clusters Application Load Balancing
A Low Cost Two-Tier Architecture Model For High Availability Clusters Application Load Balancing A B M Moniruzzaman, StudentMember, IEEE Department of Computer Science and Engineering Daffodil International
More informationEfficient DNS based Load Balancing for Bursty Web Application Traffic
ISSN Volume 1, No.1, September October 2012 International Journal of Science the and Internet. Applied However, Information this trend leads Technology to sudden burst of Available Online at http://warse.org/pdfs/ijmcis01112012.pdf
More informationA Low Cost Two-tier Architecture Model Implementation for High Availability Clusters For Application Load Balancing
A Low Cost Two-tier Architecture Model Implementation for High Availability Clusters For Application Load Balancing A B M Moniruzzaman 1, Syed Akther Hossain IEEE Department of Computer Science and Engineering
More informationA QoS-driven Resource Allocation Algorithm with Load balancing for
A QoS-driven Resource Allocation Algorithm with Load balancing for Device Management 1 Lanlan Rui, 2 Yi Zhou, 3 Shaoyong Guo State Key Laboratory of Networking and Switching Technology, Beijing University
More informationSHIV SHAKTI International Journal of in Multidisciplinary and Academic Research (SSIJMAR) Vol. 4, No. 3, June 2015 (ISSN 2278 5973)
SHIV SHAKTI International Journal of in Multidisciplinary and Academic Research (SSIJMAR) Vol. 4, No. 3, June 2015 (ISSN 2278 5973) Dynamic Load Balancing In Web Server Systems Ms. Rashmi M.Tech. Scholar
More informationAbstract. 1. Introduction
A REVIEW-LOAD BALANCING OF WEB SERVER SYSTEM USING SERVICE QUEUE LENGTH Brajendra Kumar, M.Tech (Scholor) LNCT,Bhopal 1; Dr. Vineet Richhariya, HOD(CSE)LNCT Bhopal 2 Abstract In this paper, we describe
More informationKeywords Load balancing, Dispatcher, Distributed Cluster Server, Static Load balancing, Dynamic Load balancing.
Volume 5, Issue 7, July 2015 ISSN: 2277 128X International Journal of Advanced Research in Computer Science and Software Engineering Research Paper Available online at: www.ijarcsse.com A Hybrid Algorithm
More informationA Task-Based Adaptive-TTL approach for Web Server Load Balancing *
A Task-Based Adaptive-TTL approach for Web Server Load Balancing * Devarshi Chatterjee Zahir Tari RMIT University School of Computer Science and IT Melbourne, Australia zahirt@cs cs.rmit.edu.au * Supported
More information5 Performance Management for Web Services. Rolf Stadler School of Electrical Engineering KTH Royal Institute of Technology. stadler@ee.kth.
5 Performance Management for Web Services Rolf Stadler School of Electrical Engineering KTH Royal Institute of Technology stadler@ee.kth.se April 2008 Overview Service Management Performance Mgt QoS Mgt
More informationLOAD BALANCING AS A STRATEGY LEARNING TASK
LOAD BALANCING AS A STRATEGY LEARNING TASK 1 K.KUNGUMARAJ, 2 T.RAVICHANDRAN 1 Research Scholar, Karpagam University, Coimbatore 21. 2 Principal, Hindusthan Institute of Technology, Coimbatore 32. ABSTRACT
More informationHow To Choose Between The Two Of The Four Task Assignment Policies In A Distributed Server System
In Proceedings of Performance Tools 98 Lecture Notes in Computer Science, Vol. 1468, pp. 231-242, September 1998 On Choosing a Task Assignment Policy for a Distributed Server System Mor Harchol-Balter?
More informationPriyesh Kanungo / International Journal of Computer Science & Engineering Technology (IJCSET)
STUDY OF SERVER LOAD BALANCING TECHNIQUES Priyesh Kanungo Professor and Senior Systems Engineer (Computer Centre) School of Computer Science and Information Technology Devi Ahilya University 1 Indore-452001,
More informationLoad balancing as a strategy learning task
Scholarly Journal of Scientific Research and Essay (SJSRE) Vol. 1(2), pp. 30-34, April 2012 Available online at http:// www.scholarly-journals.com/sjsre ISSN 2315-6163 2012 Scholarly-Journals Review Load
More informationProtagonist International Journal of Management And Technology (PIJMT)
Protagonist International Journal of Management And Technology (PIJMT) Online ISSN- 2394-3742 Vol 2 No 3 (May-2015) A Qualitative Approach To Design An Algorithm And Its Implementation For Dynamic Load
More informationHyLARD: A Hybrid Locality-Aware Request Distribution Policy in Cluster-based Web Servers
TANET2007 臺 灣 網 際 網 路 研 討 會 論 文 集 二 HyLARD: A Hybrid Locality-Aware Request Distribution Policy in Cluster-based Web Servers Shang-Yi Zhuang, Mei-Ling Chiang Department of Information Management National
More informationA Low Cost Two-Tier Architecture Model for High Availability Clusters Application Load Balancing
, pp.89-98 http://dx.doi.org/10.14257/ijgdc.2014.7.1.09 A Low Cost Two-Tier Architecture Model for High Availability Clusters Application Load Balancing A. B. M. Moniruzzaman 1 and Syed Akther Hossain
More informationHow To Balance A Web Server With Remaining Capacity
Remaining Capacity Based Load Balancing Architecture for Heterogeneous Web Server System Tsang-Long Pao Dept. Computer Science and Engineering Tatung University Taipei, ROC Jian-Bo Chen Dept. Computer
More informationLoad Balancing of Web Server System Using Service Queue Length
Load Balancing of Web Server System Using Service Queue Length Brajendra Kumar 1, Dr. Vineet Richhariya 2 1 M.tech Scholar (CSE) LNCT, Bhopal 2 HOD (CSE), LNCT, Bhopal Abstract- In this paper, we describe
More informationPerformance Comparison of Assignment Policies on Cluster-based E-Commerce Servers
Performance Comparison of Assignment Policies on Cluster-based E-Commerce Servers Victoria Ungureanu Department of MSIS Rutgers University, 180 University Ave. Newark, NJ 07102 USA Benjamin Melamed Department
More informationKeywords: Dynamic Load Balancing, Process Migration, Load Indices, Threshold Level, Response Time, Process Age.
Volume 3, Issue 10, October 2013 ISSN: 2277 128X International Journal of Advanced Research in Computer Science and Software Engineering Research Paper Available online at: www.ijarcsse.com Load Measurement
More informationADAPTIVE LOAD BALANCING FOR CLUSTER USING CONTENT AWARENESS WITH TRAFFIC MONITORING Archana Nigam, Tejprakash Singh, Anuj Tiwari, Ankita Singhal
ADAPTIVE LOAD BALANCING FOR CLUSTER USING CONTENT AWARENESS WITH TRAFFIC MONITORING Archana Nigam, Tejprakash Singh, Anuj Tiwari, Ankita Singhal Abstract With the rapid growth of both information and users
More informationA Statistically Customisable Web Benchmarking Tool
Electronic Notes in Theoretical Computer Science 232 (29) 89 99 www.elsevier.com/locate/entcs A Statistically Customisable Web Benchmarking Tool Katja Gilly a,, Carlos Quesada-Granja a,2, Salvador Alcaraz
More informationAN EFFICIENT LOAD BALANCING ALGORITHM FOR A DISTRIBUTED COMPUTER SYSTEM. Dr. T.Ravichandran, B.E (ECE), M.E(CSE), Ph.D., MISTE.,
AN EFFICIENT LOAD BALANCING ALGORITHM FOR A DISTRIBUTED COMPUTER SYSTEM K.Kungumaraj, M.Sc., B.L.I.S., M.Phil., Research Scholar, Principal, Karpagam University, Hindusthan Institute of Technology, Coimbatore
More informationIn Proceedings of Performance Tools 98 Lecture Notes in Computer Science, Vol. 1468, pp. 231-242, September 1998
In Proceedings of Performance Tools 98 OnChoosingaTaskAssignmentPolicyfora Lecture Notes in Computer Science, Vol. 1468, pp. 231-242, September 1998 MorHarchol-Balter?;1,MarkE.Crovella??;2,andCristinaD.Murta???;2
More informationImplementing Parameterized Dynamic Load Balancing Algorithm Using CPU and Memory
Implementing Parameterized Dynamic Balancing Algorithm Using CPU and Memory Pradip Wawge 1, Pritish Tijare 2 Master of Engineering, Information Technology, Sipna college of Engineering, Amravati, Maharashtra,
More informationExperimental Evaluation of Horizontal and Vertical Scalability of Cluster-Based Application Servers for Transactional Workloads
8th WSEAS International Conference on APPLIED INFORMATICS AND MUNICATIONS (AIC 8) Rhodes, Greece, August 2-22, 28 Experimental Evaluation of Horizontal and Vertical Scalability of Cluster-Based Application
More informationLOAD BALANCING AND ADMISSION CONTROL OF A PARLAY X APPLICATION SERVER
This is an author produced version of a paper presented at the 17th Nordic Teletraffic Seminar (NTS 17), Fornebu, Norway, 25-27 August, 2004. This paper may not include the final publisher proof-corrections
More informationAutomated QoS Support for Multimedia Disk Access
Automated QoS Support for Multimedia Disk Access Joel C. Wu, Scott Banachowski, and Scott A. Brandt Computer Science Department, University of California, Santa Cruz ABSTRACT This paper describes the AutoQoS
More informationAn MPLS based architecture for differentiated Web service
An MPLS based architecture for differentiated Web service Radu Dragos & Martin Collier Dublin City University, School of Electronic Engineering Dublin, Ireland e mail: {dragosr, collierm}@eeng.dcu.ie Abstract:
More informationLoad Balancing on Stateful Clustered Web Servers
Load Balancing on Stateful Clustered Web Servers G. Teodoro T. Tavares B. Coutinho W. Meira Jr. D. Guedes Department of Computer Science Universidade Federal de Minas Gerais Belo Horizonte MG Brazil 3270-00
More informationDESIGN OF CLUSTER OF SIP SERVER BY LOAD BALANCER
INTERNATIONAL JOURNAL OF REVIEWS ON RECENT ELECTRONICS AND COMPUTER SCIENCE DESIGN OF CLUSTER OF SIP SERVER BY LOAD BALANCER M.Vishwashanthi 1, S.Ravi Kumar 2 1 M.Tech Student, Dept of CSE, Anurag Group
More informationAN EFFICIENT DISTRIBUTED CONTROL LAW FOR LOAD BALANCING IN CONTENT DELIVERY NETWORKS
Available Online at www.ijcsmc.com International Journal of Computer Science and Mobile Computing A Monthly Journal of Computer Science and Information Technology IJCSMC, Vol. 3, Issue. 9, September 2014,
More informationPayment minimization and Error-tolerant Resource Allocation for Cloud System Using equally spread current execution load
Payment minimization and Error-tolerant Resource Allocation for Cloud System Using equally spread current execution load Pooja.B. Jewargi Prof. Jyoti.Patil Department of computer science and engineering,
More informationMEASURING PERFORMANCE OF DYNAMIC LOAD BALANCING ALGORITHMS IN DISTRIBUTED COMPUTING APPLICATIONS
MEASURING PERFORMANCE OF DYNAMIC LOAD BALANCING ALGORITHMS IN DISTRIBUTED COMPUTING APPLICATIONS Priyesh Kanungo 1 Professor and Senior Systems Engineer (Computer Centre), School of Computer Science and
More informationComparative Study of Load Balancing Algorithms
IOSR Journal of Engineering (IOSRJEN) e-issn: 2250-3021, p-issn: 2278-8719 Vol. 3, Issue 3 (Mar. 2013), V2 PP 45-50 Comparative Study of Load Balancing Algorithms Jyoti Vashistha 1, Anant Kumar Jayswal
More informationDynamic Adaptive Feedback of Load Balancing Strategy
Journal of Information & Computational Science 8: 10 (2011) 1901 1908 Available at http://www.joics.com Dynamic Adaptive Feedback of Load Balancing Strategy Hongbin Wang a,b, Zhiyi Fang a,, Shuang Cui
More informationSmart Queue Scheduling for QoS Spring 2001 Final Report
ENSC 833-3: NETWORK PROTOCOLS AND PERFORMANCE CMPT 885-3: SPECIAL TOPICS: HIGH-PERFORMANCE NETWORKS Smart Queue Scheduling for QoS Spring 2001 Final Report By Haijing Fang(hfanga@sfu.ca) & Liu Tang(llt@sfu.ca)
More informationScheduling Video Stream Transmissions for Distributed Playback over Mobile Cellular Networks
Scheduling Video Stream Transmissions for Distributed Playback over Mobile Cellular Networks Kam-Yiu Lam 1, Joe Yuen 1, Sang H. Son 2 and Edward Chan 1 Department of Computer Science 1 City University
More informationPERFORMANCE ANALYSIS OF PaaS CLOUD COMPUTING SYSTEM
PERFORMANCE ANALYSIS OF PaaS CLOUD COMPUTING SYSTEM Akmal Basha 1 Krishna Sagar 2 1 PG Student,Department of Computer Science and Engineering, Madanapalle Institute of Technology & Science, India. 2 Associate
More informationOptimizing a ëcontent-aware" Load Balancing Strategy for Shared Web Hosting Service Ludmila Cherkasova Hewlett-Packard Laboratories 1501 Page Mill Road, Palo Alto, CA 94303 cherkasova@hpl.hp.com Shankar
More informationVoIP Network Dimensioning using Delay and Loss Bounds for Voice and Data Applications
VoIP Network Dimensioning using Delay and Loss Bounds for Voice and Data Applications Veselin Rakocevic School of Engineering and Mathematical Sciences City University, London, UK V.Rakocevic@city.ac.uk
More informationQoS for Internet Services Done Right.
QoS for Internet Services Done Right. Josep M. Blanquer, Antoni Batchelli, Klaus Schauser and Rich Wolski Department of Computer Science, University of California Santa Barbara {blanquer,tbatchel,schauser,rich}@cs.ucsb.edu
More informationIMPROVED LOAD BALANCING MODEL BASED ON PARTITIONING IN CLOUD COMPUTING
Available Online at www.ijcsmc.com International Journal of Computer Science and Mobile Computing A Monthly Journal of Computer Science and Information Technology ISSN 2320 088X IJCSMC, Vol. 3, Issue.
More informationCost Effective Automated Scaling of Web Applications for Multi Cloud Services
Cost Effective Automated Scaling of Web Applications for Multi Cloud Services SANTHOSH.A 1, D.VINOTHA 2, BOOPATHY.P 3 1,2,3 Computer Science and Engineering PRIST University India Abstract - Resource allocation
More informationPerformance Modeling of an Apache Web Server with Bursty Arrival Traffic
This is an author produced version of a paper presented at the 4th International Conference on Internet Computing (IC 3), June 23-26, 23, Las Vegas, Nevada. This paper has been peer-reviewed but may not
More informationWeb Server Software Architectures
Web Server Software Architectures Author: Daniel A. Menascé Presenter: Noshaba Bakht Web Site performance and scalability 1.workload characteristics. 2.security mechanisms. 3. Web cluster architectures.
More informationA Classification of Job Scheduling Algorithms for Balancing Load on Web Servers
Vol.2, Issue.5, Sep-Oct. 2012 pp-3679-3683 ISSN: 2249-6645 A Classification of Job Scheduling Algorithms for Balancing Load on Web Servers Sairam Vakkalanka School of computing, Blekinge Institute of Technology,
More informationFault-Tolerant Framework for Load Balancing System
Fault-Tolerant Framework for Load Balancing System Y. K. LIU, L.M. CHENG, L.L.CHENG Department of Electronic Engineering City University of Hong Kong Tat Chee Avenue, Kowloon, Hong Kong SAR HONG KONG Abstract:
More informationEnergy Efficient Load Balancing among Heterogeneous Nodes of Wireless Sensor Network
Energy Efficient Load Balancing among Heterogeneous Nodes of Wireless Sensor Network Chandrakant N Bangalore, India nadhachandra@gmail.com Abstract Energy efficient load balancing in a Wireless Sensor
More informationMultimedia Requirements. Multimedia and Networks. Quality of Service
Multimedia Requirements Chapter 2: Representation of Multimedia Data Chapter 3: Multimedia Systems Communication Aspects and Services Multimedia Applications and Transfer/Control Protocols Quality of Service
More informationARTICLE IN PRESS. The Journal of Systems and Software xxx (2011) xxx xxx. Contents lists available at ScienceDirect
JSS-869; No. of Pages 6 The Journal of Systems and Software xxx (211) xxx xxx Contents lists available at ScienceDirect The Journal of Systems and Software journal homepage: www.elsevier.com/locate/jss
More informationThere are a number of factors that increase the risk of performance problems in complex computer and software systems, such as e-commerce systems.
ASSURING PERFORMANCE IN E-COMMERCE SYSTEMS Dr. John Murphy Abstract Performance Assurance is a methodology that, when applied during the design and development cycle, will greatly increase the chances
More informationA Dynamic Approach for Load Balancing using Clusters
A Dynamic Approach for Load Balancing using Clusters ShwetaRajani 1, RenuBagoria 2 Computer Science 1,2,Global Technical Campus, Jaipur 1,JaganNath University, Jaipur 2 Email: shwetarajani28@yahoo.in 1
More informationAN ADAPTIVE DISTRIBUTED LOAD BALANCING TECHNIQUE FOR CLOUD COMPUTING
AN ADAPTIVE DISTRIBUTED LOAD BALANCING TECHNIQUE FOR CLOUD COMPUTING Gurpreet Singh M.Phil Research Scholar, Computer Science Dept. Punjabi University, Patiala gurpreet.msa@gmail.com Abstract: Cloud Computing
More informationAN EFFICIENT LOAD BALANCING APPROACH IN CLOUD SERVER USING ANT COLONY OPTIMIZATION
AN EFFICIENT LOAD BALANCING APPROACH IN CLOUD SERVER USING ANT COLONY OPTIMIZATION Shanmuga Priya.J 1, Sridevi.A 2 1 PG Scholar, Department of Information Technology, J.J College of Engineering and Technology
More informationLBPerf: An Open Toolkit to Empirically Evaluate the Quality of Service of Middleware Load Balancing Services
LBPerf: An Open Toolkit to Empirically Evaluate the Quality of Service of Middleware Load Balancing Services Ossama Othman Jaiganesh Balasubramanian Dr. Douglas C. Schmidt {jai, ossama, schmidt}@dre.vanderbilt.edu
More informationScheduling Allowance Adaptability in Load Balancing technique for Distributed Systems
Scheduling Allowance Adaptability in Load Balancing technique for Distributed Systems G.Rajina #1, P.Nagaraju #2 #1 M.Tech, Computer Science Engineering, TallaPadmavathi Engineering College, Warangal,
More information@IJMTER-2015, All rights Reserved 355
e-issn: 2349-9745 p-issn: 2393-8161 Scientific Journal Impact Factor (SJIF): 1.711 International Journal of Modern Trends in Engineering and Research www.ijmter.com A Model for load balancing for the Public
More informationAdvanced RDMA-based Admission Control for Modern Data-Centers
Advanced RDMA-based Admission Control for Modern Data-Centers P. Lai S. Narravula K. Vaidyanathan D. K. Panda Department of Computer Science and Engineering The Ohio State University {laipi, narravul,
More informationMulti-service Load Balancing in a Heterogeneous Network with Vertical Handover
1 Multi-service Load Balancing in a Heterogeneous Network with Vertical Handover Jie Xu, Member, IEEE, Yuming Jiang, Member, IEEE, and Andrew Perkis, Member, IEEE Abstract In this paper we investigate
More informationBack-End Forwarding Scheme in Server Load Balancing using Client Virtualization
Back-End Forwarding Scheme in Server Load Balancing using Client Virtualization Shreyansh Kumar School of Computing Science and Engineering VIT University Chennai Campus Parvathi.R, Ph.D Associate Professor-
More informationImproving Performance and Reliability Using New Load Balancing Strategy with Large Public Cloud
Improving Performance and Reliability Using New Load Balancing Strategy with Large Public Cloud P.Gayathri Atchuta*1, L.Prasanna Kumar*2, Amarendra Kothalanka*3 M.Tech Student*1, Associate Professor*2,
More informationAn Approach to Load Balancing In Cloud Computing
An Approach to Load Balancing In Cloud Computing Radha Ramani Malladi Visiting Faculty, Martins Academy, Bangalore, India ABSTRACT: Cloud computing is a structured model that defines computing services,
More informationEffective Load Balancing for Cluster-based Servers Employing Job Preemption
Effective Load Balancing for Cluster-based Servers Employing Job Preemption Victoria Ungureanu Benjamin Melamed Michael Katehakis Abstract A cluster-based server consists of a front-end dispatcher and
More informationFair Scheduling Algorithm with Dynamic Load Balancing Using In Grid Computing
Research Inventy: International Journal Of Engineering And Science Vol.2, Issue 10 (April 2013), Pp 53-57 Issn(e): 2278-4721, Issn(p):2319-6483, Www.Researchinventy.Com Fair Scheduling Algorithm with Dynamic
More informationPerformance Modeling and Analysis of a Database Server with Write-Heavy Workload
Performance Modeling and Analysis of a Database Server with Write-Heavy Workload Manfred Dellkrantz, Maria Kihl 2, and Anders Robertsson Department of Automatic Control, Lund University 2 Department of
More informationLoad Balancing Scheduling with Shortest Load First
, pp. 171-178 http://dx.doi.org/10.14257/ijgdc.2015.8.4.17 Load Balancing Scheduling with Shortest Load First Ranjan Kumar Mondal 1, Enakshmi Nandi 2 and Debabrata Sarddar 3 1 Department of Computer Science
More informationLoad Balancing of DNS-Based Distributed Web Server Systems with Page Caching
Load Balancing of DNS-Based Distributed Web Server Systems with Page Caching Zhong Xu Rong Huang Laxmi N. Bhuyan Department of Computer Science & Engineering University of California, Riverside, CA 9252,
More informationHow To Use A Cloud For A Local Cluster
Marcos Dias de Assunção 1,2, Alexandre di Costanzo 1 and Rajkumar Buyya 1 1 Department of Computer Science and Software Engineering 2 National ICT Australia (NICTA) Victoria Research Laboratory The University
More informationA Clone-Pair Approach for the Determination of the Itinerary of Imprecise Mobile Agents with Firm Deadlines
A Clone-Pair Approach for the Determination of the Itinerary of Imprecise Mobile Agents with Firm Deadlines Luciana Rech, Carlos Montez and Rômulo de Oliveira Department of Automation and Systems Engineering
More informationLoad Balance Strategies for DEVS Approximated Parallel and Distributed Discrete-Event Simulations
Load Balance Strategies for DEVS Approximated Parallel and Distributed Discrete-Event Simulations Alonso Inostrosa-Psijas, Roberto Solar, Verónica Gil-Costa and Mauricio Marín Universidad de Santiago,
More informationApplying Active Queue Management to Link Layer Buffers for Real-time Traffic over Third Generation Wireless Networks
Applying Active Queue Management to Link Layer Buffers for Real-time Traffic over Third Generation Wireless Networks Jian Chen and Victor C.M. Leung Department of Electrical and Computer Engineering The
More informationIMPROVED PROXIMITY AWARE LOAD BALANCING FOR HETEROGENEOUS NODES
www.ijecs.in International Journal Of Engineering And Computer Science ISSN:2319-7242 Volume 2 Issue 6 June, 2013 Page No. 1914-1919 IMPROVED PROXIMITY AWARE LOAD BALANCING FOR HETEROGENEOUS NODES Ms.
More informationFlexSplit: A Workload-Aware, Adaptive Load Balancing Strategy for Media Clusters
FlexSplit: A Workload-Aware, Adaptive Load Balancing Strategy for Media Clusters Qi Zhang 1 and Ludmila Cherkasova 2 and Evgenia Smirni 1 1 Computer Science Dept., College of William and Mary, Williamsburg,
More informationComparison of Request Admission Based Performance Isolation Approaches in Multi-tenant SaaS Applications
Comparison of Request Admission Based Performance Isolation Approaches in Multi-tenant SaaS Applications Rouven Kreb 1 and Manuel Loesch 2 1 SAP AG, Walldorf, Germany 2 FZI Research Center for Information
More informationProfit Maximization and Power Management of Green Data Centers Supporting Multiple SLAs
Profit Maximization and Power Management of Green Data Centers Supporting Multiple SLAs Mahdi Ghamkhari and Hamed Mohsenian-Rad Department of Electrical Engineering University of California at Riverside,
More informationHow To Switch Between Two Servers In A Server Farm
A System for Dynamic Server Allocation in Application Server Clusters A.P. Chester, J.W.J. Xue, L. He, S.A. Jarvis, High Performance Systems Group, Department of Computer Science, University of Warwick,
More informationEfficient Service Broker Policy For Large-Scale Cloud Environments
www.ijcsi.org 85 Efficient Service Broker Policy For Large-Scale Cloud Environments Mohammed Radi Computer Science Department, Faculty of Applied Science Alaqsa University, Gaza Palestine Abstract Algorithms,
More informationNOVEL PRIORITISED EGPRS MEDIUM ACCESS REGIME FOR REDUCED FILE TRANSFER DELAY DURING CONGESTED PERIODS
NOVEL PRIORITISED EGPRS MEDIUM ACCESS REGIME FOR REDUCED FILE TRANSFER DELAY DURING CONGESTED PERIODS D. Todinca, P. Perry and J. Murphy Dublin City University, Ireland ABSTRACT The goal of this paper
More informationSources: Chapter 6 from. Computer Networking: A Top-Down Approach Featuring the Internet, by Kurose and Ross
M ultimedia Communication Multimedia Systems(Module 5 Lesson 3) Summary: Beyond Best-Effort Motivating QoS Q uality of Service (QoS) Scheduling and Policing Sources: Chapter 6 from Computer Networking:
More informationA Survey on Load Balancing and Scheduling in Cloud Computing
IJIRST International Journal for Innovative Research in Science & Technology Volume 1 Issue 7 December 2014 ISSN (online): 2349-6010 A Survey on Load Balancing and Scheduling in Cloud Computing Niraj Patel
More informationUSING VIRTUAL MACHINE REPLICATION FOR DYNAMIC CONFIGURATION OF MULTI-TIER INTERNET SERVICES
USING VIRTUAL MACHINE REPLICATION FOR DYNAMIC CONFIGURATION OF MULTI-TIER INTERNET SERVICES Carlos Oliveira, Vinicius Petrucci, Orlando Loques Universidade Federal Fluminense Niterói, Brazil ABSTRACT In
More informationVarious Schemes of Load Balancing in Distributed Systems- A Review
741 Various Schemes of Load Balancing in Distributed Systems- A Review Monika Kushwaha Pranveer Singh Institute of Technology Kanpur, U.P. (208020) U.P.T.U., Lucknow Saurabh Gupta Pranveer Singh Institute
More information[Jayabal, 3(2): February, 2014] ISSN: 2277-9655 Impact Factor: 1.852
IJESRT INTERNATIONAL JOURNAL OF ENGINEERING SCIENCES & RESEARCH TECHNOLOGY Design and Implementation of Locally Distributed Web Server Systems using Load Balancer R.Jayabal *1, R.Mohan Raj 2 *1 M.E. Student,
More information2.2 SIP-based Load Balancing. 3 SIP Load Balancing. 3.1 Proposed Load Balancing Solution. 2 Background Research. 2.1 HTTP-based Load Balancing
SIP TRAFFIC LOAD BALANCING Ramy Farha School of Electrical and Computer Engineering University of Toronto Toronto, Ontario Email: rfarha@comm.utoronto.ca ABSTRACT This paper presents a novel solution to
More informationCHAPTER 3 CALL CENTER QUEUING MODEL WITH LOGNORMAL SERVICE TIME DISTRIBUTION
31 CHAPTER 3 CALL CENTER QUEUING MODEL WITH LOGNORMAL SERVICE TIME DISTRIBUTION 3.1 INTRODUCTION In this chapter, construction of queuing model with non-exponential service time distribution, performance
More informationA Load Balancing Algorithm based on the Variation Trend of Entropy in Homogeneous Cluster
, pp.11-20 http://dx.doi.org/10.14257/ ijgdc.2014.7.2.02 A Load Balancing Algorithm based on the Variation Trend of Entropy in Homogeneous Cluster Kehe Wu 1, Long Chen 2, Shichao Ye 2 and Yi Li 2 1 Beijing
More informationSCHEDULING IN CLOUD COMPUTING
SCHEDULING IN CLOUD COMPUTING Lipsa Tripathy, Rasmi Ranjan Patra CSA,CPGS,OUAT,Bhubaneswar,Odisha Abstract Cloud computing is an emerging technology. It process huge amount of data so scheduling mechanism
More informationFlow aware networking for effective quality of service control
IMA Workshop on Scaling 22-24 October 1999 Flow aware networking for effective quality of service control Jim Roberts France Télécom - CNET james.roberts@cnet.francetelecom.fr Centre National d'etudes
More informationMultiobjective Multicast Routing Algorithm
Multiobjective Multicast Routing Algorithm Jorge Crichigno, Benjamín Barán P. O. Box 9 - National University of Asunción Asunción Paraguay. Tel/Fax: (+9-) 89 {jcrichigno, bbaran}@cnc.una.py http://www.una.py
More informationNetwork Model. University of Tsukuba. of the system. Load balancing policies are often. used for balancing the workload of distributed systems.
CDC-INV A Performance Comparison of Dynamic vs. Static Load Balancing Policies in a Mainframe { Personal Computer Network Model Hisao Kameda El-Zoghdy Said Fathy y Inhwan Ryu z Jie Li x yzx University
More informationThe Load Balancing Strategy to Improve the Efficiency in the Public Cloud Environment
The Load Balancing Strategy to Improve the Efficiency in the Public Cloud Environment Majjaru Chandra Babu Assistant Professor, Priyadarsini College of Engineering, Nellore. Abstract: Load balancing in
More informationFuzzy Active Queue Management for Assured Forwarding Traffic in Differentiated Services Network
Fuzzy Active Management for Assured Forwarding Traffic in Differentiated Services Network E.S. Ng, K.K. Phang, T.C. Ling, L.Y. Por Department of Computer Systems & Technology Faculty of Computer Science
More informationWEB ADMISSION CONTROL: IMPROVING PERFORMANCE OF WEB-BASED SERVICES
WEB ADMISSION CONTROL: IMPROVING PERFORMANCE OF WEB-BASED SERVICES B.M.M. Gijsen a, P.J. Meulenhoff a, M.A. Blom a, R.D. van der Mei b,c and B.D. van der Waaij a a TNO Telecom, Delft, The Netherlands b
More informationA Load Balancing Model Based on Cloud Partitioning for the Public Cloud
IEEE TRANSACTIONS ON CLOUD COMPUTING YEAR 2013 A Load Balancing Model Based on Cloud Partitioning for the Public Cloud Gaochao Xu, Junjie Pang, and Xiaodong Fu Abstract: Load balancing in the cloud computing
More informationSIMULATION OF LOAD BALANCING ALGORITHMS: A Comparative Study
SIMULATION OF LOAD BALANCING ALGORITHMS: A Comparative Study Milan E. Soklic Abstract This article introduces a new load balancing algorithm, called diffusive load balancing, and compares its performance
More informationLoad Balancing. Load Balancing 1 / 24
Load Balancing Backtracking, branch & bound and alpha-beta pruning: how to assign work to idle processes without much communication? Additionally for alpha-beta pruning: implementing the young-brothers-wait
More informationResource Provisioning in Single Tier and Multi-Tier Cloud Computing: State-of-the-Art
Resource Provisioning in Single Tier and Multi-Tier Cloud Computing: State-of-the-Art Marwah Hashim Eawna Faculty of Computer and Information Sciences Salma Hamdy Mohammed Faculty of Computer and Information
More information