<?xml version="1.0" encoding="UTF-8"?>
<xml><records><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">A. Badrah</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Tadeusz Czachórski</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Joanna Domańska</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">J. Fourneau</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">F. Quessette</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Performance evaluation of multistage interconnection networks with blocking - discrete and continuous time Markov model</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2002</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Archiwum Informatyki Teoretycznej i Stosowanej</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><VOLUME><style face="normal" font="default" size="100%">14</style></VOLUME><NUMBER><style face="normal" font="default" size="100%">2</style></NUMBER><title><style face="normal" font="default" size="100%">Performance evaluation of multistage interconnection networks with blocking - discrete and continuous time Markov model</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>31</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">A. Busic</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Tadeusz Czachórski</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">J. Fourneau</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Krzysztof Grochla</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Level Crossing Ordering of Markov Chains: Proving Convergence and Bounding End to End Delays in an All Optical Network</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2007</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">ACM Proceedings from Valuetools 2007</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><PUBLISHER><style face="normal" font="default" size="100%">ACM</style></PUBLISHER><title><style face="normal" font="default" size="100%">Level Crossing Ordering of Markov Chains: Proving Convergence and Bounding End to End Delays in an All Optical Network</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>31</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Adam Józefiok</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Tadeusz Czachórski</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Krzysztof Grochla</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Tadeusz Czachórski</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Performance evaluation of multiuser interactive networking system</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2010</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Proceedings of 6th International Conference HET-NETs 2010</style></SECONDARY_TITLE><PLACE_PUBLISHED><style face="normal" font="default" size="100%">Gliwice, Bałtycka 5</style></PLACE_PUBLISHED><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><PUBLISHER><style face="normal" font="default" size="100%">IITiS PAN</style></PUBLISHER><PAGES><style face="normal" font="default" size="100%">223–231</style></PAGES><ABSTRACT><style face="normal" font="default" size="100%">The article presents a work in progress aiming at performance evaluation of a large database system at an assurance company. The system includes a server with a database and a local area network with a number of terminals where the company employees run applications that introduce documents or retrieve them from the database. We discuss a model of clients activities. Measurements were collected inside the working system: the phases at each users application were identified and their duration was measured. The collected data are used to construct a synthetic model of applications activities which is then applied to predict the system bahaviour in case of the growth of the number of users.</style></ABSTRACT><title><style face="normal" font="default" size="100%">Performance evaluation of multiuser interactive networking system</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>7</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">P. Bazan</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">J. Krzak</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Tadeusz Czachórski</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Andrzej Grzywak</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Piotr Pikiewicz</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Nowe Technologie w Komputerowych Systemach Zarządzania. Internet w Społeczeństwie Informacyjnym</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2005</style></YEAR><PLACE_PUBLISHED><style face="normal" font="default" size="100%">Warszawa</style></PLACE_PUBLISHED><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><PUBLISHER><style face="normal" font="default" size="100%">Wydawnictwa Komunikacji i Łączności</style></PUBLISHER><SECTION><style face="normal" font="default" size="100%">Ocena mechanizmów kształtowania efektywności transmisji</style></SECTION><title><style face="normal" font="default" size="100%">Nowe Technologie w Komputerowych Systemach Zarządzania. Internet w Społeczeństwie Informacyjnym</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>31</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">A. Brachman</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Tadeusz Czachórski</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Krzysztof Grochla</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Analiza wydajności protokołu TCP-NCR w sieciach bezprzewodowych</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2007</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Materiały Konferencji Sieci Komputerowe</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><PUBLISHER><style face="normal" font="default" size="100%">Wydawnictwo Komunikacji i Łączności</style></PUBLISHER><DATE><style face="normal" font="default" size="100%">6</style></DATE><title><style face="normal" font="default" size="100%">Analiza wydajności protokołu TCP-NCR w sieciach bezprzewodowych</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>7</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">B. Bylina</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">J. Bylina</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Tadeusz Czachórski</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Joanna Domańska</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Stefan Węgrzyn</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Bolesław Pochopień</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Tadeusz Czachórski</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Współczesne problemy sieci komputerowych Nowe technologie</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2004</style></YEAR><PLACE_PUBLISHED><style face="normal" font="default" size="100%">Warszawa</style></PLACE_PUBLISHED><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><PUBLISHER><style face="normal" font="default" size="100%">WNT</style></PUBLISHER><SECTION><style face="normal" font="default" size="100%">Wykorzystanie równoległego i wektorowego rozkładu WZ w markowowskich modelach sieci komputerowych</style></SECTION><title><style face="normal" font="default" size="100%">Współczesne problemy sieci komputerowych Nowe technologie</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">B. Bylina</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">J. Bylina</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Joanna Domańska</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Tadeusz Czachórski</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">The use of vectorized and parallelized solutions to Markovian models in performance evaluation of communication networks: a case of leaky buckets with tokens</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2004</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Archiwum Informatyki Teoretycznej i Stosowanej</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><VOLUME><style face="normal" font="default" size="100%">16</style></VOLUME><NUMBER><style face="normal" font="default" size="100%">3</style></NUMBER><PAGES><style face="normal" font="default" size="100%">153–170</style></PAGES><title><style face="normal" font="default" size="100%">The use of vectorized and parallelized solutions to Markovian models in performance evaluation of communication networks: a case of leaky buckets with tokens</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>7</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Tadeusz Czachórski</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Andrzej Grzywak</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Internet w społeczeństwie informatycznym</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2003</style></YEAR><PLACE_PUBLISHED><style face="normal" font="default" size="100%">Dąbrowa Górnicza</style></PLACE_PUBLISHED><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><PUBLISHER><style face="normal" font="default" size="100%">Wyższa Szkoła Biznesu i Organizacji</style></PUBLISHER><SECTION><style face="normal" font="default" size="100%">Internet a sieci optyczne</style></SECTION><NOTES><style face="normal" font="default" size="100%">str 85 - 110</style></NOTES><title><style face="normal" font="default" size="100%">Internet w społeczeństwie informatycznym</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>31</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Tadeusz Czachórski</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">V. Mityushev</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Ł.A. Stępień</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">A. Budziak</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Queueing models: transient state analysis applied to performance evaluation of computer networks.</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2013</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Abstracts 9th International ISAAC Congress</style></SECONDARY_TITLE><PLACE_PUBLISHED><style face="normal" font="default" size="100%">44-100 Gliwice, ul. Pszczyńska 44</style></PLACE_PUBLISHED><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><PUBLISHER><style face="normal" font="default" size="100%">Pracownia Komputerowa Jacka Skalmierskiego</style></PUBLISHER><PAGES><style face="normal" font="default" size="100%">5–6</style></PAGES><DATE><style face="normal" font="default" size="100%">8</style></DATE><NOTES><style face="normal" font="default" size="100%">9th International ISAAC Congress August 509, 2013, Kraków, Poland</style></NOTES><title><style face="normal" font="default" size="100%">Queueing models: transient state analysis applied to performance evaluation of computer networks.</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>7</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Tadeusz Czachórski</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">V. Mityushev</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">M. Ruzhansky</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Analytic Methods in Interdisciplinary Applications</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2015</style></YEAR><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><PUBLISHER><style face="normal" font="default" size="100%">Springer International Publishing Switzerland</style></PUBLISHER><SECTION><style face="normal" font="default" size="100%">Queueing Models for Performance Evaluation of Computer Networks - Transient State Analysis</style></SECTION><ABSTRACT><style face="normal" font="default" size="100%">Queueing theory is a useful tool in design of computer networks and their performance evaluation. The literature concerning this subject is abundant. However, it is in general limited to the analysis of steady states. It means that flows of customers considered in models are constant and obtained solutions do not depend on time. It is in glaring contrast with the flows observed in real networks where the perpetual changes of traffic intensities are due to the nature of users, sending variable quantities of data, cf. multimedia traffic, and also due to the performance of traffic control algorithms which are trying to avoid congestion in networks, e.g. the algorithm of congestion window used in TCP protocol which is adapting the rate of the sent traffic to the observed losses or transmission delays. We discuss here the means used to analyse transient states in queueing models. In computer applications a mathematical model is useful only when it furnishes quantitative results. Therefore practical ussues related to numerical side of models are of importance and are here discussed. We present three approaches - Markov models solved numerically, fluid flow approximation and diffusion approximation. A particular importance is given to the latter as the author has here over 20year experience in development and application of this method. He is also convinced of the qualities of this approach - its flexibility to treat various variants of queueing models. Traffic intensity observed in computer networks have a complex stochastic nature that influences the network performances. We discuss also this side of implemented queueing models.</style></ABSTRACT><title><style face="normal" font="default" size="100%">Analytic Methods in Interdisciplinary Applications</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>31</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Tadeusz Czachórski</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Modelling transient states in queueing models of computer networks: a few practical issues</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2013</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Proceedings of the International Conference Distributed Computer and Communication networks: Control, Computation, Communications</style></SECONDARY_TITLE><PLACE_PUBLISHED><style face="normal" font="default" size="100%">Moscow</style></PLACE_PUBLISHED><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><PUBLISHER><style face="normal" font="default" size="100%">V.A.Trapeznikov Institute of Control Sciences Russian Academy of Sciences; Institute of Information and Communication technologies Bulgarian Academy of Sciences</style></PUBLISHER><PAGES><style face="normal" font="default" size="100%">27–28</style></PAGES><DATE><style face="normal" font="default" size="100%">10</style></DATE><NOTES><style face="normal" font="default" size="100%">DCCN 2013, Moscow, Russia, October 7-10, 2013</style></NOTES><title><style face="normal" font="default" size="100%">Modelling transient states in queueing models of computer networks: a few practical issues</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>31</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Tadeusz Czachórski</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Modelling and controlling dynamics of Internet flows.</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2013</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Proc. Intellectual systems of decision-making and problems of computational intelligence</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><NOTES><style face="normal" font="default" size="100%">ISDMCI'2013, Eupatoria, 20-24 maj 2013</style></NOTES><title><style face="normal" font="default" size="100%">Modelling and controlling dynamics of Internet flows.</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>31</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Tadeusz Czachórski</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Transient queueing models applied to performance evaluation of computer networks.</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2013</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Proc. Third International Conference of Gwalior Academy of Mathematical Sciences (GAMS) on Mathematical, Computational and Integrative Sciences</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><NOTES><style face="normal" font="default" size="100%">Bhopal India, 22-26 September 2013</style></NOTES><title><style face="normal" font="default" size="100%">Transient queueing models applied to performance evaluation of computer networks.</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Tadeusz Czachórski</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Analityczne modele kolejkowe w ocenie efektywności pracy systemów i sieci kolejkowych</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2003</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Pro Dialog</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><VOLUME><style face="normal" font="default" size="100%">16</style></VOLUME><PAGES><style face="normal" font="default" size="100%">90–111</style></PAGES><title><style face="normal" font="default" size="100%">Analityczne modele kolejkowe w ocenie efektywności pracy systemów i sieci kolejkowych</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>31</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Tadeusz Czachórski</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Joanna Domańska</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Tadeusz Czachórski</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">N. Pekergin</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Markovian models for long-range dependent traffic, new results</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2004</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Proc. of First Workshop on New Trends in Modelling Quantitave Methods and Measurements, in Modelling Quantitave Methods and Measurements, Zakopane, 27-29 June 2004</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><PAGES><style face="normal" font="default" size="100%">213–228</style></PAGES><title><style face="normal" font="default" size="100%">Markovian models for long-range dependent traffic, new results</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Tadeusz Czachórski</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Joanna Domańska</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Wpływ samopodobnej natury ruchu na długości kolejek w przełącznikach sieciowych</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2002</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Studia Informatica</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><VOLUME><style face="normal" font="default" size="100%">23</style></VOLUME><NUMBER><style face="normal" font="default" size="100%">2A (48)</style></NUMBER><PAGES><style face="normal" font="default" size="100%">201–212</style></PAGES><title><style face="normal" font="default" size="100%">Wpływ samopodobnej natury ruchu na długości kolejek w przełącznikach sieciowych</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Tadeusz Czachórski</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Joanna Domańska</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Markovian models for long-range dependent traffic</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2001</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Archiwum Informatyki Teoretycznej i Stosowanej</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><VOLUME><style face="normal" font="default" size="100%">13</style></VOLUME><NUMBER><style face="normal" font="default" size="100%">4</style></NUMBER><PAGES><style face="normal" font="default" size="100%">297–308</style></PAGES><title><style face="normal" font="default" size="100%">Markovian models for long-range dependent traffic</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>7</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Tadeusz Czachórski</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Joanna Domańska</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Adam Domański</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Andrzej Grzywak</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Piotr Pikiewicz</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Nowe Technologie w Komputerowych Systemach Zarządzania. Internet w Społeczeństwie Informacyjnym</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2005</style></YEAR><PLACE_PUBLISHED><style face="normal" font="default" size="100%">Warszawa</style></PLACE_PUBLISHED><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><PUBLISHER><style face="normal" font="default" size="100%">Wydawnictwa Komunikacji i Łączności</style></PUBLISHER><SECTION><style face="normal" font="default" size="100%">Rachunek sieciowy w zastosowaniu do analizy jakości usług w Internecie</style></SECTION><title><style face="normal" font="default" size="100%">Nowe Technologie w Komputerowych Systemach Zarządzania. Internet w Społeczeństwie Informacyjnym</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>7</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Tadeusz Czachórski</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Joanna Domańska</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Adam Domański</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Stefan Węgrzyn</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Bolesław Pochopień</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Tadeusz Czachórski</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Wysokowydajne sieci komputerowe. Nowe Technologie</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2005</style></YEAR><PLACE_PUBLISHED><style face="normal" font="default" size="100%">Warszawa</style></PLACE_PUBLISHED><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><PUBLISHER><style face="normal" font="default" size="100%">Wydawnictwa Komunikacji i Łączności</style></PUBLISHER><SECTION><style face="normal" font="default" size="100%">Aktywne zarządzanie buforami routerów IP w obecności ruchu samopodobnego</style></SECTION><title><style face="normal" font="default" size="100%">Wysokowydajne sieci komputerowe. Nowe Technologie</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>31</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Tadeusz Czachórski</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Joanna Domańska</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Krzysztof Grochla</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Dynamics of TCP/IP flows in presence of various AQM algorithms, a fluid flow approximation model</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2006</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Third EuroNGI Workshop on New Trends in Modelling, Quantitative methods and Measurements</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><PUBLISHER><style face="normal" font="default" size="100%">Politecnico de Torino</style></PUBLISHER><title><style face="normal" font="default" size="100%">Dynamics of TCP/IP flows in presence of various AQM algorithms, a fluid flow approximation model</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>31</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Tadeusz Czachórski</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Joanna Domańska</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Krzysztof Grochla</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">TCP/IP dynamics in wireless environment, a fluid-flow model</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2006</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Third Workshop on Wireless and Mobility</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><PUBLISHER><style face="normal" font="default" size="100%">Technical University of Catalonia</style></PUBLISHER><DATE><style face="normal" font="default" size="100%">VI</style></DATE><title><style face="normal" font="default" size="100%">TCP/IP dynamics in wireless environment, a fluid-flow model</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Tadeusz Czachórski</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Joanna Domańska</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Arkadiusz Sochan</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Samopodobny charakter natężenia ruchu w sieciach komputerowych</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2001</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Studia Informatica</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><VOLUME><style face="normal" font="default" size="100%">22</style></VOLUME><ABSTRACT><style face="normal" font="default" size="100%">Artykuł przedstawia analizę natężenia ruchu pakietów w sieci Ethernet oraz ruchu ramek MPEG-2 w sieci ATM pod kątem występowania cechy zwanej samopodobieństwem. Zamieszczono krótką charakterystykę procesów samopodobnych oraz wnioski wypływające z samopodobnej natury ruchu w sieciach komputerowych.</style></ABSTRACT><title><style face="normal" font="default" size="100%">Samopodobny charakter natężenia ruchu w sieciach komputerowych</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>7</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Tadeusz Czachórski</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Adam Domański</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Joanna Domańska</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Andrzej Grzywak</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Internet w spoleczenstwie informatycznym</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2004</style></YEAR><PLACE_PUBLISHED><style face="normal" font="default" size="100%">Warszawa</style></PLACE_PUBLISHED><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><PUBLISHER><style face="normal" font="default" size="100%">WNT</style></PUBLISHER><SECTION><style face="normal" font="default" size="100%">Mechanizmy zapewniania jakości usług w sieci Internet</style></SECTION><title><style face="normal" font="default" size="100%">Internet w spoleczenstwie informatycznym</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>7</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Tadeusz Czachórski</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Adam Domański</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Joanna Domańska</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Stefan Węgrzyn</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Bolesław Pochopień</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Tadeusz Czachórski</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Współczesne problemy sieci komputerowych Nowe technologie</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2004</style></YEAR><PLACE_PUBLISHED><style face="normal" font="default" size="100%">Warszawa</style></PLACE_PUBLISHED><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><PUBLISHER><style face="normal" font="default" size="100%">WNT</style></PUBLISHER><SECTION><style face="normal" font="default" size="100%">Wplyw samopodobnej natury ruchu internetowego na działanie mechanizmów jakości usług</style></SECTION><title><style face="normal" font="default" size="100%">Współczesne problemy sieci komputerowych Nowe technologie</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>31</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Tadeusz Czachórski</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">J. Fourneau</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Sławomir Nowak</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">F. Quessette</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Performance of a mixed deflection and convergence routing algorithm</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2002</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Proc. of 2nd Polish-German Teletraffic Symposium PGTS, Gdansk, 22-25 September 2002</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><title><style face="normal" font="default" size="100%">Performance of a mixed deflection and convergence routing algorithm</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>31</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Tadeusz Czachórski</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Krzysztof Grochla</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Adam Józefiok</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Tomasz Nycz</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Simulation, Markov Chain and Diffusion Approximation Models – a Case Study</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2011</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%"/></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><title><style face="normal" font="default" size="100%">Simulation, Markov Chain and Diffusion Approximation Models – a Case Study</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Tadeusz Czachórski</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Krzysztof Grochla</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Adam Józefiok</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Tomasz Nycz</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Porównanie metod analizy efektywności na przykładzie serwera aplikacji w sieci lokalnej</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2011</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Studia Informatica</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><VOLUME><style face="normal" font="default" size="100%">32</style></VOLUME><NUMBER><style face="normal" font="default" size="100%">3A</style></NUMBER><PAGES><style face="normal" font="default" size="100%">7–20</style></PAGES><ABSTRACT><style face="normal" font="default" size="100%">W artykule przedstawiono model kolejkowy służący do oceny funkcjonowania dużego systemu sieciowego, w skład którego wchodzi rozbudowany system bazodanowy. Opisywany system jest systemem rzeczywistym. Zebrane wyniki pracy systemu posłużyły do budowy modelu działania aplikacji interakcyjnych, na podstawie łańcuchów Markova, aproksymacji dyfuzyjnej i symulacji zdarzeń dyskretnych. Porównanie ich z rzeczywistymi wynikami umożliwiło sprawdzenie przdatności użytych metod w rzeczywistych warunkach.</style></ABSTRACT><title><style face="normal" font="default" size="100%">Porównanie metod analizy efektywności na przykładzie serwera aplikacji w sieci lokalnej</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>31</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Tadeusz Czachórski</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Krzysztof Grochla</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Adam Józefiok</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Tomasz Nycz</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Ferhan Pekergin</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Erol Gelenbe</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Ricardo Lent</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Georgia Sakellari</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Performance Evaluation of a Multiuser Interactive Networking System: A Comparison of Modelling Methods</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2012</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Computer and Information Sciences II</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><PUBLISHER><style face="normal" font="default" size="100%">Springer</style></PUBLISHER><PAGES><style face="normal" font="default" size="100%">215–222</style></PAGES><ABSTRACT><style face="normal" font="default" size="100%">This article presents a queueing model for performance evaluation of a large database system at an assurance company. The system includes a server with a database and a local area network with a number of terminals where the company employees run applications that introduce documents or retrieve them from the database. We discuss a model of clients activities. Measurements were collected inside the working system: the phases at each users application performance were identified and their duration was measured. The collected data are used to construct a synthetic model of applications activities which is then applied to predict the system behaviour in case of the growth of the number of users. We apply simulation, Markov and diffusion models-their comparison, based on real data, may better verify the utility of particular methods than usual academic examples.</style></ABSTRACT><title><style face="normal" font="default" size="100%">Performance Evaluation of a Multiuser Interactive Networking System: A Comparison of Modelling Methods</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>31</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Tadeusz Czachórski</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Krzysztof Grochla</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Ferhan Pekergin</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">J. Garcia-Vidal</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">l. Cerda-Alabern</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Stability and Dynamics of TCP-NCR(DCR) Protocol</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2007</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Lecture Notes in Computer Systems 4396 - Wireless Systems and Mobility in Next Generation Internet</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><PUBLISHER><style face="normal" font="default" size="100%">SpringeVerlag</style></PUBLISHER><PAGES><style face="normal" font="default" size="100%">241–254</style></PAGES><DATE><style face="normal" font="default" size="100%">5</style></DATE><ABSTRACT><style face="normal" font="default" size="100%">The fluid-flow approximation models investigate with much success the dynamics and stability of TCP/RED connections. Their main assumption is that the fluctuations of variables characterizing the behaviour of the connections are relatively small, that enables the linearization of model and the use of traditional control analysis tools to obtain such measures as Bode gain, phase margins, tracking error or delay margin. In this article, preserving linear fluid-flow model, we propose its extension to the case when a network is composed of wired and wireless part. We consider a variant of TCP algorithm (TCP-DCR or its new version TCP-NCR) and fluid-flow differential equations representing the size of congestion window, mean queue at the bottleneck router and loss probability at a RED queue are supplemented with terms representing constant loss probability due to transmission in wireless part and probability that a fraction of these errors is recovered by a link level mechanism. The decrease of congestion window due to TCP mechanism is delayed to allow the link protocol to deal with the errors. The model considers the presence of uncontrollable UDP flows.</style></ABSTRACT><title><style face="normal" font="default" size="100%">Stability and Dynamics of TCP-NCR(DCR) Protocol</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>31</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Tadeusz Czachórski</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Krzysztof Grochla</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Ferhan Pekergin</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Un modele d’approximation de diffusion pour la distribution du temps d’acheminement des paquets dans les réseaux de senseurs</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2008</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Colloque francophone sur l’ingénierie des protocoles</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><title><style face="normal" font="default" size="100%">Un modele d’approximation de diffusion pour la distribution du temps d’acheminement des paquets dans les réseaux de senseurs</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>31</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Tadeusz Czachórski</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Krzysztof Grochla</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Ferhan Pekergin</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Estimation of packet transfer time at sensor networks, diffusion approximation approach</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2008</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Proceedings from HET-NETs</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><title><style face="normal" font="default" size="100%">Estimation of packet transfer time at sensor networks, diffusion approximation approach</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>31</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Tadeusz Czachórski</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Krzysztof Grochla</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Ferhan Pekergin</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">TCP performance for a wireless traffic, a diffusion approxiation model</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2008</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Proceedings from Workshop on Wireless and mobility in Future Generation Internet</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><DATE><style face="normal" font="default" size="100%">2</style></DATE><title><style face="normal" font="default" size="100%">TCP performance for a wireless traffic, a diffusion approxiation model</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>31</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Tadeusz Czachórski</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Krzysztof Grochla</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Ferhan Pekergin</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Fluid-flow Approximation Model of TCP-NCR in wired-wireless networks</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2007</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Proceedings from Polish Teletraffic Symposium</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><PUBLISHER><style face="normal" font="default" size="100%">IITiS PAN</style></PUBLISHER><DATE><style face="normal" font="default" size="100%">9</style></DATE><title><style face="normal" font="default" size="100%">Fluid-flow Approximation Model of TCP-NCR in wired-wireless networks</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Tadeusz Czachórski</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Krzysztof Grochla</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Ferhan Pekergin</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">A model of TCP flows dynamics</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2006</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Theoretical and Applied Informatics</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><VOLUME><style face="normal" font="default" size="100%">18</style></VOLUME><NUMBER><style face="normal" font="default" size="100%">4</style></NUMBER><PAGES><style face="normal" font="default" size="100%">279–292</style></PAGES><ABSTRACT><style face="normal" font="default" size="100%">The fluid flow approximation models investigate with much success the dynamics and stability of TCP/RED connections. Their main assumption is that the fluctuations of variables characterizing the behaviour of the connections are relatively small, that enables the linearization of model and the use of traditional control analysis tools to obtain such measures as Bode gain, phase margins, tracking error or delay margin</style></ABSTRACT><title><style face="normal" font="default" size="100%">A model of TCP flows dynamics</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>31</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Tadeusz Czachórski</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Krzysztof Grochla</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Ferhan Pekergin</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Some contributions to the modelling the dynamics of (TCP,UDP)/RED flows over reliable and unreliable connections</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2006</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Proceedings from HET-NETs 2006</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><DATE><style face="normal" font="default" size="100%">9</style></DATE><title><style face="normal" font="default" size="100%">Some contributions to the modelling the dynamics of (TCP,UDP)/RED flows over reliable and unreliable connections</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>31</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Tadeusz Czachórski</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Krzysztof Grochla</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">T. Nycz</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Ferhan Pekergin</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Tadeusz Czachórski</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Modeling the IEEE 802.11 Networks MAC Layer Using Diffusion Approximation</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2010</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Proceeding of HET-NETs 2010</style></SECONDARY_TITLE><PLACE_PUBLISHED><style face="normal" font="default" size="100%">Gliwice, Bałtycka 5</style></PLACE_PUBLISHED><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><PUBLISHER><style face="normal" font="default" size="100%">Institute of Theoretical and Applied Informatics of the Polish Academy of Sciences</style></PUBLISHER><PAGES><style face="normal" font="default" size="100%">429–442</style></PAGES><DATE><style face="normal" font="default" size="100%">1</style></DATE><ABSTRACT><style face="normal" font="default" size="100%">Abstract: The article presents an analytical model of wireless networks using the IEEE 802.11 protocol to access the transport medium. The model allows to determine such key factors of the quality of service as transmission delays and losses. The model is based on diffusion approximation approach which was proposed three decades ago to model wired networks. We show that it can be adapted to take into consideration the input streams with general interarrival time distributions and servers with general service time distributions. The diffusion approximation has been chosen because of fairly general assumptions of models based on it, hard to be represented in Markov models. A queueing network model can have an arbitrary topology, the intensity of transmitted flows can be represented by non-Poisson (even self-similar) streams, the service times at nodes can be defined by general distributions. These assumptions are important: because of the CSMA/CA algorithm, the overall times needed to sent a packet are far from being exponentially distributed and therefore the flows between nodes are non-Poisson. Diffusion approximation allows us also to analyse the of transient behaviour of a network when traffic intensity is changing with time.</style></ABSTRACT><title><style face="normal" font="default" size="100%">Modeling the IEEE 802.11 Networks MAC Layer Using Diffusion Approximation</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>31</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Tadeusz Czachórski</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Krzysztof Grochla</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">T. Nycz</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Ferhan Pekergin</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Tadeusz Czachórski</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Mateusz Nowak</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Duration of boot-up storm period</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2012</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">17th Polish teletraffic symposium</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><PUBLISHER><style face="normal" font="default" size="100%">IITiS PAN</style></PUBLISHER><PAGES><style face="normal" font="default" size="100%">145–150</style></PAGES><DATE><style face="normal" font="default" size="100%">12</style></DATE><ABSTRACT><style face="normal" font="default" size="100%">The simultaneous boot of multiple virtual machines or networking devices imposes heavy load on the networking infrastructure. In large network of virtual machines the coordination of the reboots and the device registration is required. In the paper we present a simple analytical model to compute the distribution of boot-up time. The model is verified by comparison to a simulation model, and may be used to check the influence of several parameters on the overall boot-up time during a boot storm.</style></ABSTRACT><title><style face="normal" font="default" size="100%">Duration of boot-up storm period</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Tadeusz Czachórski</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Krzysztof Grochla</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">T. Nycz</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Ferhan Pekergin</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">A diffusion approximation model for wireless networks based on IEEE 802.11 standard, Computer Communication Journal</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2010</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Computer Communication Journal</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><VOLUME><style face="normal" font="default" size="100%">33</style></VOLUME><NUMBER><style face="normal" font="default" size="100%">S1</style></NUMBER><PAGES><style face="normal" font="default" size="100%">S86–S92</style></PAGES><ABSTRACT><style face="normal" font="default" size="100%">The article presents an analytical model of wireless networks using the IEEE 802.11 protocol to access the transport medium. The model allows to determine such key factors of the quality of service as transmission delays and losses. The model is based on diffusion approximation approach which was proposed three decades ago to model wired networks. We show that it can be adapted to take into consideration the input streams with general interarrival time distributions and servers with general service time distributions. The diffusion approximation has been chosen because of fairly general assumptions of models based on it, hard to be represented in Markov models. A queueing network model can have an arbitrary topology, the intensity of transmitted flows can be represented by non-Poisson (even self-similar) streams, the service times at nodes can be defined by general distributions. These assumptions are important: because of the CSMA/CA algorithm, the overall times needed to sent a packet are far from being exponentially distributed and therefore the flows between nodes are non-Poisson. Diffusion approximation allows us also to analyse the of transient behaviour of a network when traffic intensity is changing with time.</style></ABSTRACT><title><style face="normal" font="default" size="100%">A diffusion approximation model for wireless networks based on IEEE 802.11 standard, Computer Communication Journal</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>7</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Tadeusz Czachórski</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Stanisław Jędruś</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">M. Zakrzewicz</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">J. Gozdecki</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">P. Pacyna</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">S. Rahman</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Multimedia Networking: Technology, Management and Applications</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2002</style></YEAR><PLACE_PUBLISHED><style face="normal" font="default" size="100%">Hershey, USA</style></PLACE_PUBLISHED><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><PUBLISHER><style face="normal" font="default" size="100%">Idea Group Publishing</style></PUBLISHER><SECTION><style face="normal" font="default" size="100%">QoS-Aware Digital Video Retrieval Application</style></SECTION><title><style face="normal" font="default" size="100%">Multimedia Networking: Technology, Management and Applications</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Tadeusz Czachórski</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">J. Fourneau</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Sławomir Nowak</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Symulacyjne Badanie routingu w sieciach optycznych</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2002</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Studia informatica</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><VOLUME><style face="normal" font="default" size="100%">2A</style></VOLUME><NUMBER><style face="normal" font="default" size="100%">48</style></NUMBER><PAGES><style face="normal" font="default" size="100%">45–58</style></PAGES><title><style face="normal" font="default" size="100%">Symulacyjne Badanie routingu w sieciach optycznych</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>31</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Tadeusz Czachórski</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">M. Nycz</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">T. Nycz</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">V. Vishnevsky</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Modelling Transient States in Queueing Models of Computer Networks: A Few Practical Issues</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2014</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Distributed Computer and Communication Networks</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><PUBLISHER><style face="normal" font="default" size="100%">Springer International Publishing Switzerland</style></PUBLISHER><PAGES><style face="normal" font="default" size="100%">58–72</style></PAGES><ABSTRACT><style face="normal" font="default" size="100%">The article summarises author`s experience in two problems related to the use of queueing models in performance evaluation of computer networks: modelling transient states of queues and computations for queueing network models having large number of nodes. Both issues are not well represented in classical queuing theory, yet important to applications, because the observed traffic is time dependant and network topologies that should be considered become larger and larger. The article discusses two approaches: diffusion approximation and fluid-flow approximation that can cope with much larger models that are attainable with the use of Markov chains.</style></ABSTRACT><NOTES><style face="normal" font="default" size="100%">17th International Conference, DCCN 2013 Moscow, Russia, October 7-10, 2013</style></NOTES><title><style face="normal" font="default" size="100%">Modelling Transient States in Queueing Models of Computer Networks: A Few Practical Issues</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>31</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Tadeusz Czachórski</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Piotr Pecka</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Internet and real-time performance: a web server model</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2002</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Proc. of 9th Conf. on Real-Time Systems, Ustroń, 16-19 September 2002</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><title><style face="normal" font="default" size="100%">Internet and real-time performance: a web server model</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>31</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Tadeusz Czachórski</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Ferhan Pekergin</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">D.D. Kouvatsos</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Diffusion Approximation as a modelling tool in congestion control and performance evaluation, tutorial</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2004</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Proc. of HET-NETs '04, Performance Modelling and Evaluation of Heterogenous Networks</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><title><style face="normal" font="default" size="100%">Diffusion Approximation as a modelling tool in congestion control and performance evaluation, tutorial</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>7</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Tadeusz Czachórski</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Ferhan Pekergin</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Stefan Węgrzyn</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Bolesław Pochopień</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Tadeusz Czachórski</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Wysokowydajne sieci komputerowe, Nowe Technologie</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2005</style></YEAR><PLACE_PUBLISHED><style face="normal" font="default" size="100%">Warszawa</style></PLACE_PUBLISHED><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><PUBLISHER><style face="normal" font="default" size="100%">Wydawnictwa Komunikacji i Łączności</style></PUBLISHER><SECTION><style face="normal" font="default" size="100%">Model pracy elektroniczno-optycznego węzła brzegowego, wykorzystanie aproksymacji dyfuzyjnej</style></SECTION><title><style face="normal" font="default" size="100%">Wysokowydajne sieci komputerowe, Nowe Technologie</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Tadeusz Czachórski</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Ferhan Pekergin</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Diffusion Approximation as a Modelling Tool, chapter in: Network Performance Engineering, A Handbook on Convergent Multi-Service Networks and Next Generation Internet, St</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2011</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">LNCS , Springer</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><VOLUME><style face="normal" font="default" size="100%">5233</style></VOLUME><PAGES><style face="normal" font="default" size="100%">447–476</style></PAGES><ABSTRACT><style face="normal" font="default" size="100%">Diffusion theory is already a vast domain of knowledge. This tutorial lecture does not cover all results: it presents in a coherent way an approach we have adopted and used in analysis of a series of models concerning evoluation of some traffic control mechanisms in computer, especially ATM, networks. Diffusion approximation is presented from engineer`s point of view, stressing its utility and commenting numerical problems of its implementation. Diffusion approximation is a method to model the behavior of a single queueing station or a network of stations. It allows one to include in the model general sevice times, general (also correlated)input streams and to investigate transient states, which, in presence of bursty streams (e.g. of multimedia transfers) in modern networks, are of interest.</style></ABSTRACT><title><style face="normal" font="default" size="100%">Diffusion Approximation as a Modelling Tool, chapter in: Network Performance Engineering, A Handbook on Convergent Multi-Service Networks and Next Generation Internet, St</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Tadeusz Czachórski</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Ferhan Pekergin</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">A diffusion approximation model of an electronic-optical node</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2005</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">LNCS, Formal Techniques for Computer Systems and Bisiness Proesses</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><NUMBER><style face="normal" font="default" size="100%">3670</style></NUMBER><PAGES><style face="normal" font="default" size="100%">187–199</style></PAGES><title><style face="normal" font="default" size="100%">A diffusion approximation model of an electronic-optical node</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Tadeusz Czachórski</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Ferhan Pekergin</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">A novel diffusion process with jumps to study an electronic-optical edge router</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2005</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Archiwum Informatyki Teoretycznej I Stosowanej</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><VOLUME><style face="normal" font="default" size="100%">17</style></VOLUME><NUMBER><style face="normal" font="default" size="100%">2</style></NUMBER><PAGES><style face="normal" font="default" size="100%">87–100</style></PAGES><title><style face="normal" font="default" size="100%">A novel diffusion process with jumps to study an electronic-optical edge router</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>31</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Tadeusz Czachórski</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Ferhan Pekergin</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Diffusion approximation: modelling transient flows of multiclass queueing networks</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2003</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Proc. of International Network Optimization Conference, INOC'03, Oct. 27-29, 2003 Evry, France</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><title><style face="normal" font="default" size="100%">Diffusion approximation: modelling transient flows of multiclass queueing networks</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>31</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Tadeusz Czachórski</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Ferhan Pekergin</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">A diffusion approximation model of Web servers</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2002</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Proc. of WITASI02, 1st IFIP Workshop on Internet Technologies, Applications and Societal Impact, Wrocław, October 10-11, 2002</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><title><style face="normal" font="default" size="100%">A diffusion approximation model of Web servers</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>31</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Tadeusz Czachórski</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Ferhan Pekergin</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Modelling New Congestion Control Mechanisms TCP/IP Internet Protocols</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2001</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Proc. of International Conference on Control AUTOMATICS 2001, Odessa, Ukraine, 10-15 September 2001.</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><title><style face="normal" font="default" size="100%">Modelling New Congestion Control Mechanisms TCP/IP Internet Protocols</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>31</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Tadeusz Czachórski</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Ferhan Pekergin</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">B. Szady</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Forming optical packets, a diffusion approximation and simulation models</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2005</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Proc. Second EuoNGI Workshop on New Methods in Modelling, Quantitative Methods and Measurements, Aveiro, Porugal, November 24-25, 2005</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><title><style face="normal" font="default" size="100%">Forming optical packets, a diffusion approximation and simulation models</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>31</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Tadeusz Czachórski</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Ferhan Pekergin</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">B. Szady</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Forming optical packets, a diffusion approximation model</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2005</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Proc. of 12th Polish Teletraffic Symposium PSRT2005, Poznan, 20-21 September 2005.</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><title><style face="normal" font="default" size="100%">Forming optical packets, a diffusion approximation model</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>31</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Tadeusz Czachórski</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">T. Nycz</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">M. Nycz</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Ferhan Pekergin</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Tadeusz Czachórski</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Traffic Engineering: Erlang and Engset Models Revisited with Diffusion Approximation</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2014</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Information Sciences and Systems 2014</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><PUBLISHER><style face="normal" font="default" size="100%">Springer International Publishing Switzerland</style></PUBLISHER><PAGES><style face="normal" font="default" size="100%">249–256</style></PAGES><ABSTRACT><style face="normal" font="default" size="100%">Classical Erlang and Engset formulae determining the availability of channels, loss probability, and characteristics of overflow traffic are still use in telecommunications. Moreover, they are also interesting for traffic management in mobile networks and in Internet. They are based on the assumption of Poisson flows and exponentially distributed time of connections. By means of diffusion approximation queuing models, we extend these results to the case of general distributions and transient state analysis.</style></ABSTRACT><title><style face="normal" font="default" size="100%">Traffic Engineering: Erlang and Engset Models Revisited with Diffusion Approximation</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>31</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">D. Barth</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">P. Berthome</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Tadeusz Czachórski</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">J. Fourneau</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Ch. Laforest</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">S. Vial</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">A Mixed Deflection and Convergence Routing Algorithm: Design and Performance</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2002</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Proc. of Euro-Par 2002, 27-30 August 2002, Padeborn University, Padeborn, Germany</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><title><style face="normal" font="default" size="100%">A Mixed Deflection and Convergence Routing Algorithm: Design and Performance</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Joanna Domańska</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Tadeusz Czachórski</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Wpływ samopodobnej natury ruchu na zachowanie mechanizmu cieknącego wiadra</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2003</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Studia Informatica</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><VOLUME><style face="normal" font="default" size="100%">24</style></VOLUME><NUMBER><style face="normal" font="default" size="100%">2A (53)</style></NUMBER><PAGES><style face="normal" font="default" size="100%">199–212</style></PAGES><title><style face="normal" font="default" size="100%">Wpływ samopodobnej natury ruchu na zachowanie mechanizmu cieknącego wiadra</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Joanna Domańska</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Tadeusz Czachórski</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Model formowania pakietów w węźle brzegowym sieci optycznej</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2003</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Studia Informatica</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><VOLUME><style face="normal" font="default" size="100%">24</style></VOLUME><NUMBER><style face="normal" font="default" size="100%">2A (53)</style></NUMBER><PAGES><style face="normal" font="default" size="100%">51–61</style></PAGES><title><style face="normal" font="default" size="100%">Model formowania pakietów w węźle brzegowym sieci optycznej</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>31</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Joanna Domańska</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Adam Domański</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Tadeusz Czachórski</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">S. Balandin</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Internet Traffic Source Vased on Hidden Markov Model</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2011</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Smart spaces and Next Generation Wired/Wireless Networking</style></SECONDARY_TITLE><PLACE_PUBLISHED><style face="normal" font="default" size="100%">Berlin Heidelberg</style></PLACE_PUBLISHED><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><PUBLISHER><style face="normal" font="default" size="100%">Springer</style></PUBLISHER><PAGES><style face="normal" font="default" size="100%">395–404</style></PAGES><ABSTRACT><style face="normal" font="default" size="100%">This article shows how to use Hidden Markov Models to generate self-similar traffic. The well-known Bellcore traces are used as a training sequence to learn HMM model parameters. Performance of trained model are tested on the remaining portions of the sequence. Then we can use the HMM trained with the Bellcore data as the traffic source model.</style></ABSTRACT><title><style face="normal" font="default" size="100%">Internet Traffic Source Vased on Hidden Markov Model</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>31</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Joanna Domańska</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Adam Domański</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Tadeusz Czachórski</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Tadeusz Czachórski</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">A few investigations of long-range dependence in network traffic</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2014</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Information Science and Systems 2014</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><PUBLISHER><style face="normal" font="default" size="100%">Springer International Publishing Switzerland</style></PUBLISHER><PAGES><style face="normal" font="default" size="100%">137–144</style></PAGES><ABSTRACT><style face="normal" font="default" size="100%">The paper presents measurements and analysis of a LAN long-range dependence traffic collected in IITiS PAN (The Institute of Theoretical and Applied Informatics of the Polish Academy of Sciences). Several methods of Hurst parameter estimation were used, the results obtained by the methods differ substantially. The analysis was made for the whole traffic and traffics generated by particular types of protocols. We seek for a dependence of Hurst parameter on a protocol type. Then, a MMPP(Markov-Modulated Poisson Process) model was applied to mimic the traces. It allows us to consider Markovian queueing models with long-range dependent and self-similar traffic, an important factor as we dispose an efficient software tool to solve numerically very large continuous-time Markov chains.</style></ABSTRACT><title><style face="normal" font="default" size="100%">A few investigations of long-range dependence in network traffic</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>31</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Joanna Domańska</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Adam Domański</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Tadeusz Czachórski</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Piotr Gaj</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Estimating the intensity of long-range dependence in real and synthetic traffic traces.</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2015</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Computer Networks</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><PUBLISHER><style face="normal" font="default" size="100%">Springer International Publishing Switzerland</style></PUBLISHER><PAGES><style face="normal" font="default" size="100%">11–22</style></PAGES><NOTES><style face="normal" font="default" size="100%">22nd International Conference, CN 2015 Brunów, Poland, June 16-19, 2015</style></NOTES><title><style face="normal" font="default" size="100%">Estimating the intensity of long-range dependence in real and synthetic traffic traces.</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>31</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Joanna Domańska</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Adam Domański</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Tadeusz Czachórski</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Alexander Dudin</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Valentina Klimenok</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Gennadiy Tsarenkov</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Sergey Dudin</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Fluid Flow Analysis of RED Algorithm with Modified Weighted Moving Average</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2013</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Modern Probabilistic Methods for analysis of Telecommunication Networks</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><PUBLISHER><style face="normal" font="default" size="100%">Springer</style></PUBLISHER><PAGES><style face="normal" font="default" size="100%">50–58</style></PAGES><DATE><style face="normal" font="default" size="100%">1</style></DATE><ABSTRACT><style face="normal" font="default" size="100%">We study with the use of fluid flow approximation the impact of a modified weighted moving average on the performance of RED mechanism. A model of TCP/UDP connection with RED implemented in an intermediate IP router is used, the weighted moving average is determined on the basis of a difference (recursive) equation. The fluid flow approximation technique is applied to model the interactions between the set of TCP/UDP flows and RED mechanism.</style></ABSTRACT><NOTES><style face="normal" font="default" size="100%">Belarusian Winter Workshops in Queueing Theory, BWWQT 2013, Minsk, Belarus, January 2013</style></NOTES><title><style face="normal" font="default" size="100%">Fluid Flow Analysis of RED Algorithm with Modified Weighted Moving Average</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>7</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Joanna Domańska</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Adam Domański</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Tadeusz Czachórski</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Andrzej Grzywak</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Jerzy Klamka</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Podstawy Budowy i Oprogramowania Sieci Typu Internet</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2007</style></YEAR><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><PUBLISHER><style face="normal" font="default" size="100%">Wyższa Szkoła Biznesu w Dąbrowie Górniczej</style></PUBLISHER><SECTION><style face="normal" font="default" size="100%">Aktywne zarządzanie ruchem pakietów dla multimedialnych strumieni danych</style></SECTION><title><style face="normal" font="default" size="100%">Podstawy Budowy i Oprogramowania Sieci Typu Internet</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>31</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Joanna Domańska</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Adam Domański</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Tadeusz Czachórski</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Andrzej Kwiecień</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Piotr Gaj</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">P. Stera</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Modeling Packet Traffic with the Use of Superpositions of Two-State MMPPs</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2014</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Computer Networks</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><PUBLISHER><style face="normal" font="default" size="100%">Springer International Publishing Switzerland</style></PUBLISHER><PAGES><style face="normal" font="default" size="100%">24–36</style></PAGES><ABSTRACT><style face="normal" font="default" size="100%">The aim of this paper is to use the superposition of two-state Markov Modulated Poisson Processes to replicate the statistical nature of internet traffic over several time scales. This paper characterizes of network traffic using Bellcore data and LAN traces collected in IITiS PAN. The fitting procedure for matching second-order self-similar properties of real data traces to that of two-state MMPP`s has also been described.</style></ABSTRACT><NOTES><style face="normal" font="default" size="100%">21th International Conference, Computer Networks 2014 Brunów, Poland, June 23-27, 2014</style></NOTES><title><style face="normal" font="default" size="100%">Modeling Packet Traffic with the Use of Superpositions of Two-State MMPPs</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>31</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Joanna Domańska</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Adam Domański</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Tadeusz Czachórski</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">A HMM network traffic model</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2012</style></YEAR><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><PAGES><style face="normal" font="default" size="100%">17–20</style></PAGES><ABSTRACT><style face="normal" font="default" size="100%">The article proposes a description of Internet traffic based on Hidden Markov Model. The model refers to packet level traffic and is validated with the use of real traffic collected in our laboratory. A part of the gathered traces is used as a training sequence to learn HMM model parameters an the rest serves as testing sequences.</style></ABSTRACT><NOTES><style face="normal" font="default" size="100%">International Conference on Networking and Future Internet (ICNFI 2012)</style></NOTES><title><style face="normal" font="default" size="100%">A HMM network traffic model</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Joanna Domańska</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Adam Domański</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Tadeusz Czachórski</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Implementation of modified AQM mechanisms in IP routers</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2008</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Journal of Communications Software and Systems</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><VOLUME><style face="normal" font="default" size="100%">4</style></VOLUME><NUMBER><style face="normal" font="default" size="100%">1</style></NUMBER><DATE><style face="normal" font="default" size="100%">03</style></DATE><title><style face="normal" font="default" size="100%">Implementation of modified AQM mechanisms in IP routers</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Joanna Domańska</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Adam Domański</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Tadeusz Czachórski</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">The Drop-From-Front Strategy in AQM</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2007</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Lecture Notes in Computer Science, Springer Berlin</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><VOLUME><style face="normal" font="default" size="100%">4712</style></VOLUME><PAGES><style face="normal" font="default" size="100%">61–72</style></PAGES><title><style face="normal" font="default" size="100%">The Drop-From-Front Strategy in AQM</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>31</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Joanna Domańska</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Adam Domański</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Tadeusz Czachórski</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">The influence of traffic self-similarity on QoS Mechanisms</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2005</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Proceedings of SAINT 2005 Workshops, 31 January – 4 February 2005, Trento, Italy</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><PAGES><style face="normal" font="default" size="100%">300–303</style></PAGES><title><style face="normal" font="default" size="100%">The influence of traffic self-similarity on QoS Mechanisms</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Joanna Domańska</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Adam Domański</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Tadeusz Czachórski</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Self-similarity of network traffic and the performances of QoS mechanisms</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2004</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Archiwum Informatyki Teoretycznej i Stosowanej</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><VOLUME><style face="normal" font="default" size="100%">16</style></VOLUME><NUMBER><style face="normal" font="default" size="100%">3</style></NUMBER><PAGES><style face="normal" font="default" size="100%">337–349</style></PAGES><title><style face="normal" font="default" size="100%">Self-similarity of network traffic and the performances of QoS mechanisms</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Joanna Domańska</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Adam Domański</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Tadeusz Czachórski</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Jerzy Klamka</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Flluid flow approximation of time-limited TCP/UDP/XCP streams.</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2014</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Bulletin of the Polish Academy of Sciences Technical Sciences</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><VOLUME><style face="normal" font="default" size="100%">62</style></VOLUME><NUMBER><style face="normal" font="default" size="100%">2</style></NUMBER><PAGES><style face="normal" font="default" size="100%">217–225</style></PAGES><ABSTRACT><style face="normal" font="default" size="100%">This article presents the use of fluid flow approximation to model interactions between a set of TCP, UDP and XCP flows in the enveronment of IP routers using AQM (Active Queue Management) algorithms to control traffic congestion. In contrast to other works, independent UDP and TCP streams are considered and the model allows to start and end data transmissions in TCP, UDP and XCP strams at any time moment. It incorporates several Active Queue Management mechanisms: RED, NLRED, CHOKe.</style></ABSTRACT><title><style face="normal" font="default" size="100%">Flluid flow approximation of time-limited TCP/UDP/XCP streams.</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>7</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Joanna Domańska</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Krzysztof Grochla</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Tadeusz Czachórski</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">T. Atmaca</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Stefan Węgrzyn</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Lech Znamirowski</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Tadeusz Czachórski</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Stanisław Kozielski</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Nowe Technologie Sieci Komputerowych</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2006</style></YEAR><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><PUBLISHER><style face="normal" font="default" size="100%">Wydawnictwo Komunikacji i Łączności</style></PUBLISHER><VOLUME><style face="normal" font="default" size="100%">1</style></VOLUME><SECTION><style face="normal" font="default" size="100%">Mechanizm optycznego przełączania ciągów danych</style></SECTION><title><style face="normal" font="default" size="100%">Nowe Technologie Sieci Komputerowych</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>31</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Joanna Domańska</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">I. Kotuliak</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">T. Atmaca</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Tadeusz Czachórski</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Optical packet filling</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2003</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Proc. 10th Polish Teletraffic Symposium, Kraków 18-19 Sept. 2003</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><PAGES><style face="normal" font="default" size="100%">419–429</style></PAGES><title><style face="normal" font="default" size="100%">Optical packet filling</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>31</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Adam Domański</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Joanna Domańska</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Tadeusz Czachórski</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Andrzej Kwiecień</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Piotr Gaj</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">P. Stera</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Comparison of CHOKe and gCHOKe active queues managemant algirithms with the use of fluid flow approximation.</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2013</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Computer Networks</style></SECONDARY_TITLE><PLACE_PUBLISHED><style face="normal" font="default" size="100%">Berlin Heidelberg</style></PLACE_PUBLISHED><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><PUBLISHER><style face="normal" font="default" size="100%">Springer</style></PUBLISHER><PAGES><style face="normal" font="default" size="100%">363–371</style></PAGES><DATE><style face="normal" font="default" size="100%">6</style></DATE><ABSTRACT><style face="normal" font="default" size="100%">In the article we examine a model of TCP connection with Active Queue Managemanet in an intermediate IP router. We model a system where CHOKe or gCHOKe are the AQM policy. We use the fluid flow approximation technique to model the interactions between the set of TCP/UDP flows and two variants of the CHOKe algoithms. The obtained results confirm the superiority of these algorithms over a standard RED algorithm.</style></ABSTRACT><title><style face="normal" font="default" size="100%">Comparison of CHOKe and gCHOKe active queues managemant algirithms with the use of fluid flow approximation.</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>7</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Adam Domański</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Joanna Domańska</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Tadeusz Czachórski</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Andrzej Kwiecień</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Piotr Gaj</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">P. Stera</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Computer Networks</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2012</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Communications in Computer and Information Science</style></SECONDARY_TITLE><PLACE_PUBLISHED><style face="normal" font="default" size="100%">Berlin Heidelberg</style></PLACE_PUBLISHED><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><PUBLISHER><style face="normal" font="default" size="100%">Springer</style></PUBLISHER><VOLUME><style face="normal" font="default" size="100%">291</style></VOLUME><SECTION><style face="normal" font="default" size="100%">Comparison of AQM control systems with the use of fluid flow approximation</style></SECTION><ISBN><style face="normal" font="default" size="100%">978-3-642-31216-8</style></ISBN><ABSTRACT><style face="normal" font="default" size="100%">In the article we study a model of TCP/UDP connection with Active Queue Management in an intermediate IP router. We use the fluid flow approximation technique to model the interactions between the set of TCP/UDP flows and AQM. We model a system where RED or NLRED are the AQM policy.The obtained results confirm the advantage of our NLRED algorithm</style></ABSTRACT><title><style face="normal" font="default" size="100%">Computer Networks</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>7</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Adam Domański</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Joanna Domańska</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Tadeusz Czachórski</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Piotr Pikiewicz</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">M. Rostański</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Internet in the Information Society Computer Systems Architecture and Security</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2013</style></YEAR><PLACE_PUBLISHED><style face="normal" font="default" size="100%">41-300 Dąbrowa Górnicza Cieplaka Str. 1c</style></PLACE_PUBLISHED><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><PUBLISHER><style face="normal" font="default" size="100%">Academy od Business in Dabrowa Gornicza</style></PUBLISHER><SECTION><style face="normal" font="default" size="100%">Active queues management algorithms, an analysis with the use of fluid flow approximation in CUDA en</style></SECTION><ISBN><style face="normal" font="default" size="100%">978-83-62897-40-7</style></ISBN><ABSTRACT><style face="normal" font="default" size="100%">In the article we study a model of the TCP connection with Active Queue Management in the intermediate bottleneck IP router. The fluid flow approximation technique is used to model the interactions between the set of TCP flows and AQM algorithms. The numerical part of the model is run in CUDA environment.</style></ABSTRACT><title><style face="normal" font="default" size="100%">Internet in the Information Society Computer Systems Architecture and Security</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>7</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Adam Domański</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Joanna Domańska</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Tadeusz Czachórski</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Bolesław Pochopień</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Andrzej Kwiecień</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Andrzej Grzywak</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Jerzy Klamka</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Nowe Technologie Sieci Komputerowych</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2006</style></YEAR><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><PUBLISHER><style face="normal" font="default" size="100%">Wydawnictwa Komunikacji i Łączności</style></PUBLISHER><SECTION><style face="normal" font="default" size="100%">Badanie mechanizmów kontroli przeciążenia w TCP zaimplementowanych w systemie operacyjnym Linux</style></SECTION><title><style face="normal" font="default" size="100%">Nowe Technologie Sieci Komputerowych</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>7</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Adam Domański</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Joanna Domańska</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Tadeusz Czachórski</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Stefan Węgrzyn</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Lech Znamirowski</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Tadeusz Czachórski</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Nowe Technologie Sieci Komputerowych</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2006</style></YEAR><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><PUBLISHER><style face="normal" font="default" size="100%">Wydawnictwa Komunikacji i Łączności</style></PUBLISHER><VOLUME><style face="normal" font="default" size="100%">1</style></VOLUME><SECTION><style face="normal" font="default" size="100%">Projekt i implementacja modułu kolejkowego systemu Standardowego Interfejsu Central Cyfrowych (SICC)</style></SECTION><title><style face="normal" font="default" size="100%">Nowe Technologie Sieci Komputerowych</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Adam Domański</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Joanna Domańska</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Tadeusz Czachórski</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">GCU-Accelerated fluid flow approximation of the Active Queues Management algorithms</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2013</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Theoretical and Applied Informatics</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><VOLUME><style face="normal" font="default" size="100%">25</style></VOLUME><NUMBER><style face="normal" font="default" size="100%">2</style></NUMBER><PAGES><style face="normal" font="default" size="100%">93–104</style></PAGES><ABSTRACT><style face="normal" font="default" size="100%">In the article we study a model of TCP connection with Active Queue Management in an intermediate IP router. We use the fluid flow approximation technique to model the interactions between the set of TCP flows and AQM algorithms. Computations for fluid flow approximation model are performed in the CUDA environment.</style></ABSTRACT><title><style face="normal" font="default" size="100%">GCU-Accelerated fluid flow approximation of the Active Queues Management algorithms</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Adam Domański</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Joanna Domańska</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Tadeusz Czachórski</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">The impact of self-similarity on traffic shaping in wireless LAN</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2008</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Lecture Notes in Computer Science, Springer Berlin</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><title><style face="normal" font="default" size="100%">The impact of self-similarity on traffic shaping in wireless LAN</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>7</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Adam Domański</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Joanna Domańska</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Tadeusz Czachórski</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Internet 2005</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2005</style></YEAR><PLACE_PUBLISHED><style face="normal" font="default" size="100%">Wrocław</style></PLACE_PUBLISHED><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><PUBLISHER><style face="normal" font="default" size="100%">Oficyna Wydawnicza Politechniki Wrocławskiej</style></PUBLISHER><SECTION><style face="normal" font="default" size="100%">Mechanizmy zapewnienia jakości usług w Internecie w ramach architektury integrated service</style></SECTION><title><style face="normal" font="default" size="100%">Internet 2005</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Adam Domański</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Joanna Domańska</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Tadeusz Czachórski</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">F. Kłębczyk</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Some aspects of QoS in wireless LAN</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2008</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Studia Informatica</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><title><style face="normal" font="default" size="100%">Some aspects of QoS in wireless LAN</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>7</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Adam Domański</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Joanna Domańska</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Tadeusz Czachórski</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">F. Kłębczyk</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Sieci Komputerowe</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2008</style></YEAR><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><PUBLISHER><style face="normal" font="default" size="100%">Wydawnictwa Komunikacji i Łączności</style></PUBLISHER><SECTION><style face="normal" font="default" size="100%">Suitability study of Differentiated Service for Quality of Service in wireless LAN</style></SECTION><title><style face="normal" font="default" size="100%">Sieci Komputerowe</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Adam Domański</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Joanna Domańska</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Sławomir Nowak</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Tadeusz Czachórski</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">A contribution to the fair scheduling for the TCP and UDP streams</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2010</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Communications in Computer and Information Science 79</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><title><style face="normal" font="default" size="100%">A contribution to the fair scheduling for the TCP and UDP streams</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>7</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Piotr Gawron</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Przemysław Głomb</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Jaroslaw Miszczak</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Zbigniew Puchała</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Tadeusz Czachórski</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Stanisław Kozielski</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Urszula Stańczyk</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Eigengestures for natural human computer interface</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2011</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Man-Machine Interactions 2</style></SECONDARY_TITLE><PLACE_PUBLISHED><style face="normal" font="default" size="100%">Berlin / Heidelberg</style></PLACE_PUBLISHED><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><PUBLISHER><style face="normal" font="default" size="100%">Springer</style></PUBLISHER><PAGES><style face="normal" font="default" size="100%">49–56</style></PAGES><ISBN><style face="normal" font="default" size="100%">978-3-642-23168-1</style></ISBN><ABSTRACT><style face="normal" font="default" size="100%">We present the application of Principal Component Analysis for data acquired during the design of a natural gesture interface. We investigate the concept of an eigengesture for motion capture hand gesture data and present the visualisation of principal components obtained in the course of conducted experiments. We also show the influence of dimensionality reduction on reconstructed gesture data quality.</style></ABSTRACT><NOTES><style face="normal" font="default" size="100%">arXiv:1105.1293</style></NOTES><title><style face="normal" font="default" size="100%">Eigengestures for natural human computer interface</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>31</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Krzysztof Grochla</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Tadeusz Czachórski</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Arkadiusz Sochan</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">A tool for network traffic generation and transmission delay measurement</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2001</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Proceedings of 8th Polish Teletraffic Symposium</style></SECONDARY_TITLE><PLACE_PUBLISHED><style face="normal" font="default" size="100%">Gliwice</style></PLACE_PUBLISHED><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><PUBLISHER><style face="normal" font="default" size="100%">IITiS PAN</style></PUBLISHER><title><style face="normal" font="default" size="100%">A tool for network traffic generation and transmission delay measurement</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>31</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Krzysztof Grochla</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Tadeusz Czachórski</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">A. Busic</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">J. Fourneau</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Simulation Analysis of Deflection Routing in Hypercube</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2007</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Proceedings from Polish Teletraffic Symposium</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><PUBLISHER><style face="normal" font="default" size="100%">IITiS PAN</style></PUBLISHER><DATE><style face="normal" font="default" size="100%">9</style></DATE><title><style face="normal" font="default" size="100%">Simulation Analysis of Deflection Routing in Hypercube</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>7</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Krzysztof Grochla</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Tadeusz Czachórski</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Przemysław Głomb</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Arkadiusz Sochan</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Andrzej Grzywak</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Internet w społeczeństwie informacyjnym - Podstawowe problemy Internetu</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2004</style></YEAR><PLACE_PUBLISHED><style face="normal" font="default" size="100%">Warszawa</style></PLACE_PUBLISHED><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><PUBLISHER><style face="normal" font="default" size="100%">Wydawnictwa Naukowo-Techniczne</style></PUBLISHER><SECTION><style face="normal" font="default" size="100%">Badania symulacyjne pakietowych sieci optycznych o dowolnych topologiach</style></SECTION><title><style face="normal" font="default" size="100%">Internet w społeczeństwie informacyjnym - Podstawowe problemy Internetu</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>31</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Krzysztof Grochla</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Tadeusz Czachórski</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Jerzy Klamka</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Numerical Model of Tcp in 802.16 Networks Using Fluid Flow Approximation</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2011</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">First International Conference on Networking and Future Internet 2011 (ICNFI 2011)</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><title><style face="normal" font="default" size="100%">Numerical Model of Tcp in 802.16 Networks Using Fluid Flow Approximation</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">H. Elbiaze</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">T. Atmaca</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Tadeusz Czachórski</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Blind shaping strategy of self-similar traffic: Markovian model</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2002</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Archiwum Informatyki Teoretycznej i Stosowanej</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><VOLUME><style face="normal" font="default" size="100%">14</style></VOLUME><NUMBER><style face="normal" font="default" size="100%">1</style></NUMBER><PAGES><style face="normal" font="default" size="100%">13–25</style></PAGES><title><style face="normal" font="default" size="100%">Blind shaping strategy of self-similar traffic: Markovian model</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>31</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Jerzy Klamka</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Tadeusz Czachórski</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Krzysztof Grochla</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Modelling TCP Connection in WIMAX Network Using Fluid Flow Approximation.</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2011</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Applications and the Internet</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><PUBLISHER><style face="normal" font="default" size="100%">IEEE Computer Society Press</style></PUBLISHER><PAGES><style face="normal" font="default" size="100%">502–507</style></PAGES><ABSTRACT><style face="normal" font="default" size="100%">The fluid-flow approximation models have been during last few years to analyze the dynamics and stability of TCP/RED connections in wired networks. The model assumes that the fluctuations of parameters of the connections are relatively low. The fluid flow models base on the linearization and use of control theory analysis tools to verify the stability and behavior of the analyzed system. In this article we use some extensions of fluid flow approximation to support time division multiplexing used in WiMAX wireless networks. We describe the modification of fluid flow equations to incorporate the delivery of packets as an on-off source with on and off times modulated by the WiMAX scheduling algorithm. The results of the fluid flow model have been compared to the measurement in a small test bed. We also show how to analyze the stability of the connection using control theory approach.</style></ABSTRACT><title><style face="normal" font="default" size="100%">Modelling TCP Connection in WIMAX Network Using Fluid Flow Approximation.</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>31</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Jerzy Klamka</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">J. Tańcula</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Tadeusz Czachórski</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Examination of robust stability of computer networks</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2010</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Performance Modelling and Evaluation of Heterogeneous Networks</style></SECONDARY_TITLE><PLACE_PUBLISHED><style face="normal" font="default" size="100%">Gliwice, Bałtycka 5</style></PLACE_PUBLISHED><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><PUBLISHER><style face="normal" font="default" size="100%">Institute of Theoretical and Applied Informatics of the Polish Academy o Sciences</style></PUBLISHER><PAGES><style face="normal" font="default" size="100%">75–87</style></PAGES><ABSTRACT><style face="normal" font="default" size="100%">The thesis presents a nonlinear mathematical model of a computer network with the RED algorithm. The model equations were linearized around the set operating point and next block diagrams of the system presented. Using the methods for examining stability known from the literature, the robust stability of the system has been analysed with slight changes in its parameters. An example of stability examination prepared on the basis of the data for a real computer network has been shown. The results generalise the results known in he literature</style></ABSTRACT><NOTES><style face="normal" font="default" size="100%">HET-NETs 2010 Zakopane, January 14th - 16th, 2010</style></NOTES><title><style face="normal" font="default" size="100%">Examination of robust stability of computer networks</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>31</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Przemysław Kowalski</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Dariusz Pojda</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Aleksandra Gruca</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Tadeusz Czachórski</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Stanisław Kozielski</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Visualization of heterogenic images of 3D scene</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2014</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Man-Machine Interacions 3</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><PUBLISHER><style face="normal" font="default" size="100%">Silesian University of Technology, Gliwice, Institute of Theoretical and Applied Informatics, Polish Academy of Science, Gliwice</style></PUBLISHER><PAGES><style face="normal" font="default" size="100%">291–297</style></PAGES><ABSTRACT><style face="normal" font="default" size="100%">&lt;p&gt;The article presents a problem of 3D and 2D heterogenic data visualization. The data come from different devices installed on the robot platform. The data include 3D point cloud, 2D images, 3D and 2D occupancy grids, obtained from laser scanning device, stereocameras and calculated using data from laser 3D scanner.&lt;/p&gt;&#13;
</style></ABSTRACT><NOTES><style face="normal" font="default" size="100%">ICMMI 2013 International Conference on Man-Machine Interactions Brenna, October 22-25, 2013</style></NOTES><title><style face="normal" font="default" size="100%">Visualization of heterogenic images of 3D scene</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>31</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">M. Nycz</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">T. Nycz</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Tadeusz Czachórski</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Piotr Gaj</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">An analysis of the extracted parts of Opte Internet topology.</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2015</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Computer Networks</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><PUBLISHER><style face="normal" font="default" size="100%">Springer International Publishing Switzerland</style></PUBLISHER><PAGES><style face="normal" font="default" size="100%">371–381</style></PAGES><ABSTRACT><style face="normal" font="default" size="100%">The paper defines a method to extract a part of a graph, which corresponding to a network (Internet) topology covering a certain area. The method refers to data gathered within Opte Project and describing the Internet topology. The extracted parts of graphs have been analyzed in terms of the number of neighbours, longest path length and existence of cycles. Then the resulting topologies are used to model transient behaviour of wide area networks with the use of fluid-flow approximation.</style></ABSTRACT><NOTES><style face="normal" font="default" size="100%">22nd International Conference, CN 2015 Brunów, Poland, June 16-19, 2015</style></NOTES><title><style face="normal" font="default" size="100%">An analysis of the extracted parts of Opte Internet topology.</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">M.M. Nycz</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Tadeusz Czachórski</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Modelowanie dynamiki przesyłów TCP/IP z uwzględnieniem mechanizmu RED</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2012</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Studia Informatica</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><VOLUME><style face="normal" font="default" size="100%">33</style></VOLUME><NUMBER><style face="normal" font="default" size="100%">3! (107)</style></NUMBER><PAGES><style face="normal" font="default" size="100%">49–62</style></PAGES><ABSTRACT><style face="normal" font="default" size="100%">W pracy przedstawiono wyniki modelowania wybranych scenariuszy współczesnych sieci komputerowych. W badaniach zastosowano model matematyczny aproksymacji fluid flow, opisujący wpływ zmiennego w czasie natężenia ruchu pakietów na przełączniki sieciowe i generowanie strat pakietowych, zgodnie z założeniami mechanizmu RED stosowanego w routerach. Przeprowadzone doświadczenia obejmowały wpływ początkowych ustawień parametrów na zachowanie układu.</style></ABSTRACT><title><style face="normal" font="default" size="100%">Modelowanie dynamiki przesyłów TCP/IP z uwzględnieniem mechanizmu RED</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>31</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">M.M. Nycz</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Tadeusz Czachórski</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Modelling transient TCP flows with the use of fluid flow approximation - a numerical study</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2011</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%"/></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><PAGES><style face="normal" font="default" size="100%">181–184</style></PAGES><ABSTRACT><style face="normal" font="default" size="100%">This article presents the problem of modeling the basic elements of the transport system of the modern computer networks. The study of selected issues of the network topology uses a mathematical model of fluid flow approximations, which is based on mean value analysis. The model describes the effects of time varying packet traffic on the network switches and packet loss generation by the assumptions of active queue management mechanisms used in routers. The computations are due to our new software tool.</style></ABSTRACT><NOTES><style face="normal" font="default" size="100%"/></NOTES><title><style face="normal" font="default" size="100%">Modelling transient TCP flows with the use of fluid flow approximation - a numerical study</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>7</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Mateusz Nowak</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Sławomir Nowak</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Tadeusz Czachórski</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Andrzej Kwiecień</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Stefan Węgrzyn</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Contemporary aspects of computer networks</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2008</style></YEAR><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><PUBLISHER><style face="normal" font="default" size="100%">WKiŁ</style></PUBLISHER><SECTION><style face="normal" font="default" size="100%">Concept of new synchronisation method for wireless networks distribiuted simulation</style></SECTION><title><style face="normal" font="default" size="100%">Contemporary aspects of computer networks</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>31</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Mateusz Nowak</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Piotr Pecka</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Tadeusz Czachórski</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">QoS management for multimedia traffic in synchronous slotted-ring OPS networks</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2010</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Proc. of HET-NETs 2010 Conference</style></SECONDARY_TITLE><PLACE_PUBLISHED><style face="normal" font="default" size="100%">Gliwice, Bałtycka 5</style></PLACE_PUBLISHED><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><PUBLISHER><style face="normal" font="default" size="100%">Institute of Theoretical and Applied Informatics of the Polish Academy of Sciences</style></PUBLISHER><PAGES><style face="normal" font="default" size="100%">143–152</style></PAGES><DATE><style face="normal" font="default" size="100%">1</style></DATE><ABSTRACT><style face="normal" font="default" size="100%">The paper presents synchronous slotted-ring network with optical packet switching. The network is equipped with quality of service management, particularly considering multimedia transfers. Thanks to proposed mechanism of guarantees, multimedia data are delivered with guaranteed delay time, not greater than assumed, and in the case the delivery on time is impossible – they are removed, freeing place for remaining packets.</style></ABSTRACT><title><style face="normal" font="default" size="100%">QoS management for multimedia traffic in synchronous slotted-ring OPS networks</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>7</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Sławomir Nowak</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Stefan Węgrzyn</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Bolesław Pochopień</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Tadeusz Czachórski</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Nanotechnologi i nanoinformatyka, Rozdział w książce Współczesne problemy sieci komputerowych</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2004</style></YEAR><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><PUBLISHER><style face="normal" font="default" size="100%">Wydawnictwa Naukowo Technicze</style></PUBLISHER><SECTION><style face="normal" font="default" size="100%">Nowe technologie: Nanotechnologi i nanoinformatyka</style></SECTION><NOTES><style face="normal" font="default" size="100%">Praca finansowana z grantu KBN 7 T11 C 01721</style></NOTES><title><style face="normal" font="default" size="100%">Nanotechnologi i nanoinformatyka, Rozdział w książce Współczesne problemy sieci komputerowych</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>31</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Sławomir Nowak</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Adam Domański</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Joanna Domańska</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Tadeusz Czachórski</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Simulation models of fair scheduling for the TCP and UDP streams</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2010</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">HET-NETs 2010</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><title><style face="normal" font="default" size="100%">Simulation models of fair scheduling for the TCP and UDP streams</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>31</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Sławomir Nowak</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Mateusz Nowak</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Tadeusz Czachórski</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Parallel simulation of networks with packet loss</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2007</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">14th Polish Teletraffic Symposium</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><PUBLISHER><style face="normal" font="default" size="100%">IITiS PAN</style></PUBLISHER><DATE><style face="normal" font="default" size="100%">9</style></DATE><title><style face="normal" font="default" size="100%">Parallel simulation of networks with packet loss</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>7</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Sławomir Nowak</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Stefan Węgrzyn</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Stefan Węgrzyn</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Bolesław Pochopień</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Tadeusz Czachórski</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Wysokowydajne sieci komputerowe</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2005</style></YEAR><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><PUBLISHER><style face="normal" font="default" size="100%">WKiŁ</style></PUBLISHER><SECTION><style face="normal" font="default" size="100%">Nowe Technologie: Systemy operacyjne w układach technoligii molekularnych</style></SECTION><title><style face="normal" font="default" size="100%">Wysokowydajne sieci komputerowe</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>31</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Tadeusz Czachórski</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">M. Nycz</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">T. Nycz</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Ferhan Pekergin</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Andrzej Kwiecień</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Piotr Gaj</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">P. Stera</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Analytical and numerical means to model transient states in computer networks</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2013</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Computer Networks</style></SECONDARY_TITLE><PLACE_PUBLISHED><style face="normal" font="default" size="100%">Berlin Heidelberg</style></PLACE_PUBLISHED><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><PUBLISHER><style face="normal" font="default" size="100%">Springer</style></PUBLISHER><PAGES><style face="normal" font="default" size="100%">426–435</style></PAGES><DATE><style face="normal" font="default" size="100%">6</style></DATE><ABSTRACT><style face="normal" font="default" size="100%">Transient queue analysis is needed to model the influence of time-dependent flows on congestion in computer networks. It may be applied to the networks performance evaluation and the analysis of the transmissions quality of service. However, the exact queuing theory gives us only few practically useful results, concerning mainly M/M/1 and M/M/1/N queues. The article presents potentials of three approaches: Markovian queues solved numerically, the diffusion approximation, and fluid-flow approximation. We mention briefly a software we implemented to use these methods and summarise our experience with it.</style></ABSTRACT><title><style face="normal" font="default" size="100%">Analytical and numerical means to model transient states in computer networks</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>7</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Piotr Pecka</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Sebastian Deorowicz</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Mateusz Nowak</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Tadeusz Czachórski</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Stanisław Kozielski</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Urszula Stańczyk</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Man-Machine Interaction 2</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2011</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Advances in Intelligent and Soft Computing</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><PUBLISHER><style face="normal" font="default" size="100%">Springer Berlin / Heidelberg</style></PUBLISHER><VOLUME><style face="normal" font="default" size="100%">103</style></VOLUME><SECTION><style face="normal" font="default" size="100%">Efficient representation of transition Matrix in the Markov process modeling of computer networks</style></SECTION><ISBN><style face="normal" font="default" size="100%">978-3-642-23168-1</style></ISBN><ABSTRACT><style face="normal" font="default" size="100%">Markov chains are used in analysis in many fields. One of them is performance evaluation of computer systems, especially computer networks. For the analysis we use OLYMP object library that provides features to describe complex systems and find their statistical parameters. We present two compressed data structures for the most space-consuming parts of data processed by OLYMP. Then, we show how these improvements move the barrier of applicability of the utility.</style></ABSTRACT><title><style face="normal" font="default" size="100%">Man-Machine Interaction 2</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>31</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">D. Augustyn</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Adam Domański</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Joanna Domańska</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Tadeusz Czachórski</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Active Queue Management with non-linear packets dropping function</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2010</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Performance Modelling and Evaluation of Heterogeneous Networks Proceedings of 6th Working International Conference</style></SECONDARY_TITLE><PLACE_PUBLISHED><style face="normal" font="default" size="100%">Gliwice, Bałtycka 5</style></PLACE_PUBLISHED><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><PUBLISHER><style face="normal" font="default" size="100%">Institute of Theoretical and Applied Informatics of the Polish Academy of Sciences</style></PUBLISHER><PAGES><style face="normal" font="default" size="100%">133–142</style></PAGES><DATE><style face="normal" font="default" size="100%">1</style></DATE><ABSTRACT><style face="normal" font="default" size="100%">Abstract: Algorithms of queue management in IP routers determine which packet should be deleted when necessary. The article investigates the influence of packet rejection probability function on the performance, i.e. response time for in case of RED and nRED queues. In particular, the self-similar traffic is considered. The quantitative analysis based on simulations is shown.</style></ABSTRACT><title><style face="normal" font="default" size="100%">Active Queue Management with non-linear packets dropping function</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>31</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">R. Laalaoua</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Tadeusz Czachórski</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Stanisław Jędruś</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">T. Atmaca</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Diffusion Model of RED Control Mechanism</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2001</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Proc. of International Conference on Networking ICN01, July 9-13, 2001, CREF, Universite de Haute Alsace, Colmar, France</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><title><style face="normal" font="default" size="100%">Diffusion Model of RED Control Mechanism</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">R. Laalaoua</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Tadeusz Czachórski</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">T. Atmaca</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Diffusion approximation and markovian models of RED control mechanism</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2001</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Archiwum Informatyki Teoretycznej i Stosowanej</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><VOLUME><style face="normal" font="default" size="100%">13</style></VOLUME><NUMBER><style face="normal" font="default" size="100%">3</style></NUMBER><PAGES><style face="normal" font="default" size="100%">343–354</style></PAGES><title><style face="normal" font="default" size="100%">Diffusion approximation and markovian models of RED control mechanism</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>31</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">R. Laalaoua</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Tadeusz Czachórski</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">T. Atmaca</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Markovian Model of RED Mechanism</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2001</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Proc. of CCGrid 2001, IEEE International Symposium on Cluster Computing, 15-18 May 2001, Brisbane, Australia</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><title><style face="normal" font="default" size="100%">Markovian Model of RED Mechanism</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>31</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Krzysztof Skabek</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">P. Płoszaj</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Aleksandra Gruca</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Tadeusz Czachórski</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Stanisław Kozielski</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Implementation of registration algorithms for multiple views</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2014</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Man-Machine Interacions 3</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><PUBLISHER><style face="normal" font="default" size="100%">Silesian University of Technology, Gliwice, Institute of Theoretical and Applied Informatics, Polish Academy of Science, Gliwice</style></PUBLISHER><PAGES><style face="normal" font="default" size="100%">315–323</style></PAGES><ABSTRACT><style face="normal" font="default" size="100%">The article discusses the implementation of algorithms for registration and multiregistration of scans. The multiregistration strategies of mesh sequences for different scanning views were proposed and compared. The comparison criteria comprise parameters of the registration process such as: the accuracy of scan matching, performance, complexity of registration.</style></ABSTRACT><NOTES><style face="normal" font="default" size="100%">ICMMI 2013 International Conference on Man-Machine Interactions Brenna, October 22-25, 2013</style></NOTES><title><style face="normal" font="default" size="100%">Implementation of registration algorithms for multiple views</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>7</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Krzysztof Skabek</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Ryszard Winiarczyk</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Stefan Węgrzyn</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Bolesław Pochopień</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Tadeusz Czachórski</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Wysokowydajne sieci komputerowe Nowe Technologie</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2005</style></YEAR><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><PUBLISHER><style face="normal" font="default" size="100%">WKiŁ</style></PUBLISHER><SECTION><style face="normal" font="default" size="100%">Wykorzystanie skanera 3D do tworzenia obiektów wirtualnych</style></SECTION><title><style face="normal" font="default" size="100%">Wysokowydajne sieci komputerowe Nowe Technologie</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>31</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Ireneusz Szcześniak</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Tadeusz Czachórski</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">OPUS Software for Performance Evaluation of Optical Packet-Switched Networks</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2005</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">XII Konferencja Sieci Komputerowe</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><title><style face="normal" font="default" size="100%">OPUS Software for Performance Evaluation of Optical Packet-Switched Networks</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>7</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Ireneusz Szcześniak</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Tadeusz Czachórski</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Stefan Węgrzyn</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Bolesław Pochopień</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Tadeusz Czachórski</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Wysokowydajne sieci komputerowe. Nowe Technologie</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2005</style></YEAR><PLACE_PUBLISHED><style face="normal" font="default" size="100%">Warszawa</style></PLACE_PUBLISHED><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><PUBLISHER><style face="normal" font="default" size="100%">Wydawnictwa Komunikacji i Łączności</style></PUBLISHER><SECTION><style face="normal" font="default" size="100%">Oprogramowania OPUS do oceny wydajności sieci komunikacyjnych z optycznym przełączaniem pakietów</style></SECTION><title><style face="normal" font="default" size="100%">Wysokowydajne sieci komputerowe. Nowe Technologie</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Ireneusz Szcześniak</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Tadeusz Czachórski</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">J. Fourneau</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Packet Loss Analysis in Optical Packet-Switched Networks with Limited Deflection Routing</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2006</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Photonic Network Communications</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><NOTES><style face="normal" font="default" size="100%">przyjęte do publikacji</style></NOTES><title><style face="normal" font="default" size="100%">Packet Loss Analysis in Optical Packet-Switched Networks with Limited Deflection Routing</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>31</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Ireneusz Szcześniak</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">J. Fourneau</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Tadeusz Czachórski</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Preliminary results of packet loss analysis in optical packet-switched networks with limited deflection routing</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2005</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Proc. of SAINT 2005 Workshops, 31 January - 4 February 2005, Trento, Italy</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><PAGES><style face="normal" font="default" size="100%">296–299</style></PAGES><title><style face="normal" font="default" size="100%">Preliminary results of packet loss analysis in optical packet-switched networks with limited deflection routing</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>31</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">T. Atmaca</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Tadeusz Czachórski</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Krzysztof Grochla</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">T. Nycz</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Ferhan Pekergin</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Erol Gelenbe</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">R. Lent</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">A model of boot-up storm dynamics</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2014</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Computer and Information Sciences III</style></SECONDARY_TITLE><PLACE_PUBLISHED><style face="normal" font="default" size="100%">London</style></PLACE_PUBLISHED><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><PUBLISHER><style face="normal" font="default" size="100%">Springer</style></PUBLISHER><PAGES><style face="normal" font="default" size="100%">371–379</style></PAGES><DATE><style face="normal" font="default" size="100%">10</style></DATE><ABSTRACT><style face="normal" font="default" size="100%">The simultaneous boot of multiple virtual machines or networking devices imposes heavy load on the networking infrastructure. In large network of many virtual machines the coordination of the reboots and device registration is required. In the paper we present a simple analytical model computing the distribution of boot-up time, which is verified by comparison to a simulation model and provide analysis of the influence of several parameters on the overall boot-up time during a boot storm.</style></ABSTRACT><NOTES><style face="normal" font="default" size="100%">27th International Symposium of Computer and Information Sciences, Brenna,Poland, October 22-15, 2013</style></NOTES><title><style face="normal" font="default" size="100%">A model of boot-up storm dynamics</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">T. Atmaca</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Tadeusz Czachórski</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">R. Laalaoua</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Badanie dynamiki algorytmu RED</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2002</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Studia Informatica</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><VOLUME><style face="normal" font="default" size="100%">23</style></VOLUME><NUMBER><style face="normal" font="default" size="100%">2A (48)</style></NUMBER><PAGES><style face="normal" font="default" size="100%">223–234</style></PAGES><title><style face="normal" font="default" size="100%">Badanie dynamiki algorytmu RED</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">T. Nycz</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Tadeusz Czachórski</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Badanie skalowalności modeli sieci komputerowych wykorzystujących aproksymację dyfuzyjną wraz ze zwiększeniem rozmiaru modelowanej sieci</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2012</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Studoa Informatica</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><VOLUME><style face="normal" font="default" size="100%">33</style></VOLUME><NUMBER><style face="normal" font="default" size="100%">3A (107)</style></NUMBER><PAGES><style face="normal" font="default" size="100%">63–78</style></PAGES><ABSTRACT><style face="normal" font="default" size="100%">Zmienne natężenie ruchu generowanego przez aplikacje internetowe, np. multimedialne, a także przyjęta przez protokół TCP zasada regulacji natężenia transmisji w funkcji wykrytego obciążenia sieci, określanego na podstawie strat lub czasu transmisji, powodują, że natężenie transmisji internetowych jest permanentnie zmienne w czasie, a zmiany natężenia i dynamika tych zmian muszą być uwzględnione w ocenie algorytmów sterowania ruchem i unikania przeciążeń. Modelowanie struktur w Internecie wymaga z kolei dostosowania istniejących metod i modeli do analizy bardzo dużych konfiguracji sieciowych. Niniejsza praca bada pod kątem obliczeń numerycznych znany model matematyczny, umożliwiający analizę stanów nieustalonych w stanowisku obsługi i ich sieci, wykorzystujący metodę aproksymacji dyfuzyjnej. Zbadano wpływ poszczególnych parametrów modelu i rozmiaru sieci na całkowity czas obliczeń, a więc na skalowalność metody.</style></ABSTRACT><title><style face="normal" font="default" size="100%">Badanie skalowalności modeli sieci komputerowych wykorzystujących aproksymację dyfuzyjną wraz ze zwiększeniem rozmiaru modelowanej sieci</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>31</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">T. Nycz</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">M. Nycz</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Tadeusz Czachórski</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Andrzej Kwiecień</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Piotr Gaj</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">P. Stera</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">A Numerical Comparison of Diffusion and Fluid-Flow Approximations Used in Modelling Transient States of TCP/IP Networks.</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2014</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Computer Networks</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><PUBLISHER><style face="normal" font="default" size="100%">Springer International Publishing Switzerland</style></PUBLISHER><PAGES><style face="normal" font="default" size="100%">213–222</style></PAGES><ABSTRACT><style face="normal" font="default" size="100%">The paper presents a comparison of two approaches to queuing models used in performance evaluation of computer networks: diffusion approximation and fluid-flow approximation. Both methods are well known and are used alternatively in similar problems but the differences between their results and the errors they introduce when applied to TCP driven time dependent flows were not sufficiently investigated.</style></ABSTRACT><NOTES><style face="normal" font="default" size="100%">21st International Conference, CN 2014 Brunów, Poland, June 23-27, 2014</style></NOTES><title><style face="normal" font="default" size="100%">A Numerical Comparison of Diffusion and Fluid-Flow Approximations Used in Modelling Transient States of TCP/IP Networks.</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>7</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Stefan Węgrzyn</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Stefan Węgrzyn</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Bolesław Pochopień</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Tadeusz Czachórski</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Technologie molekularne realizowane przez molekularne systemy informatyczne</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2005</style></YEAR><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><PUBLISHER><style face="normal" font="default" size="100%">Wydawnictwa Komunikacji i Łączności</style></PUBLISHER><SECTION><style face="normal" font="default" size="100%">Wysokowydajne sieci komputerowe: Nowe Technologie</style></SECTION><title><style face="normal" font="default" size="100%">Technologie molekularne realizowane przez molekularne systemy informatyczne</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>9</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Stefan Węgrzyn</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Jerzy Klamka</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Jaroslaw Miszczak</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Tadeusz Czachórski</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Kwantowe systemy informatyki</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2003</style></YEAR><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><PUBLISHER><style face="normal" font="default" size="100%">Wydawnictwo Pracowni Komputerowej Jacka Skalmierskiego</style></PUBLISHER><EDITION><style face="normal" font="default" size="100%">2</style></EDITION><ISBN><style face="normal" font="default" size="100%">83-89105-46-2</style></ISBN><title><style face="normal" font="default" size="100%">Kwantowe systemy informatyki</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>7</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Lech Znamirowski</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Stefan Węgrzyn</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Bolesław Pochopień</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Tadeusz Czachórski</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Wysokowydajne sieci komputerowe. Nowe technologie</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2005</style></YEAR><PLACE_PUBLISHED><style face="normal" font="default" size="100%">Warszawa</style></PLACE_PUBLISHED><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><PUBLISHER><style face="normal" font="default" size="100%">Wydawnictwa Komunikacji i Łączności</style></PUBLISHER><SECTION><style face="normal" font="default" size="100%">Dwufazowy algorytm wyznaczania konformacji nanostruktur</style></SECTION><ISBN><style face="normal" font="default" size="100%">ISBN 83-206-1573-9</style></ISBN><ABSTRACT><style face="normal" font="default" size="100%">W procesach budowy obiektów w dziedzinie informatycznej technologii wytwarzania, jedną z możliwych metod jest wykorzystanie molekularnego programu określającego budowę obiektu, który powstaje na bazie współdziałających, molekularnych narzędzi realizujących program. Analiza działania sieci współpracujących nanostruktur wymaga znajomości konformacji początkowych lub konformacji występujących w sieci w wyniku współdziałania z innymi nanostrukturami. W rozdziale rozpatruje się zagadnienie wyznaczania konformacji dla polipeptydu określonego jego kodem zapisanym w DNA w przypadku powstawania w rybosomie lub w wyniku współdziałania z tzw. białkiem opiekuńczym w fazie innej niż faza powstawania. Przedstawiony został bezgradientowy, dwufazowy algorytm wyznaczania konformacji poprzez obliczenie kątów torsyjnych dla łańcucha aminokwasów. Rozważania zilustrowano przykładem numerycznym.</style></ABSTRACT><title><style face="normal" font="default" size="100%">Wysokowydajne sieci komputerowe. Nowe technologie</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>7</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Lech Znamirowski</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Stefan Węgrzyn</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Bolesław Pochopień</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Tadeusz Czachórski</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Współczesne problemy sieci komputerowych. Nowe technologie</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2004</style></YEAR><PLACE_PUBLISHED><style face="normal" font="default" size="100%">Warszawa</style></PLACE_PUBLISHED><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><PUBLISHER><style face="normal" font="default" size="100%">WNT</style></PUBLISHER><SECTION><style face="normal" font="default" size="100%">Przełączanie konformacyjne w nanoprocesach</style></SECTION><ISBN><style face="normal" font="default" size="100%">83-204-3010-0</style></ISBN><title><style face="normal" font="default" size="100%">Współczesne problemy sieci komputerowych. Nowe technologie</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>31</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Tadeusz Czachórski</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Erol Gelenbe</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">R. Lent</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Quantum Queuing Networks Throughput Optimisation</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2014</style></YEAR><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><PUBLISHER><style face="normal" font="default" size="100%">ISCIS 29th Annual Symposium</style></PUBLISHER><DATE><style face="normal" font="default" size="100%">X</style></DATE><ISBN><style face="normal" font="default" size="100%">978-3-319-09464-9</style></ISBN><ABSTRACT><style face="normal" font="default" size="100%">We study models of quantum queues based on discrete time quantum walks with barriers. Our considerations refer to multi-servers queuing models. Input and output of jobs in the queue are realized by systems consisting of quantum coins and walkers. We show that presented models behave differently from the classical ones. We also present numerical methods for optimisation of jobs processed by the system. We simultaneously maximise jobs throughput in the system and minimise the number of jobs lost.</style></ABSTRACT><title><style face="normal" font="default" size="100%">Quantum Queuing Networks Throughput Optimisation</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>31</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Tadeusz Czachórski</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Arkadiusz Sochan</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">8th Polish Teletraffic Symposium (Editor)</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2001</style></YEAR><PLACE_PUBLISHED><style face="normal" font="default" size="100%">Gliwice</style></PLACE_PUBLISHED><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><PUBLISHER><style face="normal" font="default" size="100%">Instytut Informatyki Teoretycznej i Stosowanej PAN</style></PUBLISHER><DATE><style face="normal" font="default" size="100%">09</style></DATE><ISBN><style face="normal" font="default" size="100%">83-86644-90-7</style></ISBN><title><style face="normal" font="default" size="100%">8th Polish Teletraffic Symposium (Editor)</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Tadeusz Czachórski</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Adam Domański</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Joanna Domańska</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Artur Rataj</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">A Study of IP Router Queues with the Use of Markov Models</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2016</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Communications in Computer Information Science</style></SECONDARY_TITLE><PLACE_PUBLISHED><style face="normal" font="default" size="100%">Brunów, Poland</style></PLACE_PUBLISHED><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><PUBLISHER><style face="normal" font="default" size="100%">Springer International Publishing Switzerland</style></PUBLISHER><VOLUME><style face="normal" font="default" size="100%">608</style></VOLUME><PAGES><style face="normal" font="default" size="100%">294-305</style></PAGES><title><style face="normal" font="default" size="100%">A Study of IP Router Queues with the Use of Markov Models</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>7</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Monika Nycz</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Tomasz Nycz</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Tadeusz Czachórski</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Omer Abdelrahman</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Erol Gelenbe</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Gokce Gorbil</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Ricardo Lent</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Modelling Dynamics of TCP Flows in Very Large Network Topologies</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2016</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Information Sciences and Systems 2015: 30th International Symposium on Computer and Information Sciences (ISCIS 2015)</style></SECONDARY_TITLE><PLACE_PUBLISHED><style face="normal" font="default" size="100%">Cham</style></PLACE_PUBLISHED><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><PUBLISHER><style face="normal" font="default" size="100%">Springer International Publishing</style></PUBLISHER><PAGES><style face="normal" font="default" size="100%">251–259</style></PAGES><ISBN><style face="normal" font="default" size="100%">978-3-319-22635-4</style></ISBN><URL><style face="normal" font="default" size="100%">http://dx.doi.org/10.1007/978-3-319-22635-4_23</style></URL><title><style face="normal" font="default" size="100%">Modelling Dynamics of TCP Flows in Very Large Network Topologies</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>7</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Johan Arcile</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Tadeusz Czachórski</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Jean-Yves Didier</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Hanna Klaudel</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Artur Rataj</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Aleksandra Gruca</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Agnieszka Brachman</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Stanisław Kozielski</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Tadeusz Czachórski</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Modelling and Analysing Mixed Reality Applications</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2016</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Man–Machine Interactions 4: 4th International Conference on Man–Machine Interactions, ICMMI 2015 Kocierz Pass, Poland, October 6–9, 2015</style></SECONDARY_TITLE><PLACE_PUBLISHED><style face="normal" font="default" size="100%">Cham</style></PLACE_PUBLISHED><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><PUBLISHER><style face="normal" font="default" size="100%">Springer International Publishing</style></PUBLISHER><PAGES><style face="normal" font="default" size="100%">3–17</style></PAGES><ISBN><style face="normal" font="default" size="100%">978-3-319-23437-3</style></ISBN><URL><style face="normal" font="default" size="100%">http://dx.doi.org/10.1007/978-3-319-23437-3_1</style></URL><title><style face="normal" font="default" size="100%">Modelling and Analysing Mixed Reality Applications</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Adam Domański</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Joanna Domańska</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Tadeusz Czachórski</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">The Impact of the Degree of Self-Similarity on the NLREDwM Mechanism with Drop from Front Strategy</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2016</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Communications in Computer Information Science</style></SECONDARY_TITLE><PLACE_PUBLISHED><style face="normal" font="default" size="100%">Cham</style></PLACE_PUBLISHED><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><PUBLISHER><style face="normal" font="default" size="100%">Springer International Publishing</style></PUBLISHER><VOLUME><style face="normal" font="default" size="100%">608</style></VOLUME><PAGES><style face="normal" font="default" size="100%">192–203</style></PAGES><ISBN><style face="normal" font="default" size="100%">978-3-319-39207-3</style></ISBN><URL><style face="normal" font="default" size="100%">http://dx.doi.org/10.1007/978-3-319-39207-3_17</style></URL><title><style face="normal" font="default" size="100%">The Impact of the Degree of Self-Similarity on the NLREDwM Mechanism with Drop from Front Strategy</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Tadeusz Czachórski</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Adam Domański</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Joanna Domańska</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Michele Pagano</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Artur Rataj</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Delays in IP Routers, a Markov Model</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2016</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Communications in Computer Information Science</style></SECONDARY_TITLE><PLACE_PUBLISHED><style face="normal" font="default" size="100%">Cham</style></PLACE_PUBLISHED><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><PUBLISHER><style face="normal" font="default" size="100%">Springer International Publishing</style></PUBLISHER><VOLUME><style face="normal" font="default" size="100%">659</style></VOLUME><PAGES><style face="normal" font="default" size="100%">185–192</style></PAGES><ISBN><style face="normal" font="default" size="100%">978-3-319-47217-1</style></ISBN><URL><style face="normal" font="default" size="100%">http://dx.doi.org/10.1007/978-3-319-47217-1_20</style></URL><title><style face="normal" font="default" size="100%">Delays in IP Routers, a Markov Model</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Adam Domański</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Joanna Domańska</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Michele Pagano</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Tadeusz Czachórski</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">The Fluid Flow Approximation of the TCP Vegas and Reno Congestion Control Mechanism</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2016</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Communications in Computer Information Science</style></SECONDARY_TITLE><PLACE_PUBLISHED><style face="normal" font="default" size="100%">Cham</style></PLACE_PUBLISHED><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><PUBLISHER><style face="normal" font="default" size="100%">Springer International Publishing</style></PUBLISHER><VOLUME><style face="normal" font="default" size="100%">659</style></VOLUME><PAGES><style face="normal" font="default" size="100%">193–200</style></PAGES><ISBN><style face="normal" font="default" size="100%">978-3-319-47217-1</style></ISBN><URL><style face="normal" font="default" size="100%">http://dx.doi.org/10.1007/978-3-319-47217-1_21</style></URL><title><style face="normal" font="default" size="100%">The Fluid Flow Approximation of the TCP Vegas and Reno Congestion Control Mechanism</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>7</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Sławomir Nowak</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Mateusz Nowak</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Krzysztof Grochla</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Piotr Pecka</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Tadeusz Czachórski</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Erol Gelenbe</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Krzysztof Grochla</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Ricardo Lent</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Global Queue Pruning Method for Efficient Broadcast in Multihop Wireless Networks</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2016</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Computer and Information Sciences: 31st International Symposium, ISCIS 2016, Kraków, Poland, October 27–28, 2016, Proceedings</style></SECONDARY_TITLE><PLACE_PUBLISHED><style face="normal" font="default" size="100%">Cham</style></PLACE_PUBLISHED><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><PUBLISHER><style face="normal" font="default" size="100%">Springer International Publishing</style></PUBLISHER><PAGES><style face="normal" font="default" size="100%">214–224</style></PAGES><ISBN><style face="normal" font="default" size="100%">978-3-319-47217-1</style></ISBN><URL><style face="normal" font="default" size="100%">http://dx.doi.org/10.1007/978-3-319-47217-1_23</style></URL><title><style face="normal" font="default" size="100%">Global Queue Pruning Method for Efficient Broadcast in Multihop Wireless Networks</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>9</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Tadeusz Czachórski</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Erol Gelenbe</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Krzysztof Grochla</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Ricardo Lent</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Computer and Information Sciences ISCIS 2016</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2016</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Communications in computer Information Science</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><VOLUME><style face="normal" font="default" size="100%">659</style></VOLUME><NUMBER><style face="normal" font="default" size="100%">659</style></NUMBER><PAGES><style face="normal" font="default" size="100%">500</style></PAGES><EDITION><style face="normal" font="default" size="100%">Springer</style></EDITION><title><style face="normal" font="default" size="100%">Computer and Information Sciences ISCIS 2016</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Joanna Domańska</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Erol Gelenbe</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Tadeusz Czachórski</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Anastasios Drosou</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Dimitrios Tzovaras</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Research and innovation action for the security of the internet of things: The SerIoT project</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2018</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%"> Communications in Computer and Information Science</style></SECONDARY_TITLE><PLACE_PUBLISHED><style face="normal" font="default" size="100%">London, United Kingdom</style></PLACE_PUBLISHED><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><PUBLISHER><style face="normal" font="default" size="100%">Springer</style></PUBLISHER><VOLUME><style face="normal" font="default" size="100%">821</style></VOLUME><PAGES><style face="normal" font="default" size="100%">101-118</style></PAGES><SECTION><style face="normal" font="default" size="100%">101</style></SECTION><ISBN><style face="normal" font="default" size="100%">978-331995188-1</style></ISBN><ABSTRACT><style face="normal" font="default" size="100%">&lt;p&gt;The Internet of Things (IoT) was born in the mid 2010’s, when the threshold of connecting more objects than people to the Internet, was crossed. Thus, attacks and threats on the content and quality of service of the IoT platforms can have economic, energetic and physical security consequences that go way beyond the traditional Internet’s lack of security, and way beyond the threats posed by attacks to mobile telephony. Thus, this paper describes the H2020 project “Secure and Safe Internet of Things” (SerIoT) which will optimize the information security in IoT platforms and networks in a holistic, cross-layered manner (i.e. IoT platforms and devices, honeypots, SDN routers and operator’s controller) in order to offer a secure SerIoT platform that can be used to implement secure IoT platforms and networks anywhere and everywhere.&lt;/p&gt;&#13;
</style></ABSTRACT><title><style face="normal" font="default" size="100%">Research and innovation action for the security of the internet of things: The SerIoT project</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Joanna Domańska</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Mateusz Nowak</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Sławomir Nowak</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Tadeusz Czachórski</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">European Cybersecurity Research and the SerIoT Project</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2018</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Communications in Computer and Information Science </style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><VOLUME><style face="normal" font="default" size="100%">935</style></VOLUME><PAGES><style face="normal" font="default" size="100%">166-173</style></PAGES><SECTION><style face="normal" font="default" size="100%">166</style></SECTION><DATE><style face="normal" font="default" size="100%">08/2018</style></DATE><ABSTRACT><style face="normal" font="default" size="100%">&lt;p&gt;This paper briefly reviews some recent research in Cybersecurity in Europe funded by the European Commission in areas such as mobile telephony, networked health systems, the Internet of Things. We then outline the objectives of the SerIoT Project which started in 2018 to address the security needs of fields such as Smart Cities, Smart Transportation Systems, Supply Chains and Industrial Informatics.&lt;/p&gt;&#13;
</style></ABSTRACT><URL><style face="normal" font="default" size="100%">https://link.springer.com/chapter/10.1007/978-3-030-00840-6_19</style></URL><title><style face="normal" font="default" size="100%">European Cybersecurity Research and the SerIoT Project</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Adam Domański</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Joanna Domańska</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Tadeusz Czachórski</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Jerzy Klamka</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Jakub Szyguła</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">The AQM Dropping Packet Probability Function Based on Non-integer Order PI^αD^β Controller</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2019</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Lecture Notes in Electrical Engineering</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><VOLUME><style face="normal" font="default" size="100%">496</style></VOLUME><PAGES><style face="normal" font="default" size="100%">36-48</style></PAGES><SECTION><style face="normal" font="default" size="100%">36</style></SECTION><title><style face="normal" font="default" size="100%">The AQM Dropping Packet Probability Function Based on Non-integer Order PI^αD^β Controller</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Adam Domański</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Joanna Domańska</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Tadeusz Czachórski</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Jerzy Klamka</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Dariusz Marek</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Jakub Szyguła</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">GPU Accelerated Non-integer Order PI^αD^β Controller Used as AQM Mechanism</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2018</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Communications in Computer and Information Science</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><VOLUME><style face="normal" font="default" size="100%">860</style></VOLUME><PAGES><style face="normal" font="default" size="100%">286-299</style></PAGES><SECTION><style face="normal" font="default" size="100%">286</style></SECTION><title><style face="normal" font="default" size="100%">GPU Accelerated Non-integer Order PI^αD^β Controller Used as AQM Mechanism</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Adam Domański</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Joanna Domańska</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Tadeusz Czachórski</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Jerzy Klamka</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Dariusz Marek</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Jakub Szyguła</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">The Influence of the Traffic Self-similarity on the Choice of the Non-integer Order PI^α Controller Parameters</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2018</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Communications in Computer and Information Science</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><VOLUME><style face="normal" font="default" size="100%">935</style></VOLUME><PAGES><style face="normal" font="default" size="100%">76-83</style></PAGES><SECTION><style face="normal" font="default" size="100%">76</style></SECTION><title><style face="normal" font="default" size="100%">The Influence of the Traffic Self-similarity on the Choice of the Non-integer Order PI^α Controller Parameters</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>31</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Erol Gelenbe</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Joanna Domańska</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Tadeusz Czachórski</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Anastasis Drosou</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Dimitrios Tzovaras</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Security for Internet of Things: The SerIoT Project</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2018</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">2018 International Symposium on Networks, Computers and Communications (ISNCC)</style></SECONDARY_TITLE><PLACE_PUBLISHED><style face="normal" font="default" size="100%">Rome, Italy</style></PLACE_PUBLISHED><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><PUBLISHER><style face="normal" font="default" size="100%">IEEE</style></PUBLISHER><title><style face="normal" font="default" size="100%">Security for Internet of Things: The SerIoT Project</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Adam Domański</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Joanna Domańska</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Tadeusz Czachórski</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Jerzy Klamka</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">The use of a non-integer order PI controller with an active queue management mechanism</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2016</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">International Journal of Applied Mathematics and Computer Science</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><VOLUME><style face="normal" font="default" size="100%">26</style></VOLUME><ISSUE><style face="normal" font="default" size="100%">4</style></ISSUE><PAGES><style face="normal" font="default" size="100%">777-789</style></PAGES><title><style face="normal" font="default" size="100%">The use of a non-integer order PI controller with an active queue management mechanism</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Adam Domański</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Joanna Domańska</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Tadeusz Czachórski</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Jerzy Klamka</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Self-similarity Traffic and AQM Mechanism Based on Non-integer Order Pi^αD^β Controller</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2017</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Communications in Computer and Information Science</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><VOLUME><style face="normal" font="default" size="100%">718</style></VOLUME><PAGES><style face="normal" font="default" size="100%">336-350</style></PAGES><title><style face="normal" font="default" size="100%">Self-similarity Traffic and AQM Mechanism Based on Non-integer Order Pi^αD^β Controller</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Joanna Domańska</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Adam Domański</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Tadeusz Czachórski</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Hidden Markov Models in Long Range Dependence Traffic Modelling</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2017</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Communications in Computer and Information Science</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><VOLUME><style face="normal" font="default" size="100%">700</style></VOLUME><PAGES><style face="normal" font="default" size="100%">75-86</style></PAGES><title><style face="normal" font="default" size="100%">Hidden Markov Models in Long Range Dependence Traffic Modelling</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>31</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Tadeusz Czachórski</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Models of traffic control in large Internet topologies, invited talk</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2018</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">The 8th International Conference on Electronics, Communications and Networks (CECNet 2018) Bangkok, Thailand, November 16-19th, 2018</style></SECONDARY_TITLE><PLACE_PUBLISHED><style face="normal" font="default" size="100%">Bangkok, Thailand</style></PLACE_PUBLISHED><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><PUBLISHER><style face="normal" font="default" size="100%">Rangsit University</style></PUBLISHER><DATE><style face="normal" font="default" size="100%">11/2018</style></DATE><ABSTRACT><style face="normal" font="default" size="100%">&lt;p&gt;&lt;span style="font-family:times new roman,serif; font-size:12pt"&gt;Transient state queueing models help us to understand better the dynamics of Internet transmissions and the performance of traffic control algorithms. Fluid flow approximation, due its simplicity is popular and frequently used -- but even it, if applied to large topologies, is time and space consuming. The alternative approaches as Markov chains or diffusion approximation lead to much more complex computations. Fluid flow approximation is based on first-order differential equations, and its algorithm is based on iterative calculations on large mutually interdependent structures. In consequence, the bottleneck of the method lies not in numerical computations but in storing and selection of data. This is why we use an approach in which a database (SAP HANA) and its language are used to implement the method. The model logic is represented by ETL (Extract, Transform and Load) customizable and user-friendly processes. The numerical examples are based on a real topology having over 100 000 nodes. We may investigate and compare this way various TCP control algorithms as Vegas or Reno, as well as the influence of the introduction of energy aware algorithms to routers.&lt;/span&gt;&lt;/p&gt;&#13;
</style></ABSTRACT><title><style face="normal" font="default" size="100%">Models of traffic control in large Internet topologies, invited talk</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>31</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Tadeusz Czachórski</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Queueing Models for Performance Evaluation of Computer Networks - Transient State Analysis, invited talk </style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2018</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">2018 International Conference on Sensor Networks and Signal Processing (SNSP 2018)</style></SECONDARY_TITLE><PLACE_PUBLISHED><style face="normal" font="default" size="100%">Xi'an, China</style></PLACE_PUBLISHED><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><PUBLISHER><style face="normal" font="default" size="100%">Xi'an University of Science Technology, China</style></PUBLISHER><DATE><style face="normal" font="default" size="100%">11/2018</style></DATE><ABSTRACT><style face="normal" font="default" size="100%">&lt;p&gt;Queueing theory is a useful tool in design of computer networks and their performance evaluation. The literature concerning this subject is abundant. However, it is in general limited to the analysis of steady states. It means that flows considered in models are constant and obtained solutions do not depend on time. It is in glaring contrast with the flows observed in real networks where the perpetual changes of traffic intensities are due to the nature of users, sending variable quantities of data, cf. multimedia traffic, and also due to the performance of traffic control algorithms which are trying to avoid congestion in networks, e.g. the algorithm of congestion window used in TCP protocol which is adapting the rate of the sent traffic to the observed losses or transmission delays. The quality of Internet transmission services depends on current load of links and not on its average value. Also modelling and understanding the performance of traffic control mechanisms, control stability and its impact on quality of service needs transient state analysis.&lt;/p&gt;&#13;
&#13;
&lt;p&gt;We discuss mathematical and computational means used to analyse transient states in queueing models. In computer applications a mathematical model is useful only when it furnishes quantitative results. Therefore practical issues related to numerical side of models are of importance. &#160;We present three approaches - Markov models solved numerically, fluid flow approximation and diffusion approximation. A particular importance is given to the latter which is describing the evolution of queues and waiting times in terms of partial differential equations. The author has over 20 year experience in development and application of this method and is also convinced of the qualities of this approach, its flexibility to treat various variants of queueing models.&lt;/p&gt;&#13;
&#13;
&lt;p&gt;Fluid flow approximation, due its simplicity is popular and frequently used -- but even it, if applied to large topologies, is time and space consuming. &#160;&#160;&#160;&#160;&#160;&#160;&#160;&#160;&#160; Fluid flow approximation is based on first-order differential equations, and its algorithm needs iterative calculations on large mutually interdependent structures. In consequence, the bottleneck of the method lies not in numerical computations but in storing and selection of data. This is why we use an approach in which a database and its language are used to implement the method. The numerical examples are based on a real topology having over 100 000 nodes. We may investigate and compare this way various TCP control algorithms as Vegas or Reno, as well as the influence of the introduction of energy aware algorithms to routers.&lt;/p&gt;&#13;
&#13;
&lt;p&gt;Traffic intensity observed in computer networks have a complex stochastic nature (self-similarity and long-range dependence) that influences the network performances. We discuss also this side of implemented queueing models.&lt;/p&gt;&#13;
</style></ABSTRACT><title><style face="normal" font="default" size="100%">Queueing Models for Performance Evaluation of Computer Networks - Transient State Analysis, invited talk </style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>31</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Tadeusz Czachórski</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Queueing models of traffic control and performance evaluation in large Internet topologies, key-note talk</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2018</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">XIII International Scientific and Technical Conference, Computer Science and Information Technologies</style></SECONDARY_TITLE><PLACE_PUBLISHED><style face="normal" font="default" size="100%"> Lviv Polytechnic National University</style></PLACE_PUBLISHED><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><PUBLISHER><style face="normal" font="default" size="100%"> Lviv Polytechnic National University</style></PUBLISHER><DATE><style face="normal" font="default" size="100%">09/2018</style></DATE><ABSTRACT><style face="normal" font="default" size="100%">&lt;p&gt;Transient state queueing models help us to understand better the dynamics of internet transmissions and the performance of traffic control algorithms. Fluid flow approximation, due its simplicity is popular and frequently used -- but even it, if applied to large topologies, is time and space consuming. The alternative approaches as Markov chains or diffusion approximation lead to much more complex computations. Fluid flow approximation is based on first-order differential equations, and its algorithm is based on iterative calculations on large mutually interdependent structures. In consequence, the bottleneck of the method lies not in numerical computations but in storing and selection of data. This is why we use an approach in which a database (SAP HANA) and its language are used to implement the method.&lt;/p&gt;&#13;
&#13;
&lt;p&gt;The model logic is represented by ETL (Extract, Transform and Load) customizable and user-friendly processes. The numerical examples are based on a real topology having over 100 000 nodes. We may investigate and compare this way various TCP control algorithms as Vegas or Reno, as well as the influence of the introduction of energy aware algorithms to routers.&lt;/p&gt;&#13;
</style></ABSTRACT><title><style face="normal" font="default" size="100%">Queueing models of traffic control and performance evaluation in large Internet topologies, key-note talk</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>31</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Tadeusz Czachórski</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Metoda sterowania natężeniem ruchu w Internecie, referat zaproszony</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2018</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">XXI Krajowa Konferencja Automatyzacji Procesów Dyskretnych</style></SECONDARY_TITLE><PLACE_PUBLISHED><style face="normal" font="default" size="100%">Zakopane</style></PLACE_PUBLISHED><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><PUBLISHER><style face="normal" font="default" size="100%">Politechnika Śląska</style></PUBLISHER><DATE><style face="normal" font="default" size="100%">09/2018</style></DATE><title><style face="normal" font="default" size="100%">Metoda sterowania natężeniem ruchu w Internecie, referat zaproszony</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>31</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Godlove Suila</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Edelqueen Anyam</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Tadeusz Czachórski</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Artur Rataj</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Performance of a buffer between electronic and all-optical networks, diffusion approximation model</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2018</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">32nd International Symposium on Computer and Information Sciences   In Conjunction with the IFIP World Congress 2018</style></SECONDARY_TITLE><PLACE_PUBLISHED><style face="normal" font="default" size="100%">Poznań</style></PLACE_PUBLISHED><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><PUBLISHER><style face="normal" font="default" size="100%">Communications in Computer and Information Science , vol. 935, Springer</style></PUBLISHER><DATE><style face="normal" font="default" size="100%">09/2018</style></DATE><title><style face="normal" font="default" size="100%">Performance of a buffer between electronic and all-optical networks, diffusion approximation model</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>31</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Kuaban Suila</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Tadeusz Czachórski</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Artur Rataj</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">A Queueing Model of the Edge Node in IP over All-Optical Networks</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2018</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Computer Networks 2018</style></SECONDARY_TITLE><PLACE_PUBLISHED><style face="normal" font="default" size="100%">Gliwice</style></PLACE_PUBLISHED><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><PUBLISHER><style face="normal" font="default" size="100%">Springer, Communications in Computer and Information Science, vol. 860</style></PUBLISHER><DATE><style face="normal" font="default" size="100%">06/2018</style></DATE><title><style face="normal" font="default" size="100%">A Queueing Model of the Edge Node in IP over All-Optical Networks</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>31</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Adam Józefiok</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Tadeusz Czachórski</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Artur Rataj</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">A Queueing Model of an Insurance Database Interactive System, Comparison of Modelling Methods</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2017</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">5th International Conference on Man - Machine Interactions, ICMMI 2017</style></SECONDARY_TITLE><PLACE_PUBLISHED><style face="normal" font="default" size="100%">Kraków</style></PLACE_PUBLISHED><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><PUBLISHER><style face="normal" font="default" size="100%">Springer, Advances in Intelligent Systems and Computing, vol. 659, pp. 525-531</style></PUBLISHER><DATE><style face="normal" font="default" size="100%">10/2017</style></DATE><ISBN><style face="normal" font="default" size="100%">978-3-319-67791-0</style></ISBN><title><style face="normal" font="default" size="100%">A Queueing Model of an Insurance Database Interactive System, Comparison of Modelling Methods</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>31</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Monika Nycz</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Tomasz Nycz</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Tadeusz Czachórski</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Performance Modelling of Transmissions in Very Large Network Topologies</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2017</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Distributed Computer and Communication Networks 20th International Conference, DCCN 2017</style></SECONDARY_TITLE><PLACE_PUBLISHED><style face="normal" font="default" size="100%">Moscow, Russia</style></PLACE_PUBLISHED><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><PUBLISHER><style face="normal" font="default" size="100%">Springer, Communications in Computer and Information Science, vol. 700, pp. 49-62</style></PUBLISHER><DATE><style face="normal" font="default" size="100%">09/2017</style></DATE><ISBN><style face="normal" font="default" size="100%">ISBN: 978-3-319-66835-2</style></ISBN><title><style face="normal" font="default" size="100%">Performance Modelling of Transmissions in Very Large Network Topologies</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>7</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Marek Fiuk</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Tadeusz Czachórski</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">A Queueing Model and Performance Analysis of UPnP/HTTP client server interactions in Networked Control Systems</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2019</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Computer Networks 2019</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><PUBLISHER><style face="normal" font="default" size="100%">Springer, Communications in Computer and Information Science</style></PUBLISHER><NUMBER><style face="normal" font="default" size="100%">1039</style></NUMBER><PAGES><style face="normal" font="default" size="100%">366-386</style></PAGES><EDITION><style face="normal" font="default" size="100%">Springer</style></EDITION><ABSTRACT><style face="normal" font="default" size="100%">&lt;div&gt;HTTP based communication protocols are ubiquitous in modern distributed control/supervision systems, therefore it becomes important to understand the performance of the HTTP protocol working with this type of applications and to develop techniques to investigate the impact of the protocol on the overall performance of these systems. A distributed control/supervision system based on HTTP usually consists of multiple nodes sending control requests or measurements to one or more recipient nodes; these data are used to perform control functions, and are stored or presented to supervising personnel. Typically multiple, concurrent flows of data are carried over HTTP to a given recipient. The stochastic characteristics of these flows are often different from the bursty nature of the ordinary Web Browser – Web Server interactions. Furthermore, in order to efficiently carry the randomly arriving data, the number of overlapping (concurrent) HTTP request/response sessions utilized by a sending node is higher than in typical Web Browser -- Web Server communications.&lt;/div&gt;&#13;
&#13;
&lt;div&gt;We investigate how the characteristics of nodes participating in the distributed control system communications (number of nodes, service times, number of service stations, queue lengths) influence performance of the employed HTTP protocol. The main focus is on&#160; end-to-end delays in transmissions, the most important factor in control. The presented approach can be used to select configuration parameters for the nodes of a realistic control/supervision system having in mind the best communication related performance of such system.&lt;/div&gt;&#13;
&#13;
&lt;div&gt;In this work we propose a queuing model of HTTP client/server interactions which we subsequently simplify to be represented by a numerically solvable Markov chain. We compare the results obtained with the simplified model with the output of a discrete event simulation based on the original full model.&lt;/div&gt;&#13;
&#13;
&lt;div&gt;The initial motivation for this research came from a study of UPnP based remote PTZ camera control mechanism used by a leading manufacturer of large scale video monitoring systems.&lt;/div&gt;&#13;
&#13;
&lt;div&gt;&#160;&lt;/div&gt;&#13;
</style></ABSTRACT><title><style face="normal" font="default" size="100%">A Queueing Model and Performance Analysis of UPnP/HTTP client server interactions in Networked Control Systems</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>31</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Mateusz Nowak</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Sławomir Nowak</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Joanna Domańska</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Tadeusz Czachórski</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Cognitive Packet Networks for the Secure Internet of Things</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2019</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Global IoT Summit (GIoTS)</style></SECONDARY_TITLE><PLACE_PUBLISHED><style face="normal" font="default" size="100%">Aarhus, Denmark</style></PLACE_PUBLISHED><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><ISBN><style face="normal" font="default" size="100%">978-1-7281-2171-0</style></ISBN><URL><style face="normal" font="default" size="100%">https://ieeexplore.ieee.org/document/8766380</style></URL><title><style face="normal" font="default" size="100%">Cognitive Packet Networks for the Secure Internet of Things</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>7</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Enrico Ferrera</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Claudio Pastrone</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Paul-Emmanuel Brun</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Remi De Besombes</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Konstantinos Loupos</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Gerasimos Kouloumpis</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Patrick O’Sullivan</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Alexandros Papageorgiou</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Panayiotis Katsoulakos</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Bill Karakostas</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Antonis Mygiakis</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Christina Stratigaki</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Bora Caglayan</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Basile Starynkevitch</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Christos Skoufis</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Stelios Christofi</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Nicolas Ferry</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Hui Song</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Arnor Solberg</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Peter Matthews</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Antonio Skarmeta</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">José Santa</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Michail Beliatis</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Mirko Presser</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Josiane Parreira</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Juan Martínez</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Payam Barnaghi</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Shirin Enshaeifar</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Thorben Iggena</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Marten Fischer</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Ralf Tönjes</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Martin Strohbach</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Alessandro Sforzin</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Hien Truong</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">John Soldatos</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Sofoklis Efremidis</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Georgios Koutalieris</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Panagiotis Gouvas</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Juergen Neises</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">George Hatzivasilis</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Ioannis Askoxylakis</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Vivek Kulkarni</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Arne Broering</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Dariusz Dober</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Kostas Ramantas</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Christos Verikoukis</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Joachim Posegga</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Domenico Presenza</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">George Spanoudakis</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Danilo Pau</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Erol Gelenbe</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Sławomir Nowak</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Mateusz Nowak</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Tadeusz Czachórski</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Joanna Domańska</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Anastasis Drosou</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Dimitrios Tzovaras</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Tommi Elo</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Santeri Paavolainen</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Dmitrij Lagutin</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Helen Leligou</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Panagiotis Trakadas</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">George Polyzos</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">IoT European Security and Privacy Projects: Integration, Architectures and Interoperability</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2018</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Next Generation Internet of Things. Distributed Intelligence at the Edge and Human Machine-to-Machine Cooperation</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><PUBLISHER><style face="normal" font="default" size="100%">River Publishers</style></PUBLISHER><SECTION><style face="normal" font="default" size="100%">7</style></SECTION><ISBN><style face="normal" font="default" size="100%">9788770220071</style></ISBN><title><style face="normal" font="default" size="100%">IoT European Security and Privacy Projects: Integration, Architectures and Interoperability</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Adam Domański</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Joanna Domańska</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Tadeusz Czachórski</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Jerzy Klamka</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Dariusz Marek</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Jakub Szyguła</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">AQM Mechanism with the Dropping Packet Function Based on the Answer of Several  PIα  Controllers</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2019</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Communications in Computer and Information Science </style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><VOLUME><style face="normal" font="default" size="100%">1039</style></VOLUME><SECTION><style face="normal" font="default" size="100%">400-412</style></SECTION><title><style face="normal" font="default" size="100%">AQM Mechanism with the Dropping Packet Function Based on the Answer of Several  PIα  Controllers</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>31</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Tadeusz Czachórski</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Krzysztof Grochla</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Diffusion Approximation Models for Cloud Computations with Task Migrations</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2019</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">2019 IEEE International Conference on Fog Computing (ICFC)</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><PUBLISHER><style face="normal" font="default" size="100%">IEEE</style></PUBLISHER><URL><style face="normal" font="default" size="100%">https://ieeexplore.ieee.org/abstract/document/8821824</style></URL><title><style face="normal" font="default" size="100%">Diffusion Approximation Models for Cloud Computations with Task Migrations</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Adam Domański</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Joanna Domańska</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Tadeusz Czachórski</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Jerzy Klamka</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Jakub Szyguła</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Dariusz Marek</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Diffusion Approximation Model of TCP NewReno Congestion Control Mechanism</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2020</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">SN Computer Science</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><ISSUE><style face="normal" font="default" size="100%">1:43</style></ISSUE><title><style face="normal" font="default" size="100%">Diffusion Approximation Model of TCP NewReno Congestion Control Mechanism</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>31</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Jakub Szyguła</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Adam Domański</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Joanna Domańska</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Tadeusz Czachórski</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Dariusz Marek</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Jerzy Klamka</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%"> AQM mechanism with neuron tuning parameters</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2020</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">12th Asian Conference on Intelligent Information and Database Systems, Phuket, Thailand</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><DATE><style face="normal" font="default" size="100%">23-26 March 2020</style></DATE><title><style face="normal" font="default" size="100%"> AQM mechanism with neuron tuning parameters</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>31</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Anastasija Collen</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Niels Nijdam</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Javier Augusto-Gonzalez</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Sokratis Katsikas</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Konstantinos Giannoutakis</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Georgios Spathoulas</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Erol Gelenbe</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Konstantinos Votis</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Dimitrios Tzovaras</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">N. Ghavami</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Melanie Volkamer</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Piroska Haller</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">A. Sánchez</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">M. Dimas</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Erol Gelenbe</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Paolo Campegiani</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Tadeusz Czachórski</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Sokratis Katsikas</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Ioannis Komnios</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Luigi Romano</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Dimitrios Tzovaras</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">GHOST - Safe-Guarding Home IoT Environments with Personalised Real-Time Risk Control</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2018</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Security in Computer and Information Sciences - First International ISCIS Security Workshop 2018, Euro-CYBERSEC 2018, London, UK, February 26-27, 2018, Revised Selected Papers</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><PUBLISHER><style face="normal" font="default" size="100%">Springer</style></PUBLISHER><URL><style face="normal" font="default" size="100%">https://doi.org/10.1007/978-3-319-95189-8_7</style></URL><title><style face="normal" font="default" size="100%">GHOST - Safe-Guarding Home IoT Environments with Personalised Real-Time Risk Control</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>31</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Olumide Akinwande</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Erol Gelenbe</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Tadeusz Czachórski</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Erol Gelenbe</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Krzysztof Grochla</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Ricardo Lent</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">A Reinforcement Learning Approach to Adaptive Forwarding in Named Data Networking</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2018</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Computer and Information Sciences - 32nd International Symposium, ISCIS 2018, Held at the 24th IFIP World Computer Congress, WCC 2018, Poznan, Poland, September 20-21, 2018, Proceedings</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><PUBLISHER><style face="normal" font="default" size="100%">Springer</style></PUBLISHER><URL><style face="normal" font="default" size="100%">https://doi.org/10.1007/978-3-030-00840-6_23</style></URL><title><style face="normal" font="default" size="100%">A Reinforcement Learning Approach to Adaptive Forwarding in Named Data Networking</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>31</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Erol Gelenbe</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Paolo Campegiani</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Tadeusz Czachórski</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Sokratis Katsikas</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Ioannis Komnios</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Luigi Romano</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Dimitrios Tzovaras</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Security in Computer and Information Sciences - First International ISCIS Security Workshop 2018, Euro-CYBERSEC 2018, London, UK, February 26-27, 2018, Revised Selected Papers</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2018</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Communications in Computer and Information Science</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><PUBLISHER><style face="normal" font="default" size="100%">Springer</style></PUBLISHER><VOLUME><style face="normal" font="default" size="100%">821</style></VOLUME><ISBN><style face="normal" font="default" size="100%">978-3-319-95188-1</style></ISBN><URL><style face="normal" font="default" size="100%">https://doi.org/10.1007/978-3-319-95189-8</style></URL><title><style face="normal" font="default" size="100%">Security in Computer and Information Sciences - First International ISCIS Security Workshop 2018, Euro-CYBERSEC 2018, London, UK, February 26-27, 2018, Revised Selected Papers</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>31</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Tadeusz Czachórski</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Erol Gelenbe</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Krzysztof Grochla</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Ricardo Lent</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Computer and Information Sciences - 32nd International Symposium, ISCIS 2018, Held at the 24th IFIP World Computer Congress, WCC 2018, Poznan, Poland, September 20-21, 2018, Proceedings</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2018</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Communications in Computer and Information Science</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><PUBLISHER><style face="normal" font="default" size="100%">Springer</style></PUBLISHER><VOLUME><style face="normal" font="default" size="100%">935</style></VOLUME><ISBN><style face="normal" font="default" size="100%">978-3-030-00839-0</style></ISBN><title><style face="normal" font="default" size="100%">Computer and Information Sciences - 32nd International Symposium, ISCIS 2018, Held at the 24th IFIP World Computer Congress, WCC 2018, Poznan, Poland, September 20-21, 2018, Proceedings</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>31</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Tadeusz Czachórski</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Erol Gelenbe</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Godlove Kuaban</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Dariusz Marek</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Transient Behaviour of a Network Router</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2020</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">43th International Conference on Telecommunications and Signal Processing</style></SECONDARY_TITLE><PLACE_PUBLISHED><style face="normal" font="default" size="100%">Milano, Italy</style></PLACE_PUBLISHED><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><PUBLISHER><style face="normal" font="default" size="100%">IEEE</style></PUBLISHER><ABSTRACT><style face="normal" font="default" size="100%">&lt;p&gt;The broader use of Software Defined Network (SDN) controllers creates periodic changes in topology and traffic rates at routers that adapt the network to changes in network conditions.&#160;&lt;br /&gt;&#13;
Thus the transient behaviour of network components, and in particular routers, is becoming of great interest.&lt;br /&gt;&#13;
Since standard queueing models are difficult to analyze under time-varying conditions, we propose a tractable diffusion approximation for both the transient and steady-state behaviour of a network router. In particular, the analysis provides the steady-state and transient delay and packet loss probability as a function of traffic load and other characteristics. Using these results, we show that when SDN routers change the paths of flows frequently, the network's behaviour may often be far from its steady-state behaviour. Therefore any network optimization conducted with the help of SDN should not be based on&#160;steady-state behaviour, but rather on some metric reated to the network time dependent behaviour.&lt;/p&gt;&#13;
</style></ABSTRACT><title><style face="normal" font="default" size="100%">Transient Behaviour of a Network Router</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>31</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Tadeusz Czachórski</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Godlove Kuaban</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Tomasz Nycz</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Vladimir Vishnevskiy</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Konstantin Samouylov</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Dmitry Kozyrev</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Multichannel Diffusion Approximation Models for the Evaluation of Multichannel Communication Networks</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2019</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Distributed Computer and Communication Networks - 22nd International Conference, DCCN 2019, Moscow, Russia, September 23-27, 2019, Revised Selected Papers</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><PUBLISHER><style face="normal" font="default" size="100%">Springer</style></PUBLISHER><URL><style face="normal" font="default" size="100%">https://doi.org/10.1007/978-3-030-36614-8_4</style></URL><title><style face="normal" font="default" size="100%">Multichannel Diffusion Approximation Models for the Evaluation of Multichannel Communication Networks</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>31</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Aleksandra Gruca</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Tadeusz Czachórski</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Sebastian Deorowicz</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Katarzyna Harezlak</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Agnieszka Piotrowska</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Man-Machine Interactions 6 - 6th International Conference on Man-Machine Interactions, ICMMI 2019, Cracow, Poland, October 2-3, 2019</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2020</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Advances in Intelligent Systems and Computing</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><PUBLISHER><style face="normal" font="default" size="100%">Springer</style></PUBLISHER><VOLUME><style face="normal" font="default" size="100%">1061</style></VOLUME><ISBN><style face="normal" font="default" size="100%">978-3-030-31963-2</style></ISBN><URL><style face="normal" font="default" size="100%">https://doi.org/10.1007/978-3-030-31964-9</style></URL><title><style face="normal" font="default" size="100%">Man-Machine Interactions 6 - 6th International Conference on Man-Machine Interactions, ICMMI 2019, Cracow, Poland, October 2-3, 2019</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>31</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Tadeusz Czachórski</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Diffusion approximation as a tool in computer networks performance evaluation, invited talk,  The 9th International Conference on  Electronics, Communications and Networks, CECNet 2019, October 18-21, 2019   Kitakyushu City, Japan</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2019</style></YEAR><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><ABSTRACT><style face="normal" font="default" size="100%">&lt;p&gt;Performance of computer networks is frequently investigated with the use of queueing theory. Its models represent the queues of packets waiting in routers to be sent further and evaluate queueing delays, loss probabilities in routers and then the overall transmission quality of service. There is a constant effort &#160;to develop models reflecting as exactly as possible the stochastic nature of the transmission intensity, its variability, the distribution of the size of packets, &#160;and the rules of traffic management applied by protocols to avoid network congestion. The article describes one of the approaches: diffusion approximation where the size of queues is described by a diffusion process. The method was introduced in 1970-ties by Hisashi Kobayashi and Erol Gelenbe and is still being developed by the author to fit various models of Internet, Internet of Things, Software Defined Networks, Cloud and Fog computing, edge computing. The method is based on the solution of a system of differential partial equations giving&#160; an approximation of the queue lengths distribution at any considered time moment. The features that are in favour of the method are:&lt;/p&gt;&#13;
&#13;
&lt;ul&gt;&#13;
	&lt;li&gt;diffusion model of a single server assumes general&#160; interarrival and service time distributions this way going beyond Markov models,&lt;/li&gt;&#13;
	&lt;li&gt;network models may have any topology, also hierarchical, and any number of nodes (are easy scalable)&lt;/li&gt;&#13;
	&lt;li&gt;the results are obtained in form of queue distributions and waiting time distributions that makes easier to analyse&#160; QoS of paths, e.g. jitter,&lt;/li&gt;&#13;
	&lt;li&gt;&#160;easy separation of each node within a network model,&lt;/li&gt;&#13;
	&lt;li&gt;the transient state model is solved step-by-stem in small time intervals with parameters specific to these intervals; any decision of a controller concerning&#160; dynamic routing of packets,&#160; as well as changes of flows due to attacks and control mechanisms may be easily reflected in time-dependent and state-dependent diffusion parameters&#160; and time-depended routing probabilities in equations determining the flows.&lt;/li&gt;&#13;
&lt;/ul&gt;&#13;
</style></ABSTRACT><title><style face="normal" font="default" size="100%">Diffusion approximation as a tool in computer networks performance evaluation, invited talk,  The 9th International Conference on  Electronics, Communications and Networks, CECNet 2019, October 18-21, 2019   Kitakyushu City, Japan</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Adam Domański</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Joanna Domańska</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Katarzyna Filus</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Jakub Szyguła</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Tadeusz Czachórski</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">The self-similar markovian sources</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2020</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Applied Sciences</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><VOLUME><style face="normal" font="default" size="100%">10</style></VOLUME><ISSUE><style face="normal" font="default" size="100%">11</style></ISSUE><title><style face="normal" font="default" size="100%">The self-similar markovian sources</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>31</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Godlove Kuaban</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Tadeusz Czachórski</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Artur Rataj</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">A Queueing Model of the Edge Node in IP over  All-Optical Networks</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2018</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">25th International Conference on Computer Networks</style></SECONDARY_TITLE><PLACE_PUBLISHED><style face="normal" font="default" size="100%">Gliwice, Poland</style></PLACE_PUBLISHED><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><PUBLISHER><style face="normal" font="default" size="100%">Springer</style></PUBLISHER><ISBN><style face="normal" font="default" size="100%">978-3-3199-249-5</style></ISBN><title><style face="normal" font="default" size="100%">A Queueing Model of the Edge Node in IP over  All-Optical Networks</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>31</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Godlove Kuaban</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Edelqueen Anyam</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Tadeusz Czachórski</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Artur Rataj</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Performance of a buffer between  electronic and all-optical networks, diffusion approximation model</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2018</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">32nd International Symposium  on Computer and Information Sciences In Conjunction with the IFIP World Congress 2018</style></SECONDARY_TITLE><PLACE_PUBLISHED><style face="normal" font="default" size="100%">Poznań, Poland</style></PLACE_PUBLISHED><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><PUBLISHER><style face="normal" font="default" size="100%">Springer</style></PUBLISHER><ISBN><style face="normal" font="default" size="100%"> 978-3-0300-0839-0</style></ISBN><title><style face="normal" font="default" size="100%">Performance of a buffer between  electronic and all-optical networks, diffusion approximation model</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Jakub Szyguła</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Adam Domański</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Joanna Domańska</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Tadeusz Czachórski</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Jerzy Klamka</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Dariusz Marek</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">The IoT Gateway with Active Queue Management</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2021</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">International Journal of Applied Mathematics and Computer Science (AMCS)</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><VOLUME><style face="normal" font="default" size="100%">31</style></VOLUME><ISSUE><style face="normal" font="default" size="100%">1</style></ISSUE><URL><style face="normal" font="default" size="100%"/></URL><title><style face="normal" font="default" size="100%">The IoT Gateway with Active Queue Management</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Dariusz Marek</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Adam Domański</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Joanna Domańska</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Tadeusz Czachórski</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Jerzy Klamka</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Jakub Szyguła</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Combined diffusion approximation - simulation model of AQM’s transient behaviour</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2021</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Computer Communications</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><VOLUME><style face="normal" font="default" size="100%">166</style></VOLUME><SECTION><style face="normal" font="default" size="100%">40-48</style></SECTION><DATE><style face="normal" font="default" size="100%">01/2021</style></DATE><ABSTRACT><style face="normal" font="default" size="100%">&lt;p&gt;The article introduces an approach combining diffusion approximation and simulation ones. Furthermore, it describes how it can be used to evaluate active queue management (AQM) mechanisms. Based on the obtained queue distributions, the simulation part of the model decides on package losses and modifies the flow intensity sent by the transmitter. The diffusion is used to estimate queue distributions and the goal of the simulation part of the model is to represent the AQM mechanism. On the one hand, the use of the diffusion part considerably accelerates the performance of the whole model. On the other hand, the simulation increases the accuracy of the diffusion part. We apply the model to compare the performance of fractional order PIη controller used in AQM with the performance of RED, a well known active queue management mechanism.&lt;/p&gt;&#13;
</style></ABSTRACT><URL><style face="normal" font="default" size="100%">http://www.sciencedirect.com/science/article/pii/S0140366420319940</style></URL><title><style face="normal" font="default" size="100%">Combined diffusion approximation - simulation model of AQM’s transient behaviour</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>31</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Tadeusz Czachórski</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Erol Gelenbe</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Godlove Kuaban</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Dariusz Marek</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Time Dependent Diffusion Model for Security Driven Software Defined Networks</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2020</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Second International Workshop on Stochastic Modeling and Applied Research of Technology (SMARTY 2020)</style></SECONDARY_TITLE><PLACE_PUBLISHED><style face="normal" font="default" size="100%">Petrozavodsk, Karelia, Russia</style></PLACE_PUBLISHED><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><PUBLISHER><style face="normal" font="default" size="100%">CEUR-WS.org</style></PUBLISHER><VOLUME><style face="normal" font="default" size="100%">2792</style></VOLUME><PAGES><style face="normal" font="default" size="100%">38-56</style></PAGES><EDITION><style face="normal" font="default" size="100%">CEUR Workshop Proceedings</style></EDITION><DATE><style face="normal" font="default" size="100%">12/2020</style></DATE><ABSTRACT><style face="normal" font="default" size="100%">&lt;p&gt;We present a model of a Software Defined Network (SDN) where frequent changes in routing and traffic rates at routers are needed to respond to the security, quality of service (QoS), and energy savings requirements of applications such as the Internet of Things.&lt;br /&gt;&#13;
Such frequent path and traffic changes introduce time-dependent network behaviours, and standard queueing models are not well adapted to analyse the transient regime, we propose a tractable diffusion approximation for both the transient and steady-state behaviour.&lt;br /&gt;&#13;
Our model can represent any network topology transmitting time-dependent flows with routing changes, and computes queue length and delay distributions at each network node and along&#160;complete paths between senders and receivers.&#160;&lt;br /&gt;&#13;
Using realistic router parameters, we show that transients occupy a significant fraction of system time, so that the optimisation conducted with SDN controllers needs to include the effect of time-dependent behaviours.&lt;/p&gt;&#13;
</style></ABSTRACT><URL><style face="normal" font="default" size="100%">http://ceur-ws.org/Vol-2792/</style></URL><title><style face="normal" font="default" size="100%">Time Dependent Diffusion Model for Security Driven Software Defined Networks</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>31</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Tulin Atmaca</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Amira Kamli</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Godlove Kuaban</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Tadeusz Czachórski</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Performance Evaluation of the Packet Aggregation Mechanism of an N-GREEN Metro Network Node</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2020</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Modelling, Analysis, and Simulation of Computer and Telecommunication Systems, 28th International Symposium, MASCOTS 2020, Nice, France, November 17–19, 2020, Revised Selected Papers</style></SECONDARY_TITLE><PLACE_PUBLISHED><style face="normal" font="default" size="100%">on-line</style></PLACE_PUBLISHED><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><PUBLISHER><style face="normal" font="default" size="100%">Springer International Publishing</style></PUBLISHER><VOLUME><style face="normal" font="default" size="100%">12527</style></VOLUME><EDITION><style face="normal" font="default" size="100%">Computer Communication Networks and Telecommunications, LNCS</style></EDITION><DATE><style face="normal" font="default" size="100%">12/2020</style></DATE><ISBN><style face="normal" font="default" size="100%">978-3-030-68110-4</style></ISBN><ABSTRACT><style face="normal" font="default" size="100%">&lt;p&gt;Today's telecommunication network infrastructure and services are dramatically changing due partially to the rapid increase in the amount of traffic generation and its transportation. This rapid change is also caused by the increased demand for a high quality of services and the recent interest in green networking strengthened by cutting down carbon emission and operation cost. Access networks generate short electronic packets of different sizes, which are aggregated into larger optical packets at the ingress edge nodes of the optical backbone network. It is transported transparently in the optical domain, reconverted into the electronic domain at the egress edge nodes, and delivered to the destination access networks. Packet aggregation provides many benefits at the level of MAN, and core networks such as, increased spectral efficiency, energy efficiency, optimal resource utilisation, simplified traffic management which significantly reduces protocol and signalling overhead. However, packet aggregation introduces performance bottleneck at the edge node as the packets from the access networks are temporarily stored in the aggregation buffers during the packet aggregation process. In this article, we apply the diffusion approximation model and other stochastic modelling methods to analytically evaluate the performance of a new packet aggregation mechanism which was developed specifically for an N-GREEN (Next Generation of Routers for Energy &#160;Efficiency) metro network. We obtain the distribution of the packets' queue in the aggregation buffer, which influences the distribution of the waiting time (delay) experienced by packets in the aggregation buffer. We then, demonstrate the influence of the probability $p$ of successfully inserting the packet data units from the aggregation queue to the optical ring within a defined timeslot $\Delta$. We also discuss the performance evaluation of the complete ring by deriving the utilisation of each link.&lt;br /&gt;&#13;
&#160;&lt;/p&gt;&#13;
</style></ABSTRACT><title><style face="normal" font="default" size="100%">Performance Evaluation of the Packet Aggregation Mechanism of an N-GREEN Metro Network Node</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>31</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Tadeusz Czachórski</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Erol Gelenbe</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Dariusz Marek</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Software Defined Network Dynamics via Diffusions</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2020</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">28th International Symposium on Modelling, Analysis, and Simulation of Computer and Telecommunication Systems, MASCOTS 2020, revised delected papers</style></SECONDARY_TITLE><PLACE_PUBLISHED><style face="normal" font="default" size="100%">on-line</style></PLACE_PUBLISHED><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><PUBLISHER><style face="normal" font="default" size="100%">Springer International Publishing</style></PUBLISHER><VOLUME><style face="normal" font="default" size="100%">12527</style></VOLUME><EDITION><style face="normal" font="default" size="100%">Computer Communication Networks and Telecommunications, LNCS</style></EDITION><DATE><style face="normal" font="default" size="100%">12/2020</style></DATE><ISBN><style face="normal" font="default" size="100%">978-3-030-68110-4</style></ISBN><ABSTRACT><style face="normal" font="default" size="100%">&lt;p&gt;Software-Defined Networks (SDN) dynamically modify the paths of Internet flows in response to the quality of service or security needs, and hence frequently modify traffic levels at network routers. Thus network routers often operate in the transient regime, rather than at steady-state, with significant impact on packet loss probabilities and delay. We, therefore, investigate the time-dependent performance of a small network of routers, modelled as G/G/1/N queueing stations. &#160;A diffusion approximation is developed to predict the quality of service of the routers in the transient regime. Numerical examples show that&#160;the results in the transient regime can differ very significantly from the steady-state results, and therefore that the&#160;transient analysis must be taken into account in evaluating the performance of routers in a SDN network.&lt;/p&gt;&#13;
</style></ABSTRACT><URL><style face="normal" font="default" size="100%">https://www.springer.com/gp/book/9783030681098</style></URL><title><style face="normal" font="default" size="100%">Software Defined Network Dynamics via Diffusions</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>31</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Tadeusz Czachórski</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Erol Gelenbe</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Godlove Kuaban</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Dariusz Marek</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Time Dependent Diffusion Model for Security Driven Software Defined Networks</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2020</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">The Second International Workshop on Stochastic Modeling and Applied Research of Technology (SMARTY 2020)</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><VOLUME><style face="normal" font="default" size="100%">2792</style></VOLUME><PAGES><style face="normal" font="default" size="100%">pp. 38-56</style></PAGES><ABSTRACT><style face="normal" font="default" size="100%">&lt;p&gt;We present a model of a Software Defined Network (SDN) where frequent changes in routing and traffic rates at routers are needed&lt;br /&gt;&#13;
to respond to the security, quality of service (QoS), and energy savings requirements of applications such as the Internet of Things. Such frequent path and traffic changes introduce time-dependent network behaviours, and standard queueing models are not well adapted to analyse the transient regime, we propose a tractable diffusion approximation for both the transient and steady-state behaviour. Our model can represent any network topology transmitting time-dependent flows with routing changes, and computes queue length and delay distributions at each network node and along complete paths between senders and receivers. Using realistic router parameters, we show that transients occupy a significant fraction of system time, so that the optimisation conducted with SDN controllers needs to include the effect of time-dependent behaviours.&lt;/p&gt;&#13;
</style></ABSTRACT><title><style face="normal" font="default" size="100%">Time Dependent Diffusion Model for Security Driven Software Defined Networks</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Tadeusz Czachórski</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Erol Gelenbe</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Godlove Kuaban</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Dariusz Marek</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Time-Dependent Performance of a Multi-Hop Software Defined Network</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2021</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Applied Sciences</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><VOLUME><style face="normal" font="default" size="100%">11</style></VOLUME><ISSUE><style face="normal" font="default" size="100%">2469</style></ISSUE><SECTION><style face="normal" font="default" size="100%">1-21</style></SECTION><DATE><style face="normal" font="default" size="100%">03/2021</style></DATE><ABSTRACT><style face="normal" font="default" size="100%">&lt;p&gt;It has been recently observed that Software Defined Networks (SDN) can change the&lt;br /&gt;&#13;
paths of different connections in the network at a relatively frequent pace to improve the overall&lt;br /&gt;&#13;
network performance, including delay and packet loss, or to respond to other needs such as security.&lt;br /&gt;&#13;
These changes mean that a network that SDN controls will seldom operate in steady state; rather,&lt;br /&gt;&#13;
the network may often be in transient mode, especially when the network is heavily loaded and&lt;br /&gt;&#13;
path changes are critically important. Hence, we propose a transient analysis of such networks to&lt;br /&gt;&#13;
better understand how frequent changes in paths and the switches’ workloads may affect multi-hop&lt;br /&gt;&#13;
networks’ performance. Since conventional queueing models are difficult to solve for transient&lt;br /&gt;&#13;
behaviour and simulations take excessive computation time due to the need for statistical accuracy,&lt;br /&gt;&#13;
we use a diffusion approximation to study a multi-hop network controlled by SDN. The results show&lt;br /&gt;&#13;
that network optimization should consider the transient effects of SDN and that transients need to be&lt;br /&gt;&#13;
included in the design of algorithms for SDN controllers that optimize network performance.&lt;/p&gt;&#13;
</style></ABSTRACT><URL><style face="normal" font="default" size="100%">https://www.mdpi.com/journal/applsci</style></URL><title><style face="normal" font="default" size="100%">Time-Dependent Performance of a Multi-Hop Software Defined Network</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Dariusz Marek</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Adam Domański</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Joanna Domańska</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Jakub Szyguła</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Tadeusz Czachórski</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Jerzy Klamka</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Diffusion model of a non-integer order PIγ controller with TCP/UDP  streams</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2021</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Entropy</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><VOLUME><style face="normal" font="default" size="100%">23</style></VOLUME><SECTION><style face="normal" font="default" size="100%">619</style></SECTION><DATE><style face="normal" font="default" size="100%">05/2021</style></DATE><title><style face="normal" font="default" size="100%">Diffusion model of a non-integer order PIγ controller with TCP/UDP  streams</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>31</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Erol Gelenbe</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Mert Nakip</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Dariusz Marek</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Tadeusz Czachórski</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Diffusion Analysis Improves Scalability of IoTNetworks to Mitigate the Massive Access Problem</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2021</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">2021 Mascots: 29th International Symposium on the Modelling, Analysis and Simulation of Computer and Telecommunication Systems</style></SECONDARY_TITLE><PLACE_PUBLISHED><style face="normal" font="default" size="100%">Houston, Texas, USA</style></PLACE_PUBLISHED><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><PUBLISHER><style face="normal" font="default" size="100%">IEEE</style></PUBLISHER><DATE><style face="normal" font="default" size="100%">11/2021</style></DATE><ABSTRACT><style face="normal" font="default" size="100%">&lt;p&gt;A significant challenge of IoT networks is to offer Quality of Service (QoS) and meet deadline requirements when packets from a massive number of IoT devices are forwarded to an IoT gateway. Many IoT devices tend to report their data to their wired or wireless network gateways at closely correlated instants of time, leading to congestion known as the MassiveAccess Problem (MAP), which increases the probability that the IoT data will not meet its required deadlines. Since IoT data loses much of its value if it arrives to destination beyond a required deadline, MAP has been extensively studied in the literature. Thus we first take a queueing theoretic view of the problem, and also use a Diffusion Approximation to gain insight into the IoT traffic statistics that affect MAP. Then we introduce the Quasi-Deterministic Transmission Policy (QDTP) which significantly alleviates MAP when the average traffic rate grows beyond a given level and substantially reduces the probability that IoT data deadlines are missed. The results are validated using real IoT data which has been placed in IP packets for transmission.&lt;/p&gt;&#13;
</style></ABSTRACT><title><style face="normal" font="default" size="100%">Diffusion Analysis Improves Scalability of IoTNetworks to Mitigate the Massive Access Problem</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Tomasz Nycz</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Tadeusz Czachórski</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Monika Nycz</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Diffusion Model of Preemptive-Resume Priority Systems and Its Application to Performance Evaluation of SDN Switches.</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2021</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Sensors</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><VOLUME><style face="normal" font="default" size="100%">21</style></VOLUME><ISSUE><style face="normal" font="default" size="100%">5042</style></ISSUE><SECTION><style face="normal" font="default" size="100%">1</style></SECTION><DATE><style face="normal" font="default" size="100%">07/2021</style></DATE><ABSTRACT><style face="normal" font="default" size="100%">&lt;p&gt;The increasing use of Software-Defined Networks brings the need for their performance analysis and detailed analytical and numerical models of them. The primary element of such research is a model of a SDN switch. This model should take into account non-Poisson traffic and general distributions of service times. Because of frequent changes in SDN flows, it should also analyze transient states of the queues. The method of diffusion approximation can meet these requirements. We present here a diffusion approximation of priority queues and apply it to build a more detailed model of SDN switch where packets returned by the central controller have higher priority than other packets.&lt;/p&gt;&#13;
</style></ABSTRACT><title><style face="normal" font="default" size="100%">Diffusion Model of Preemptive-Resume Priority Systems and Its Application to Performance Evaluation of SDN Switches.</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Godlove Kuaban</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Tulin Atmaca</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Amira Kamli</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Tadeusz Czachórski</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Piotr Czekalski</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Performance Analysis of Packet Aggregation Mechanisms and Their Applications in Access (e.g., IoT, 4G/5G), Core, and Data Centre Networks</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2021</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Sensors</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><VOLUME><style face="normal" font="default" size="100%">21</style></VOLUME><ISSUE><style face="normal" font="default" size="100%">3898</style></ISSUE><SECTION><style face="normal" font="default" size="100%">1</style></SECTION><DATE><style face="normal" font="default" size="100%">06/2021</style></DATE><ABSTRACT><style face="normal" font="default" size="100%">The transmission of massive amounts of small packets generated by access networks&#13;
through high-speed Internet core networks to other access networks or cloud computing data centres has introduced several challenges such as poor throughput, underutilisation of network resources,  and higher energy consumption. Therefore, it is essential to develop strategies to deal with these challenges. &#13;
One of them is to aggregate smaller packets into a larger payload packet, and these groups of aggregated packets will share the same header, hence increasing throughput, improving resource utilisation, and reduction in energy consumption. This paper presents a review of the packet aggregation applications in access networks (e.g., IoT and 4G/5G mobile networks), optical core networks, and cloud computing data centre networks. &#13;
Then we propose new analytical models based on diffusion approximation for the evaluation of the performance of packet aggregation mechanisms. We demonstrate the use of measured traffic from real networks to evaluate the performance of packet aggregation mechanisms analytically. The use of diffusion approximation allows us to consider time-dependent queueing models with general interarrival and service time distributions. Therefore these models are more general than others presented till now.&#13;
</style></ABSTRACT><title><style face="normal" font="default" size="100%">Performance Analysis of Packet Aggregation Mechanisms and Their Applications in Access (e.g., IoT, 4G/5G), Core, and Data Centre Networks</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>31</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Tulin Atmaca</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Amira Kamli</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Godlove Kuaban</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Tadeusz Czachórski</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Performance Evaluation of the Packet Aggregation Mechanism of an N-GREEN Metro Network Node</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2021</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Modelling, Analysis, and Simulation of Computer and Telecommunication Systems (MASCOTS) Workshop 2020</style></SECONDARY_TITLE><PLACE_PUBLISHED><style face="normal" font="default" size="100%">Nice, France</style></PLACE_PUBLISHED><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><PUBLISHER><style face="normal" font="default" size="100%">Springer</style></PUBLISHER><DATE><style face="normal" font="default" size="100%"> January 2021</style></DATE><ABSTRACT><style face="normal" font="default" size="100%">&lt;p&gt;&lt;span style="background-color:rgb(255, 255, 255); color:rgb(51, 51, 51); font-family:hind,arial,sans-serif; font-size:15px"&gt;Today’s telecommunication network infrastructure and services are dramatically changing due partially to the rapid increase in the amount of traffic generation and its transportation. This rapid change is also caused by the increased demand for a high quality of services and the recent interest in green networking strengthened by cutting down carbon emission and operation cost. Access networks generate short electronic packets of different sizes, which are aggregated into larger optical packets at the ingress edge nodes of the optical backbone network. It is transported transparently in the optical domain, reconverted into the electronic domain at the egress edge nodes, and delivered to the destination access networks. Packet aggregation provides many benefits at the level of MAN, and core networks such as, increased spectral efficiency, energy efficiency, optimal resource utilisation, simplified traffic management which significantly reduces protocol and signalling overhead. However, packet aggregation introduces performance bottleneck at the edge node as the packets from the access networks are temporarily stored in the aggregation buffers during the packet aggregation process. In this article, we apply the diffusion approximation model and other stochastic modelling methods to analytically evaluate the performance of a new packet aggregation mechanism which was developed specifically for an N-GREEN (Next Generation of Routers for Energy Efficiency) metro network. We obtain the distribution of the packets’ queue in the aggregation buffer, which influences the distribution of the waiting time (delay) experienced by packets in the aggregation buffer. We then, demonstrate the influence of the probability&#160;&lt;/span&gt;&lt;em&gt;p&lt;/em&gt;&lt;span style="background-color:rgb(255, 255, 255); color:rgb(51, 51, 51); font-family:hind,arial,sans-serif; font-size:15px"&gt;&#160;of successfully inserting the packet data units from the aggregation queue to the optical ring within a defined timeslot&#160;&lt;/span&gt;&lt;span style="background-color:rgb(255, 255, 255); color:rgb(51, 51, 51); font-family:hind,arial,sans-serif; font-size:15px"&gt;Δ&lt;/span&gt;&lt;span style="background-color:rgb(255, 255, 255); color:rgb(51, 51, 51); font-family:hind,arial,sans-serif; font-size:15px"&gt;. We also discuss the performance evaluation of the complete ring by deriving the utilisation of each link.&lt;/span&gt;&lt;/p&gt;&#13;
</style></ABSTRACT><title><style face="normal" font="default" size="100%">Performance Evaluation of the Packet Aggregation Mechanism of an N-GREEN Metro Network Node</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>31</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Aleksander Byrski</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Tadeusz Czachórski</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Erol Gelenbe</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Krzysztof Grochla</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Yuko Murayama</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Computer Science Protecting Human Society Against Epidemics</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2021</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">ANTICOVID 2021</style></SECONDARY_TITLE><PLACE_PUBLISHED><style face="normal" font="default" size="100%">Virtual Event, June 28–29, 2021</style></PLACE_PUBLISHED><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><PUBLISHER><style face="normal" font="default" size="100%">Springer</style></PUBLISHER><VOLUME><style face="normal" font="default" size="100%">616</style></VOLUME><NUMBER><style face="normal" font="default" size="100%">616</style></NUMBER><PAGES><style face="normal" font="default" size="100%">125</style></PAGES><TERTIARY_TITLE><style face="normal" font="default" size="100%">IFIP Advances in Information and Communication Technology</style></TERTIARY_TITLE><ISBN><style face="normal" font="default" size="100%">978-3-030-86582-5</style></ISBN><title><style face="normal" font="default" size="100%">Computer Science Protecting Human Society Against Epidemics</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Monika Nycz</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Tomasz Nycz</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Tadeusz Czachórski</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Fluid-Flow Approximation in the Analysis of Vast Energy-Aware Networks</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2021</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Mathematics</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><VOLUME><style face="normal" font="default" size="100%">9</style></VOLUME><ISSUE><style face="normal" font="default" size="100%">3279</style></ISSUE><SECTION><style face="normal" font="default" size="100%">1</style></SECTION><DATE><style face="normal" font="default" size="100%">12/2021</style></DATE><ABSTRACT><style face="normal" font="default" size="100%">&lt;p&gt;The paper addresses two issues: (i) modeling dynamic flows transmitted in vast TCP/IP networks and (ii) modeling the impact of energy-saving algorithms. The approach is based on the fluid-flow approximation, which applies first-order differential equations to analyze the evolution of queues and flows. We demonstrate that the effective implementation of this method overcomes the constraints of storing large data in numerical solutions of transient problems in vast network topologies. The model is implemented and executed directly in a database system. It can analyze transient states in topologies of more than 100,000 nodes, i.e., the size which was not considered until now. We use it to investigate the impact of an energy-saving algorithm on the performance of a vast network. We find that it reduces network congestion and save energy costs but significantly lower network throughput.&lt;/p&gt;&#13;
</style></ABSTRACT><URL><style face="normal" font="default" size="100%">https://www.mdpi.com/2227-7390/9/24/3279</style></URL><title><style face="normal" font="default" size="100%">Fluid-Flow Approximation in the Analysis of Vast Energy-Aware Networks</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Dariusz Marek</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Adam Domański</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Joanna Domańska</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Jakub Szyguła</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Tadeusz Czachórski</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Jerzy Klamka</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Katarzyna Filus</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Approximation Models for the Evaluation of TCP/AQM Networks</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2022</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Bulletin of the Polish Academy of Sciences, Technical Sciences (BPASTS)</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><VOLUME><style face="normal" font="default" size="100%">70</style></VOLUME><ISSUE><style face="normal" font="default" size="100%">4</style></ISSUE><URL><style face="normal" font="default" size="100%">https://journals.pan.pl/dlibra/publication/141986/edition/123961/content</style></URL><title><style face="normal" font="default" size="100%">Approximation Models for the Evaluation of TCP/AQM Networks</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>31</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Erol Gelenbe</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Mert Nakip</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Dariusz Marek</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Tadeusz Czachórski</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Mitigating the Massive Access Problem in the Internet of Things</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2022</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%"> EuroCybersec</style></SECONDARY_TITLE><PLACE_PUBLISHED><style face="normal" font="default" size="100%">Nice, France</style></PLACE_PUBLISHED><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><PUBLISHER><style face="normal" font="default" size="100%">Springer</style></PUBLISHER><ABSTRACT><style face="normal" font="default" size="100%">&lt;p&gt;The traffic from the large number of IoT devices connected to the IoT is a source of congestion known as the Massive Access Problem (MAP), that results in packet losses, delays and missed deadlines for realtime data. This paper reviews the literature on MAP and summarizes recent results on two approaches that have been designed to mitigate MAP. One approach is based on randomizing the packet arrival instants to IoT gateways within a given time interval that is chosen so that packet arrivals do not exceed their deadlines, but also so that they do not constitute bulk arrivals. The second approach is a novel traffic shaping policy named the Quasi-Deterministic-Transmission-Policy (QDTP) which has been proved to drastically reduce queue formation at the receiving gateway by delaying packet departures from the IoT devices in a judicious manner. Both analytical and experimental results are summarized, that describe the benefits of these techniques.&lt;/p&gt;&#13;
</style></ABSTRACT><title><style face="normal" font="default" size="100%">Mitigating the Massive Access Problem in the Internet of Things</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Erol Gelenbe</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Mert Nakip</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Tadeusz Czachórski</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Improving Massive Access to IoT Gateways</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2022</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Performance Evaluation</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><SECTION><style face="normal" font="default" size="100%">102308</style></SECTION><DATE><style face="normal" font="default" size="100%">08/2022</style></DATE><ABSTRACT><style face="normal" font="default" size="100%">&lt;p&gt;IoT networks handle incoming packets from large numbers of IoT Devices (IoTDs) to IoT Gateways. This can lead to the IoT Massive Access Problem that causes buffer overflow, large end-to-end delays and missed deadlines. This paper analyzes a novel traffic shaping method named the Quasi-Deterministic Traffic Policy (QDTP) that mitigates this problem by shaping the incoming traffic without increasing the end-to-end delay or dropping packets. Using queueing theoretic techniques and extensive data driven simulations with real IoT datasets, the value of QDTP is shown as a means to considerably reduce congestion at the Gateway, and significantly improve the IoT network’s overall performance.&lt;/p&gt;&#13;
</style></ABSTRACT><title><style face="normal" font="default" size="100%">Improving Massive Access to IoT Gateways</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>31</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Tadeusz Czachórski</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Erol Gelenbe</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Godlove Kuaban</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Dariusz Marek</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Optimizing Energy Usage for an Electric Drone</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2022</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">EuroCybersec 2021</style></SECONDARY_TITLE><PLACE_PUBLISHED><style face="normal" font="default" size="100%">Nice, France</style></PLACE_PUBLISHED><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><PUBLISHER><style face="normal" font="default" size="100%">Springer</style></PUBLISHER><VOLUME><style face="normal" font="default" size="100%">1596</style></VOLUME><ABSTRACT><style face="normal" font="default" size="100%">&lt;p&gt;Unmanned Aerial Vehicles (UAVs) are rapidly gaining popu-&lt;br /&gt;&#13;
larity in a wide variety of applications, e.g., agriculture, health care, envi-&lt;br /&gt;&#13;
ronmental management, supply chains, law enforcement, surveillance,&lt;br /&gt;&#13;
and photography. Dones are often powered by batteries, making energy&lt;br /&gt;&#13;
a critical resource that must be optimised during the mission of the&lt;br /&gt;&#13;
drone. The duration of a done’s mission depends on the amount of energy&lt;br /&gt;&#13;
required to perform some manoeuvering actions (takeoff, level flight, hov-&lt;br /&gt;&#13;
ering, and landing), the energy required to power the ICT modules in&lt;br /&gt;&#13;
the drone, the drone’s speed, payload, and the wind. In this paper, we&lt;br /&gt;&#13;
present a model that minimizes the energy consumption of a low power&lt;br /&gt;&#13;
drone and maximizes the time required to completely drain the drone’s&lt;br /&gt;&#13;
battery and ensure the safe landing of the drone.&lt;/p&gt;&#13;
</style></ABSTRACT><title><style face="normal" font="default" size="100%">Optimizing Energy Usage for an Electric Drone</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>31</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Tadeusz Czachórski</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Erol Gelenbe</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Godlove Kuaban</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Modelling energy changes in the energy harvesting battery of an IoT device</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2022</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">30th International Symposium on the Modeling, Analysis, and Simulation of Computer and Telecommunication Systems (MASCOTS 2022)</style></SECONDARY_TITLE><PLACE_PUBLISHED><style face="normal" font="default" size="100%">Nice, France</style></PLACE_PUBLISHED><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><PUBLISHER><style face="normal" font="default" size="100%">IEEE</style></PUBLISHER><ABSTRACT><style face="normal" font="default" size="100%">&lt;p&gt;The complexity of battery-powered autonomous de-&lt;br /&gt;&#13;
vices such as Internet of Things (IoT) nodes or Unmanned Aerial&lt;br /&gt;&#13;
Vehicles (UAV) and the necessity to ensure an acceptable quality&lt;br /&gt;&#13;
of service, reliability, and security, have significantly increased&lt;br /&gt;&#13;
their energy demand. In this paper, we discuss using a diffusion&lt;br /&gt;&#13;
approximation process to approximate the dynamic changes in&lt;br /&gt;&#13;
the energy content of a battery. We consider the case when&lt;br /&gt;&#13;
energy harvesting sources are constantly charging the battery.&lt;br /&gt;&#13;
The model assumes a probabilistic consumption and delivery of&lt;br /&gt;&#13;
energy, giving the time-dependent distributions of the energy at&lt;br /&gt;&#13;
the battery, of the time remaining until it becomes empty, the&lt;br /&gt;&#13;
time required to charge the battery to its total capacity, or the&lt;br /&gt;&#13;
time it is operational between two moments of complete depletion.&lt;br /&gt;&#13;
When possible, we compare the diffusion approximation results&lt;br /&gt;&#13;
with corresponding Markovian models.&lt;/p&gt;&#13;
</style></ABSTRACT><title><style face="normal" font="default" size="100%">Modelling energy changes in the energy harvesting battery of an IoT device</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>31</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Tadeusz Czachórski</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Erol Gelenbe</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Godlove Kuaban</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Modelling energy changes in the energy harvesting battery of an IoT device</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2023</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">30th International Symposium on the Modeling, Analysis, and Simulation of Computer and Telecommunication Systems (MASCOTS 2022)  pp. 81-88</style></SECONDARY_TITLE><PLACE_PUBLISHED><style face="normal" font="default" size="100%">Nice, France</style></PLACE_PUBLISHED><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><PUBLISHER><style face="normal" font="default" size="100%">IEEE Xplore</style></PUBLISHER><DATE><style face="normal" font="default" size="100%">03/2023</style></DATE><ABSTRACT><style face="normal" font="default" size="100%">&lt;p&gt;The complexity of battery-powered autonomous devices such as Internet of Things (IoT) nodes or Unmanned Aerial Vehicles (UAV) and the necessity to ensure an acceptable quality of service, reliability, and security have significantly increased their energy demand. In this paper, we discuss using a diffusion approximation process to approximate the dynamic changes in the energy content of a battery. We consider the case when energy harvesting sources are constantly charging the battery. The model assumes a probabilistic consumption and delivery of energy, giving the time-dependent distributions of the energy at the battery, of the time remaining until it becomes empty, the&lt;br /&gt;&#13;
time required to charge the battery to its total capacity, or the time it is operational between two moments of complete depletion.&lt;br /&gt;&#13;
When possible, we compare the diffusion approximation results with corresponding Markovian models.&lt;/p&gt;&#13;
</style></ABSTRACT><title><style face="normal" font="default" size="100%">Modelling energy changes in the energy harvesting battery of an IoT device</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>7</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Tadeusz Czachórski</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Erol Gelenbe</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Godlove Kuaban</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Dariusz Marek</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Optimizing Energy Usage for an Electric Drone</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2022</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">EuroCybersec 2021: Security in Computer and Information Sciences</style></SECONDARY_TITLE><PLACE_PUBLISHED><style face="normal" font="default" size="100%">Nice, France</style></PLACE_PUBLISHED><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><PUBLISHER><style face="normal" font="default" size="100%">Springer</style></PUBLISHER><VOLUME><style face="normal" font="default" size="100%">1596</style></VOLUME><NUMBER><style face="normal" font="default" size="100%">CCIS</style></NUMBER><PAGES><style face="normal" font="default" size="100%">61–75</style></PAGES><ISBN><style face="normal" font="default" size="100%">978-3-031-09357-9</style></ISBN><ABSTRACT><style face="normal" font="default" size="100%">&lt;p&gt;Unmanned Aerial Vehicles (UAVs) are rapidly gaining popularity in a wide variety of applications, e.g., agriculture, health care, environmental management, supply chains, law enforcement, surveillance, and photography. Dones are often powered by batteries, making energy&lt;br /&gt;&#13;
a critical resource that must be optimised during the mission of the drone. The duration of a done’s mission depends on the amount of energy required to perform some manoeuvering actions (takeoff, level flight, hovering, and landing), the energy required to power the ICT modules in the drone, the drone’s speed, payload, and the wind. In this paper, we present a model that minimizes the energy consumption of a low-power drone and maximizes the time required to completely drain the drone’s battery and ensure the safe landing of the drone.&lt;/p&gt;&#13;
</style></ABSTRACT><title><style face="normal" font="default" size="100%">Optimizing Energy Usage for an Electric Drone</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Godlove Kuaban</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Erol Gelenbe</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Tadeusz Czachórski</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Piotr Czekalski</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Julius Tangka</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Modelling of the Energy Depletion Process and Battery Depletion Attacks for Battery-Powered Internet of Things (IoT) Devices</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2023</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Sensors</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><VOLUME><style face="normal" font="default" size="100%">23</style></VOLUME><ISSUE><style face="normal" font="default" size="100%">6183</style></ISSUE><DATE><style face="normal" font="default" size="100%">07/2023</style></DATE><ABSTRACT><style face="normal" font="default" size="100%">&lt;pre&gt;&#13;
The Internet of Things (IoT) is transforming almost every industry, including agriculture, food processing, health care, oil and gas, environmental protection, transportation and logistics, manufacturing, home automation, and safety. Cost-effective, small-sized batteries are often used to power IoT devices being deployed with limited energy capacity. The limited energy capacity of IoT devices makes them vulnerable to battery depletion attacks designed to exhaust the energy stored in the battery rapidly and eventually shut down the device. In designing and deploying IoT devices, the battery and device specifications should be chosen in such a way as to ensure a long lifetime of the device. This paper proposes diffusion approximation as a mathematical framework for modelling the energy depletion process in IoT batteries. We applied diffusion or Brownian motion processes to model the energy depletion of a battery of an IoT device. We used this model to obtain the probability density function, mean, variance, and probability of the lifetime of an IoT device. Furthermore, we studied the influence of active power consumption, sleep time, and battery capacity on the probability density function, mean, and probability of the lifetime of an IoT device. We modelled ghost energy depletion attacks and their impact on the lifetime of IoT devices. We used numerical examples to study the influence of battery depletion attacks on the distribution of the lifetime of an IoT device. We also introduced an energy threshold after which the device's battery should be replaced in order to ensure that the battery is not completely drained before it is replaced. &lt;/pre&gt;&#13;
</style></ABSTRACT><title><style face="normal" font="default" size="100%">Modelling of the Energy Depletion Process and Battery Depletion Attacks for Battery-Powered Internet of Things (IoT) Devices</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>31</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Godlove Kuaban</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Erol Gelenbe</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Tadeusz Czachórski</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Piotr Czekalski</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Modelling the Energy Performance of Off-Grid Sustainable Green Cellular Base Stations</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2024</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">2023 31st International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunication Systems (MASCOTS 2023)</style></SECONDARY_TITLE><PLACE_PUBLISHED><style face="normal" font="default" size="100%">Stony Brook, NY, USA</style></PLACE_PUBLISHED><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><PUBLISHER><style face="normal" font="default" size="100%">IEEE</style></PUBLISHER><DATE><style face="normal" font="default" size="100%">16/01/2024</style></DATE><ABSTRACT><style face="normal" font="default" size="100%">&lt;pre&gt;&#13;
There is a growing awareness of the need to reduce carbon emissions from the operation of mobile networks. The massive deployment of ultra-dense 5G and IoT networks will significantly increase energy demand and put the electricity grid under stress while also driving up operational costs. In this paper, we model the energy performance of an off-grid sustainable green cellular base station site which consists of a solar power system, Battery Energy Storage (BESS) and Hydrogen Energy Storage (HESS) system, and various types of macrocells, microcells, picocells, or femtocells, with broadband optical or microwave transmission systems, and other electrical and electronic systems (air conditioner, power converters, and controllers. We propose diffusion-based models of the charging and discharging processes of the energy storage systems, and obtain the probability of charging them to their full capacities during the day and completely discharging them at the end of each day. We also investigate the impact of design parameters such as the mean charging rate and the mean discharging rate on the probability densities of charging BESS and HESS to their full capacities during the day and of completely discharging them before the end of each night period. &lt;/pre&gt;&#13;
</style></ABSTRACT><title><style face="normal" font="default" size="100%">Modelling the Energy Performance of Off-Grid Sustainable Green Cellular Base Stations</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>7</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Godlove Kuaban</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Tadeusz Czachórski</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Erol Gelenbe</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Sapana Sharma</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Piotr Czekalski</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">A Markov model for a Self-Powered Green IoT Device with State-Dependent Energy Consumption</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2024</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Proceeding of the 2023 4th International Conference on Communications, Information, Electronic and Energy Systems (CIEES)</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><PUBLISHER><style face="normal" font="default" size="100%">IEEE</style></PUBLISHER><ISBN><style face="normal" font="default" size="100%">979-8-3503-3691-7</style></ISBN><ABSTRACT><style face="normal" font="default" size="100%">&lt;pre&gt;&#13;
The growing concerns about the resource sustainability and environmental impact of deploying billions or trillions of IoT devices in the various sectors of society or economy have given rise to an energy research field known as Green-IoT (G-IoT). G-IoT emphasises the need to prioritise energy efficiency and the reduction of pollution in the IoT ecosystem. This paper presents a Markov model for a self-powered Green IoT device with state-dependent energy consumption. The model evaluates the energy performance of a self-powered Green IoT device. We derive the probability distribution of the energy content of the battery, including the probability that the energy stored in the battery is completely depleted and the density of the lifetime of the IoT device. We investigate the influence of some design parameters on the results. Introducing the threshold at which the device is forced to enter an energy-saving regime significantly increases a G-IoT device's lifetime. Apart from deploying energy-efficient mechanisms to increase the lifetime of a G-IoT device, integrating an efficient energy harvesting system into the device will increase its lifetime and reduce the frequency of battery replacement.&lt;/pre&gt;&#13;
</style></ABSTRACT><title><style face="normal" font="default" size="100%">A Markov model for a Self-Powered Green IoT Device with State-Dependent Energy Consumption</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>31</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Godlove Kuaban</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Tadeusz Czachórski</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Erol Gelenbe</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Piotr Pecka</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Valery Nkemeni</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Piotr Czekalski</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Energy performance of Internet of Things (IoT) networks for pipeline monitoring</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2024</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">2024 International Wireless Communications and Mobile Computing (IWCMC)</style></SECONDARY_TITLE><PLACE_PUBLISHED><style face="normal" font="default" size="100%">Ayia Napa, Cyprus</style></PLACE_PUBLISHED><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><PUBLISHER><style face="normal" font="default" size="100%">IEEE</style></PUBLISHER><DATE><style face="normal" font="default" size="100%">17/07/2024</style></DATE><ISBN><style face="normal" font="default" size="100%">979-8-3503-6126-1</style></ISBN><ABSTRACT><style face="normal" font="default" size="100%">&lt;pre&gt;&#13;
Pipelines are the most convenient ways to transport fluids (e.g., water, oil, and gas). However, leakage of fluids into the environment results in resource wastage (especially water, which is becoming a scarce resource) and environmental pollution (in the case of leakage of toxic fluids like oil and gas). Emerging technologies like the Internet of Things (IoT), Wireless Sensor Networks (WSNs), Artificial Intelligence (AI), distributed computing, and cloud computing enable continuous monitoring of pipelines to detect leakages and corrosion on the pipeline. The main challenge with using battery-powered sensor nodes to monitor pipelines is the energy constraint, necessitating frequent battery replacement. Thus, there is a need to develop energy-saving mechanisms to prolong the lifetime of these sensor nodes. In this paper, we use the diffusion approximation modelling framework in which the data from the experimental testbed are used to model the dynamics of the battery's energy content and to estimate the mean and variance of the device's lifetime. The novelty in the proposed diffusion model of the battery of an IoT node is the introduction of multiple energy thresholds that split the energy state-space of the battery into multiple energy-saving regimes. As the battery discharges, the node gradually transitions into energy-saving regimes by reconfiguring some of its parameters to reduce energy consumption (sometimes at the cost of trading off some performance metrics). We investigate the impact of energy-saving regimes or the number of thresholds on the node's lifetime.&lt;/pre&gt;&#13;
</style></ABSTRACT><title><style face="normal" font="default" size="100%">Energy performance of Internet of Things (IoT) networks for pipeline monitoring</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Godlove Kuaban</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Erol Gelenbe</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Tadeusz Czachórski</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Piotr Czekalski</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Valery Nkemeni</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Energy Performance of Off-Grid Green Cellular Base Stations</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2024</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Performance Evaluation</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><VOLUME><style face="normal" font="default" size="100%">165</style></VOLUME><DATE><style face="normal" font="default" size="100%">10/07/2024</style></DATE><ABSTRACT><style face="normal" font="default" size="100%">&lt;pre&gt;&#13;
The most energy-hungry parts of mobile networks are the base station sites, which consume around $60-80\%$ of their total energy. One of the approaches for relieving this energy pressure on the electricity grid infrastructure and reducing the Operational Expenditures (OPEX) is to power base stations with renewable energy. However, the design of a green mobile network requires the dimensioning of the energy harvesting and storage systems through the estimation of the network's energy demand. Therefore, this paper develops a diffusion-based modelling framework for solar-powered green off-grid base station sites. We apply this framework to evaluate the energy performance of homogeneous and hybrid energy storage systems supplied by harvested solar energy. We present the complete analysis, with numerical examples, to study the relationship between the design parameters and the energy performance metrics. The numerical computations demonstrate how the proposed framework can be applied to evaluate homogeneous and unconventional hybrid energy storage systems.&lt;/pre&gt;&#13;
</style></ABSTRACT><title><style face="normal" font="default" size="100%">Energy Performance of Off-Grid Green Cellular Base Stations</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>7</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Godlove Kuaban</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Tadeusz Czachórski</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Piotr Czekalski</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Markov Models for Dimensioning and Provisioning of Battery Energy Storage Systems (BESS) for Off-Grid Green Mobile Network Base Station Sites</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2024</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Proceedings of the st 1 International Conference on Mathematical and Statistical Sciences(ICMSS-1)</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><ISBN><style face="normal" font="default" size="100%">978-99916-55-80-2</style></ISBN><ABSTRACT><style face="normal" font="default" size="100%">&lt;pre&gt;&#13;
There is a growing desire by mobile network operators and other stakeholders to reduce carbon emissions from the operation of mobile networks. The widespread adoption of ultra-dense 5G and Internet of Things (IoT) networks will likely increase the energy demand from these networks significantly. In this paper, we model the density of the time required to charge BESS to its full capacity when the renewable energy sources can generate enough energy to meet the needs of the base station site and the density of the time required to completely deplete the energy stored in BESS when the renewable energy sources cannot generate a sufficient amount of energy to meet the demand of the site. We also investigate the influence of the design parameters, such as the energy supply-demand ratio, on the distribution of the time required to charge BESS to its full capacity (for a supply-demand ratio greater than one) and the time required to completely deplete the energy stored in BESS (for supply-demand ratio less than one).&lt;/pre&gt;&#13;
</style></ABSTRACT><URL><style face="normal" font="default" size="100%">chrome-extehttps://icmss.nust.na/sites/default/files/ICMSS-1%20Conference%20Proceedings_1st%20Edition_Final-11apr24.pdf</style></URL><title><style face="normal" font="default" size="100%">Markov Models for Dimensioning and Provisioning of Battery Energy Storage Systems (BESS) for Off-Grid Green Mobile Network Base Station Sites</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Monika Nycz</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Tomasz Nycz</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Tadeusz Czachórski</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Dropping or Marking: a Review and Evaluation of  Existing Fluid-Flow Approximation Models</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2024</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Bulletin of the Polish Academy of Sciences Technical Sciences</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><VOLUME><style face="normal" font="default" size="100%">72</style></VOLUME><ISSUE><style face="normal" font="default" size="100%">5</style></ISSUE><SECTION><style face="normal" font="default" size="100%">e150333</style></SECTION><DATE><style face="normal" font="default" size="100%">09/2024</style></DATE><URL><style face="normal" font="default" size="100%">http://journals.pan.pl/Content/131546/PDF/BPASTS_2024_72_5_4300.pdf</style></URL><title><style face="normal" font="default" size="100%">Dropping or Marking: a Review and Evaluation of  Existing Fluid-Flow Approximation Models</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Godlove Kuaban</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Tadeusz Czachórski</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Erol Gelenbe</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Piotr Pecka</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Sapana Sharma</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Pradeep Singh</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Valery Nkemeni</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Piotr Czekalski</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Energy performance of self-powered Green IoT nodes</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2024</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Frontiers in Energy Research</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><VOLUME><style face="normal" font="default" size="100%">12</style></VOLUME><DATE><style face="normal" font="default" size="100%">07/11/2024</style></DATE><ABSTRACT><style face="normal" font="default" size="100%">&lt;p&gt;The widespread adoption of the Internet of Things (IoT) partly depends on the successful design and deployment of IoT nodes that can operate for several years without any service outage and the need to replace their energy storage systems (e.g., battery, capacitor, or supercapacitor) when all the stored energy is depleted or when the cycle life of the Energy Storage Systems (ESS) is reached. Replacing batteries in the case of large-scale IoT networks and nodes located in places that are hard to reach is very challenging and costly, requiring the design of IoT nodes that can operate for several years without the need for human intervention. One such example is the deployment of IoT nodes in large agricultural fields (for soil or crop monitoring) or a long-distance pipeline (for pipeline monitoring). This paper investigates the practical implications of imposing energy-saving thresholds on the energy performance metrics of green IoT nodes. We propose an energy packet-based model for the evaluation of the energy performance of a green IoT node with the possibility of switching the node to energy-saving regimes on the fly when the energy content of the ESS reaches defined thresholds. Configuring single or multiple thresholds improves the energy performance of the node significantly (e.g., increases the lifetime of the node and reduces the probability of service outage and energy wastage), and the value of the threshold(s) should be carefully chosen. The energy performance of the IoT node can also be improved by dimensioning the energy harvesting system to ensure that the node operates for several years without running out of energy (e.g., maximizing the lifetime of the nodes and minimising the probability of service outage and energy wastage).&lt;/p&gt;&#13;
</style></ABSTRACT><title><style face="normal" font="default" size="100%">Energy performance of self-powered Green IoT nodes</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>31</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Godlove Kuaban</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Tadeusz Czachórski</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Erol Gelenbe</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Piotr Pecka</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Valery Nkemeni</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Piotr Czekalski</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Impact of energy leakage on the energy performance of green IoT nodes</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2024</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">32nd International Symposium on the Modeling, Analysis, and Simulation of Computer and Telecommunication Systems (MASCOTS 2024)</style></SECONDARY_TITLE><PLACE_PUBLISHED><style face="normal" font="default" size="100%">Krakow, Poland</style></PLACE_PUBLISHED><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><PUBLISHER><style face="normal" font="default" size="100%">IEEE</style></PUBLISHER><ABSTRACT><style face="normal" font="default" size="100%">&lt;p&gt;In the present paper, we investigate the impact of imperfections (non-idealities) of the energy storage system (e.g., batteries, capacitors, or supercapacitors) on the energy performance of green IoT nodes. In particular, we investigate the impact of energy leakage from the Energy Storage System (ESS) on important energy performance metrics, such as service outage probability, the density of the lifetime of the node, and the time-dependent mean number of energy packets (EPs) in the ESS. Also, we explore various strategies that can be employed to compensate for the impact of energy losses due to energy leakage on the energy performance metrics. Specifically, we examine two potential strategies for improving the energy performance of the IoT nodes: (i) through increasing the energy generation rate of the energy harvesters (e.g., by adding additional solar panels or replacing the existing solar panels with more efficient ones that can produce more energy), and (ii) through reducing the energy consumption rate of the IoT node (e.g., by configuring ESS energy thresholds below which the nodes are forced to operate in low energy consumption states).&lt;/p&gt;&#13;
</style></ABSTRACT><URL><style face="normal" font="default" size="100%">https://ieeexplore.ieee.org/document/10786519 </style></URL><title><style face="normal" font="default" size="100%">Impact of energy leakage on the energy performance of green IoT nodes</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>7</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Godlove Kuaban</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Valery Nkemeni</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Tadeusz Czachórski</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Piotr Czekalski</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Eric Djomadji</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Dimensioning the renewable energy system of a Green Cellular Base Station Site</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><SECONDARY_TITLE><style face="normal" font="default" size="100%">EAI/Springer Innovations in Communication and Computing </style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><PUBLISHER><style face="normal" font="default" size="100%">Springer</style></PUBLISHER><ABSTRACT><style face="normal" font="default" size="100%">&lt;p&gt;The demand for mobile communication services has experienced astronomical growth in the past few decades and continues to grow steadily at a brisk rate. This is due partly to falling prices of user devices, the evolution of mobile applications, the widespread adoption of social media, and the recent advances in modern technologies such as the Internet of Things (IoT), cloud/fog computing, and Artificial Intelligence (AI). An expansion of mobile communication infrastructure to accommodate the rapidly growing demand and to migrate to new technologies (e.g., 4G/5G) have also resulted in a significant increase in the energy consumption of mobile networks. An attractive solution to reduce the carbon footprint of mobile networks and to reduce the energy bills of network operators is to deploy renewable energy systems(e.g., solar energy systems) to power base station sites. In this paper, we present a practical approach for dimensioning and evaluating renewable generation and storage systems for cellular base station sites. We use data collected from a base station site in Banda (North region of Cameroon) as input to the analytical model; we estimate the probability of service outage (when all the stored energy is consumed and the PV system is not able to generate energy).&lt;/p&gt;&#13;
</style></ABSTRACT><title><style face="normal" font="default" size="100%">Dimensioning the renewable energy system of a Green Cellular Base Station Site</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>31</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Godlove Kuaban</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Tomasz Nycz</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Monika Nycz</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Tadeusz Czachórski</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Piotr Czekalski</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Modelling the Transient Evolution of Queues in Plugged-in Electric Vehicles(PEV) Fast Charging Stations</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2025</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">25th International Conference on Computational Science</style></SECONDARY_TITLE><PLACE_PUBLISHED><style face="normal" font="default" size="100%">Singapore</style></PLACE_PUBLISHED><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><PUBLISHER><style face="normal" font="default" size="100%">Springer, Cham</style></PUBLISHER><DATE><style face="normal" font="default" size="100%">07/2025</style></DATE><ISBN><style face="normal" font="default" size="100%">978-3-031-97635-3</style></ISBN><ABSTRACT><style face="normal" font="default" size="100%">&lt;p&gt;The transportation sector is responsible for approximately 23% of global greenhouse gas (GHG) emissions, with road transportation contributing nearly 70% of these emissions. The widespread adoption of electric vehicles (EVs) is transforming this sector by reducing emissions and decreasing reliance on fossil fuels. However, the growing number of EVs presents significant challenges for charging infrastructure, particularly in managing long queues, extended wait times, and limited station capacity. Most existing studies on the performance of electric vehicle charging stations assume Poisson arrivals and exponential charging times, simplifications that often overlook real-world variability. This paper introduces a generalized queueing model that leverages empirical interarrival and charging duration data for more accurate performance evaluation. A transient analysis is conducted, examining two operational optimization strategies aimed at minimizing queue sizes during peak demand: (1) a queue management policy that encourages charging only up to a predefined state-of-charge (SoC) threshold instead of the typical 80–100%, and (2) dynamic control of the number of active charging ports based on demand. The results show that these operational optimization policies improve the efficiency of the charging station and significantly improve the customer experience.&lt;/p&gt;&#13;
</style></ABSTRACT><title><style face="normal" font="default" size="100%">Modelling the Transient Evolution of Queues in Plugged-in Electric Vehicles(PEV) Fast Charging Stations</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Godlove Kuaban</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Tadeusz Czachórski</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Erol Gelenbe</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Piotr Czekalski</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Time-Dependent Analysis of the Interaction Between Energy Harvesting, Leakage, and Consumption Processes in a Green IoT Device</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2025</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%"> IEEE Access </style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><ABSTRACT><style face="normal" font="default" size="100%">&lt;p&gt;The Internet of Things (IoT) is transforming industries by enhancing productivity and efficiency; however, energy availability remains a significant challenge due to the limited capacity of batteries and supercapacitors powering IoT devices. The emergence of Green IoT (G-IoT) frameworks, which prioritize energy efficiency and renewable energy integration, offers a promising solution to address this challenge. Despite these advancements, energy storage systems (ESSs) face issues such as capacity degradation, leakage, and charge redistribution, which can lead to energy depletion and service disruptions. Traditional models often assume constant energy harvesting rates, overlooking the time-varying nature of environmental conditions that influence energy availability. In this paper, we propose a novel mathematical framework that incorporates time-dependent fluctuations in the energy harvesting rate to analyse the dynamic interactions between energy harvesting, leakage, and consumption in green IoT systems. Our approach includes an Energy Packet Network (EPN) model to represent transient energy dynamics and a Markov model to capture fluctuations in the energy harvesting rate. Through numerical simulations, we evaluate the impact of key design parameters, such as ESS capacity, mean energy consumption rate, energy leakage, and energy harvesting rate variations, on critical performance metrics including the probability of energy depletion and the transient mean number of stored energy packets. The results highlight the importance of considering time-varying energy harvesting in the design and optimization of IoT systems for long-term operation and sustainability.&lt;/p&gt;&#13;
</style></ABSTRACT><title><style face="normal" font="default" size="100%">Time-Dependent Analysis of the Interaction Between Energy Harvesting, Leakage, and Consumption Processes in a Green IoT Device</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>31</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Godlove Kuaban</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Tulin Atmaca</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Zeynep Turgut</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Tadeusz Czachórski</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Piotr Czekalski</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Leveraging Packet Aggregation to Optimise QoS and Energy Trade-offs in 5G/6G Optical Fronthaul Networks</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2025</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">The 21st International Conference on Wireless and Mobile Computing, Networking and Communications.</style></SECONDARY_TITLE><PLACE_PUBLISHED><style face="normal" font="default" size="100%">Marrakech, Morocco</style></PLACE_PUBLISHED><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><PUBLISHER><style face="normal" font="default" size="100%">IEEE</style></PUBLISHER><DATE><style face="normal" font="default" size="100%">02/12/2025</style></DATE><ABSTRACT><style face="normal" font="default" size="100%">&lt;p&gt;The growing demands of 5G and emerging 6G mobile networks—driven by the proliferation of IoT devices, immersive applications, and high-throughput services—necessitate more efficient and scalable fronthaul solutions. Open Radio Access Networks and cloud-RAN architectures offer promising frameworks by decoupling hardware and software and enabling centralised processing. However, the fronthaul segment still faces challenges related to bandwidth inefficiency, signalling overhead, and relatively high energy consumption, particularly due to the transmission of vast numbers of small packets. Packet aggregation emerges as a viable strategy to mitigate these challenges by grouping multiple small packets into larger payloads, thereby reducing protocol overhead, improving throughput efficiency, and lowering energy consumption in the network as a whole. This paper investigates the impact of packet aggregation on both quality of service (QoS) and energy efficiency in the fronthaul of 5G/6G mobile networks. While prior studies have examined its effects on throughput and latency, the implications for energy consumption remain underexplored. We evaluate how aggregation design parameters—such as time thresholds, size thresholds, and traffic intensity—influence performance metrics such as throughput and latency. We also propose ways to achieve an optimal trade-off between QoS and energy efficiency.&#160;Our findings offer insights into the design of energy-aware, delay-sensitive packet aggregation schemes tailored for next-generation mobile network architectures.&lt;/p&gt;&#13;
</style></ABSTRACT><title><style face="normal" font="default" size="100%">Leveraging Packet Aggregation to Optimise QoS and Energy Trade-offs in 5G/6G Optical Fronthaul Networks</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>31</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Godlove Kuaban</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Tadeusz Czachórski</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Erol Gelenbe</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Piotr Pecka</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Piotr Czekalski</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Energy Dynamics of Green IoT Nodes with Time-Varying Energy Harvesting, Leakage, and Consumption Patterns</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2025</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">33rd International Symposium on the Modeling, Analysis, and Simulation of Computer and Telecommunication System</style></SECONDARY_TITLE><PLACE_PUBLISHED><style face="normal" font="default" size="100%">Paris, France</style></PLACE_PUBLISHED><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><PUBLISHER><style face="normal" font="default" size="100%">IEEE</style></PUBLISHER><DATE><style face="normal" font="default" size="100%">12/2025</style></DATE><ABSTRACT><style face="normal" font="default" size="100%">&lt;p&gt;The growing proliferation of Internet of Things (IoT) devices has intensified the need for sustainable energy solutions, particularly in resource-constrained deployments where non-rechargeable batteries and supercapacitors are the primary energy sources. Green IoT (G-IoT) frameworks address this challenge by combining energy-saving techniques with energy harvesting from ambient sources such as solar power. However, the intermittent nature of renewable energy and the non-ideal behavior of energy storage systems—such as energy leakage and capacity degradation—complicate reliable energy provisioning. This paper presents a novel Markovian framework for modelling the coupled dynamics of time-varying solar energy harvesting, time-dependent energy consumption, and state-dependent energy leakage in G-IoT systems. Unlike traditional steady-state models, our approach uses Discrete-Time Markov Chains (DTMCs) to capture the stochastic variability in both energy harvesting and consumption processes. We also introduce a refined leakage model in which the leakage rate is dynamically dependent on the stored energy level, enabling a more realistic characterization of energy losses due to energy leakage. Through extensive analytical evaluation, we examine how key parameters—such as storage capacity, leakage rate coefficient, and energy harvesting and consumption patterns—affect critical performance metrics, including the mean stored energy and energy-related service outage probability. Furthermore, we propose a parameter tuning strategy to optimize energy reliability and storage efficiency. The proposed model provides valuable insights for the design and optimization of robust, energy-aware IoT systems powered by renewable energy sources.&lt;/p&gt;&#13;
</style></ABSTRACT><title><style face="normal" font="default" size="100%">Energy Dynamics of Green IoT Nodes with Time-Varying Energy Harvesting, Leakage, and Consumption Patterns</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>31</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Godlove Kuaban</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Tadeusz Czachórski</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Tulin Atmaca</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Piotr Czekalski</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Analytical Power Efficiency Models for Open Radio Access Network (O-RAN)</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2025</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">33rd International Symposium on the Modeling, Analysis, and Simulation of Computer and Telecommunication System</style></SECONDARY_TITLE><PLACE_PUBLISHED><style face="normal" font="default" size="100%">Paris, France</style></PLACE_PUBLISHED><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><PUBLISHER><style face="normal" font="default" size="100%">IEEE</style></PUBLISHER><DATE><style face="normal" font="default" size="100%">12/2025</style></DATE><ABSTRACT><style face="normal" font="default" size="100%">&lt;p&gt;The rapid deployment of 5G and the anticipated evolution to 6G have intensified the need for energy-efficient radio access networks, driven by rapidly growing power demands, rising energy costs, and environmental concerns. Open Radio Access Networks (O-RAN) offer a flexible and scalable architecture; however, their disaggregated nature requires accurate power modelling to optimise energy consumption. This paper proposes enhanced power consumption models for O-RAN that account for power efficiency gains from resource sharing across multiple radio units (O-RUs) and the offloading of highly parallel baseband processing tasks to specialised energy-efficient hardware accelerators such as ASICs, FPGAs, or GPUs. The models are used to analyse the scaling behavior of O-RUs, distributed units (O-DUs), and centralized units (O-CUs) under varying deployment scenarios. Results show that O-RUs dominate the total network power budget, while O-DUs benefit from sublinear growth due to statistical multiplexing, and O-CUs scale the slowest owing to centralised control-plane sharing. Furthermore, the study identifies optimal ranges of RU-to-DU aggregation and accelerator utilization for maximising energy efficiency in large-scale 5G/6G O-RAN deployments.&lt;/p&gt;&#13;
</style></ABSTRACT><title><style face="normal" font="default" size="100%">Analytical Power Efficiency Models for Open Radio Access Network (O-RAN)</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>31</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Godlove Kuaban</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Tadeusz Czachórski</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Tulin Atmaca</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Piotr Czekalski</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Power models for O-RAN O-DU planning and optimisation</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><SECONDARY_TITLE><style face="normal" font="default" size="100%">IEEE Consumer Communications and Networking Conference (CCNC 2026)</style></SECONDARY_TITLE><PLACE_PUBLISHED><style face="normal" font="default" size="100%">Las Vegas, NV, USA</style></PLACE_PUBLISHED><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><PUBLISHER><style face="normal" font="default" size="100%">IEEE</style></PUBLISHER><ABSTRACT><style face="normal" font="default" size="100%">&lt;p&gt;The transition from 5G to 6G networks is driving an unprecedented densification of Radio Access Networks (RANs), resulting in increased energy demand and operational costs. Open RAN (O-RAN) architectures, which disaggregate baseband processing across commercial off-the-shelf (COTS) servers, further amplify these challenges due to the power sensitivity of the Distributed Unit (O-DU) to traffic load variations.&#160;This paper develops a nonlinear O-DU power model that captures load-dependent efficiency effects and integrates it into a dynamic core management framework, which activates or deactivates CPU cores based on instantaneous traffic demand. The effectiveness of the proposed dynamic core management framework is investigated in multi-RU O-RAN scenarios, comparing the proposed dynamic approach with a static baseline. Simulation results show that the dynamic scheme reduces energy consumption by up to $59.42\%$ on average under light traffic, with instantaneous savings exceeding $70\%$ during off-peak periods, while maintaining performance. These findings demonstrate that workload-aware core provisioning can deliver substantial energy efficiency gains in O-RAN deployments, particularly in lightly to moderately loaded networks.&lt;/p&gt;&#13;
</style></ABSTRACT><title><style face="normal" font="default" size="100%">Power models for O-RAN O-DU planning and optimisation</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>31</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Tadeusz Czachórski</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Krzysztof Grochla</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Piotr Pecka</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Anna Strzoda</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">J. Fourneau</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Lynda Mokdad</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Monika Nycz</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Tomasz Nycz</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">The impact of CSMA on LoRaWAN gateways' performance in IoT networks</style></TITLE></TITLES><KEYWORDS><KEYWORD><style face="normal" font="default" size="100%">LoRa</style></KEYWORD></KEYWORDS><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2026</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%"/></SECONDARY_TITLE><PLACE_PUBLISHED><style face="normal" font="default" size="100%">Las Vegas USA</style></PLACE_PUBLISHED><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><PUBLISHER><style face="normal" font="default" size="100%">IEEE</style></PUBLISHER><DATE><style face="normal" font="default" size="100%">02/2026</style></DATE><KEYWORD><style face="normal" font="default" size="100%"/></KEYWORD><ABSTRACT><style face="normal" font="default" size="100%">&lt;p&gt;The CSMA mode of operation was recently added to the LoRaWAN standard. We investigate, using a queueing model, how the introduction of CSMA in the communication between devices and the gate in LoRaWan may increase the probability of successful transmission. &#160;In the proposed model, customers (transmissions) are served by a multichannel station (gate), and the number of channels corresponds to the number of transmissions that can be performed in parallel. We introduce a queueing model with multiple attempts to find a free channel and investigate their impact on transmission throughput and reliability.&lt;br /&gt;&#13;
&#160;&lt;/p&gt;&#13;
</style></ABSTRACT><URL><style face="normal" font="default" size="100%">https://ieeexplore.ieee.org/document/11366536</style></URL><title><style face="normal" font="default" size="100%">The impact of CSMA on LoRaWAN gateways' performance in IoT networks</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>31</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Tadeusz Czachórski</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%"> Queueing Theory and Diffusion Approximation with their Applications</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2026</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Materials for Lectures at UPES Univerity Dehradun, India</style></SECONDARY_TITLE><DATE><style face="normal" font="default" size="100%">05/2026</style></DATE><title><style face="normal" font="default" size="100%"> Queueing Theory and Diffusion Approximation with their Applications</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>31</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Tadeusz Czachórski</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Krzysztof Grochla</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Piotr Pecka</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Anna Strzoda</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Jean Fourneau</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Lynda Mokdad</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Monika Nycz</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Tomasz Nycz</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">The Impact of CSMA on LoRaWAN Communication Efficiency: A Diffusion Approximation Model</style></TITLE></TITLES><KEYWORDS><KEYWORD><style face="normal" font="default" size="100%">Diffusion approximation; LPWAN; CSMA</style></KEYWORD></KEYWORDS><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2026</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Nineteen International Workshop on Selected Topics in Mobile and Wireless Computing WiMob</style></SECONDARY_TITLE><PLACE_PUBLISHED><style face="normal" font="default" size="100%">Avignon, France</style></PLACE_PUBLISHED><PUBLISHER><style face="normal" font="default" size="100%">IEEE</style></PUBLISHER><KEYWORD><style face="normal" font="default" size="100%"/></KEYWORD><title><style face="normal" font="default" size="100%">The Impact of CSMA on LoRaWAN Communication Efficiency: A Diffusion Approximation Model</style></title></RECORD></records></xml>
