Sojourn Times in Closed Queueing Networks. Kelly, F. P. & Pollett, P. K. Advances in Applied Probability, 15(3):638–656, September, 1983.
Sojourn Times in Closed Queueing Networks [link]Paper  doi  bibtex   
@Article{Kelly:1983:STC,
  author =       "F. P. Kelly and P. K. Pollett",
  title =        "Sojourn Times in Closed Queueing Networks",
  journal =      j-ADV-APPL-PROB,
  volume =       "15",
  number =       "3",
  pages =        "638--656",
  month =        sep,
  year =         "1983",
  CODEN =        "AAPBBD",
  DOI =          "https://doi.org/10.2307/1426623",
  ISSN =         "0001-8678 (print), 1475-6064 (electronic)",
  ISSN-L =       "0001-8678",
  bibdate =      "Sat May 3 07:41:38 MDT 2014",
  bibsource =    "http://www.jstor.org/stable/i262259;
                 http://www.math.utah.edu/pub/tex/bib/advapplprob.bib",
  URL =          "http://www.jstor.org/stable/1426623",
  acknowledgement = ack-nhfb,
  ajournal =     "Adv. Appl. Probab.",
  fjournal =     "Advances in Applied Probability",
  journal-URL =  "http://www.jstor.org/journals/00018678.html",
}

Downloads: 0