Quality-of-Service in NoCs 147
worst-case bounds in the previous subsection. The authors present a recursive
algorithm to consider the reciprocal impact of all incoming flows to a switch
on the others and the values are computed following a reverse order of the
dependencies.
Several works have applied network calculus for performance analysis of
Asynchronous Transfer Mode (ATM) traffic in the Internet with different ser-
vices and several other networks. In [30], the authors present worst-case delay
bounds for best-effort traffic using network calculus. They assume that the
application traffic can be characterized in terms of arrival curves at each core.
The router service model is abstracted by a service curve. The objective of the
work is to derive the equiv ...