Please use this identifier to cite or link to this item: http://hdl.handle.net/10071/5672
Full metadata record
DC FieldValueLanguage
dc.contributor.authorFerreira, Manuel Alberto M.-
dc.contributor.authorAndrade, Marina-
dc.date.accessioned2013-10-01T17:52:20Z-
dc.date.available2013-10-01T17:52:20Z-
dc.date.issued2012-
dc.identifier.citationFerreira, M. A. M., & Andrade, M. (2012). Sojourn times in Jackson networks. Aplimat - Journal of Applied Mathematics, 5(3), 225-240. http://hdl.handle.net/10071/5672-
dc.identifier.issn1337-6365por
dc.identifier.urihttp://hdl.handle.net/10071/5672-
dc.description.abstractJackson 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.por
dc.language.isoengpor
dc.publisherSlovak University of Technologypor
dc.rightsopenAccesspor
dc.subjectJackson networkspor
dc.subjectSojourn timepor
dc.subjectRandomisation procedurepor
dc.titleSojourn times in Jackson networkspor
dc.typearticlepor
dc.pagination225-240por
dc.publicationstatusPublicadopor
dc.peerreviewedSimpor
dc.journalAplimat - Journal of Applied Mathematicspor
dc.distributionInternacionalpor
dc.volume5por
dc.number3por
dc.subject.fosDomínio/Área Científica::Ciências Naturais::Matemáticas-
Appears in Collections:DM-RI - Artigos em revistas científicas internacionais com arbitragem científica

Files in This Item:
File Description SizeFormat 
article_hdl5672.pdf347,13 kBAdobe PDFView/Open


FacebookTwitterDeliciousLinkedInDiggGoogle BookmarksMySpaceOrkut
Formato BibTex mendeley Endnote Logotipo do DeGóis Logotipo do Orcid 

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.