Are you an EPFL student looking for a semester project?
Work with us on data science and visualisation projects, and deploy your project as an app on top of Graph Search.
Publication
Are you an EPFL student looking for a semester project?
Work with us on data science and visualisation projects, and deploy your project as an app on top of Graph Search.
We consider the multiplexing of several variable bit rate (VBR) connections over one variable bit rate connection where the multiplexing uses a multiplexing buffer of size B. The VBR trunk is itself a connection and has a multidimensional connection descriptor, reflecting peek and sustainable rates. Given a cast function for the VBR trunk and a connection admission control (CAC) method for the input connections, we focus on the problem of finding the VBR trunk connection descriptor that minimizes the cost function and is able to accept ct given set of VBR input connections. First, we show that, under reasonable assumptions on the coat function, the optimization problem can be reduced to a simpler one. Then we consider the homogeneous, loss-free case, for which we give an explicit CAC method In that case, we find that, for all reasonable cost functions, the optimal VBR trunk is either of the CBR type, or is truly VBR, with a burst duration equal to the burst duration of the input connections. We motivate this study by showing that the optimal peak cell rate is fixed for a given B (thus for a CBR trunk), and a VBR choice can only be on improvement. Lastly, we take as example of cost function the equivalent capacity of the VBR trunk. Those results are expected to form the basis for a general method for a connection manager at a multiplexing node in an integrated services pocket network.
, ,
,