Erlang Model for Multi-Type Data Flow

The well-known Erlang teletraffic models were estimated to guild the infrastructure construction in communication societies for stable data requirements. However, with the development of information technology, requirements for data flow have become diverse. Particularly, when multi-type data flow (MDF) is used, games, videos, calls, etc. are all requirements. Thus, there may be a constant switch between these requirements, and also multi-type requirements at the same time. Consequently, the demands of users change over time, which prevents the traditional teletraffic analysis from being applied directly to infrastructure construction for MDF. This paper proposes new probabilistic models to discuss the blocking probabilities of MDF, whose requirements depend on the time of demand duration, and analyzes the models in three states: non-tolerance, tolerance and delay, in order to meet a more general and practical data flow utilization. When the requirement random variables are co-distributed with respect to time, we prove the practicability of the Erlang Multirate Loss Model (EMLM) under MDF cases, from a mathematical perspective by discretizing time and error analysis. An algorithm of pre-allocating resources is given to guild the construction of base resources for MDF.