Traffic Engineering for Real Time Communication Groups Using Network Calculus Based Schedulability Analysis

In this paper, the problem of supporting a set of real time communication groups in a meshed core network is studied. Such kind of network is typically the backbone of an industrial control network, in which static routing for all communication groups is calculated off line and end-to-end delay bounds required by applications must be guaranteed. In this paper, we will analyze the performance of the popular WFQ scheduler based on the theory of network calculus. Combined with genetic algorithm as our routing selection algorithm, an optimized traffic engineering methodology is presented and its performance is evaluated in this paper.