<?xml version="1.0" encoding="UTF-8"?>
<xml><records><record><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><ref-type>5</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">A. Bęben</style></author><author><style face="normal" font="default" size="100%">J. Śliwiński</style></author><author><style face="normal" font="default" size="100%">P. Krawiec</style></author><author><style face="normal" font="default" size="100%">Piotr Pecka</style></author><author><style face="normal" font="default" size="100%">Mateusz Nowak</style></author><author><style face="normal" font="default" size="100%">B. Belter</style></author><author><style face="normal" font="default" size="100%">J. Gutkowski</style></author><author><style face="normal" font="default" size="100%">Ł. Łopatowski</style></author><author><style face="normal" font="default" size="100%">P. Białoń</style></author><author><style face="normal" font="default" size="100%">J.M. Batalla</style></author><author><style face="normal" font="default" size="100%">M. Drwal</style></author><author><style face="normal" font="default" size="100%">P. Rygielski</style></author><author><style face="normal" font="default" size="100%">Wojciech Burakowski</style></author><author><style face="normal" font="default" size="100%">P. Krawiec</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Inżynieria Internetu Przyszłości</style></title></titles><keywords/><dates><year><style face="normal" font="default" size="100%">2012</style></year></dates><section><style face="normal" font="default" size="100%">Architektura sieci świadomych treści w Systemie IIP</style></section><publisher><style face="normal" font="default" size="100%">Politechnika Warszawska</style></publisher><pub-location><style face="normal" font="default" size="100%">Warszawa</style></pub-location><language><style face="normal" font="default" size="100%">eng</style></language></record><record><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">B. Wieczorek</style></author><author><style face="normal" font="default" size="100%">M. Połomski</style></author><author><style face="normal" font="default" size="100%">Piotr Pecka</style></author><author><style face="normal" font="default" size="100%">S. Deorowicz</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%">An Effective Way of Storing and Accessing Very Large Transition Matrices Using Multi-core CPU and GPU Architectures</style></title></titles><keywords/><dates><year><style face="normal" font="default" size="100%">2014</style></year></dates><secondary-title><style face="normal" font="default" size="100%">BDAS 2014</style></secondary-title><pages><style face="normal" font="default" size="100%">323–334</style></pages><abstract><style face="normal" font="default" size="100%">The topic of probabilistic model checking algoritms of Markov processes makes the problem of storing and processing of very large transition matrices crucial. While the symbolic approach utilises very effective storage and access methods, like Multi-terminal Binary Decision Diagrams, the traditional explicit method of representing and solving the model using sparse matrices has many advantages, especially when we concired the flexibility of computing of different properties. We show and examine a compact representation of a very large transition matrix in the sparse form. The technique employs an effective method of compression, storage, and accessing of the matrix and is suitable for use in mutli-core CPU and GPU environments. Such large transition matrices consume a lot of space and cannot be considered as typical types of data for storage in database systems. Nevertheless, their storage and efficient access to them could be beneficial for solving of Markov models, so constructing specialised compression methods is obviously the way to go.</style></abstract><publisher><style face="normal" font="default" size="100%">Springer International Publishing Switzerland</style></publisher><language><style face="normal" font="default" size="100%">eng</style></language><notes><style face="normal" font="default" size="100%">10th International Conference BDAS 2014, Ustroń, Poland May 27-30,</style></notes></record><record><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><ref-type>47</ref-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><year><style face="normal" font="default" size="100%">2002</style></year></dates><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></record><record><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Krzysztof Grochla</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%">The Markov chain model of RED active queuing management algorithm</style></title></titles><keywords/><dates><year><style face="normal" font="default" size="100%">2006</style></year></dates><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></record><record><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Krzysztof Grochla</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%">Analiza wydajności mechanizmu RED za pomocą łańcuchów Markowa z czasem ciągłym</style></title></titles><keywords/><dates><year><style face="normal" font="default" size="100%">2006</style></year></dates><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></record><record><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><ref-type>47</ref-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%">Piotr Pecka</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%">Content Identification in PI CAN Network</style></title></titles><keywords/><dates><year><style face="normal" font="default" size="100%">2011</style></year></dates><secondary-title><style face="normal" font="default" size="100%">Computer Networks</style></secondary-title><pages><style face="normal" font="default" size="100%">164–172</style></pages><publisher><style face="normal" font="default" size="100%">Springer</style></publisher><language><style face="normal" font="default" size="100%">eng</style></language></record><record><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><ref-type>47</ref-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><year><style face="normal" font="default" size="100%">2010</style></year><pub-dates><date><style face="normal" font="default" size="100%">1</style></date></pub-dates></dates><secondary-title><style face="normal" font="default" size="100%">Proc. of HET-NETs 2010 Conference</style></secondary-title><pages><style face="normal" font="default" size="100%">143–152</style></pages><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><publisher><style face="normal" font="default" size="100%">Institute of Theoretical and Applied Informatics of the Polish Academy of Sciences</style></publisher><pub-location><style face="normal" font="default" size="100%">Gliwice, Bałtycka 5</style></pub-location><language><style face="normal" font="default" size="100%">eng</style></language></record><record><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><ref-type>5</ref-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></authors></contributors><titles><title><style face="normal" font="default" size="100%">Simulation and Analytical Evaluation of a Slotted Ring Optical Packet Switching Network</style></title></titles><keywords/><dates><year><style face="normal" font="default" size="100%">2009</style></year></dates><secondary-title><style face="normal" font="default" size="100%">Advances in Soft Computing</style></secondary-title><volume><style face="normal" font="default" size="100%">64</style></volume><section><style face="normal" font="default" size="100%">Simulation and Analytical Evaluation of a Slotted Ring Optical Packet Switching Network</style></section><abstract><style face="normal" font="default" size="100%">&lt;p&gt;Optical Packet Switching (OPS) is a technology which thanks to its speed of operation may become popular in next-generation networks. Because optical packets are not buffered it is necessary to develop new mechanisms which would allow quality of service management in OPS networks. The paper discusses the architecture of OPS networks of the ring type with nodes enabling optical packet switching, equipped with the mechanism of Quality of Service (QoS) management. The differentiation of the quality of service was achieved by means of the proposed mechanism of priority registers with the timeout mechanism. This enables the network to be used for transporting various classes of data with varying requirements as to the quality of service. Simulation trials have been conducted and an analytical model for this type of network has been proposed.&lt;/p&gt;&#13;
</style></abstract><publisher><style face="normal" font="default" size="100%">Springer Berlin / Heidelberg</style></publisher><language><style face="normal" font="default" size="100%">eng</style></language><notes><style face="normal" font="default" size="100%">10.1007/978-3-642-05019-0\_3</style></notes></record><record><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><ref-type>5</ref-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%">S. Balandin</style></author><author><style face="normal" font="default" size="100%">R. Dunaytsev</style></author><author><style face="normal" font="default" size="100%">Y. Koucheryavy</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Smart Spaces and Next Generation Wired/Wireless Networking. Third Conference on Smart Spaces, ruSMART 2010, and 10th International Conference, NEW2AN 2010</style></title></titles><keywords/><dates><year><style face="normal" font="default" size="100%">2010</style></year><pub-dates><date><style face="normal" font="default" size="100%">8</style></date></pub-dates></dates><secondary-title><style face="normal" font="default" size="100%">Lecture Notes in Computer Science</style></secondary-title><volume><style face="normal" font="default" size="100%">6294</style></volume><section><style face="normal" font="default" size="100%">Reducing the Number of States for Markovian Model of Optical Slotted Ring Network</style></section><abstract><style face="normal" font="default" size="100%">Modelling with use of Markov chains is difficult from computational point of view, because of a rapid increase in the number of states occurring even when there is only a slight increase in the model’s scale. However, thanks to the appropriate description of the model the number of states can be significantly reduced. This paper discusses a synchronous slotted-ring network with optical packet switching modelled by means of markovian chains with continuous time. Simplifying the description has made it possible to significantly reduce the model’s dimension without significantly diminishing the results’ accuracy.</style></abstract><isbn><style face="normal" font="default" size="100%">978-3-642-14890-3</style></isbn><publisher><style face="normal" font="default" size="100%">Springer Berlin / Heidelberg</style></publisher><language><style face="normal" font="default" size="100%">eng</style></language><notes><style face="normal" font="default" size="100%">10.1007/978-3-642-14891-0\_21</style></notes></record><record><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><ref-type>17</ref-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></authors></contributors><titles><title><style face="normal" font="default" size="100%">Priority Registers Mechanism for fair access to ring-type OPS network</style></title></titles><keywords/><dates><year><style face="normal" font="default" size="100%">2009</style></year></dates><secondary-title><style face="normal" font="default" size="100%">Theoretical and Applied Informatics</style></secondary-title><pages><style face="normal" font="default" size="100%">181–191</style></pages><volume><style face="normal" font="default" size="100%">21</style></volume><number><style face="normal" font="default" size="100%">3-4</style></number><abstract><style face="normal" font="default" size="100%">The paper discusses the architecture of ring-type OPS (Optical Packet Switching) networks with QoS management. The electronic-optical nodes of the network enable optical packet switching within the ring and electronic buffered interface for a client. The differentiation of the quality of service was achieved by means of the system of priorities, and thanks to proposed mechanism of priority registers fair access to the link was achieved. This enables the network to be used for transporting various classes of data with varying requirements as to the quality of service. Simulation trials have been conducted and an analytical model for this type of network has been proposed.</style></abstract><language><style face="normal" font="default" size="100%">eng</style></language></record><record><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Sławomir Nowak</style></author><author><style face="normal" font="default" size="100%">Piotr Pecka</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%">Rozproszona baza danych dla lokalizacji treści w sieci PI CAN</style></title></titles><keywords/><dates><year><style face="normal" font="default" size="100%">2012</style></year></dates><secondary-title><style face="normal" font="default" size="100%">Przegląd Telekomunikacyjny i Wiadomości Telekomunikacyjne</style></secondary-title><pages><style face="normal" font="default" size="100%">1481–1490</style></pages><number><style face="normal" font="default" size="100%">8-9</style></number><abstract><style face="normal" font="default" size="100%">Identyfikacja i lokalizacja treści stanowią podstawowe zagadnienia przy opracowywaniu sieci ukierunkowanych na treść (content-centric networks). W artykule przedstawiono implementację oraz badania wydajności mechanizmu Content Registry (CR), który został opracowany na potrzeby projektu Inżynieria Internetu Przyszłości, w części dotyczącej mechanizmów i wymagań dla sieci PI CAN (Paralel Internet Content Aware Network). CR umożliwia wydajne wyszukiwanie, w rozproszonej sieciowej bazie danych rekordów opisu treści, które zawierają podstawowe informacje o lokalizacji treści I wymaganiach w zakresie transmisji sieciowej. Rezultaty badań przedstawione w artykule potwierdzają wysoką efektywność proponowanego rozwiązania w różnych konfiguracjach i topologiach sieciowych.</style></abstract><language><style face="normal" font="default" size="100%">eng</style></language></record><record><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Sławomir Nowak</style></author><author><style face="normal" font="default" size="100%">Piotr Pecka</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%">Content Registry - the distributed database of content localization for the PI CAN network</style></title></titles><keywords/><dates><year><style face="normal" font="default" size="100%">2012</style></year></dates><secondary-title><style face="normal" font="default" size="100%">Proceedings</style></secondary-title><abstract><style face="normal" font="default" size="100%">Content addressing and localization are basic issues in the structure of content-centric networks. This paper presents the implementation and performance evaluation of the Content Registry (CR), developed within the framework of the FIE (Future Internet Engineering) project to meet the requirements of the PI CAN network. The CR allows to find the desired Content Record (containing basic transmission parameters and localization of a content) in the network-distributed content database. The results confirm the CR is highly efficient in various configurations of the logical topology of connected nodes.</style></abstract><publisher><style face="normal" font="default" size="100%">IEEE Xplore</style></publisher><language><style face="normal" font="default" size="100%">eng</style></language><notes><style face="normal" font="default" size="100%">NETWORKS 2012, 15th International Telecommunication Network Strategy and Planning Symposium, Rome, October 15th - 18th 2012</style></notes></record><record><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Piotr Pecka</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Software library for the Markov analysis of complex queuing models</style></title></titles><keywords/><dates><year><style face="normal" font="default" size="100%">2005</style></year><pub-dates><date><style face="normal" font="default" size="100%">11</style></date></pub-dates></dates><secondary-title><style face="normal" font="default" size="100%">Proceedings from Workshop “New Trends in Modelling, Quantitative Methods and Measurements”</style></secondary-title><language><style face="normal" font="default" size="100%">eng</style></language></record><record><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><ref-type>5</ref-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><year><style face="normal" font="default" size="100%">2011</style></year></dates><secondary-title><style face="normal" font="default" size="100%">Advances in Intelligent and Soft Computing</style></secondary-title><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><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><isbn><style face="normal" font="default" size="100%">978-3-642-23168-1</style></isbn><publisher><style face="normal" font="default" size="100%">Springer Berlin / Heidelberg</style></publisher><language><style face="normal" font="default" size="100%">eng</style></language></record><record><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><ref-type>5</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Piotr Pecka</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%">Sergey Balandin</style></author><author><style face="normal" font="default" size="100%">Koucheryavy Yevgeni</style></author><author><style face="normal" font="default" size="100%">Hu Honglin</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Smart Spaces and Next Generation Wired/Wireless Networking</style></title></titles><keywords/><dates><year><style face="normal" font="default" size="100%">2011</style></year></dates><secondary-title><style face="normal" font="default" size="100%">Lecture Notes in Computer Science</style></secondary-title><volume><style face="normal" font="default" size="100%">6869</style></volume><section><style face="normal" font="default" size="100%">Content Localization for Non-overlay Content-Aware Networks</style></section><abstract><style face="normal" font="default" size="100%">Content addressing and localization are the basic issues in design of content-aware networks (CAN). The paper summarizes assumptions for content-aware networks and presents content localization algorithm for PI-CAN, developed within FIE (Future Internet Engineering) project. The algorithm allows to find location of desired content in distributed content database in time O(1)</style></abstract><isbn><style face="normal" font="default" size="100%">978-3-642-22874-2</style></isbn><publisher><style face="normal" font="default" size="100%">Springer</style></publisher><pub-location><style face="normal" font="default" size="100%">Berlin / Heidelberg</style></pub-location><language><style face="normal" font="default" size="100%">eng</style></language></record><record><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Artur Rataj</style></author><author><style face="normal" font="default" size="100%">Mateusz Nowak</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%">Modelling CTMC with a standard programming language and using conventions from computer networking</style></title></titles><keywords/><dates><year><style face="normal" font="default" size="100%">2011</style></year></dates><secondary-title><style face="normal" font="default" size="100%">Theoretical and Applied Informatics</style></secondary-title><pages><style face="normal" font="default" size="100%">229–243</style></pages><volume><style face="normal" font="default" size="100%">23</style></volume><number><style face="normal" font="default" size="100%">3-4</style></number><language><style face="normal" font="default" size="100%">eng</style></language></record><record><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><ref-type>5</ref-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><year><style face="normal" font="default" size="100%">2016</style></year></dates><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><urls><style face="normal" font="default" size="100%">http://dx.doi.org/10.1007/978-3-319-47217-1_23</style></urls><electronic-resource-num><style face="normal" font="default" size="100%">10.1007/978-3-319-47217-1_23</style></electronic-resource-num><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><publisher><style face="normal" font="default" size="100%">Springer International Publishing</style></publisher><pub-location><style face="normal" font="default" size="100%">Cham</style></pub-location><language><style face="normal" font="default" size="100%">eng</style></language></record><record><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><ref-type>17</ref-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></authors></contributors><titles><title><style face="normal" font="default" size="100%">Efektywne rozgłaszanie w wielohopowej sieci bezprzewodowej. Effective Broadcasts in Multihop Wireless Network</style></title></titles><keywords/><dates><year><style face="normal" font="default" size="100%">2016</style></year></dates><secondary-title><style face="normal" font="default" size="100%">Przegląd Telekomunikacyjny - Wiadomości Telekomunikacyjne</style></secondary-title><electronic-resource-num><style face="normal" font="default" size="100%">DOI: 10.15199/59.2016.8-9.32</style></electronic-resource-num><pages><style face="normal" font="default" size="100%">887-891</style></pages><issue><style face="normal" font="default" size="100%">8-9</style></issue><abstract><style face="normal" font="default" size="100%">&lt;p&gt;Znanych jest wiele rozwiązań problemu rozgłaszania wiadomości w sieciach bezprzewodowych typu ad-hoc. Rozwiązania te różnią się w zależności od wielkości sieci, dostępności informacji o topologii, modelu komunikacji, wymagań gwarancji dostarczenia wiadomości itp. Sieci dedykowane są do różnych zastosowań i różnią się specyfiką występujących w nich problemów związanych z komunikacją. W artykule przedstawiono kilka znanych rozwiązań problemu rozgłaszania oraz przedstawiono autorskie rozwiązanie, dedykowane do specyficznego problemu sieci typu AMI (Advanced Metering Infrastructure - zaawansowana infrastruktura pomiarowa). Sieć ta zakładała model komunikacji jeden-do-wielu, stosunkowo niewielką dynamikę zmian w sieci, możliwość istnienia długich ścieżek na drodze transmisji oraz szereg innych wymagań. Analizowane algorytmy nie spełniały postawionych wymagań. Artykuł opisuje opracowaną motodę i porównuje ją do wybranych rozwiązań referencyjncych.&lt;/p&gt;&#13;
</style></abstract><language><style face="normal" font="default" size="100%">eng</style></language></record><record><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><ref-type>5</ref-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%">Piotr Gaj</style></author><author><style face="normal" font="default" size="100%">Andrzej Kwiecień</style></author><author><style face="normal" font="default" size="100%">Michał Sawicki</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Application of Fault-Tolerant GQP Algorithm in Multihop AMI Networks</style></title></titles><keywords/><dates><year><style face="normal" font="default" size="100%">2017</style></year></dates><secondary-title><style face="normal" font="default" size="100%">Computer Networks. CN 2017. Communications in Computer and Information Science, vol 718</style></secondary-title><urls><style face="normal" font="default" size="100%">https://doi.org/10.1007/978-3-319-59767-6_6</style></urls><electronic-resource-num><style face="normal" font="default" size="100%">10.1007/978-3-319-59767-6_6</style></electronic-resource-num><pages><style face="normal" font="default" size="100%">70-80</style></pages><number><style face="normal" font="default" size="100%">Communications in Computer and Information Science, vol 718.</style></number><abstract><style face="normal" font="default" size="100%">&lt;p&gt;The paper presents the evaluation of the GQP algorithm in AMI networks using real map based network topologies (low, medium and high density of buildings). The algorithm was compared to the reference algorithms: CB, SBA and DP. It was shown that the GQP algorithm presents the good scalability, relatively optimal number of selected forwarders and by introducing the redundancy factor, good fault tolerance. An improvement to GQP algorithm to add a redundancy factor is proposed, what allows to execute fault tolerant broadcast transmission.&lt;/p&gt;&#13;
</style></abstract><isbn><style face="normal" font="default" size="100%">978-3-319-59767-6</style></isbn><publisher><style face="normal" font="default" size="100%">Springer International Publishing</style></publisher><pub-location><style face="normal" font="default" size="100%">Cham</style></pub-location><language><style face="normal" font="default" size="100%">eng</style></language></record><record><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><ref-type>5</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Krzysztof Grochla</style></author><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%">Sławomir Nowak</style></author><author><style face="normal" font="default" size="100%">A Zgrzywa</style></author><author><style face="normal" font="default" size="100%">K Choroś</style></author><author><style face="normal" font="default" size="100%">A Siemiński</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Influence of message-oriented middleware on performance of network management system: a modelling study.</style></title></titles><keywords/><dates><year><style face="normal" font="default" size="100%">2017</style></year></dates><secondary-title><style face="normal" font="default" size="100%">Multimedia and Network Information Systems. </style></secondary-title><urls><style face="normal" font="default" size="100%">https://link.springer.com/chapter/10.1007%2F978-3-319-43982-2_33</style></urls><electronic-resource-num><style face="normal" font="default" size="100%">10.1007/978-3-319-43982-2_33</style></electronic-resource-num><pages><style face="normal" font="default" size="100%">379-393</style></pages><volume><style face="normal" font="default" size="100%">Advances in Intelligent Systems and Computing, Vol. 506</style></volume><isbn><style face="normal" font="default" size="100%">978-3-319-43981-5</style></isbn><publisher><style face="normal" font="default" size="100%">Springer</style></publisher><language><style face="normal" font="default" size="100%">eng</style></language></record><record><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Piotr Pecka</style></author><author><style face="normal" font="default" size="100%">Mateusz Nowak</style></author><author><style face="normal" font="default" size="100%">Artur Rataj</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%">Solving large Markov models described with standard programming language</style></title></titles><keywords/><dates><year><style face="normal" font="default" size="100%">2018</style></year><pub-dates><date><style face="normal" font="default" size="100%">2018</style></date></pub-dates></dates><secondary-title><style face="normal" font="default" size="100%">Int. Symposium on Computer and Information Sciences. ISCIS 2018</style></secondary-title><language><style face="normal" font="default" size="100%">eng</style></language></record><record><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Piotr Pecka</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%">Routing Algorithms Simulation for Self-Aware SDN</style></title></titles><keywords/><dates><year><style face="normal" font="default" size="100%">2022</style></year><pub-dates><date><style face="normal" font="default" size="100%">12/2021</style></date></pub-dates></dates><secondary-title><style face="normal" font="default" size="100%">Electronics</style></secondary-title><urls><style face="normal" font="default" size="100%">https://www.mdpi.com/2079-9292/11/1/104</style></urls><electronic-resource-num><style face="normal" font="default" size="100%"> https://doi.org/10.3390/electronics11010104</style></electronic-resource-num><volume><style face="normal" font="default" size="100%"> 11</style></volume><issue><style face="normal" font="default" size="100%">1</style></issue><language><style face="normal" font="default" size="100%">eng</style></language></record><record><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><ref-type>47</ref-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><year><style face="normal" font="default" size="100%">2024</style></year><pub-dates><date><style face="normal" font="default" size="100%">17/07/2024</style></date></pub-dates></dates><secondary-title><style face="normal" font="default" size="100%">2024 International Wireless Communications and Mobile Computing (IWCMC)</style></secondary-title><electronic-resource-num><style face="normal" font="default" size="100%">10.1109/IWCMC61514.2024.10592530</style></electronic-resource-num><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><isbn><style face="normal" font="default" size="100%">979-8-3503-6126-1</style></isbn><publisher><style face="normal" font="default" size="100%">IEEE</style></publisher><pub-location><style face="normal" font="default" size="100%">Ayia Napa, Cyprus</style></pub-location><language><style face="normal" font="default" size="100%">eng</style></language></record><record><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><ref-type>17</ref-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><year><style face="normal" font="default" size="100%">2024</style></year><pub-dates><date><style face="normal" font="default" size="100%">07/11/2024</style></date></pub-dates></dates><secondary-title><style face="normal" font="default" size="100%">Frontiers in Energy Research</style></secondary-title><electronic-resource-num><style face="normal" font="default" size="100%">10.3389/fenrg.2024.1399371</style></electronic-resource-num><volume><style face="normal" font="default" size="100%">12</style></volume><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><language><style face="normal" font="default" size="100%">eng</style></language></record><record><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><ref-type>47</ref-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><year><style face="normal" font="default" size="100%">2024</style></year></dates><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><urls><style face="normal" font="default" size="100%">https://ieeexplore.ieee.org/document/10786519 </style></urls><electronic-resource-num><style face="normal" font="default" size="100%">10.1109/MASCOTS64422.2024.10786519</style></electronic-resource-num><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><publisher><style face="normal" font="default" size="100%">IEEE</style></publisher><pub-location><style face="normal" font="default" size="100%">Krakow, Poland</style></pub-location><language><style face="normal" font="default" size="100%">eng</style></language></record><record><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Piotr Pecka</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Symulacja kolejki z negatywnymi klientami i wieloma serwerami</style></title></titles><keywords/><dates><year><style face="normal" font="default" size="100%">2006</style></year><pub-dates><date><style face="normal" font="default" size="100%">06/2006</style></date></pub-dates></dates><secondary-title><style face="normal" font="default" size="100%"> Studia Informatica ; 1642-0489 [8] ; Zeszyty Naukowe Politechniki</style></secondary-title><volume><style face="normal" font="default" size="100%"> Vol. 27, No. 4 = No. 69 [5]</style></volume><section><style face="normal" font="default" size="100%">54</style></section><language><style face="normal" font="default" size="100%">eng</style></language></record><record><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><ref-type>47</ref-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><year><style face="normal" font="default" size="100%">2025</style></year><pub-dates><date><style face="normal" font="default" size="100%">12/2025</style></date></pub-dates></dates><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><electronic-resource-num><style face="normal" font="default" size="100%">10.1109/MASCOTS67699.2025.11283368</style></electronic-resource-num><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><publisher><style face="normal" font="default" size="100%">IEEE</style></publisher><pub-location><style face="normal" font="default" size="100%">Paris, France</style></pub-location><language><style face="normal" font="default" size="100%">eng</style></language></record><record><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><ref-type>47</ref-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><year><style face="normal" font="default" size="100%">2026</style></year><pub-dates><date><style face="normal" font="default" size="100%">02/2026</style></date></pub-dates></dates><secondary-title><style face="normal" font="default" size="100%"/></secondary-title><urls><style face="normal" font="default" size="100%">https://ieeexplore.ieee.org/document/11366536</style></urls><keyword><style face="normal" font="default" size="100%"/></keyword><electronic-resource-num><style face="normal" font="default" size="100%">10.1109/CCNC65079.2026.11366536</style></electronic-resource-num><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><publisher><style face="normal" font="default" size="100%">IEEE</style></publisher><pub-location><style face="normal" font="default" size="100%">Las Vegas USA</style></pub-location><language><style face="normal" font="default" size="100%">eng</style></language></record><record><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><ref-type>47</ref-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><year><style face="normal" font="default" size="100%">2026</style></year></dates><secondary-title><style face="normal" font="default" size="100%">Nineteen International Workshop on Selected Topics in Mobile and Wireless Computing WiMob</style></secondary-title><keyword><style face="normal" font="default" size="100%"/></keyword><publisher><style face="normal" font="default" size="100%">IEEE</style></publisher><pub-location><style face="normal" font="default" size="100%">Avignon, France</style></pub-location></record></records></xml>
