Capacity Estimation of Time-Triggered Ethernet Network Based on Complex Network Theory

Abstract

Time-Triggered Ethernet (TTE) is a new Ethernet network communication technique based on mixed time service and event service. Transmission flow is classified by time critical characteristic as Time-Triggered (TT) flow, Rate-Constrained (RC) flow and Best-Effort (BE) flow. And compound traffic partition scheduling method is used for reasonable time planning of real-time and non-real-time traffic. This research further estimates the capacity of TTE network on the basis of the existed complex network modal and relative capacity theory, with partition scheduling characteristic of TTE. Furthermore, according to the characteristic that the edge with maximum betweenness is most likely to be congested, the relationship between capacity of TTE network and the edge betweenness can be established and utilized to estimate the capacity. Then, reasonability of the capability estimation method can be verified by relative experiment. With this research, it is more efficient to design and plan TTE network flow.