Traffic Engineering for Real Time Communication Groups Using Network Calculus Based Schedulability Analysis
Conference: MMB 2006 - 13th GI/ITG Conference Measuring, Modelling and Evaluation of Computer and Communication Systems
03/27/2006 - 03/29/2006 at Nürnberg, Germany
Proceedings: MMB 2006
Pages: 14Language: englishTyp: PDFPersonal VDE Members are entitled to a 10% discount on this title
Zhang, Shu; Kreft, Lothar; Killat, Ulrich (Hamburg University of Technology, Department of Communication Networks, 4-06, 21071 Hamburg, Germany)
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.