Two-way handshaking circular sequential k-out-of-n congestion system

Many communication systems require a two-way, or three-way handshaking process to improve their dependability & authenticity in order to achieve a more successful operation. In this paper, we present a new two-way handshaking reliability model based upon (k, n) threshold-based cryptography systems. Such systems require a two-way handshaking process to i) establish a group of participated servers in the first handshaking process, and ii) calculate a cipher with k successfully connected servers collaboratively in the second handshaking process. When the servers are attempted, each server has three known connection probabilities in the following three states: i) successful, ii) breakdown, and iii) congested. These connection probabilities are unchanged in both handshaking processes. During the first handshaking process, we establish connections that more than k servers are willing to participate. For the second handshaking process, the system becomes successful as soon as we can connect these k servers successfully again. Because we need to connect k servers successfully in the second handshaking process, we would rather connect m additional servers besides the k servers required to be connected successfully in the first handshaking process. This preference will minimize the chance that the system breaks down when fewer than k,servers can be reconnected successfully in the second handshaking process. We refer to this system as a Two-Way Handshaking Circular Sequential k-out-of-n Congestion (TWHCSknC) system. In this paper, we derived analytical formulas for the system's successful probability & average stop length, and we showed that the TWHCSknC system is a communication system with an efficient two-way handshaking process.