Analysis of manufacturing blocking systems with network calculus

Authors:
Amit Bose;Xiaoyue Jiang;Bin Liu;Gang Li
Affiliations:
School of Mathematics and Statistics, Carleton University, Canada;Department of Industrial Engineering, Louisiana State University;Institute of Applied Mathematics, Academy of Mathematics and System Sciences, Chinese Academy of Sciences, China;School of Mathematics and Statistics, Carleton University, Canada
Venue:
Performance Evaluation
Year:
2006

Citing 8
Cited 2

An approximation method for tandem queues with blocking

Operations Research
Probabilistic modelling

Probabilistic modelling
Performance Guarantees in Communication Networks

Performance Guarantees in Communication Networks
Network calculus: a theory of deterministic queuing systems for the internet

Network calculus: a theory of deterministic queuing systems for the internet
Robust non-probabilistic bounds for delay and throughput in credit-based flow control

INFOCOM'96 Proceedings of the Fifteenth annual joint conference of the IEEE computer and communications societies conference on The conference on computer communications - Volume 2
Application of network calculus to guaranteed service networks

IEEE Transactions on Information Theory
On deterministic traffic regulation and service guarantees: a systematic approach by filtering

IEEE Transactions on Information Theory
Matrix extensions of the filtering theory for deterministic traffic regulation and service guarantees

IEEE Journal on Selected Areas in Communications

Modular performance analysis of cyclic dataflow graphs

EMSOFT '09 Proceedings of the seventh ACM international conference on Embedded software
End-to-end delay analysis for networks with partial assumptions of statistical independence: invited paper

Proceedings of the Fourth International ICST Conference on Performance Evaluation Methodologies and Tools

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, the manufacturing blocking system (MBS) is studied from the Network Calculus (NetCal) perspective. By dominating an MBS by a window flow controller (WFC), we obtain service curves for systems with instantaneous and noninstantaneous acknowledgements. The explicit expression for the system service curve leads to the optimal allocation of the buffer sizes, which guarantees the ideal system service curve: that is, the service curve for the system with no restrictions on the sizes of in-between buffers. This allocation is more efficient than one based on guarantees of individual service curves. In addition, a method of simulation of NetCal systems is developed exploiting the duality between arrival curves and strict service curves. Simulation experiments are conducted to show the tightness of the theoretical bounds obtained using NetCal.