Journal Article10.1109/TNET.2007.892875
Maximum availability server selection policy for efficient and reliable session control systems
TL;DR: The maximum availability (MA) SSP is proposed to improve session control performance in scenarios with server and communication failures, and results show that transaction control time is considerably reduced with MA as opposed to when using traditional round robin.
read more
Abstract: There has been a rapid growth of services based on session control. Session-based services comprise multimedia conferences, Internet telephone calls, instant messaging, and similar applications consisting of one or more media types such as audio and video. Deployment examples include session control services as part of the IP multimedia subsystem (IMS), in the third-generation mobile networks. High service dependability in session control systems is achieved by introducing redundancy, e.g., through reliable server pooling (RSerPool) or clustering. Namely, session control servers are multiplied in server sets. Performance of such replicated session control servers is quantified by transaction control time. Thus, reducing transaction control time enhances performance. Server selection policies (SSP) are crucial in achieving this goal. The maximum availability (MA) SSP is proposed to improve session control performance in scenarios with server and communication failures. Based on a status vector, MA aims at maximizing the probability of successful transaction with the current transmission, thereby minimizing the average number of attempted servers until success. MA is applicable in a broad range of IP-based systems and services, and it is independent of the fault-tolerant platform. A simple protocol extension is proposed in order to integrate MA into the RSerPool fault-tolerant architecture. In addition, an analytic model is derived based on certain system model assumptions. Analytic and simulation results show that transaction control time is considerably reduced with MA as opposed to when using traditional round robin.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
A Self-tuning Failure Detection Scheme for Cloud Computing Service
Naixue Xiong,Athanasios V. Vasilakos,Jie Wu,Y. Richard Yang,Andy Rindos,Yuezhi Zhou,Wen-Zhan Song,Yi Pan +7 more
- 21 May 2012
TL;DR: Experimental results demonstrate that the proposed SFD scheme can automatically adjust SFD control parameters to obtain corresponding services and satisfy user requirements, while maintaining good performance.
88
Patent
Data transmission queuing using fault prediction
Marc D. Reyhner,Ian C. Jirka +1 more
- 14 Mar 2008
TL;DR: In this article, the data to be communicated is assigned to one of the plurality of virtual queues prior to transmission based on fault group information associated with the data, i.e., a first representative virtual queue associated with a first fault group and a second representative virtual queuing with a second fault group.
38
Dynamic service placement and replication framework to enhance service availability using team formation algorithm
TL;DR: The evaluation results showed that the framework is capable of managing resources according to the requirements given by administrator, even during in the event of multiple consecutive resources failure.
23
Inconsistency evaluation in a replicated IP-Based call control system
Thibault Julien Renier,Erling Vestergaard Matthiesen,Hans-Peter Schwefel,Ramjee Prasad +3 more
- 15 May 2006
TL;DR: This paper discusses the relevance of different inconsistency definitions and suggests a common model in which the inconsistency metrics are broken down into a set of measurable and/or analytically derivable contributing factors.
7
Server selection mechanism for VoIP system in wireless mesh networks
San-Peng Kao,Yung-Sheng Lee,Yung-Chiao Chen,Jiann-Liang Chen,Kai-Hsiang Yang +4 more
- 03 Mar 2016
TL;DR: A Server Selection Mechanism (SSM) that evaluates the capacity of each smart mobile device to select the most appropriate one to act as the SIP server and client and enhanced the period of whole group connectivity and provided better service for group users is proposed.
2
References
Time, clocks, and the ordering of events in a distributed system
TL;DR: In this article, the concept of one event happening before another in a distributed system is examined, and a distributed algorithm is given for synchronizing a system of logical clocks which can be used to totally order the events.
Time, clocks, and the ordering of events in a distributed system
TL;DR: In this paper, the concept of one event happening before another in a distributed system is examined, and a distributed algorithm is given for synchronizing a system of logical clocks which can be used to totally order the events.
•Book
Introduction to Discrete Event Systems
Christos G. Cassandras,Stéphane Lafortune +1 more
- 30 Sep 1999
TL;DR: This edition includes recent research results pertaining to the diagnosis of discrete event systems, decentralized supervisory control, and interval-based timed automata and hybrid automata models.
4.6K
Session Initiation Protocol (SIP) Extension for Instant Messaging
Jonathan Rosenberg,Henning Schulzrinne,Christian Huitema,D. Gurle,Ben Allen Campbell +4 more
- 01 Dec 2002
TL;DR: Instant Messaging (IM) refers to the transfer of messages between users in near real-time, usually, but not required to be, short.
•Book
Replication techniques in distributed systems
Abdelsalam Helal,Bharat Bhargava,Abdelsalam A. Heddaya +2 more
- 01 Jan 1996
TL;DR: This chapter discussesReplication in Heterogeneous, Mobile, and Large-Scale Systems, Serializability Theory, and the Future of Replication, which aims to define and explain the role of data stores in these systems.
199