Statistical multiplexing and mix-dependent alternative routing in multiservice VP networks

We consider problems in traffic integration and routing for virtual path (V P)-based multiservice networks. The objective is to exploit statistical mul tiplexing among various traffic types in order to improve system utilizatio n. Difficulties arise due to statistical multiplexing since a connection's bandwidth requirement depends on the characteristics of the interfering tra ffic. We first consider whether segregating heterogeneous traffic with diff erent quality of service (QoS) requirements on separate VP's is desirable. Next we consider routing heterogeneous permanent connections given a predef ined traffic type mix onto multiple VP's between a source destination pair. We show that it is not necessarily advantageous to have each VP carry ever y traffic type. In fact, perhaps surprisingly, an optimum solution to this problem suggests that only a small number of traffic types, or even homogen eous traffic, need be present on each VP. Based on this observation, we pro pose a simple alternative routing algorithm with routing sequences dependin g on the traffic mix.