Alireza Shekaramiz
ABSTRACT
Feedback mechanisms are integral components of network protocols and traffic control algorithms. Their performance evaluation is hard due to intricate time correlations introduced by feedback. Network calculus has been successfully applied for the analysis of feedback mechanisms in deterministic systems. However, an extension to random systems has remained an open problem for more than a decade. We present a stochastic network calculus analysis of a random system with feedback, specifically, a window flow control system with random service and fixed feedback delay. We quantify the service impediment due to the feedback mechanism by deriving statistical lower bounds on the available service, and obtain complementary upper bounds. We also discover special cases where an exact description of the service is feasible.
- A. Shekaramiz, J. Liebeherr, A. Burchard. Window flow control systems with random service. arXiv:1507.04631, July 2015.Google Scholar
- R. Agrawal, R. L. Cruz, C. Okino, and R. Rajan. Performance bounds for flow control protocols. IEEE/ACM Trans. Netw., 7(3):310--323, June1999. Google ScholarDigital Library
- C.-S. Chang. Performance Guarantees in Communication Networks. Springer Verlag, 2000. Google ScholarDigital Library
- M. Fidler. An end-to-end probabilistic network calculus with moment generating functions. In IEEE IWQoS, pages 261--270, June 2006.Google ScholarCross Ref
- M. A. Beck, J. B. Schmitt. Window flow control in stochastic network calculus - The general service case In Proc. ACM VALUETOOLS, January 2016. Google ScholarDigital Library
Index Terms
- Network Calculus Analysis of a Feedback System with Random Service
Recommendations
Network Calculus Analysis of a Feedback System with Random Service
Performance evaluation reviewFeedback mechanisms are integral components of network protocols and traffic control algorithms. Their performance evaluation is hard due to intricate time correlations introduced by feedback. Network calculus has been successfully applied for the ...
Survey of deterministic and stochastic service curve models in the network calculus
In recent years service curves have proven a powerful and versatile model for performance analysis of network elements, such as schedulers, links, and traffic shapers, up to entire computer networks, like the Internet. The elegance of the concept of ...
Generalizing window flow control in bivariate network calculus to enable leftover service in the loop
Network calculus is a methodology to analyze queueing networks in a (probabilistic) worst-case setting. To that end, many results have been presented for different arrival and service processes and under different network topologies. Yet, in the ...
Comments