Tight end-to-end per-flow delay bounds in FIFO multiplexing sink-tree networks

Lenzini, Luciano; Martorini, Linda; Mingozzi, Enzo; Stea, Giovanni

doi:10.1016/j.peva.2005.10.003

Cited by 80 publications

(76 citation statements)

References 14 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…We have published a preliminary analytical framework for single-switch networks [16]. The current paper extends that work with theoretical proofs and analysis for networks with multiple switches.…”

Section: ________mentioning

confidence: 83%

“…The two approaches are based on the same network architecture (switched Ethernet) and queuing mechanism (FCFS), but use different traffic models and analytical schemes to calculate the worst-case end-to-end delays [16]. We will first describe the delay estimation used in NC-LH, and then introduce a theory for transforming the strictly periodic traffic model used in our analysis into the rate-andburstiness-constrained model used in NC-LH.…”

Section: Relation To Network Calculusmentioning

confidence: 99%

“…However, all these NC-based solutions require modification when applied to a network with standard components such as switched Ethernet, e.g., implementing traffic shapers in the source nodes [12] [13] or supporting priorities to logical real-time channels [15], which significantly increase the cost and implementation complexity. Tight end-to-end delay bounds for FCFS sink-tree networks have been derived using NC [16]. However, the analysis is not generalized to common network topology.…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Guaranteed real-time communication in packet-switched networks with FCFS queuing

Fan

Jönsson

2009

Computer Networks

View full text Add to dashboard Cite

In this paper, we propose a feasibility analysis of periodic hard real-time traffic in packet-switched networks using First Come First Served (FCFS) queuing but no traffic shapers. Our work constitutes a framework that can be adopted for realtime analysis of switched low-cost networks like Ethernet without modification of the standard network components. Our analysis is based on a flexible network and traffic model, e.g., variable-sized frames, arbitrary deadlines and multiple switches. The correctness of our real-time analysis and the tightness of it for network components in single-switch networks are given by theoretical proofs. The performance of the end-to-end real-time analysis is evaluated by simulations. Moreover, our conceptual and experimental comparison studies between our analysis and the commonly used Network Calculus (NC) shows that our analysis can achieve better performance than NC in many cases.

show abstract

Section: ________mentioning

confidence: 83%

Section: Relation To Network Calculusmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Guaranteed real-time communication in packet-switched networks with FCFS queuing

Fan

Jönsson

2009

Computer Networks

View full text Add to dashboard Cite

show abstract

“…It is well known that bound are tight for a single server [1, Th 1.4.4]. There also are results for FIFO policy in some specific topologies [31]. [28,29] describe the first algorithm which computes the maximum end-toend delay for a given flow, as well as the maximum backlog at a server, for any feed-forward network topology under blind multiplexing, with concave arrival curves and convex service curves.…”

Section: Tight Results Under Blind Policymentioning

confidence: 99%

The PEGASE Project: Precise and Scalable Temporal Analysis for Aerospace Communication Systems with Network Calculus

Boyer

Navet

Olivé

et al. 2010

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract. With the increase of critical data exchanges in embedded real-time systems, the computation of tight upper bounds on network traversal times is becoming a crucial industrial need especially in safety critical systems. To address this need, the French project PEGASE grouping academics and industrial partners from the aerospace field has been undertaken to improve some key aspects of the Network Calculus and its implementation.

show abstract

“…End-to-end delay bounds for aggregate FIFO scheduling were derived in networks with general topologies [6], [15], [29], and networks with restricted topologies (e.g. acyclic or sinktree) [12], [22].…”

Section: Introductionmentioning

confidence: 99%

A Case for Decomposition of FIFO Networks

Ciucu

Liebeherr

2009

Ieee Infocom 2009

View full text Add to dashboard Cite

Abstract-Recent studies showing that the output of traffic flows at packet switches has similar characteristics as the corresponding input enables a decomposition analysis of a network where nodes can be studied in isolation, thus simplifying an endto-end analysis of networks. However, network decomposition results available today are mostly many-sources asymptotics. In this paper we explore the viability of network decomposition in a non-asymptotic regime with a finite number of flows. For traffic with Exponentially Bounded Burstiness (EBB) we derive statistical bounds for the output traffic at a FIFO buffer and compare them with bounds on the input. Evaluating the accuracy of the output bounds with exact results available for special cases and by numerical illustrations we find that conditions for network decomposition appear favorable even if the number of flows is relatively small.

show abstract

Tight end-to-end per-flow delay bounds in FIFO multiplexing sink-tree networks

Cited by 80 publications

References 14 publications

Guaranteed real-time communication in packet-switched networks with FCFS queuing

Guaranteed real-time communication in packet-switched networks with FCFS queuing

The PEGASE Project: Precise and Scalable Temporal Analysis for Aerospace Communication Systems with Network Calculus

A Case for Decomposition of FIFO Networks

Contact Info

Product

Resources

About