A Threshold Multi-server Protocol for Password-Based Authentication

2016 ◽  
Author(s):  
Mengxiang Guan ◽  
Jiaxing Song ◽  
Weidong Liu
Keyword(s):  
Multi Server ◽  
Password Based Authentication

A Self-Verifiable Password Based Authentication Scheme for Multi-Server Architecture Using Smart Card

2017 ◽  
Vol 96 (4) ◽  
pp. 6273-6297 ◽  
Author(s):  
Jangirala Srinivas ◽  
Sourav Mukhopadhyay ◽  
Dheerendra Mishra
Keyword(s):  
Smart Card ◽  
Authentication Scheme ◽  
Multi Server ◽  
Password Based Authentication ◽  
Server Architecture

Password-Based Authentication Protocol for Secret-Sharing-Based Multiparty Computation

2018 ◽  
Vol E101.A (1) ◽  
pp. 51-63 ◽  
Author(s):  
Ryo KIKUCHI ◽  
Koji CHIDA ◽  
Dai IKARASHI ◽  
Koki HAMADA
Keyword(s):  
Secret Sharing ◽  
Authentication Protocol ◽  
Multiparty Computation ◽  
Password Based Authentication

Cost-Profit Analysis of an Infinite Capacity Multi-server Markovian Feedback Queuing System with Reverse Balking

2019 ◽  
Vol 7 (5) ◽  
pp. 462-466
Author(s):  
Bhupender Kumar Som ◽  
Vivek Kumar Sharma ◽  
Sunny Seth
Keyword(s):  
Queuing System ◽  
Profit Analysis ◽  
Multi Server

Optimization of a Multi-Server Stochastic Financial Queue

2019 ◽  
Author(s):  
Bhupender Kumar Soam ◽  
Shweta Bhatia ◽  
Kirti Sharma
Keyword(s):  
Multi Server

scholarly journals Zero Queueing for Multi-Server Jobs

2021 ◽  
Vol 5 (1) ◽  
pp. 1-25
Author(s):  
Weina Wang ◽  
Qiaomin Xie ◽  
Mor Harchol-Balter
Keyword(s):  
Cloud Computing ◽  
Stability Region ◽  
Transient Analysis ◽  
Queueing Systems ◽  
Sufficient Conditions ◽  
Hard Problem ◽  
Queueing Model ◽  
Multiple Servers ◽  
First Results ◽  
Multi Server

Cloud computing today is dominated by multi-server jobs. These are jobs that request multiple servers simultaneously and hold onto all of these servers for the duration of the job. Multi-server jobs add a lot of complexity to the traditional one-server-per-job model: an arrival might not "fit'' into the available servers and might have to queue, blocking later arrivals and leaving servers idle. From a queueing perspective, almost nothing is understood about multi-server job queueing systems; even understanding the exact stability region is a very hard problem. In this paper, we investigate a multi-server job queueing model under scaling regimes where the number of servers in the system grows. Specifically, we consider a system with multiple classes of jobs, where jobs from different classes can request different numbers of servers and have different service time distributions, and jobs are served in first-come-first-served order. The multi-server job model opens up new scaling regimes where both the number of servers that a job needs and the system load scale with the total number of servers. Within these scaling regimes, we derive the first results on stability, queueing probability, and the transient analysis of the number of jobs in the system for each class. In particular we derive sufficient conditions for zero queueing. Our analysis introduces a novel way of extracting information from the Lyapunov drift, which can be applicable to a broader scope of problems in queueing systems.

Sign in / Sign up

Export Citation Format

Share Document