Computing Reviews
Today's Issue Hot Topics Search Browse Recommended My Account Log In
Review Help
Search
Maximum availability server selection policy for efficient and reliable session control systems
Bozinovski M., Schwefel H., Prasad R. IEEE/ACM Transactions on Networking15 (2):387-399,2007.Type:Article
Date Reviewed: Jan 31 2008

Internet services based on the notion of session, such as instant messaging, are growing in popularity. Fault tolerance in such services is achieved by introducing redundancy through replicating the servers that perform session management. Session control protocols, such as session initiation protocol (SIP), are transactional protocols. A key performance indicator of such systems is the transaction time in the event of multiple failovers to different servers.

A proper server selection policy (SSP), which selects the server that will fulfill a client’s session request, is crucial to minimizing the transaction control time. Round robin (RR) is an example of a simple static selection policy that achieves load balancing by selecting servers sequentially in a cycle. This paper presents a novel dynamic SSP, referred to as the maximum availability (MA) SSP, that minimizes the average number of attempted servers until success, thereby minimizing the transaction control time. MA SSP is a dynamic and adaptive algorithm, and has a low implementation complexity: a simple vector with the status of the servers is maintained at each client, and the server with the largest last known uptime, or with the last known shortest downtime, is selected. The paper presents integration of MA into reliable server pooling (RSerPool), a fault-tolerant platform defined by the Internet Engineering Task Force (IETF); however, the policy is applicable on other platforms, such as clusters, and should be of interest to developers implementing Internet protocol (IP) based systems and services.

The authors also developed an analytical model and expressions for evaluation metrics for the system. An event-driven simulator based on the model is used to show that the proposed MA SSP significantly outperforms RR.

Reviewer:  Suma Adabala Review #: CR135199 (0812-1192)
Bookmark and Share
 
Reliability, Availability, And Serviceability (C.4 ... )
 
 
Network Management (C.2.3 ... )
 
 
Performance Attributes (C.4 ... )
 
 
Servers (C.5.5 )
 
 
Performance of Systems (C.4 )
 
Would you recommend this review?
yes
no
Other reviews under "Reliability, Availability, And Serviceability": Date
Implementing fault-tolerant services using the state machine approach: a tutorial
Schneider F. ACM Computing Surveys 22(4): 299-319, 2001. Type: Article
Jul 1 1992
Network reliability and algebraic structures
Shier D., Clarendon Press, New York, NY, 1991. Type: Book (9780198533863)
Sep 1 1992
On building systems that will fail
Corbató F. Communications of the ACM 34(9): 72-81, 1991. Type: Article
Sep 1 1992
more...

E-Mail This Printer-Friendly
Send Your Comments
Contact Us
Reproduction in whole or in part without permission is prohibited.   Copyright 1999-2024 ThinkLoud®
Terms of Use
| Privacy Policy