Name
Abstract | ||
|---|---|---|
This paper is motivated by the response-time analysis of distributed information systems, where transactions are handled by a sequence of front-end server and back-end server actions. We study sojourn times in an open queueing network with a single Processor Sharing (PS) node and an arbitrary number of M multi-server First-Come-First-Served (FCFS) nodes. Customers arrive at the PS according to a Poisson process. After departing from the PS node a customer jumps to FCFS node k with probability pk, and departs from the system with probability 1 - p, where p = Σk-1M pk (0 p |
Year | DOI | Venue |
|---|---|---|
2006 | 10.1016/j.peva.2005.08.002 | Perform. Eval. |
Keywords | Field | DocType |
sojourn time approximation,probability pk,poisson process,m multi-server,queueing network,front-end server,sojourn time,k-1m pk,arbitrary number,response time,information system,back-end server action,ps node,feedback,node k,approximation,queueing networks,servers,informatics,distributed database systems,approximation theory,information management,scheduling,front end | Scheduling (computing),Computer science,Server,Approximation theory,Response time,Overtaking,Processor sharing,Real-time computing,Queueing theory,Distributed database,Distributed computing | Journal |
Volume | Issue | ISSN |
63 | 8 | Performance Evaluation |
Citations | PageRank | References |
3 | 0.39 | 1 |
Authors | ||
5 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| B. M. M. Gijsen | 1 | 18 | 2.61 |
| R. D. Van der Mei | 2 | 14 | 2.37 |
| P. Engelberts | 3 | 3 | 0.39 |
| j van den berg | 4 | 135 | 19.90 |
| K. M. C. van Wingerden | 5 | 3 | 0.39 |