Erlang Model for Multi-type Data Flow

TL;DR

This paper introduces a probabilistic Erlang-based model for analyzing multi-type data flow requirements, accounting for dynamic user demands and providing an algorithm for resource pre-allocation.

Contribution

It develops a novel Erlang multirate loss model for multi-type data flows, addressing the limitations of traditional teletraffic analysis in dynamic, multi-requirement scenarios.

Findings

Proves the practicability of EMLM through mathematical analysis.

Provides a resource pre-allocation algorithm for MDF.

Analyzes data flow requirements in three states: non-tolerance, tolerance, and delay.

Abstract

With the development of information technology, requirements for data flow have become diverse. When multi-type data flow (MDF) is used, games, videos, calls, etc. are all requirements. There may be a constant switch between these requirements, and also multiple requirements at the same time. Therefore, the demands of users change over time, which makes traditional teletraffic analysis not directly applicable. This paper proposes probabilistic models for the requirement of MDF, and analyzes in three states: non-tolerance, tolerance and delay. When the requirement random variables are co-distributed with respect to time, we prove the practicability of the Erlang Multirate Loss Model (EMLM) 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.