Performance Evaluation of an Efficient Multiple Copy Update Algorithm
IEEE Transactions on Parallel and Distributed Systems
| Hi-index | 0.00 |
WE CONSIDER A SINGLE SERVER QUEUE SERVING TWO CLASSES OF CUSTOMERS ACCORDING TO A PREEMPTIVE RESUME HEAD OF THE LINE PRIORITY DISCIPLINE. THE SERVER IS PRONE TO FAILURES AND AT THE TIME THAT THEY OCCUR, ALL CUSTOMERS ARE FLUSHED OUT OF THE SYSTEM. THE SYSTEM IS ANALYZED UNDER THE ASSUMPTION OF A BULK ARRIVAL PROCESSE, EXPONENTIAL SERVICE TIMES, GENERAL REPAIR TIMES AND EXPONENTIAL INTERFAILURE TIMES.