Delay Bounds under Arbitrary Multiplexing: When Network Calculus Leaves You in the Lurch...

Schmitt, Jens; Zdarsky, Frank A.; Fidler, Markus

doi:10.1109/infocom.2008.228

Cited by 69 publications

(24 citation statements)

References 27 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…More details about the PMOO analysis for general feed-forward networks, including its relation to other network calculus analyses, as well as an in-depth discussion, can be found in [14,15]. In sink tree networks, a specialized version can make use of the network structure.…”

Section: Calculation Of Performance Boundsmentioning

confidence: 99%

The Sensor Network Calculus as Key to the Design of Wireless Sensor Networks with Predictable Performance

Schmitt

Bondorf

Poe

2017

JSAN

View full text Add to dashboard Cite

Abstract:In this article, we survey the sensor network calculus (SensorNC), a framework continuously developed since 2005 to support the predictable design, control and management of large-scale wireless sensor networks with timing constraints. It is rooted in the deterministic network calculus, which it instantiates for WSNs, as well as it generalizes it in some crucial aspects, as for instance in-network processing. Besides presenting these core concepts of the SensorNC, we also discuss the advanced concept of self-modeling of WSNs and efficient tool support for the SensorNC. Furthermore, several applications of the SensorNC methodology, like sink and node placement, as well as TDMA design, are displayed.

show abstract

Section: Calculation Of Performance Boundsmentioning

confidence: 99%

The Sensor Network Calculus as Key to the Design of Wireless Sensor Networks with Predictable Performance

Schmitt

Bondorf

Poe

2017

JSAN

View full text Add to dashboard Cite

show abstract

“…First the notion of service curve can be defined in several manners, depending on the chosen model. To compute remaining service curves, one has to work with strict service curve [16], but to study FIFO scheduling policy, the notion of service curve is enough [17]. Real-Time calculus is mainly based on Network Calculus, but also uses concepts of real-time scheduling theory [18].…”

Section: Network Calculus : An Overview Of the State Of The Artmentioning

confidence: 99%

“…Up to our knowledge, the networks that have been extensively studied are: servers in tandem or sink trees [17,20,16]. Some other studies focus on general networks with cyclic dependencies, and exhibit networks where, against intuition, the load is very small in each server but can be unstable (that is, the backlog is not bounded).…”

Section: Network Calculus : An Overview Of the State Of The Artmentioning

confidence: 99%

See 1 more Smart Citation

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

“…Since our probabilistic analysis contains deterministic delay bounds (that are never violated) as a special case, our work also relates to the literature on worst-case end-to-end analysis [15], [22]. Several methods for computing statistical end-to-end delay bounds have been developed for EDF scheduling under additional assumptions on the operation of the scheduler.…”

Section: Introductionmentioning

confidence: 99%

On the Impact of Link Scheduling on End-to-End Delays in Large Networks

Liebeherr

Ghiassi-Farrokhfal

Burchard

2011

IEEE J. Select. Areas Commun.

View full text Add to dashboard Cite

Abstract-We seek to provide an analytical answer whether the impact of link scheduling algorithms on end-to-end delays diminishes on long network paths. The answer is provided through a detailed multi-hop delay analysis, which is applicable to a broad class of scheduling algorithms, and which can account for statistical multiplexing. The analysis is enabled by two contributions: (1) We derive a function that can characterize the available bandwidth at a buffered link for various scheduling algorithms. This characterization is sharp enough to provide necessary and sufficient conditions for satisfying worst-case delay bounds at a single link; (2) We obtain end-to-end delay bounds by solving an optimization problem, in which the service received on a multi-hop path is subsumed into a single function. Since our analysis captures the properties of a broad group of schedulers in a single parameter, it can provide insight how the choice of scheduling algorithms impacts end-to-end delay bounds. An important finding of this paper is that schedulers may exhibit noticeable performance differences which persist in a network setting with long paths.

show abstract

Delay Bounds under Arbitrary Multiplexing: When Network Calculus Leaves You in the Lurch...

Cited by 69 publications

References 27 publications

The Sensor Network Calculus as Key to the Design of Wireless Sensor Networks with Predictable Performance

The Sensor Network Calculus as Key to the Design of Wireless Sensor Networks with Predictable Performance

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

On the Impact of Link Scheduling on End-to-End Delays in Large Networks

Contact Info

Product

Resources

About