A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Filters
On the way to a distributed systems calculus
2006
Performance Evaluation Review
Preserved Fulltext
Combined with the concept of packetizer this theory enables a true end-to-end analysis of distributed systems. ...
To this end this paper evolves a concise network calculus with scaling functions, which allow modelling a wide variety of transformation processes. ...
CONCLUSION We extended the framework of network calculus from networks with pure forwarding to distributed systems with various kinds of data processing. ...
doi:10.1145/1140103.1140310
fatcat:axvizwpypngdtffontaava6oee
On the way to a distributed systems calculus
2006
Proceedings of the joint international conference on Measurement and modeling of computer systems - SIGMETRICS '06/Performance '06
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Combined with the concept of packetizer this theory enables a true end-to-end analysis of distributed systems. ...
To this end this paper evolves a concise network calculus with scaling functions, which allow modelling a wide variety of transformation processes. ...
CONCLUSION We extended the framework of network calculus from networks with pure forwarding to distributed systems with various kinds of data processing. ...
doi:10.1145/1140277.1140310
dblp:conf/sigmetrics/FidlerS06
fatcat:ps5qccwxuzdmzdrcaffr2xpt3e
Dynamic demultiplexing in network calculus—Theory and application
2011
Performance evaluation (Print)
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Stochastic scaling allows one to put probabilistic bounds on how a flow is split inside the network. ...
During the last two decades, starting with the seminal work by Cruz, network calculus has evolved as a new theory for the performance analysis of networked systems. ...
analysis, and stochastic scaling with an end-to-end analysis. ...
doi:10.1016/j.peva.2010.12.002
fatcat:aj3lb4xwjzcvtpqcgqfe3nl4p4
Perspectives on network calculus
2012
Proceedings of the ACM SIGCOMM 2012 conference on Applications, technologies, architectures, and protocols for computer communication - SIGCOMM '12
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
To that end, we attempt to illustrate the fundamental concepts and features of network calculus in a systematic way, and also to rigorously clarify some key facts as well as misconceptions. ...
We touch in particular on the relationship between linear systems, classical queueing theory, and network calculus, and on the lingering issue of tightness of network calculus bounds. ...
, Hao Wang, Karthik Rajkumar, and all the students from the Stochastic Network Calculus class given at TU Berlin (WS/ [11] [12] . ...
doi:10.1145/2342356.2342426
dblp:conf/sigcomm/CiucuS12
fatcat:nafztulotfd7xbyb3gbtndtfju
Shape Calculus. A Spatial Mobile Calculus for 3D Shapes
2010
Scientific Annals of Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Behaviours are specified with a timed CCS-like process algebra using a notion of channel to naturally model binding sites on the surface of shapes. ...
We present a bio-inspired calculus for describing 3D shapes moving in a space. A shape forms a 3D process when combined with a behaviour. ...
biological systems (at any scale), but also gives the possibility to represent dierent levels of the same biological system in a uniform way. ...
doaj:acaa7ec714604aa9aed552e468c8a7e0
fatcat:mybzbkucvzg4fgxwhlkwfz6vza
An Algorithmic Information Calculus for Causal Discovery and Reprogramming Systems
[article]
2018
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Other Versions
To this end we performed experiments and validated the results on (1) a very large set of small graphs, (2) a number of larger networks with different topologies, and (3) biological networks from a widely ...
Based on these results we introduce a conceptual framework, a model-based interventional calculus and a reprogrammability measure with which to steer, manipulate, and reconstruct the dynamics of non- linear ...
To this end we performed experiments and validated the results on (1) a very large set of small graphs, (2) a number of larger networks with different topologies, and (3) biological networks from a widely ...
arXiv:1709.05429v11
fatcat:hldyt3tygjcqtft543scvbaamm
Boosting sensor network calculus by thoroughly bounding cross-traffic
2015
2015 IEEE Conference on Computer Communications (INFOCOM)
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Sensor Network Calculus (SensorNC) provides a framework for worst-case analysis of wireless sensor networks. ...
Even more important, it enables a localization of the information necessary to execute the calculations at the node level, thus enabling a distribution of the SensorNC analysis within a self-modeling WSN ...
We investigate the impact of Theorem 18 on the execution time of an end-to-end analysis of all flows in the network. ...
doi:10.1109/infocom.2015.7218387
dblp:conf/infocom/BondorfS15
fatcat:euqz65wy75hh3oxyvczej3tzzi
Itô Calculus and Quantum White Noise Calculus
[chapter]
2007
Stochastic Analysis and Applications
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
The present paper is an attempt to explain the motivations of these extensions with emphasis on open challenges. The last section includes a result obtained after the Abel Symposium. ...
Quantum white noise calculus is a third generalization, unifying the two above mentioned ones and bringing some unexpected insight into some old problems studied in different fields, such as the renormalization ...
This was the first quantum generalization of Itô calculus and opened the way to all subsequent ones. ...
doi:10.1007/978-3-540-70847-6_2
fatcat:womdloeipjaxvhc7uasytbjkim
An End-to-End Probabilistic Network Calculus with Moment Generating Functions
[article]
2006
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Other Versions
Recent research dispenses with the worst-case assumptions of network calculus to develop a probabilistic equivalent that benefits from statistical multiplexing. ...
The presented work features closed-form, end-to-end, probabilistic performance bounds that achieve the objective of scaling linearly in the number of servers in series. ...
ACKNOWLEDGEMENTS I gratefully acknowledge the valuable comments from A. Burchard, F. Ciucu, and J. Liebeherr who in particular called my attention to the scaling of end-to-end performance bounds. ...
arXiv:cs/0507004v2
fatcat:6kiixpoonnckbpq2cte3rgr4l4
A Calculus for Sensor Networks
[article]
2006
arXiv
pre-print
Preserved Fulltext
The Internet Archive has a preservation copy of this work in our general collections.
The file type is application/pdf.
Assuming that collisions, packet losses, and errors are dealt with at the lower layers of the protocol stack, we propose a Calculus for Sensor Networks (CSN) that captures the main abstractions for programming ...
Besides providing the syntax and semantics for the calculus, we show its expressiveness by providing implementations for several examples of typical operations on sensor networks. ...
ACKNOWLEDGEMENTS The authors gratefully acknowledge insightful discussions with Gerhard Maierbacher (Departamento de Ciência de Computadores, Faculdade de Ciências, Universidade do Porto). ...
arXiv:cs/0612093v1
fatcat:b5gl56r23jev5or7zuzsg5uh7a
Stochastic network calculus for end-to-end delays distribution evaluation on an avionics switched Ethernet
2007
IEEE Conference on Industrial Informatics
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2011; you can also visit the original URL.
The file type is application/pdf.
In this paper, we propose a stochastic network calculus approach in order to evaluate the distribution of end-to-end delays. ...
Deterministic network calculus gives a guaranteed upper bound on end-to-end delays, while simulation produces more accurate results on a given set of scenarios. ...
In this paper, we propose a stochastic network calculus approach in order to obtain a distribution of end-to-end delays. Such an approach could deal with arbitrarily large network configurations. ...
doi:10.1109/indin.2007.4384818
fatcat:h5xh25tt5bcovao25njyc47we4
Calculus Formation
1950
Journal of Periodontology
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
A close inspection of the figure reveals an interesting selective distribution of the
points depending on the origin of the saliva. ...
Neither has it been shown that the calcific deposits produc ed by Adamson! on the silk threads are, in any way, similar to oral calculus. Zander'? ...
doi:10.1902/jop.1950.21.4.211
pmid:14795365
fatcat:4xjmwjwxjbdpjiun3a5vc32zim
Lambda calculus as a workflow model
2009
Concurrency and Computation
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2011; you can also visit the original URL.
The file type is application/pdf.
This paper explains why lambda calculus is an appropriate model for workflow representation, and how a suitably efficient implementation can provide a wide range of capabilities to developers. ...
Such an approach avoids the restrictions often found in workflow languages, permitting the implementation of complex application logic and data manipulation. ...
The tasks are executed in such an order that if task A depends on task B, then B will be executed first, with its output data being transferred to A. ...
doi:10.1002/cpe.1448
fatcat:446xuff7lfei3aa2co6kw25hwi
Validating the Sensor Network Calculus by Simulations
2007
Proceedings of the 3rd International ICSTConference on Wireless Internet
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
It has been demonstrated that this so-called Sensor Network Calculus (SNC) is an effective network dimensioning tool as it allows us to calculate maximum message transfer delays and communication related ...
Network Calculus has been proposed and customized as a framework for worst-case analysis in wireless sensor networks (WSNs). ...
With this PMOOA-based end-to-end service curve the endto-end delay can then be calculated using standard network calculus results as for the TFA. ...
doi:10.4108/pwsn.2007.2290
dblp:conf/wicon/RoedigGS07
fatcat:mhi2bj2ubrgm5gdb3mgeunubcu
The PEGASE Project: Precise and Scalable Temporal Analysis for Aerospace Communication Systems with Network Calculus
[chapter]
2010
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2013; you can also visit the original URL.
The file type is application/pdf.
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 ...
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 ...
Since this is a generic method, it also handles heterogeneous networks and allows to consider an end-to-end path with, for example, a CAN and an AFDX segment. ...
doi:10.1007/978-3-642-16558-0_13
fatcat:jur324yo4nbpddmjilrsdyyzyq
« Previous
Showing results 1 — 15 out of 23,060 results