Performance Bounds in Switched Ethernet Onboard Networks

In modern aeronautic onboard networks, a driving force exists to integrate multiple communication networks onto a single switched Ethernet network. Goals for future onboard communication networks are low weight, low price, high bandwidth, and certifiable safety. The certification process for such a novel system requires hard performance guarantees on latency and jitter. The state-of-the-art approach to determine worst case bounds is Network Calculus, and the tightness of Network Calculus is subject to ongoing research. We propose a packetized model based on a mixed-integer program, which is able to express the worst-case in a closed-form representation. The proposed algorithm allows better mapping of packetized switched networks compared to known Network Calculus approaches. We finally show that the hard performance bounds are guaranteed, which opens the investigated switched cabin network for a wide range of applications.

[1]  Jürgen Teich,et al.  Accuracy of Ethernet AVB time synchronization under varying temperature conditions for automotive networks , 2011, 2011 48th ACM/EDAC/IEEE Design Automation Conference (DAC).

[2]  P. M. Melliar-Smith,et al.  Byzantine clock synchronization , 1984, PODC '84.

[3]  Murad S. Taqqu,et al.  On the Self-Similar Nature of Ethernet Traffic , 1993, SIGCOMM.

[4]  Jens B. Schmitt,et al.  Searching for Tight Performance Bounds in Feed-Forward Networks , 2010, MMB/DFT.

[5]  Sally Floyd,et al.  Wide area traffic: the failure of Poisson modeling , 1995, TNET.

[6]  Jürgen Jasperneite,et al.  A performance study of Ethernet Audio Video Bridging (AVB) for Industrial real-time communication , 2009, 2009 IEEE Conference on Emerging Technologies & Factory Automation.

[7]  Yong Liu,et al.  Stochastic Network Calculus , 2008 .

[8]  Jean-Yves Le Boudec,et al.  "Pay bursts only once" does not hold for non-FIFO guaranteed rate nodes , 2005, Perform. Evaluation.

[9]  Nick McKeown,et al.  A Starvation-free Algorithm For Achieving 100% Throughput in an Input- Queued Switch , 1999 .

[10]  J. Mitchell.  Branch-and-Cut Algorithms for Combinatorial Optimization Problems , 1988 .

[11]  Yuming Jiang.  A basic stochastic network calculus , 2006, SIGCOMM 2006.

[12]  Ivan Martinovic,et al.  Improving Performance Bounds in Feed-Forward Networks by Paying Multiplexing Only Once , 2008, MMB.

[13]  Lars Völker,et al.  IEEE 802.1AS time synchronization in a switched Ethernet based in-car network , 2011, 2011 IEEE Vehicular Networking Conference (VNC).

[14]  Jean-Yves Le Boudec,et al.  Network Calculus: A Theory of Deterministic Queuing Systems for the Internet , 2001 .

[15]  Christian Fraboul,et al.  Methods and Tools for the Temporal Analysis of Avionic Networks , 2010 .

[16]  William Stallings,et al.  High Speed Networks and Internet , 2002 .

[17]  Evangelos Vayias,et al.  On the building blocks of quality of service in heterogeneous IP networks , 2005, IEEE Communications Surveys & Tutorials.

[18]  Frank Leipold,et al.  Wireless UWB Aircraft Cabin Communication System , 2011 .

[19]  David K. Smith.  Theory of Linear and Integer Programming , 1987 .

[20]  Birgit Vogel-Heuser,et al.  PERFORMANCE ANALYSIS OF INDUSTRIAL ETHERNET NETWORKS BY MEANS OF TIMED MODEL-CHECKING , 2006 .

[21]  Jens B. Schmitt,et al.  Delay Bounds under Arbitrary Multiplexing: When Network Calculus Leaves You in the Lurch... , 2008, IEEE INFOCOM 2008 - The 27th Conference on Computer Communications.

[22]  Jens B. Schmitt,et al.  The DISCO network calculator: a toolbox for worst case analysis , 2006, valuetools '06.

[23]  Steven Martin,et al.  Schedulability analysis of flows scheduled with FIFO: application to the expedited forwarding class , 2006, Proceedings 20th IEEE International Parallel & Distributed Processing Symposium.

[24]  Mark G. Karpovsky,et al.  Application of network calculus to general topologies using turn-prohibition , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.