A Survey on Network Calculus Tools for Network Infrastructure in Real-Time Systems

Zhou, Boyang; Howenstine, Isaac; Limprapaipong, Siraphob; Cheng, Liang

doi:10.1109/access.2020.3043600

Cited by 12 publications

(5 citation statements)

References 53 publications

(47 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…As far as NC tools are concerned, a critical review of the available software packages is reported in [46]. However, the latter only reports functional comparisons (i.e., discusses the capabilities of each tool), and does not address performance issues.…”

Section: Related Workmentioning

confidence: 99%

Computationally Efficient Worst-Case Analysis of Flow-Controlled Networks With Network Calculus

Zippo

Stea²

2023

IEEE Trans. Inform. Theory

View full text Add to dashboard Cite

Networks with hop-by-hop flow control occur in several contexts, from data centers to systems architectures (e.g., wormhole-routing networks on chip). A worst-case endto-end delay in such networks can be computed using Network Calculus (NC), an algebraic theory where traffic and service guarantees are represented as curves in a Cartesian plane. NC uses transformation operations, e.g., the min-plus convolution, to model how the traffic profile changes with the traversal of network nodes. NC allows one to model flow-controlled systems, hence one can compute the end-to-end service curve describing the minimum service guaranteed to a flow traversing a tandem of flow-controlled nodes. However, while the algebraic expression of such an end-to-end service curve is quite compact, its computation is often intractable from an algorithmic standpoint: data structures tend to grow quickly to unfeasibly large sizes, making operations intractable, even with as few as three hops.In this paper, we propose computational and algebraic techniques to mitigate the above problem. We show that existing techniques (such as reduction to compact domains) cannot be used in this case, and propose an arsenal of solutions, which include methods to mitigate the data representation space explosion as well as computationally efficient algorithms for the minplus convolution operation. We show that our solutions allow a significant speedup, enable analysis of previously unfeasible case studies, and -since they do not rely on any approximation -still provide exact results.

show abstract

Section: Related Workmentioning

confidence: 99%

Computationally Efficient Worst-Case Analysis of Flow-Controlled Networks With Network Calculus

Zippo

Stea²

2023

IEEE Trans. Inform. Theory

View full text Add to dashboard Cite

show abstract

“…As far as NC tools are concerned, a critical review of the available software packages is reported in [43]. However, the latter only reports functional comparisons (i.e., discusses the capabilities of each tool), and does not address performance issues.…”

Section: Related Workmentioning

confidence: 99%

Computationally efficient worst-case analysis of flow-controlled networks with Network Calculus

Zippo¹,

Stea²

2022

Preprint

View full text Add to dashboard Cite

Networks with hop-by-hop flow control occur in several contexts, from data centers to systems architectures (e.g., wormholerouting networks on chip). A worst-case end-to-end delay in such networks can be computed using Network Calculus (NC), an algebraic theory where traffic and service guarantees are represented as curves in a Cartesian plane. NC uses transformation operations, e.g., the min-plus convolution, to model how the traffic profile changes with the traversal of network nodes. NC allows one to model flow-controlled systems, hence one can compute the end-to-end service curve describing the minimum service guaranteed to a flow traversing a tandem of flow-controlled nodes. However, while the algebraic expression of such an end-to-end service curve is quite compact, its computation is often untractable from an algorithmic standpoint: data structures tend to explode, making operations unfeasibly complex, even with as few as three hops.In this paper, we propose computational and algebraic techniques to mitigate the above problem. We show that existing techniques (such as reduction to compact domains) cannot be used in this case, and propose an arsenal of solutions, which include methods to mitigate the data representation space explosion as well as computationally efficient algorithms for the min-plus convolution operation. We show that our solutions allow a significant speedup, enable analysis of previously unfeasible case studies, and -since they do not rely on any approximation -still provide exact results.

show abstract

“…These often implement their own versions of min/max-plus algebra operations, often restricted to classes of curves matching the type of application network they target. A review of their capabilities is reported in [12]. For instance, DEBO-RAH [13] analyzes FIFO tandems of rate-latency curves traversed by leaky-bucket-shaped flows.…”

Section: Motivation and Significancementioning

confidence: 99%

Nancy: An efficient parallel Network Calculus library

Zippo¹,

Stea²

2022

SoftwareX

View full text Add to dashboard Cite

A Survey on Network Calculus Tools for Network Infrastructure in Real-Time Systems

Cited by 12 publications

References 53 publications

Computationally Efficient Worst-Case Analysis of Flow-Controlled Networks With Network Calculus

Computationally Efficient Worst-Case Analysis of Flow-Controlled Networks With Network Calculus

Computationally efficient worst-case analysis of flow-controlled networks with Network Calculus

Nancy: An efficient parallel Network Calculus library

Contact Info

Product

Resources

About