Results 241 to 250 of about 152,325 (279)

A Calculus for Mobile Network Systems

2002
The rapidly increasing demand for ubiquitous communication has led to the widespread use of wireless networks. These systems consist of a group of independently executing components which may migrate through some space during the course of the computation, and the connectivity between the components changes with their migration [5, 6].
Huang, J., Verschueren, A., Aalderink, H., Lukkien, J.   +3 more
openaire   +3 more sources

Stochastischer Network Calculus

2011
Der Deterministische Network Calculus weist zwei Schwachpunkte auf, die die Erweiterung hin zum Stochastischen Network Calculus begrunden: 1. Der Deterministische Network Calculus betrachtet ein „Worst-case”-Szenario. Gemunzt auf den Ankunftsprozess bedeutet dies, dass die Arrival Curve sich an der Spitzenrate des Ankunftsprozesses – und nicht ...
openaire   +1 more source

On applying stochastic network calculus

Frontiers of Computer Science, 2013
Performance evaluation plays a crucial role in the design of network systems. Many theoretical tools, including queueing theory, effective bandwidth and network calculus, have been proposed to providemodeling mechanisms and results. While these theories have been widely adopted for performance evaluation, each has its own limitation.
Lin C., Deng Y., Jiang Y.
openaire   +1 more source

Deterministischer Network Calculus

2011
Der Deterministische Network Calculus basiert auf dem Einhullenden-Konzept und nutzt die Min-Plus-Algebra zur Ableitung von Schranken fur einzelne Knoten wie fur eine Kette von Knoten, die dann in einem virtuellen Knoten zusammengefasst werden. Konfrontiert mit dem in der Regel unbekannten stochastischen Verhalten von realen Anwendungen, stellt sich ...
openaire   +1 more source

A Max-plus Network Calculus

2009 Eighth IEEE/ACIS International Conference on Computer and Information Science, 2009
Network calculus is a theory of deterministic queuing systems, which is based on min-plus algebra. This paper shows a novel network calculus that based on other dioids, that is max-plus algebra. Performance bounds can be obtained by max-plus network calculus.
Baohua Fan, Heying Zhang, Wenhua Dou
openaire   +1 more source

Network Verification: Calculus and solvers

2014 First International Science and Technology Conference (Modern Networking Technologies) (MoNeTeC), 2014
We examine calculus and solvers for Network Verification. As starting point we take the SecGuru tool that checks network access restrictions in the Microsoft Azure public cloud infrastructure. The tool is based on the Satisfiability Modulo Theories solver Z3.
N. Bjorner, K. Jayaraman
openaire   +1 more source

New perspectives on network calculus

ACM SIGMETRICS Performance Evaluation Review, 2008
Originated in communications engineering and theoretically rooted in idempotent analysis, the theory of network calculus (NetCal) presents an elegant methodology for offering performance guarantees in deterministic queuing systems. In this research we developed two new formulations of Net-Cal, each of which bears some unique insights.
openaire   +1 more source

NETWORK SYNTHESIS AND VARELA'S CALCULUS

International Journal of General Systems, 1978
Abstract Network models are given for self-referential expressions in the calculus of indications (of G. Spencer Brown). A precise model is presented for the behavior of such expressions in time. The extension of Brown's calculus by F. Varela is then shown to describe behavior invariant properties of these networks.
openaire   +1 more source

The Stochastic Network Calculus Methodology

2009
The stochastic network calculus is an evolving new methodology for backlog and delay analysis of networks that can account for statistical multiplexing gain. This paper advances the stochastic network calculus by deriving a network service curve, which expresses the service given to a flow by the network as a whole in terms of a probabilistic bound ...
Deah J. Kadhim, Saba Q. Jobbar, Wei Liu, Wenqing Cheng   +3 more
openaire   +1 more source

On Probabilistic Network Calculus

2002
Deterministic Network Calculus provides an elegant way to compute performance bounds, e.g. bounds on backlog, delay-jitter, loss ratio, and like. Such bounds are deterministic worst-case bounds. In some cases it is practically sensible that individual flows, which share a network element, are supposed statistically independent.
openaire