<div dir="ltr">PROXIMO ENCUENTRO: Miércoles 15 de Mayo, 12:00hs.<div class="gmail_extra"><div class="gmail_quote"><div dir="ltr"><span style="font-size:13px;font-family:arial,sans-serif"><br>EXPOSITOR: Matthieu Jonckheere, Conicet<br>
<br></span><div><span style="font-size:13px;font-family:arial,sans-serif">TITULO: Beyond strict insensitivity<br></span><div class="gmail_extra">

<div class="gmail_quote"><div><div> </div><div><span style="font-size:13px;font-family:arial,sans-serif">LUGAR: Departamento de Matemática, Aula de</span><span style="font-size:13px;font-family:arial,sans-serif"> seminarios</span><span style="font-size:13px;font-family:arial,sans-serif">, 2do piso, Pabellón 1.</span></div>


<div><span style="font-size:13px;font-family:arial,sans-serif"><br></span></div></div><div><span style="font-size:13px;font-family:arial,sans-serif">RESUMEN: </span><p dir="ltr" style="line-height:1.15;margin-top:0pt;margin-bottom:0pt;text-align:justify" id="docs-internal-guid-5e386624-9fc1-d05b-0d4f-e696c3f7a17e">
<span style="font-size:12px;font-family:Arial;color:rgb(0,0,0);background-color:transparent;font-weight:normal;font-style:normal;font-variant:normal;text-decoration:none;vertical-align:baseline">One
 of the most notorious historical success (or even miracle) of queuing 
theory is the Erlang formula and its extensions to loss networks. Its 
applicability largely relies on its robustness to the call durations 
distribution: the well-known insensitivity property. Attempts to extend 
this formula to various forms of  modern networks (e.g. with best effort 
traffic) have been only partially successful, due to  the increased 
complexity and intrinsic asymmetries of the corresponding models.</span></p><p dir="ltr" style="line-height:1.15;margin-top:0pt;margin-bottom:0pt;text-align:justify"><span style="font-size:12px;font-family:Arial;color:rgb(0,0,0);background-color:transparent;font-weight:normal;font-style:normal;font-variant:normal;text-decoration:none;vertical-align:baseline"><br>
</span></p><p dir="ltr" style="line-height:1.15;margin-top:0pt;margin-bottom:0pt;text-align:justify"><span style="font-size:12px;font-family:Arial;color:rgb(0,0,0);background-color:transparent;font-weight:normal;font-style:normal;font-variant:normal;text-decoration:none;vertical-align:baseline">We
 examine here a relaxed robustness property of stationary queuing 
systems: the insensitivity of the large deviations characteristics to 
the distribution of job sizes. We show that this property holds for some
 fundamental models like bandwidth sharing networks under the 
proportional fair allocation, giving hope to develop efficient 
performance evaluation tools.</span></p><p dir="ltr" style="line-height:1.15;margin-top:0pt;margin-bottom:0pt;text-align:justify"><span style="font-size:12px;font-family:Arial;color:rgb(0,0,0);background-color:transparent;font-weight:normal;font-style:normal;font-variant:normal;text-decoration:none;vertical-align:baseline"></span><br>
</p><span style="font-size:16px;font-family:Arial;color:rgb(0,0,0);background-color:transparent;font-weight:bold;font-style:normal;font-variant:normal;text-decoration:none;vertical-align:baseline"></span></div></div>

Joint work with Sergio Lopez.<br></div></div></div></div><br></div></div>