Results 31 to 40 of about 152,325 (279)
Sharp bounds in stochastic network calculus [PDF]
ACM SIGMETRICS Performance Evaluation Review, 2013 The practicality of the stochastic network calculus (SNC) is often questioned on grounds of potential looseness of its performance bounds. In this paper it is uncovered that for bursty arrival processes (specifically Markov-Modulated On-Off (MMOO)), whose amenability to per-flow analysis is typically proclaimed as a highlight of SNC, the bounds can ...
Ciucu, Florin +2 more
openaire +3 more sources
Performance analysis of a Master/Slave switched Ethernet for military embedded applications [PDF]
, 2010 Current military communication network is a generation old and is no longer effective in meeting the emerging requirements imposed by the next generation military embedded applications.
Fraboul, Christian +2 more
core +2 more sources
An Algorithmic Toolbox for Network Calculus [PDF]
Discrete Event Dynamic Systems, 2007 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Bouillard, Anne, Thierry, Eric
openaire +3 more sources
Detailed Consideration of Graphical Calculation of Min-Plus Convolution in Deterministic Network Calculus [PDF]
International Journal of Electronics and Telecommunications, 2018 The convolution operation used in deterministic network calculus differs from its counterpart known from the classic systems theory. A reason for this lies in the fact that the former is defined in terms of the so-called min-plus algebra.
Andrzej Borys
doaj +1 more source
Improved Delay Bound for a Service Curve Element with Known Transmission Rate
, 2019 Network calculus is often used to prove delay bounds in deterministic networks, using arrival and service curves. We consider a FIFO system that offers a rate-latency service curve and where packet transmission occurs at line rate without pre-emption ...
Boudec, Jean-Yves Le +2 more
core +1 more source
On Time Synchronization Issues in Time-Sensitive Networks with Regulators and Nonideal Clocks
, 2020 Flow reshaping is used in time-sensitive networks (as in the context of IEEE TSN and IETF Detnet) in order to reduce burstiness inside the network and to support the computation of guaranteed latency bounds.
Boudec, Jean-Yves Le, Thomas, Ludovic
core +1 more source
Algebraic Approach for Performance Bound Calculus on Transportation Networks [PDF]
Transportation Research Record: Journal of the Transportation Research Board, 2013 An application of the basic results of deterministic network calculus theory to road traffic flow theory is presented. Network calculus is a theory based on min-plus algebra. This calculus uses algebraic techniques to compute performance bounds in communication networks, such as maximum end-to-end delays and backlogs. The objective of this paper is to
Farhi, Nadir +2 more
openaire +2 more sources
Centralized QoS Routing Using Network Calculus for SDN-Based Streaming Media Networks
IEEE Access, 2019 Streaming media transmission requires strict quality of service (QoS) parameters such as maximum delay and delay jitter. An effective streaming media routing algorithm is a key factor in ensuring QoS.
Sheng Zhu +5 more
doaj +1 more source
Model checking probabilistic and stochastic extensions of the pi-calculus [PDF]
, 2009 We present an implementation of model checking for probabilistic and stochastic extensions of the pi-calculus, a process algebra which supports modelling of concurrency and mobility.
Norman, G. +3 more
core +3 more sources
Towards Certifying Network Calculus [PDF]
, 2013 Network Calculus (NC) is an established theory for determining bounds on message delays and for dimensioning buffers in the design of networks for embedded systems. It is supported by academic and industrial tool sets and has been widely used, including for the design and certification of the Airbus A380 AFDX backbone.
Mabille, Etienne +3 more
openaire +1 more source