Increased availability and scalability for clustered services via the wait time calculation, trust based filtering and redirection of TCP connection requests

Clutterbuck, P. J. and Mohay, G. (2003). Increased availability and scalability for clustered services via the wait time calculation, trust based filtering and redirection of TCP connection requests. In: Convergent Technologies for the Asia-Pacific Region: IEEE Tencon 2003. IEEE Tencon 2003 Conference, Bangalore, India, (328-332). 15-17 October 2003. doi:10.1109/TENCON.2003.1273339


Author Clutterbuck, P. J.
Mohay, G.
Title of paper Increased availability and scalability for clustered services via the wait time calculation, trust based filtering and redirection of TCP connection requests
Conference name IEEE Tencon 2003 Conference
Conference location Bangalore, India
Conference dates 15-17 October 2003
Proceedings title Convergent Technologies for the Asia-Pacific Region: IEEE Tencon 2003
Journal name Ieee Tencon 2003: Conference On Convergent Technologies for the Asia-Pacific Region, Vols 1-4
Place of Publication Piscataway NJ, U.S.A.
Publisher IEEE Computer Society
Publication Year 2003
Sub-type Fully published paper
DOI 10.1109/TENCON.2003.1273339
ISBN 0-7803-8162-9
ISSN 0886-1420
Volume 1
Start page 328
End page 332
Total pages 5
Collection year 2003
Language eng
Abstract/Summary The paper describes two new transport layer (TCP) options and an expanded transport layer queuing strategy that facilitate three functions that are fundamental to the dispatching-based clustered service. A transport layer option has been developed to facilitate. the use of client wait time data within the service request processing of the cluster. A second transport layer option has been developed to facilitate the redirection of service requests by the cluster dispatcher to the cluster processing member. An expanded transport layer service request queuing strategy facilitates the trust based filtering of incoming service requests so that a graceful degradation of service delivery may be achieved during periods of overload - most dramatically evidenced by distributed denial of service attacks against the clustered service. We describe how these new options and queues have been implemented and successfully tested within the transport layer of the Linux kernel.
Subjects E1
280304 Operating Systems
700102 Application tools and system utilities
Keyword Internet
Computer crime
Operating system kernels
Queueing theory
Telecommunication security
Q-Index Code E1

 
Versions
Version Filter Type
Citation counts: TR Web of Science Citation Count  Cited 0 times in Thomson Reuters Web of Science Article
Google Scholar Search Google Scholar
Created: Fri, 24 Aug 2007, 02:14:41 EST