A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2004; you can also visit the original URL.
The file type is application/pdf.
Filters
A Calculus of Bounded Capacities
[chapter]
2003
Lecture Notes in Computer Science
Preserved Fulltext
This paper focuses on space control and develops an analysis of space usage in the context of an ambient-like calculus with bounded capacities and weighed processes, where migration and activation require ...
Acknowledgements We gratefully acknowledge the anonymous referees of ASIAN 2003 for careful reading and useful suggestions. ...
Resource allocation in BoCa is controlled by a system of capacity types that guarantees capacity bounds on computational ambients. ...
doi:10.1007/978-3-540-40965-6_14
fatcat:maayd4ckufcgrit6zimv3zkcem
The Generative Capacity of the Lambek–Grishin Calculus: A New Lower Bound
[chapter]
2011
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 2019; you can also visit the original URL.
The file type is application/pdf.
In this paper, we prove a new lower bound on the generative capacity of LG, namely the class of languages that are the intersection of a context-free language and the permutation closure of a context-free ...
The Lambek-Grishin calculus LG is a categorial grammar obtained by turning the one-sided sequents of the non-associative Lambek calculus NL into two-sided sequents, and adding interaction postulates between ...
Acknowledgements The author would like to thank Michael Moortgat and Vincent van Oostrom for their useful help and comments while supervising the MSc thesis of which this article is a result. ...
doi:10.1007/978-3-642-20169-1_8
fatcat:hiiuarcp2jeirpovzbmmeztfqm
An end-to-end stochastic network calculus with effective bandwidth and effective capacity
2013
Computer Networks
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.
Note that this fulltext copy is not of the "primary" version of this work. The version it corresponds to is:
2011 pre-print arXiv:1110.5098v1 fatcat:vwmjli23wrbmnczi274sytyud4Other Versions
Network calculus is an elegant theory which uses envelopes to determine the worst-case performance bounds in a network. ...
Similarly, the notion of effective capacity summarizes the time varying resource availability to the arrival traffic at a network node. ...
In Section 3, we derive end-to-end backlog and delay bounds using stochastic network calculus with effective bandwidth and effective capacity functions. ...
doi:10.1016/j.comnet.2012.09.003
fatcat:id4igmrp2zdkdnvpkmnc7g72ni
A Simple Proof of Linear Scaling of End-to-End Probabilistic Bounds using Network Calculus
[article]
2012
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.
Note that this fulltext copy is not of the "primary" version of this work. The version it corresponds to is:
2011 pre-print arXiv:1110.1801v3 fatcat:75jn3ztrlfbcfhhqwpot64ufieOther Versions
Statistical network calculus is the probabilistic extension of network calculus, which uses a simple envelope approach to describe arrival traffic and service available for the arrival traffic in a node ...
One of the key features of network calculus is the possibility to describe the service available in a network using a network service envelope constructed from the service envelopes of the individual nodes ...
We derive the probabilistic bounds on end-to-end delay and backlog in a network using the notion of effective bandwidth [8] and effective capacity [9] . ...
arXiv:1110.1801v5
fatcat:fkzlkybsw5dxlhg66hrkvitdhy
Latency Guarantee for Ubiquitous Intelligence in 6G: A Network Calculus Approach
[article]
2022
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 2022; you can also visit the original URL.
The file type is application/pdf.
of network calculus can model the tail characteristic of the delay distribution in UbiI. ...
In this article, the arrival curve and service curve of network calculus can well characterize the stochastic nature of wireless channels, the tail behavior of wireless systems and the E2E service curve ...
Then, we propose the system architecture and network model of UbiI and use network calculus to derive the upper bound of the E2E service delay of UbiI. ...
arXiv:2205.03115v1
fatcat:slczyjy7tvfopnc52nkoa5wpna
On the Flow-Level Delay of a Spatial Multiplexing MIMO Wireless Channel
[article]
2010
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.
In this work, we present a stochastic network calculus analysis of a MIMO system, operating in spatial multiplexing mode, using moment generating functions (MGF). ...
We derive probabilistic delay bounds for the system and show the impact of increasing the number of antennas on the delay bounds under various conditions, such as channel burstiness, signal strength and ...
MGF Stochastic Network Calculus Stochastic network calculus is a framework for QoS analysis and flow level performance evaluation of communication systems. ...
arXiv:1009.4091v1
fatcat:b6dlvfckpndelcpeci463tkzxq
Event Stream Calculus for Schedulability Analysis
[chapter]
2009
IFIP Advances in Information and Communication Technology
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.
Each task τ has, as available capacity, the capacity S left over by the tasks τ with a higher priority located on the same processing unit. ...
In the paper we will show the integration of the real-time calculus with event driven real-time analysis like the periodic or the sporadic task model. ...
Event Bound Function The amount of events occuring in some intervals I, therefore the value of the real-time calculus curves can be calculated with the following event bound function.
Definition 2. ...
doi:10.1007/978-3-642-04284-3_10
fatcat:gmgrkcvtrndkfdhgzulpvf2gzq
How stochastic network calculus concepts help green the power grid
2011
2011 IEEE International Conference on Smart Grid Communications (SmartGridComm)
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 2015; you can also visit the original URL.
The file type is application/pdf.
) of a given period can be obtained. ...
To deal with the fluctuation in both the power generation and demand, we borrow the ideas from stochastic network calculus and build a stochastic model for the power supply reliability with different renewable ...
ACKNOWLEDGMENT This research is supported by the State Scholarship Fund of China, and the National Natural Scientific Foundation of China (No. 61020106002 and No.60973107). ...
doi:10.1109/smartgridcomm.2011.6102385
dblp:conf/smartgridcomm/WangLL11
fatcat:mplwwlthyvfnzledb4cepvigly
A Stochastic Power Network Calculus for Integrating Renewable Energy Sources into the Power Grid
2012
IEEE Journal on Selected Areas in Communications
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.
To illustrate the validity of the model, we conduct a case study for the integration of renewable energy sources into the power system of an island off the coast of Southern California. ...
To deal with the fluctuation in both the power supply and demand, we extend and apply stochastic network calculus to analyze the power supply reliability with various renewable energy configurations. ...
The deterministic network calculus allows a broad scope of queueing scenarios and enables the derivation of tight bounds (see [8] , p. 27). ...
doi:10.1109/jsac.2012.120703
fatcat:fmfrtll37fgv5gjaj76vqocnka
Capacity Limits for a Cognitive Radio Network under Fading Channel
[chapter]
2011
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 2015; you can also visit the original URL.
The file type is application/pdf.
In this paper, performance evaluation of a cognitive radio network is conducted. The analysis is based on stochastic network calculus. ...
In addition, performance distribution bounds are obtained based on stochastic network calculus. Furthermore, numerical calculations are made to show the capacity limits under delay constraints. ...
Then, the capacity limit of SUs flow can be expressed as: Fig.3(b) shows three delay distribution bounds when η is set as 0. ...
doi:10.1007/978-3-642-23041-7_5
fatcat:dw2emtzn2nhxpe36qffqi2ntoa
An Approach using Demisubmartingales for the Stochastic Analysis of Networks
[article]
2012
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.
Other Versions
The accuracy of probabilistic end-to-end delay or backlog bounds computed using network calculus has always been a concern. ...
In particular, we show that reasonably accurate bounds are achieved by comparing the new bounds with the existing results for a network of M/M/1 queues. ...
The main advantage of using network calculus to do performance analysis of networks is that the network calculus allows to model a network of nodes as a single virtual node. ...
arXiv:1111.3063v3
fatcat:awtaizicgbdhhiuph7xemyk7tu
Network Calculus Applied to Verification of Memory Access Performance in SoCs
2007
2007 IEEE/ACM/IFIP Workshop on Embedded Systems for Real-Time Multimedia
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 2008; you can also visit the original URL.
The file type is application/pdf.
We further extend the flow concept with a degree and make use of the peak characteristics of a flow to tighten the bounds in the analysis. ...
We present a video playback case study and show that the proposed application of network calculus allows us to statically verify that all requirements on memory access latency are fulfilled. ...
We conclude that it is possible to apply network calculus for worst-case analysis of memory access performance in SoCs. ...
doi:10.1109/estmed.2007.4375796
dblp:conf/estimedia/HenrikssonWJB07
fatcat:ha72ylxjnbcnjlrki7v2keaawy
Low-Latency Millimeter-Wave Communications: Traffic Dispersion or Network Densification?
2018
IEEE Transactions on Communications
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.
V, we give a closed-form expression for the effective capacity for traffic dispersion, and derive lower and upper bounds to characterize the effective capacity for both network densification and the hybrid ...
upper bounds to characterize their actual effective capacity. ...
Based on MGF-based stochastic network calculus and effective capacity theory, respectively, we have derived performance bounds for probabilistic delay and effective capacity for the three schemes, which ...
doi:10.1109/tcomm.2018.2817199
fatcat:guwq2mp2ivhrjf6hfihqr3pet4
WOPANets: A tool for WOrst case Performance Analysis of embedded Networks
2010
2010 15th IEEE International Workshop on Computer Aided Modeling, Analysis and Design of Communication Links and Networks (CAMAD)
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 2012; you can also visit the original URL.
The file type is application/pdf.
WOPANets (WOrst case Performance Analysis of embedded Networks) is a design aided-decision tool for embedded networks. ...
In this paper, we describe the features set of WOPANets tool and we provide analysis in the case of a realistic embedded avionic network to show how the variation of some system's parameters can improve ...
The Network Calculus has recently attracted a lot of attention as a deterministic framework for worst case analysis of delay and backlog bounds for communication networks as for example, Switched Ethernet ...
doi:10.1109/camad.2010.5686958
dblp:conf/camad/MifdaouiA10
fatcat:rki2jjldlreixn4c7ystrtafti
A SysML Method with Network Dimensioning
2019
2019 International Symposium on Systems Engineering (ISSE)
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.
TTool is interfaced with WoPANets, a tool based on network calculus theory. An AFDX network serves as case study. ...
This particularly applies to a family of systems where increasing data exchanges between equipments create high requirements for the networks. ...
Network Calculus derives deterministic upper bounds on network parameters such as the backlog of network switches and the delay of messages. ...
doi:10.1109/isse46696.2019.8984437
fatcat:suqhiwjfjvd75ezpt3ojbznqxe
« Previous
Showing results 1 — 15 out of 30,311 results