%0 Conference Paper %1 info3-inproceedings-2022-17 %A Geißler, Stefan %A Lange, Stanislav %A Haßllinger, Gerhard %A Tran-Gia, Phuoc %A Hoßfeld, Tobias %B 34st International Teletraffic Congress (ITC). , Shenzhen, China %D 2022 %K myown can %T Discrete-Time Analysis of Multi-Component Queuing Networks under Renewal Approximation %X The analytical and numerical performance evaluation of network components and distributed systems has been a staple in the networking community for many years. However, the ever growing complexity of modern systems and the need to gain detailed insights into systems consisting of many, interconnected components emphasizes the need for an extension to the classical single-component approach, and although approaches like Jackson Networks exist, their limited application scope lags behind the complexity of modern environments. To this end, we revisit existing models of the common Gi/Gi/1-oo queue, extend them to allow the concatenation of multiple queueing components, and evaluate the approximation error introduced through renewal approximation. We revisit previously performed parameter studies and evaluate the approximation error for a wide range of parameter combinations that we can solve through the power of modern computing equipment and efficient numerical implementations of our models. We show the main impact factors for the linear concatenation of queueing components as well as the split and superposition of processes. Our evaluations show that the renewal approximation can be applied to a wide range of parameters while still obtaining results within acceptable error margins.

@inproceedings{info3-inproceedings-2022-17, abstract = {The analytical and numerical performance evaluation of network components and distributed systems has been a staple in the networking community for many years. However, the ever growing complexity of modern systems and the need to gain detailed insights into systems consisting of many, interconnected components emphasizes the need for an extension to the classical single-component approach, and although approaches like Jackson Networks exist, their limited application scope lags behind the complexity of modern environments. To this end, we revisit existing models of the common Gi/Gi/1-oo queue, extend them to allow the concatenation of multiple queueing components, and evaluate the approximation error introduced through renewal approximation. We revisit previously performed parameter studies and evaluate the approximation error for a wide range of parameter combinations that we can solve through the power of modern computing equipment and efficient numerical implementations of our models. We show the main impact factors for the linear concatenation of queueing components as well as the split and superposition of processes. Our evaluations show that the renewal approximation can be applied to a wide range of parameters while still obtaining results within acceptable error margins.}, added-at = {2022-10-05T14:05:46.000+0200}, author = {Geißler, Stefan and Lange, Stanislav and Haßllinger, Gerhard and Tran-Gia, Phuoc and Hoßfeld, Tobias}, biburl = {https://www.bibsonomy.org/bibtex/28c21951031e3b311426bf294172acd00/uniwue_info3}, booktitle = {34st International Teletraffic Congress (ITC). , Shenzhen, China}, interhash = {1bcb8b16c91033ea73d756c632129b62}, intrahash = {8c21951031e3b311426bf294172acd00}, keywords = {myown can}, month = {9}, timestamp = {2022-10-05T14:05:46.000+0200}, title = {Discrete-Time Analysis of Multi-Component Queuing Networks under Renewal Approximation}, year = 2022 }