Adaptable server clusters with QoS objectives Export

@inproceedings{citeulike:813426, abstract = {We present a decentralized design for a server cluster that supports a single service with response time guarantees. Three distributed mechanisms represent the key elements of our design. Topology construction maintains a dynamic overlay of cluster nodes. Request routing directs service requests towards available servers. Membership control allocates/releases servers to/from the cluster, in response to changes in the external load. We advocate a decentralized approach, because it is scalable, fault-tolerant, and has a lower configuration complexity than a centralized solution. We demonstrate through simulations that our system operates efficiently by comparing it to an ideal centralized system. In addition, we show that our system rapidly adapts to changing load. We found that the interaction of the various mechanisms in the system leads to desirable global properties. More precisely, for a fixed connectivity c (i.e., the number of neighbors of a node in the overlay), the average experienced delay in the cluster is independent of the external load. In addition, increasing c increases the average delay but decreases the system size for a given load. Consequently, the cluster administrator can use c as a management parameter that permits control of the tradeoff between a small system size and a small experienced delay for the service.}, author = {Adam, C. and Stadler, R.}, citeulike-article-id = {813426}, citeulike-linkout-0 = {http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=1440782}, journal = {Integrated Network Management, 2005. IM 2005. 2005 9th IFIP/IEEE International Symposium on}, keywords = {adaptable, clusters, epidemic, qos, server}, pages = {149--162}, posted-at = {2006-08-23 08:17:36}, priority = {2}, title = {Adaptable server clusters with QoS objectives}, url = {http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=1440782}, year = {2005} }

TY - CONF ID - citeulike:813426 L3 - citeulike-article-id:813426 N2 - We present a decentralized design for a server cluster that supports a single service with response time guarantees. Three distributed mechanisms represent the key elements of our design. Topology construction maintains a dynamic overlay of cluster nodes. Request routing directs service requests towards available servers. Membership control allocates/releases servers to/from the cluster, in response to changes in the external load. We advocate a decentralized approach, because it is scalable, fault-tolerant, and has a lower configuration complexity than a centralized solution. We demonstrate through simulations that our system operates efficiently by comparing it to an ideal centralized system. In addition, we show that our system rapidly adapts to changing load. We found that the interaction of the various mechanisms in the system leads to desirable global properties. More precisely, for a fixed connectivity c (i.e., the number of neighbors of a node in the overlay), the average experienced delay in the cluster is independent of the external load. In addition, increasing c increases the average delay but decreases the system size for a given load. Consequently, the cluster administrator can use c as a management parameter that permits control of the tradeoff between a small system size and a small experienced delay for the service. JF - Integrated Network Management, 2005. IM 2005. 2005 9th IFIP/IEEE International Symposium on EP - 162 TI - Adaptable server clusters with QoS objectives SP - 149 KW - adaptable KW - clusters KW - epidemic KW - qos KW - server AU - Adam, C AU - Stadler, R PY - 2005/// UR - http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=1440782 ER -