Admission controls for Erlang's loss system with service times distributed as a finite sum of exponential random variables.

Moretta, Brian; Ziedins, Ilze

Journal of Applied Mathematics and Decision Sciences (1998)

  • Volume: 2, Issue: 2, page 119-132
  • ISSN: 2090-3359

How to cite

top

Moretta, Brian, and Ziedins, Ilze. "Admission controls for Erlang's loss system with service times distributed as a finite sum of exponential random variables.." Journal of Applied Mathematics and Decision Sciences 2.2 (1998): 119-132. <http://eudml.org/doc/119871>.

@article{Moretta1998,
author = {Moretta, Brian, Ziedins, Ilze},
journal = {Journal of Applied Mathematics and Decision Sciences},
keywords = {single link loss network; threshold policy; robustness},
language = {eng},
number = {2},
pages = {119-132},
publisher = {Hindawi Publishing Corporation, New York},
title = {Admission controls for Erlang's loss system with service times distributed as a finite sum of exponential random variables.},
url = {http://eudml.org/doc/119871},
volume = {2},
year = {1998},
}

TY - JOUR
AU - Moretta, Brian
AU - Ziedins, Ilze
TI - Admission controls for Erlang's loss system with service times distributed as a finite sum of exponential random variables.
JO - Journal of Applied Mathematics and Decision Sciences
PY - 1998
PB - Hindawi Publishing Corporation, New York
VL - 2
IS - 2
SP - 119
EP - 132
LA - eng
KW - single link loss network; threshold policy; robustness
UR - http://eudml.org/doc/119871
ER -

NotesEmbed ?

top

You must be logged in to post comments.

To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.

Only the controls for the widget will be shown in your chosen language. Notes will be shown in their authored language.

Tells the widget how many notes to show per page. You can cycle through additional notes using the next and previous controls.

    
                

Note: Best practice suggests putting the JavaScript code just before the closing </body> tag.