Delay bounds for combined input–output switches with low speedup

Confronting the performances of a switched Ethernet network with industrial constraints by using the network calculus

“…Some models have been proposed: in References [7,11], a blackbox approach is used. In opposition, our contribution is to model in a constructive way as done by Giaccone et al [14], but with a more detailed functional decomposition and a more realistic correspondence with commercial devices.…”

“…For example, ATM uses the generic cell rate algorithm to control the traffic departure so that it is constrained by an arrival curve [18]. In this paper, it is proposed to use another representation, the leaky bucket controller, also used by Giaccone et al [14]. It is presented in Figure 2.…”

Determination of Delay Bound over Multi-hop Real-Time Switches with Virtual Output Queuing

“…The worst-case network delay for the seven ƀows can now be respectively determined as 180, 120, 150, 210, 90, 150, and 210 ms, because all trafſc passing through the switches is feasible, as can be checked using (1) and (2). At the receiver side, for simplicity, we need to perform the feasibility check only at switch S 8 , a bottleneck, as follows: Figures 5 and 6 compare the worst-case and average network delays at each of seven measurement points (immediately after the packet leaves each 8 × 8 crossbar real-time switch) when their clock periods increase additively as 1, 3,5,7,9,11, and 13 ms ( Figure 5), or exponentially as 1,2,4,8,16,32, and 64 ms (Figure 6), and their port capacities are all 1 Gb/s. The sum of the queuing and switching delays d sw,y incurred by the yth switch, which is used in (10), is obtained by averaging the results for 1000 iterations.…”

“…Considerable effort has been devoted both to analyzing the performance of high-speed switches and routers and to obtaining delay bounds [1], [2]. The scheduling of crossbar switches can be reduced to a graph matching problem, and fast algorithms for obtaining such matches have been studied [3].…”

A design process of switched Ethernet architectures according to real-time application constraints

“…Some models have been proposed : in Song (2001) and in Jasperneite et al (2002), a blackbox approach is used. In opposition, our contribution is to model in a constructive way as done by Giaccone et al (2004), but with a more detailed functional decomposition. Phipps (1999) and Seifert (2000) decompose the switching architecture in three main functional components :…”