optimal multiplexing of heterogeneous traffic with hard constraint
Considered are optimal dynamic policies for multiplexing &Kgr; + 1 heterogeneous traffic types onto a single communication channel. The packet types arrive to the channel according to independent Poisson processes. The service requirements are exponential with type dependent means. The optimization criterion is to minimize a linear combination of the average delays for packet types 1 to &Kgr; , while simultaneously subjecting the average delay of type-0 packets to a hard constraint. The optimal multiplexing policy is shown to be a randomized modification of the  &mgr;c rule. The optimization problem is thereby reduced to a problem of finding the optimal randomization factor; an algorithm, which can be implemented in real time, is given to do this for two particular cases.
optimality multiplexing heterogeneity traffic constraint dynamic policy types communication dependencies process requirements combinational delay randomization algorithm real-time