Academic literature on the topic 'Multiserver. Two'

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Multiserver. Two.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "Multiserver. Two"

1

Renisagayaraj M, Roja R, Bhuvaneswari S, Suganthi P, and Sujatha R. "A Study of Multiserver Retrial Queues With Different Stages of Homogeneous Service." Journal of Computational Mathematica 7, no. 1 (2023): 017–22. http://dx.doi.org/10.26524/cm159.

Full text
Abstract:
We discuss a queuing system with retrial of customers. Two models are discussed. First, we investigate single server queues in parallel, when the customer going to search and join the shorter of the two queues and in the second model we introduce the multiserver queue to multiserver retrial queue system. Multiserver provides different stages of homogeneous service in succession.
APA, Harvard, Vancouver, ISO, and other styles
2

Amin, Ruhul, SK Hafizul Islam, Muhammad Khurram Khan, Arijit Karati, Debasis Giri, and Saru Kumari. "A Two-Factor RSA-Based Robust Authentication System for Multiserver Environments." Security and Communication Networks 2017 (2017): 1–15. http://dx.doi.org/10.1155/2017/5989151.

Full text
Abstract:
The concept of two-factor multiserver authentication protocol was developed to avoid multiple number of registrations using multiple smart-cards and passwords. Recently, a variety of two-factor multiserver authentication protocols have been developed. It is observed that the existing RSA-based multiserver authentication protocols are not suitable in terms of computation complexities and security attacks. To provide lower complexities and security resilience against known attacks, this article proposes a two-factor (password and smart-card) user authentication protocol with the RSA cryptosystem for multiserver environments. The comprehensive security discussion proved that the known security attacks are eliminated in our protocol. Besides, our protocol supports session key agreement and mutual authentication between the application server and the user. We analyze the proof of correctness of the mutual authentication and freshness of session key using the BAN logic model. The experimental outcomes obtained through simulation of the Automated Validation of Internet Security Protocols and Applications (AVISPA) S/W show that our protocol is secured. We consider the computation, communication, and storage costs and the comparative explanations show that our protocol is flexible and efficient compared with protocols. In addition, our protocol offers security resilience against known attacks and provides lower computation complexities than existing protocols. Additionally, the protocol offers password change facility to the authorized user.
APA, Harvard, Vancouver, ISO, and other styles
3

Wang, Chenyu, Guoai Xu, and Wenting Li. "A Secure and Anonymous Two-Factor Authentication Protocol in Multiserver Environment." Security and Communication Networks 2018 (2018): 1–15. http://dx.doi.org/10.1155/2018/9062675.

Full text
Abstract:
With the great development of network technology, the multiserver system gets widely used in providing various of services. And the two-factor authentication protocols in multiserver system attract more and more attention. Recently, there are two new schemes for multiserver environment which claimed to be secure against the known attacks. However, after a scrutinization of these two schemes, we found that (1) their description of the adversary’s abilities is inaccurate; (2) their schemes suffer from many attacks. Thus, firstly, we corrected their description on the adversary capacities to introduce a widely accepted adversary model and then summarized fourteen security requirements of multiserver based on the works of pioneer contributors. Secondly, we revealed that one of the two schemes fails to preserve forward secrecy and user anonymity and cannot resist stolen-verifier attack and off-line dictionary attack and so forth and also demonstrated that another scheme fails to preserve forward secrecy and user anonymity and is not secure to insider attack and off-line dictionary attack, and so forth. Finally, we designed an enhanced scheme to overcome these identified weaknesses, proved its security via BAN logic and heuristic analysis, and then compared it with other relevant schemes. The comparison results showed the superiority of our scheme.
APA, Harvard, Vancouver, ISO, and other styles
4

Mohammad, Majid Masroor, Mishra Kushagra, and Sasikala E. "Providing Security in Multiserver Authentication Scheme using Efficient Three Factor Encryption." International Journal of Recent Technology and Engineering (IJRTE) 9, no. 2 (2020): 55–59. https://doi.org/10.35940/ijrte.A2877.079220.

Full text
Abstract:
For last couple of months, Using Two Factor Authentication was not so secure to protect the data inheriting from Multiserver Authentication. Providing Three Factor Authentication helped a lot in these fields to enhance the security while decrypting the encrypted files but failed in many aspects as there were no Multiserver Authentication was used. Here, the approach is used to provide security in Multiserver Platform Using Three Factor Encryption efficiently so as to remove 99.9% chances of failure in security from decryption of the files without going through Three Factor Security present at different Servers to verify at same time and providing permission to access. For the duration between Feb. 2019 and Jan 2020, There were millions of cases reporting loss of data even having two factor authentication, It happens in a way to get through the first factor on first server taking approval, and the packet can be dropped in-between to use that authentication to get through the second factor on second server to access the data. With the improvement of spread choosing development to the degree unfaltering quality and point of confinement and boundless affiliation have been set as parameters to improve. So, we have implemented these changes in our model to reduce the complexity by this effect providing more security using different layers and format to keep the file secure and going through 3-layer security and authentication before getting access.
APA, Harvard, Vancouver, ISO, and other styles
5

Cheng, Dinah W. "Line Reversibility of Multiserver Systems." Probability in the Engineering and Informational Sciences 11, no. 2 (1997): 177–88. http://dx.doi.org/10.1017/s0269964800004745.

Full text
Abstract:
The line reversibility property of a two-stage multiserver system with manufacturing blocking has previously been established using a duality argument between the blocked state and the idle state. In this paper, we provide counterexamples that show this argument does not apply to systems with more than two stages. A focus of this paper is to provide a new proof for the result. Our argument is based on the duality between the service initiation and the service completion events.
APA, Harvard, Vancouver, ISO, and other styles
6

Neelam, Singla, and Kalra Sonia. "A two-dimensional Multiserver Queuing system with repeated attempts and impatience." Indian Journal of Science and Technology 14, no. 17 (2021): 1379–91. https://doi.org/10.17485/IJST/v14i17.820.

Full text
Abstract:
Abstract <strong>Objective:</strong>&nbsp;This study discusses a two-state multiserver retrial queueing system, where the customer may leave the system due to impatience. In this paper, we deal with the time dependent probabilities when all, some or none servers are busy.&nbsp;<strong>Method:</strong>&nbsp;For this model, we solved difference differential equations recursively and obtained the time dependent probabilities when all, some or none servers are busy.&nbsp;<strong>Findings:</strong>&nbsp;Time dependent probabilities of exact number of arrivals and exact number of departures at when all, some or none servers are busy are obtained. In this paper, some kind of verification and converting two state model into single state model are discussed. Some special cases of interest are also discussed.&nbsp;<strong>Novelty:</strong>&nbsp;In communication networks, multiple servers are used to reduce traffic congestion and improve system performance. The operation mode of a call center with repeated attempts provides an initial motivation for our study. <strong>Keywords:</strong> Impatience; Multiserver; Probability; Queueing; Retrial
APA, Harvard, Vancouver, ISO, and other styles
7

Maddah, Bacel, and Muhammad El-Taha. "Selective Trunk with Multiserver Reservation." Advances in Operations Research 2016 (2016): 1–8. http://dx.doi.org/10.1155/2016/3478709.

Full text
Abstract:
We consider a queueing model that is primarily applicable to traffic control in communication networks that use the Selective Trunk Reservation technique. Specifically, consider two traffic streams competing for service at ann-server queueing system. Jobs from theprotectedstream, stream 1, are blocked only if allnservers are busy. Jobs from thebest effortstream, stream 2, are blocked ifn-r, r≥1, servers are busy. Blocked jobs are diverted to a secondary group ofc-nservers with, possibly, a different service rate. We extend the literature that studied this system for the special case ofr=1and present an explicit computational scheme to calculate the joint probabilities of the number of primary and secondary busy servers and related performance measures. We also argue that the model can be useful for bed allocation in a hospital.
APA, Harvard, Vancouver, ISO, and other styles
8

PHUNG-DUC, TUAN. "MULTISERVER RETRIAL QUEUES WITH TWO TYPES OF NONPERSISTENT CUSTOMERS." Asia-Pacific Journal of Operational Research 31, no. 02 (2014): 1440009. http://dx.doi.org/10.1142/s0217595914400090.

Full text
Abstract:
We consider M/M/c/K(K ≥ c ≥ 1) retrial queues with two types of nonpersistent customers, which are motivated from modeling of service systems such as call centers. Arriving customers that see the system fully occupied either join the orbit or abandon receiving service forever. After an exponentially distributed time in the orbit, each customer either abandons the system forever or retries to occupy a server again. For the case of K = c = 1, we present an analytical solution for the generating functions in terms of confluent hypegeometric functions. In the general case, the number of customers in the system and that in the orbit form a level-dependent quasi-birth-and-death (QBD) process whose structure is sparse. Based on this sparse structure, we develop a numerically stable algorithm to compute the joint stationary distribution. We show that the computational complexity of the algorithm is linear to the capacity of the queue. Furthermore, we present a simple fixed point approximation model for the case where the algorithm is time consuming. Numerical results show various insights into the system behavior.
APA, Harvard, Vancouver, ISO, and other styles
9

Pandelis, Dimitrios G., and Demosthenis Teneketzis. "Optimal Multiserver Stochastic Scheduling of two Interconnected Priority Queues." Advances in Applied Probability 26, no. 1 (1994): 258–79. http://dx.doi.org/10.2307/1427590.

Full text
Abstract:
A number of jobs on two interconnected queues are to be processed by m identical servers. The servers operate in parallel, so that every server can process any job. Jobs in queue i, i = 1, 2, incur an instantaneous holding cost Ci during the time they remain in the system. The service time for jobs in queue i, denoted by Xi, is a random variable with a general distribution. The interconnection process is independent of the service process. We establish sufficient conditions on the service times, the holding costs and the interconnection process under which the non-preemptive scheduling strategy that gives priority to queue 1 minimizes the total expected α -discounted cost. We call this strategy P1. We present counterexamples showing that if any of the sufficient conditions is not satisfied P1 may not be optimal, and that the optimal policy for the single-server problem is not necessarily optimal for the multiserver problem.
APA, Harvard, Vancouver, ISO, and other styles
10

Singla, Neelam, and Sonia Kalra. "A two-state multiserver retrial queueing model with balking." Journal of Physics: Conference Series 1531 (May 2020): 012061. http://dx.doi.org/10.1088/1742-6596/1531/1/012061.

Full text
APA, Harvard, Vancouver, ISO, and other styles
More sources

Dissertations / Theses on the topic "Multiserver. Two"

1

Tung-Lung, Lee, and 李東隆. "Optimal Admission Control to Two Multiserver Queues in Series with Two Arrival Streams." Thesis, 2000. http://ndltd.ncl.edu.tw/handle/60792735887275473202.

Full text
Abstract:
碩士<br>中原大學<br>工業工程學系<br>88<br>Queueing networks are useful to model manufacturing systems, telecommunication systems and service systems. Consider a phonebanking service system( we call it the system) in which phonebanking officers serves customers through the phones for the request such as transferring, investment and inquiring. There are two kinds of customers: ordinary customers and prior customers( VIP customers). For the ordinary customers, the system will put them on hold for hearing the greeting when they call in then switch them to phonebanking officers. However, for the VIP customers, the system will directly switch them to the phonebanking officers(if there is any available) when they call in. We can consider the system as a network of two queues in series: the first queue is for the customers put on hold and the second queue is for the customers Abstract We consider a loss system of two queues in series with finite system capacity. The first queue is a self-service queue and the second is a multiserver queue. Suppose that there are M telephone lines linking to system and there are N phonebanking officers in the systems. Therefore the total capacity of this queueing network is M with N parallel servers in the second queue. There are two types(type 1 and 2) of customers that are generated according to independent Poisson processes. A type 1 customer requires the service at the first queue then at the second queue, while a type 2 customer requires service at the second queue only. An arriving type 2 customer finding that all servers at the second queue are busy will leave. Assume that service times at both queues are exponentially distributed. A holding cost per unit time occurs for each customer in system and a reward earned by system for each customer entering the system, while a cost for each lost type 2 customer at the second queue. This system is similar to a phonebanking center.\ We study the optimal admission policy by accepting or rejecting the arriving type 1 customers and the objective is to maximize the expected total discounted profit. We modeling the system by Markov decision process. We found that under some cost conditions, the expected $\beta$-discounted profit function has the monotonicity properties. According to these properties we have a switching curve of the system. The switching curve divide the state space into two subregions. In the accept region, the system accept an 1-customer. In the reject region the system reject an 1-customer.
APA, Harvard, Vancouver, ISO, and other styles

Book chapters on the topic "Multiserver. Two"

1

Peshkova, Irina, Evsey Morozov, and Maria Maltseva. "On Comparison of Multiserver Systems with Two-Component Mixture Distributions." In Communications in Computer and Information Science. Springer International Publishing, 2020. http://dx.doi.org/10.1007/978-3-030-66242-4_27.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Nazarov, Anatoly, Tuan Phung-Duc, Svetlana Paul, and Olga Lizyura. "Diffusion Approximation for Multiserver Retrial Queue with Two-Way Communication." In Distributed Computer and Communication Networks. Springer International Publishing, 2020. http://dx.doi.org/10.1007/978-3-030-66471-8_43.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Dieker, Antonius B., and Steven T. Hackman. "Exactness Results." In Springer Series in Operations Research and Financial Engineering. Springer Nature Switzerland, 2024. https://doi.org/10.1007/978-3-031-74870-7_18.

Full text
Abstract:
AbstractThis chapter shows that, under various assumptions, the kernel iterates are equal to the lifted QPLEX iterates, i.e., QPLEX iterates after applying a multinomial lift map. We call such a result an exactness result, and we establish such results in three specific settings. In the first two settings, we consider QPLEX chains that encompass as special cases the multiserver queueing model from Chap. 2 in which (1) the service duration distribution is geometric and does not vary over time and (2) the number of servers is infinite. The third setting considers an arbitrary single activity QPLEX chain in which the size functions only take on values 0 or 1.
APA, Harvard, Vancouver, ISO, and other styles
4

Domenech-Benlloch, Ma Jose, Jose Manuel Gimenez-Guzman, Vicent Pla, Vicente Casares-Giner, and Jorge Martinez-Bauset. "Solving Multiserver Systems with Two Retrial Orbits Using Value Extrapolation: A Comparative Perspective." In Analytical and Stochastic Modeling Techniques and Applications. Springer Berlin Heidelberg, 2009. http://dx.doi.org/10.1007/978-3-642-02205-0_5.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Singla, Neelam, and Sonia Kalra. "Performance Analysis of a Two-Dimensional State Multiserver Markovian Queueing Model with Reneging Customers." In Trends in Mathematics. Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-68281-1_24.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Gharbi, Nawel, and Leila Charabi. "An Algorithmic Approach for Multiserver Retrial Queues with Two Customers Classes and Non-preemptive Priority." In Analytical and Stochastic Modelling Techniques and Applications. Springer International Publishing, 2017. http://dx.doi.org/10.1007/978-3-319-61428-1_7.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Multiserver. Two"

1

Anggraito, Adityo, Diletta Olliaro, Andrea Marin, and Marco Ajmone Marsan. "The Non-Saturated Multiserver Job Queuing Model with Two Job Classes: a Matrix Geometric Analysis." In 2024 32nd International Conference on Modeling, Analysis and Simulation of Computer and Telecommunication Systems (MASCOTS). IEEE, 2024. https://doi.org/10.1109/mascots64422.2024.10786546.

Full text
APA, Harvard, Vancouver, ISO, and other styles
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!

To the bibliography