Pseudo-cyclic policies for multi-queue single server systems

1994 ◽  
Vol 48 (1) ◽  
pp. 127-152 ◽  
Author(s):  
Offer Fabian ◽  
Hanoch Levy
Keyword(s):  
Single Server ◽  
Server Systems

LOCKING PROTOCOL FOR INFORMATION FLOW CONTROL

2004 ◽  
Vol 05 (03) ◽  
pp. 233-247 ◽  
Author(s):  
RYUNG CHON ◽  
KOUHEI TAKEDA ◽  
TOMOYA ENOKIDO ◽  
MAKOTO TAKIZAWA
Keyword(s):  
Access Control ◽  
Flow Control ◽  
Information Flow ◽  
Single Server ◽  
Role Based Access Control ◽  
Information Flow Control ◽  
Server Systems ◽  
Locking Protocol ◽  
Role Based ◽  
Multi Server

We discuss a novel role locking protocol (RLP) to prevent illegal information flow among objects in a role-based access control (RBAC) model. In this paper, we define a conflicting relation among roles "a role R1 conflicts with another role R2" to show that illegal information flow may occur if a transaction associated with role R1 is performed before another transaction with role R2. Here, we introduce a role lock on an object to abort a transaction with role R1 if another transaction with role R2 had been already performed on the object. Role locks are not released even if transactions issuing the role locks commit. After data in an object o1 flow to another object o2, if the object o1 is updated, the data in the object o2 is independent of the object o1, i.e. obsolete. A role lock on an object can be released if information brought into the object is obsolete. We discuss how to release obsolete role locks. We also discuss how to implement the role locking protocol in single-server and multi-server systems.

scholarly journals Dual processes to solve single server systems

2005 ◽  
Vol 135 (1) ◽  
pp. 121-147 ◽  
Author(s):  
Alan Krinik ◽  
Gerardo Rubino ◽  
Daniel Marcus ◽  
Randall J. Swift ◽  
Hassan Kasfy ◽  
...  
Keyword(s):  
Single Server ◽  
Dual Processes ◽  
Server Systems

Exponential spectra as a tool for the study of server-systems with several classes of customers

1978 ◽  
Vol 15 (01) ◽  
pp. 162-170 ◽  
Author(s):  
J. Keilson
Keyword(s):  
Waiting Time ◽  
Busy Period ◽  
Heavy Traffic ◽  
Transient Behavior ◽  
Single Server ◽  
Idle State ◽  
Priority Systems ◽  
Completely Monotone ◽  
Server Systems ◽  
Server System

For a single-server system having several Poisson streams of customers with exponentially distributed service times, busy period densities, waiting time densities, and idle state probabilities are completely monotone. The exponential spectra for such densities are of importance for understanding the transient behavior of such systems. Algorithms are given for the computation of such spectra. Applications to heavy traffic situations and priority systems are also discussed.

On two stationary distributions for the stable GI/G/1 queue

1974 ◽  
Vol 11 (04) ◽  
pp. 849-852 ◽  
Author(s):  
Austin J. Lemoine
Keyword(s):  
Waiting Time ◽  
Queue Length ◽  
Distribution Functions ◽  
Single Server ◽  
Stationary Distributions ◽  
Virtual Waiting Time ◽  
Server Systems ◽  
Stationary Queue Length

This paper provides simple proofs of two standard results for the stable GI/G/1 queue on the structure of the distribution functions of the stationary virtual waiting time and the stationary queue-length Our argument is applicable to more general single server systems than the queue GI/G/1.

On two stationary distributions for the stable GI/G/1 queue

1974 ◽  
Vol 11 (4) ◽  
pp. 849-852 ◽  
Author(s):  
Austin J. Lemoine
Keyword(s):  
Waiting Time ◽  
Queue Length ◽  
Distribution Functions ◽  
Single Server ◽  
Stationary Distributions ◽  
Virtual Waiting Time ◽  
Server Systems ◽  
Stationary Queue Length

This paper provides simple proofs of two standard results for the stable GI/G/1 queue on the structure of the distribution functions of the stationary virtual waiting time and the stationary queue-length Our argument is applicable to more general single server systems than the queue GI/G/1.

Sign in / Sign up

Export Citation Format

Share Document