«N threshold policy»
۵۲۰ نتیجهDISCRETE-TIME GI/D-MSP/1/K QUEUE WITH N THRESHOLD POLICY
This paper presents a discrete-time single-server finite buffer N threshold policy queue with renewal input and discreteMarkovian service process. The server terminates service whenever the system becomes empty, and recommencesservice as soon as the number of waiting customers in
discrete-time gi/d-msp/1/k queue with n threshold policy
this paper presents a discrete-time single-server finite buffer n threshold policy queue with renewal input and discretemarkovian service process. the server terminates service whenever the system becomes empty, and recommencesservice as soon as the number of waiting customers in
Discrete - Time GI / D - MSP / 1 / K Queue with N Threshold Policy
This paper presents a discrete-time single-server finite buffer N threshold policy queue with renewal input and discrete Markovian service process. The server terminates service whenever the system becomes empty, and recommences service as soon as the number of waiting customers
A Single Vacation Model G/M/1/K with N Threshold Policy
This paper studies a G/M/1/K queueing system, where the server applies an N policy and takes a single vacation when the system is empty. We provide a recursive method, using the supplementary variable technique and treating the supplementary variable as the remaining inter-arriva
Performance Analysis of a Two-queue Model with an (m, N)-threshold Service Schedule
In this paper, we consider a polling system consisting of two-parallel queues and a single server under an (M, N)-threshold nonpreemptive priority service schedule. Two thresholds M and N (0 EA;} . J=l j=1 (2.3) We have that LT = E[r]. Then we obtain a sufficient condition of the
Chosen Ciphertext Secure Ciphertext-Policy Attribute-Based Encryption with Constant Ciphertext Length and Threshold Policy
A ciphertext-policy attribute-based encryption scheme allows that an encrypter assigns a decryption policy to ciphertexts. Any user will be able to decrypt if and only if a set of attributes (his private key) satisfy the assigned decryption policy. In this paper we first propose
Tight Guarantees for Static Threshold Policies in the Prophet Secretary Problem
In the prophet secretary problem, n values are drawn independently from known distributions and presented in a uniformly random order. A decision maker must accept or reject each value when it is may at most k total. The objective to maximize expected sum of accepted values. We a
A New (t, n)-Threshold Scheme Based on Difference Equations
In the paper, we propose three threshold secret sharing schemes that are based on difference equations. The first scheme is a (t, n)− threshold scheme which is an ideal perfect secure. The other two schemes add the restricted order structure to the set of shadows and the access s
A time-shared machine repair problem with mixed spares under N-policy
The present investigation deals with a machine repair problem consisting of cold and warm standby machines. The machines are subject to breakdown and are repaired by the permanent repairman operating under N-policy. There is provision of one additional removable repairman who is
analysis of an m/g/1 queue with multiple vacations, n-policy, unreliable service station and repair facility failures
this paper studies an m/g/1 repairable queueing system with multiple vacations and n-policy, in which the service station is subject to occasional random breakdowns. when the service station breaks down, it is repaired by a repair facility. moreover, the repair facility may fail