Journal ArticleDOI
Tight end-to-end per-flow delay bounds in FIFO multiplexing sink-tree networks
Reads0
Chats0
TLDR
This paper derives per-flow end-to-end delay bounds in aggregate scheduling networks in which per-egress (or sink-tree) aggregation is in place, and flows traffic is aggregated according to a FIFO policy based on Network Calculus.About:
This article is published in Performance Evaluation.The article was published on 2006-10-01. It has received 99 citations till now. The article focuses on the topics: Network delay & End-to-end delay.read more
Citations
More filters
Proceedings ArticleDOI
Compositional Analysis Framework Using EDP Resource Models
TL;DR: This work introduces the explicit deadline periodic (EDP) resource model, and presents compositional analysis techniques under EDF and DM, and shows that these techniques are bandwidth optimal, in that they do not incur any bandwidth overhead in abstraction or composition.
Journal ArticleDOI
Survey of deterministic and stochastic service curve models in the network calculus
TL;DR: In this paper, the authors survey the state-of-the-art of the deterministic and the recent probabilistic network calculus and discuss the use of service curves, its use in the network calculus, and the relation to systems theory under the min-plus algebra.
Deterministic and stochastic service curve models in the network calculus
TL;DR: The state-of-the-art of the deterministic and the recent probabilistic network calculus is surveyed and stochastic service curve models allow utilizing the statistical multiplexing gain in a network calculus framework that features end-to-end network analysis by convolution of service curves.
Proceedings ArticleDOI
Modeling and Worst-Case Dimensioning of Cluster-Tree Wireless Sensor Networks
TL;DR: The fundamental performance limits of cluster-tree wireless sensor networks are shown by the provision of a simple and effective methodology for the design of such WSNs.
Proceedings ArticleDOI
Delay Bounds under Arbitrary Multiplexing: When Network Calculus Leaves You in the Lurch...
TL;DR: This paper addresses the problem of bounding the delay of individual traffic flows in feed-forward networks under arbitrary multiplexing and finds that direct application of network calculus results in loose bounds even in seemingly simple scenarios.
References
More filters
An Architecture for Differentiated Service
TL;DR: An architecture for implementing scalable service differentiation in the Internet achieves scalability by aggregating traffic classification state which is conveyed by means of IP-layer packet marking using the DS field [DSFIELD].
Multiprotocol Label Switching Architecture
TL;DR: This document specifies the architecture for Multiprotocol Label Switching (MPLS).
Integrated Services in the Internet Architecture: an Overview
TL;DR: This memo discusses a proposed extension to the Internet architecture and protocols to provide integrated services, i.e., to support real- time as well as the current non-real-time service of IP.
Journal ArticleDOI
A calculus for network delay. I. Network elements in isolation
TL;DR: A calculus is developed for obtaining bounds on delay and buffering requirements in a communication network operating in a packet switched mode under a fixed routing strategy, and burstiness constraints satisfied by the traffic that exits the element are derived.
Book
Network Calculus: A Theory of Deterministic Queuing Systems for the Internet
TL;DR: The application of Network Calculus to the Internet and basic Min-plus and Max-plus Calculus and Optimal Multimedia Smoothing and Adaptive and Packet Scale Rate Guarantees are studied.