Statistics Seminars: Stability of the processor sharing network with simultaneous resource requirements
17 February 2006 14:00 in CM107" We look at the mathematics of bandwidth allocation and control in networks with simultaneous resource requirements (as is required in communications networks which require streaming applications). We are interested in the problem of stability. A control strategy (bandwidth allocation) is stable if the corresponding network is positive recurrent.
A network with given capacities and input rates is feasible if each resource has sufficient capacity for those call types which use it, and a control strategy is Pareto efficient (PE) if no call type may be allocated more bandwidth without decreasing that allocated to other call types. For every feasible network there exists at least one PE control strategy which is stable However, it is well-known that the simultaneous resource requirement for calls of each type means that, for all but the simplest networks, not every PE control strategy is stable.
We attempt to develop some characteristics of stable control startegies. "
Contact firstname.lastname@example.org for more information