Blocking analysis of transaction processing queues

A transaction processing queue manages a database which is partitioned into N items. Each arriving class-i customer requests to read and write a certain subset of the N items (called the shared and exclusive access sets Ri and Wi). Classes i and j are said to conflict if (Wi∩Wj)∪(Wi∩Rj)∪(Ri∩Wj)≠∅. No two conflicting classes of customers can be processed simultaneously. All classes arrive according to independent Poisson processes and have general i.i.d. service times. s paper, we discuss database systems without queuing. We show the insensitivity property of the system, and derive analytical expressions for performance measures such as blocking probabilities, throughput, etc.