Network calculus. A theory of deterministic queueing systems for the Internet

From MaRDI portal
Revision as of 00:48, 30 January 2024 by Import240129110155 (talk | contribs) (Created automatically from import240129110155)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:5940717

DOI10.1007/3-540-45318-0zbMath0974.90003OpenAlexW4247726752WikidataQ29395059 ScholiaQ29395059MaRDI QIDQ5940717

Jean-Yves Le Boudec, Patrick Thiran

Publication date: 20 August 2001

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-45318-0




Related Items (41)

Schedulability analysis of Ethernet audio video bridging networks with scheduled traffic supportPrice-coupled scheduling for differentiated services: Gcµversus GPSNetwork calculus for bounding delays in feedforward networks of FIFO queueing systemsFast weak–KAM integrators for separable Hamiltonian systemsCache-aware timing analysis of streaming applicationsFractal teletraffic delay bounds in computer networksA MILP approach to DRAM access worst-case analysisWorkload correlations in multi-processor hard real-time systemsDelay-constrained routing problems: accurate scheduling models and admission controlEnvelope modeling of renewable resource variability and capacityCausality problem in real-time calculusAn analytical model for Network-on-Chip with finite input bufferPeak temperature analysis and optimization for pipelined hard real-time systemsExtending the network calculus algorithmic toolbox for ultimately pseudo-periodic functions: pseudo-inverse and compositionMarkov decision processes with burstiness constraintsPerformance evaluation and dimensioning of \(GI^X/M/c/N\) systems through kernel estimationmBm-based scalings of traffic propagated in internetPerformance of scheduling policies in adversarial networks with non-synchronized clocksNumerical analysis of worst-case end-to-end delay bounds in FIFO tandem networksAsymptotic identity in min-plus algebra: a report on CPNSContainer of (min,+)-linear systemsPlayout in slotted CBR networks: Single and multiple nodesA formal approach to the WCRT analysis of multicore systems with memory contention under phase-structured task setsA Max-Sum algorithm for training discrete neural networksGraph-based models for real-time workload: a surveyTiming analysis of rate-constrained traffic in TTEthernet using network calculusReal-time worst-case temperature analysis with temperature-dependent parametersReactive speed control in temperature-constrained real-time systemsModelling routing phenomenon with bounds estimation in dioidsBuffer planning for application-specific networks-on-chip designA Stochastic Ordering Property for Leaky Bucket Regulated Flows in Packet NetworksProbabilistic NetKATOn the Identifiability of Link Service Curves from End-Host MeasurementsAn algorithmic toolbox for network calculusEnd-to-end deadlines over dynamic topologiesResponse-Time Analysis of ROS 2 Processing Chains Under Reservation-Based SchedulingUnnamed ItemFFOB: efficient online mode-switch procrastination in mixed-criticality systemsParametric multisingular hybrid Petri nets: formal definitions and analysis techniquesQuantitative characterization of event streams in analysis of hard real-time applicationsResponse time evaluation of industrial-scale distributed control systems by discrete event systems formalisms







This page was built for publication: Network calculus. A theory of deterministic queueing systems for the Internet