Sojourn times in Jackson networks
Jackson queuing networks have a lot of practical applications, mainly in the modelling of computation and telecommunications networks. Evidently the time that one customer - a person, a job, a message … – spends in this kind of systems, its sojourn time, is an important measure of its performance. I...
| Autor principal: | |
|---|---|
| Outros Autores: | |
| Formato: | article |
| Idioma: | eng |
| Publicado em: |
2013
|
| Assuntos: | |
| Texto completo: | http://hdl.handle.net/10071/5672 |
| País: | Portugal |
| Oai: | oai:repositorio.iscte-iul.pt:10071/5672 |
| Resumo: | Jackson queuing networks have a lot of practical applications, mainly in the modelling of computation and telecommunications networks. Evidently the time that one customer - a person, a job, a message … – spends in this kind of systems, its sojourn time, is an important measure of its performance. In this work the practical known results about the sojourn time distribution are collected and presented. |
|---|