Socket-based RR scheduling scheme for tightly coupled clusters providing single-name images

Authors:
Seungmin Baek;Hwakyung Rim;Sungchun Kim
Affiliations:
Department of Computer Science, Laboratory of High Performance Computer System, Sogang University, Sinsudong I, Mapogu, Seoul 121-742, South Korea;Department of Computer Education, Busan National University of Education, Busan 611-736, South Korea;Department of Computer Science, Laboratory of High Performance Computer System, Sogang University, Sinsudong I, Mapogu, Seoul 121-742, South Korea
Venue:
Journal of Systems Architecture: the EUROMICRO Journal
Year:
2004

Citing 7
Cited 1

Internet Web servers: workload characterization and performance implications

IEEE/ACM Transactions on Networking (TON)
ONE-IP: techniques for hosting a service on a cluster of machines

Selected papers from the sixth international conference on World Wide Web
Network dispatcher: a connection router for scalable Internet services

WWW7 Proceedings of the seventh international conference on World Wide Web 7
Scalable internet servers: issues and challenges

ACM SIGMETRICS Performance Evaluation Review
Dynamic Load Balancing on Web-Server Systems

IEEE Internet Computing
High-Performance Web Site Design Techniques

IEEE Internet Computing
Scheduling algorithms for distributed Web servers

ICDCS '97 Proceedings of the 17th International Conference on Distributed Computing Systems (ICDCS '97)

A dynamic dispatcher-based scheduling algorithm on load balancing for web server cluster

WISM'10 Proceedings of the 2010 international conference on Web information systems and mining

Quantified Score

Hi-index	0.00

Visualization

Abstract

Server clusters for Internet services can yield both high performance and cost effectiveness. Contemporary approaches to cluster design must confront the tradeoff between dynamic load-balancing and efficiency when dispatching client requests to servers in the cluster. In this paper we describe a packet filtering-based RR scheduling scheme, intended to be an easily implemented scheme for hosting Internet services on a server cluster in a way transparent to clients. We take a non-centralized approach, in which client packets sent to the cluster's single IP address are broadcast to all of its servers. Packets requesting that a new TCP session be set up cause counters in each server to be incremented; if a server's counter matches its fixed unique ID, it takes charge of the session, else it ignores the packet. This yields a round-robin type algorithm. We describe this approach in detail, and present results of simulations that show it achieves higher performance (in terms of throughput and reliability) than similar approaches based on client-IP hashing and dispatcher-based RR.