Methods for Reducing Load of Dynamic Scaling for Distributed Session Control Servers
Eriko Iwasa, Michio Irie, Masashi KANEKO, Takeshi Fukumoto, Masami Iio, Kiyoshi Ueda
Abstract
Eriko Iwasa, Michio Irie, Masashi KANEKO, Takeshi Fukumoto, Masami Iio, Kiyoshi Ueda
Abstract
We discuss the dynamic scaling of distributed session control servers. Dynamic scaling refers to changing the system configuration by servers dynamically joining or leaving. In session control servers, availability and real-time processing must be guaranteed. Therefore, dynamic scaling must be achieved while ensuring these requirements. We propose a cluster model that makes it possible for session control servers to achieve both scalability and dynamic scaling. One problem when a node joins a server cluster is that the lookup load that occurs when the new node takes over call states makes it impossible to continue processing. Consequently, this overload can reduce service reliability. We propose two methods for reducing the overload and describe their properties. We evaluated the methods in a set of experiments. The evaluation using a Session Initiation Protocol application revealed that dynamic scaling was efficient, which indicates the methods are effective in reducing look-up load.
OpenAlex reports 6 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
We discuss the dynamic scaling of distributed session control servers. Dynamic scaling refers to changing the system configuration by servers dynamically joining or leaving. In session control servers, availability and real-time processing must be guaranteed. Therefore, dynamic scaling must be achieved while ensuring these requirements. We propose a cluster model that makes it possible for session control servers to achieve both scalability and dynamic scaling. One problem when a node joins a server cluster is that the lookup load that occurs when the new node takes over call states makes it impossible to continue processing. Consequently, this overload can reduce service reliability. We propose two methods for reducing the overload and describe their properties. We evaluated the methods in a set of experiments. The evaluation using a Session Initiation Protocol application revealed that dynamic scaling was efficient, which indicates the methods are effective in reducing look-up load.
Key concepts: Server, Computer science, Scalability, Joins, Session (web analytics), Node (physics), Distributed computing, Computer network