Publications

A Simulation-based Optimization Framework for Online Adaptation of Networks. Herrnleben, Stefan; Grohmann, Johannes; Rygielski, Pitor; Lesch, Veronika; Krupitzer, Christian; Kounev, Samuel; in Proceedings of the 12th EAI International Conference on Simulation Tools and Techniques (SIMUtools), H. Song, D. Jiang (eds.) (2021). 513–532. Springer International Publishing, Cham.

[ Abstract ]
[ BibTeX ]
[ EndNote ]
[ URL ]
[ DOI ]
[ Download ]

Today's data centers face a rapid change of deployed services, growing complexity, and increasing performance requirements. Customers expect not only round-the-clock availability of the hosted services but also high responsiveness. Besides optimizing software architectures and deployments, networks have to be adapted to handle the changing and volatile demands. Approaches from self-adaptive systems can be used for optimizing data center networks to continuously meet Service Level Agreements (SLAs) between data center operators and customers. However, existing approaches focus only on specific objectives like topology design, power optimization, or traffic engineering. In this paper, we present an extensible framework that analyzes networks using different types of simulation and adapts them subject to multiple objectives using various adaptation techniques. Analyzing each suggested adaptation ensures that performance requirements and SLAs are continuously met. We evaluate our framework w.r.t. (i) general requirements and assessments of languages and frameworks for adaptation models, (ii) finding Pareto-optimal solutions considering a multi-dimensional cost model, and (iii) scalability. The evaluation shows that our approach detects the bottlenecks and the violated SLAs correctly, outputs valid and cost-optimal adaptations, and keeps the runtime for the adaptation process constant even with increasing network size and an increasing number of alternative configurations.

@inproceedings{HeGrRyLeKrKo2020-SIMUtools-Network-Online-Adaptation,
  abstract = {Today's data centers face a rapid change of deployed services, growing complexity, and increasing performance requirements. Customers expect not only round-the-clock availability of the hosted services but also high responsiveness. Besides optimizing software architectures and deployments, networks have to be adapted to handle the changing and volatile demands. Approaches from self-adaptive systems can be used for optimizing data center networks to continuously meet Service Level Agreements (SLAs) between data center operators and customers. However, existing approaches focus only on specific objectives like topology design, power optimization, or traffic engineering. In this paper, we present an extensible framework that analyzes networks using different types of simulation and adapts them subject to multiple objectives using various adaptation techniques. Analyzing each suggested adaptation ensures that performance requirements and SLAs are continuously met. We evaluate our framework w.r.t. (i) general requirements and assessments of languages and frameworks for adaptation models, (ii) finding Pareto-optimal solutions considering a multi-dimensional cost model, and (iii) scalability. The evaluation shows that our approach detects the bottlenecks and the violated SLAs correctly, outputs valid and cost-optimal adaptations, and keeps the runtime for the adaptation process constant even with increasing network size and an increasing number of alternative configurations.},
  address = {Cham},
  author = {Herrnleben, Stefan and Grohmann, Johannes and Rygielski, Pitor and Lesch, Veronika and Krupitzer, Christian and Kounev, Samuel},
  booktitle = {Proceedings of the 12th EAI International Conference on Simulation Tools and Techniques (SIMUtools)},
  editor = {Song, Houbing and Jiang, Dingde},
  keywords = {networking},
  month = {08},
  pages = {513–532},
  publisher = {Springer International Publishing},
  series = {SIMUtools 2020},
  title = {A Simulation-based Optimization Framework for Online Adaptation of Networks},
  year = 2021
}

%0 Conference Paper
%1 HeGrRyLeKrKo2020-SIMUtools-Network-Online-Adaptation
%A Herrnleben, Stefan
%A Grohmann, Johannes
%A Rygielski, Pitor
%A Lesch, Veronika
%A Krupitzer, Christian
%A Kounev, Samuel
%B Proceedings of the 12th EAI International Conference on Simulation Tools and Techniques (SIMUtools)
%C Cham
%D 2021
%E Song, Houbing
%E Jiang, Dingde
%I Springer International Publishing
%P 513--532
%R 10.1007/978-3-030-72792-5_41
%T A Simulation-based Optimization Framework for Online Adaptation of Networks
%U https://doi.org/10.1007/978-3-030-72792-5_41
%X Today's data centers face a rapid change of deployed services, growing complexity, and increasing performance requirements. Customers expect not only round-the-clock availability of the hosted services but also high responsiveness. Besides optimizing software architectures and deployments, networks have to be adapted to handle the changing and volatile demands. Approaches from self-adaptive systems can be used for optimizing data center networks to continuously meet Service Level Agreements (SLAs) between data center operators and customers. However, existing approaches focus only on specific objectives like topology design, power optimization, or traffic engineering. In this paper, we present an extensible framework that analyzes networks using different types of simulation and adapts them subject to multiple objectives using various adaptation techniques. Analyzing each suggested adaptation ensures that performance requirements and SLAs are continuously met. We evaluate our framework w.r.t. (i) general requirements and assessments of languages and frameworks for adaptation models, (ii) finding Pareto-optimal solutions considering a multi-dimensional cost model, and (iii) scalability. The evaluation shows that our approach detects the bottlenecks and the violated SLAs correctly, outputs valid and cost-optimal adaptations, and keeps the runtime for the adaptation process constant even with increasing network size and an increasing number of alternative configurations.
%@ 978-3-030-72792-5

{Model-based Performance Predictions for SDN-based Networks: A Case Study}. Herrnleben, Stefan; Rygielski, Piotr; Grohmann, Johannes; Eismann, Simon; Hossfeld, Tobias; Kounev, Samuel; in Proceedings of the 20th International GI/ITG Conference on Measurement, Modelling and Evaluation of Computing Systems (2020). Springer, Cham.

[ Abstract ]
[ BibTeX ]
[ EndNote ]
[ URL ]
[ DOI ]
[ Download ]

Emerging paradigms for network virtualization like Software-Defined Networking (SDN) and Network Functions Virtualization (NFV) form new challenges for accurate performance modeling and analysis tools. Therefore, performance modeling and prediction approaches that support SDN or NFV technologies help system operators to analyze the performance of a data center and its corresponding network. The Descartes Network Infrastructures (DNI) offers a high-level descriptive language to model SDN-based networks, which can be transformed into various predictive modeling formalisms. However, these modeling concepts have not yet been evaluated in a realistic scenario. In this paper, we present an extensive case study evaluating the DNI modeling capabilities, the transformations to predictive models, and the performance prediction using the OMNeT++ and SimQPN simulation frameworks. We present five realistic scenarios of a content distribution network (CDN), compare the performance predictions with real-world measurements, and discuss modeling gaps and calibration issues causing mispredictions in some scenarios.

@inproceedings{HeRyGrEiHoKo-MMB2020-Model-based-SDN-Performance,
  abstract = {Emerging paradigms for network virtualization like Software-Defined Networking (SDN) and Network Functions Virtualization (NFV) form new challenges for accurate performance modeling and analysis tools. Therefore, performance modeling and prediction approaches that support SDN or NFV technologies help system operators to analyze the performance of a data center and its corresponding network. The Descartes Network Infrastructures (DNI) offers a high-level descriptive language to model SDN-based networks, which can be transformed into various predictive modeling formalisms. However, these modeling concepts have not yet been evaluated in a realistic scenario. In this paper, we present an extensive case study evaluating the DNI modeling capabilities, the transformations to predictive models, and the performance prediction using the OMNeT++ and SimQPN simulation frameworks. We present five realistic scenarios of a content distribution network (CDN), compare the performance predictions with real-world measurements, and discuss modeling gaps and calibration issues causing mispredictions in some scenarios.},
  address = {Cham},
  author = {Herrnleben, Stefan and Rygielski, Piotr and Grohmann, Johannes and Eismann, Simon and Hossfeld, Tobias and Kounev, Samuel},
  booktitle = {Proceedings of the 20th International GI/ITG Conference on Measurement, Modelling and Evaluation of Computing Systems},
  keywords = {SDN},
  month = {03},
  publisher = {Springer},
  series = {MMB 2020},
  title = {{Model-based Performance Predictions for SDN-based Networks: A Case Study}},
  year = 2020
}

%0 Conference Paper
%1 HeRyGrEiHoKo-MMB2020-Model-based-SDN-Performance
%A Herrnleben, Stefan
%A Rygielski, Piotr
%A Grohmann, Johannes
%A Eismann, Simon
%A Hossfeld, Tobias
%A Kounev, Samuel
%B Proceedings of the 20th International GI/ITG Conference on Measurement, Modelling and Evaluation of Computing Systems
%C Cham
%D 2020
%I Springer
%R 10.1007/978-3-030-43024-5_6
%T {Model-based Performance Predictions for SDN-based Networks: A Case Study}
%U https://doi.org/10.1007/978-3-030-43024-5_6
%X Emerging paradigms for network virtualization like Software-Defined Networking (SDN) and Network Functions Virtualization (NFV) form new challenges for accurate performance modeling and analysis tools. Therefore, performance modeling and prediction approaches that support SDN or NFV technologies help system operators to analyze the performance of a data center and its corresponding network. The Descartes Network Infrastructures (DNI) offers a high-level descriptive language to model SDN-based networks, which can be transformed into various predictive modeling formalisms. However, these modeling concepts have not yet been evaluated in a realistic scenario. In this paper, we present an extensive case study evaluating the DNI modeling capabilities, the transformations to predictive models, and the performance prediction using the OMNeT++ and SimQPN simulation frameworks. We present five realistic scenarios of a content distribution network (CDN), compare the performance predictions with real-world measurements, and discuss modeling gaps and calibration issues causing mispredictions in some scenarios.
%@ 978-3-030-43024-5

{CUP: A Formalism for Expressing Cloud Usage Patterns for Experts and Non-Experts}. Milenkoski, Aleksandar; Iosup, Alexandru; Kounev, Samuel; Sachs, Kai; Mularz, Diane E.; Curtiss, Jonathan A.; Ding, Jason J.; Rosenberg, Florian; Rygielski, Piotr; in IEEE Cloud Computing (2018). 5(3) 65–76. IEEE.

[ BibTeX ]
[ EndNote ]

@article{MiIoKoSaMuCuDiRoRy2018-IEEECC-cup,
  author = {Milenkoski, Aleksandar and Iosup, Alexandru and Kounev, Samuel and Sachs, Kai and Mularz, Diane E. and Curtiss, Jonathan A. and Ding, Jason J. and Rosenberg, Florian and Rygielski, Piotr},
  journal = {IEEE Cloud Computing},
  keywords = {Virtualization},
  month = {06},
  number = 3,
  pages = {65–76},
  publisher = {IEEE},
  title = {{CUP: A Formalism for Expressing Cloud Usage Patterns for Experts and Non-Experts}},
  volume = 5,
  year = 2018
}

%0 Journal Article
%1 MiIoKoSaMuCuDiRoRy2018-IEEECC-cup
%A Milenkoski, Aleksandar
%A Iosup, Alexandru
%A Kounev, Samuel
%A Sachs, Kai
%A Mularz, Diane E.
%A Curtiss, Jonathan A.
%A Ding, Jason J.
%A Rosenberg, Florian
%A Rygielski, Piotr
%D 2018
%I IEEE
%J IEEE Cloud Computing
%N 3
%P 65--76
%T {CUP: A Formalism for Expressing Cloud Usage Patterns for Experts and Non-Experts}
%V 5

{SPEC Research Group Newsletter, vol. 2 no. 2}. Kounev, Samuel; van Hoorn, Andre; Rygielski, Piotr; Herbst, Nikolas; Bauer, Andr{é}; (2017, April).

Published by Standard Performance Evaluation Corporation (SPEC)

[ BibTeX ]
[ EndNote ]
[ URL ]
[ Download ]

@misc{SPEC-RG-NEWSLETTER-6,
  author = {Kounev, Samuel and van Hoorn, Andre and Rygielski, Piotr and Herbst, Nikolas and Bauer, Andr{\'e}},
  keywords = {se2},
  month = {04},
  note = {Published by Standard Performance Evaluation Corporation (SPEC)},
  title = {{SPEC Research Group Newsletter, vol. 2 no. 2}},
  year = 2017
}

%0 Generic
%1 SPEC-RG-NEWSLETTER-6
%A Kounev, Samuel
%A van Hoorn, Andre
%A Rygielski, Piotr
%A Herbst, Nikolas
%A Bauer, Andr{é}
%D 2017
%T {SPEC Research Group Newsletter, vol. 2 no. 2}
%U http://research.spec.org/en/newsletter.html

Flexible Modeling of Data Center Networks for Capacity Management. Rygielski, Piotr; (2017, March). University of W{ü}rzburg, Germany.

[ BibTeX ]
[ EndNote ]
[ URL ]
[ Download ]

@phdthesis{Rygielski2017-phd,
  author = {Rygielski, Piotr},
  keywords = {DNI},
  month = {03},
  school = {University of W{\"u}rzburg, Germany},
  title = {Flexible Modeling of Data Center Networks for Capacity Management},
  year = 2017
}

%0 Thesis
%1 Rygielski2017-phd
%A Rygielski, Piotr
%D 2017
%T Flexible Modeling of Data Center Networks for Capacity Management
%U https://opus.bibliothek.uni-wuerzburg.de/frontdoor/index/index/docId/14623

{Performance Analysis of SDN Switches with Hardware and Software Flow Tables}. Rygielski, Piotr; Seliuchenko, Marian; Kounev, Samuel; Klymash, Mykhailo; in Proceedings of the 10th EAI International Conference on Performance Evaluation Methodologies and Tools (ValueTools 2016) (2016).

[ Abstract ]
[ BibTeX ]
[ EndNote ]
[ Download ]

{Nowadays data centers are increasingly becoming larger and dynamic due to virtualization. Software-Defined Networking is the leading approach to network virtualization and flexible management. The wide variety of hardware implementations have brought strong heterogeneity to the market of networking devices which are different in terms of OpenFlow features and performance. In this paper we address the issue of heterogeneity of four hardware OpenFlow switches by characterizing selected performance relevant parameters for the hardware and software flow tables. We characterize maximum size of hardware flow tables for each switch including the behavior of a rule promotion engine that moves the rules between tables. We show that in the worst case forwarding packets using software table decreases the throughput by two orders of magnitude (from 940 to 14 Mbit/s). Our results can help the developers of SDN applications to account performance limitations of hardware and software processing as well as limited hardware support for a specific rule types. }

@inproceedings{RySeKoKl2016-valuetools2016-sdn-switches-hw-sw-flow-tables,
  abstract = {{Nowadays data centers are increasingly becoming larger and dynamic due to virtualization. Software-Defined Networking is the leading approach to network virtualization and flexible management. The wide variety of hardware implementations have brought strong heterogeneity to the market of networking devices which are different in terms of OpenFlow features and performance. In this paper we address the issue of heterogeneity of four hardware OpenFlow switches by characterizing selected performance relevant parameters for the hardware and software flow tables. We characterize maximum size of hardware flow tables for each switch including the behavior of a rule promotion engine that moves the rules between tables. We show that in the worst case forwarding packets using software table decreases the throughput by two orders of magnitude (from 940 to 14 Mbit/s). Our results can help the developers of SDN applications to account performance limitations of hardware and software processing as well as limited hardware support for a specific rule types. }},
  author = {Rygielski, Piotr and Seliuchenko, Marian and Kounev, Samuel and Klymash, Mykhailo},
  booktitle = {Proceedings of the 10th EAI International Conference on Performance Evaluation Methodologies and Tools (ValueTools 2016)},
  keywords = {DNI},
  month = 10,
  title = {{Performance Analysis of SDN Switches with Hardware and Software Flow Tables}},
  year = 2016
}

%0 Conference Paper
%1 RySeKoKl2016-valuetools2016-sdn-switches-hw-sw-flow-tables
%A Rygielski, Piotr
%A Seliuchenko, Marian
%A Kounev, Samuel
%A Klymash, Mykhailo
%B Proceedings of the 10th EAI International Conference on Performance Evaluation Methodologies and Tools (ValueTools 2016)
%D 2016
%T {Performance Analysis of SDN Switches with Hardware and Software Flow Tables}
%X {Nowadays data centers are increasingly becoming larger and dynamic due to virtualization. Software-Defined Networking is the leading approach to network virtualization and flexible management. The wide variety of hardware implementations have brought strong heterogeneity to the market of networking devices which are different in terms of OpenFlow features and performance. In this paper we address the issue of heterogeneity of four hardware OpenFlow switches by characterizing selected performance relevant parameters for the hardware and software flow tables. We characterize maximum size of hardware flow tables for each switch including the behavior of a rule promotion engine that moves the rules between tables. We show that in the worst case forwarding packets using software table decreases the throughput by two orders of magnitude (from 940 to 14 Mbit/s). Our results can help the developers of SDN applications to account performance limitations of hardware and software processing as well as limited hardware support for a specific rule types. }

{Modeling and Prediction of Software-Defined Networks Performance using Queueing Petri Nets}. Rygielski, Piotr; Seliuchenko, Marian; Kounev, Samuel; in Proceedings of the Ninth International Conference on Simulation Tools and Techniques (SIMUTools 2016) (2016). 66–75.

[ Abstract ]
[ BibTeX ]
[ EndNote ]
[ URL ]
[ Download ]

{Using various modeling and simulation approaches for predicting network performance requires extensive experience and involves a number of time consuming manual steps regarding each of the modeling formalisms. Descartes Network Infrastructure (DNI) is a data center network performance modeling approach that addresses this challenge by offering multiple performance models but requiring to use only a single modeling language. In this paper, we thoroughly extend DNI to support new networking paradigms like, among others, Software-Defined Networking (SDN) and Network-Function Virtualization (NFV). Additionally, we demonstrate how SDN-based networks can be modeled using DNI and how are they transformed later into Queueing Petri Nets (QPN) using a model-to-model transformation. In the analysis of the performance prediction accuracy, we show that automatically generated QPN models represent the performance of heterogeneous SDN hardware with maximal prediction accuracy error of 12 percent.}

@inproceedings{RySeKo2016-SIMUTools-SDN-switches-QPN,
  abstract = {{Using various modeling and simulation approaches for predicting network performance requires extensive experience and involves a number of time consuming manual steps regarding each of the modeling formalisms. Descartes Network Infrastructure (DNI) is a data center network performance modeling approach that addresses this challenge by offering multiple performance models but requiring to use only a single modeling language. In this paper, we thoroughly extend DNI to support new networking paradigms like, among others, Software-Defined Networking (SDN) and Network-Function Virtualization (NFV). Additionally, we demonstrate how SDN-based networks can be modeled using DNI and how are they transformed later into Queueing Petri Nets (QPN) using a model-to-model transformation. In the analysis of the performance prediction accuracy, we show that automatically generated QPN models represent the performance of heterogeneous SDN hardware with maximal prediction accuracy error of 12 percent.}},
  author = {Rygielski, Piotr and Seliuchenko, Marian and Kounev, Samuel},
  booktitle = {Proceedings of the Ninth International Conference on Simulation Tools and Techniques (SIMUTools 2016)},
  keywords = {QPN},
  month = {08},
  pages = {66–75},
  title = {{Modeling and Prediction of Software-Defined Networks Performance using Queueing Petri Nets}},
  year = 2016
}

%0 Conference Paper
%1 RySeKo2016-SIMUTools-SDN-switches-QPN
%A Rygielski, Piotr
%A Seliuchenko, Marian
%A Kounev, Samuel
%B Proceedings of the Ninth International Conference on Simulation Tools and Techniques (SIMUTools 2016)
%D 2016
%P 66--75
%T {Modeling and Prediction of Software-Defined Networks Performance using Queueing Petri Nets}
%U http://dl.acm.org/citation.cfm?id=3021426.3021437
%X {Using various modeling and simulation approaches for predicting network performance requires extensive experience and involves a number of time consuming manual steps regarding each of the modeling formalisms. Descartes Network Infrastructure (DNI) is a data center network performance modeling approach that addresses this challenge by offering multiple performance models but requiring to use only a single modeling language. In this paper, we thoroughly extend DNI to support new networking paradigms like, among others, Software-Defined Networking (SDN) and Network-Function Virtualization (NFV). Additionally, we demonstrate how SDN-based networks can be modeled using DNI and how are they transformed later into Queueing Petri Nets (QPN) using a model-to-model transformation. In the analysis of the performance prediction accuracy, we show that automatically generated QPN models represent the performance of heterogeneous SDN hardware with maximal prediction accuracy error of 12 percent.}

{Automated Extraction of Network Traffic Models Suitable for Performance Simulation}. Rygielski, Piotr; Simko, Viliam; Sittner, Felix; Aschenbrenner, Doris; Kounev, Samuel; Schilling, Klaus; in Proceedings of the 7th ACM/SPEC International Conference on Performance Engineering (ICPE 2016) (2016). 27–35. ACM.

{Acceptance rate (Full Paper): 19/57 = 33\%}

[ Abstract ]
[ BibTeX ]
[ EndNote ]
[ URL ]
[ Download ]

{Data centers are increasingly becoming larger and dynamic due to virtualization. In order to leverage the performance modeling and prediction techniques, such as Palladio Component Model or Descartes Modeling Language, in such a dynamic environments, it is necessary to automate the model extraction. Building and maintaining such models manually is not feasible anymore due to their size and the level of details. This paper is focused on traffic models that are an essential part of network infrastructure. Our goal is to decompose real traffic dumps into models suitable for performance prediction using Descartes Network Infrastructure modeling approach. The main challenge was to efficiently encode an arbitrary signal in the form of simple traffic generators while maintaining the shape of the original signal. We show that a typical 15 minute long tcpdump trace can be compressed to 0.4--15% of its original size whereas the relative median of extraction error is 0% for the most of the 69 examined traces.}

@inproceedings{RySiSiAschKoSch2016-dni-traffic-extraction-icpe2016,
  abstract = {{Data centers are increasingly becoming larger and dynamic due to virtualization. In order to leverage the performance modeling and prediction techniques, such as Palladio Component Model or Descartes Modeling Language, in such a dynamic environments, it is necessary to automate the model extraction. Building and maintaining such models manually is not feasible anymore due to their size and the level of details. This paper is focused on traffic models that are an essential part of network infrastructure. Our goal is to decompose real traffic dumps into models suitable for performance prediction using Descartes Network Infrastructure modeling approach. The main challenge was to efficiently encode an arbitrary signal in the form of simple traffic generators while maintaining the shape of the original signal. We show that a typical 15 minute long tcpdump trace can be compressed to 0.4–15% of its original size whereas the relative median of extraction error is 0% for the most of the 69 examined traces.}},
  author = {Rygielski, Piotr and Simko, Viliam and Sittner, Felix and Aschenbrenner, Doris and Kounev, Samuel and Schilling, Klaus},
  booktitle = {Proceedings of the 7th ACM/SPEC International Conference on Performance Engineering (ICPE 2016)},
  keywords = {DNI},
  month = {03},
  note = {{Acceptance rate (Full Paper): 19/57 = 33\%}},
  pages = {27–35},
  publisher = {ACM},
  title = {{Automated Extraction of Network Traffic Models Suitable for Performance Simulation}},
  year = 2016
}

%0 Conference Paper
%1 RySiSiAschKoSch2016-dni-traffic-extraction-icpe2016
%A Rygielski, Piotr
%A Simko, Viliam
%A Sittner, Felix
%A Aschenbrenner, Doris
%A Kounev, Samuel
%A Schilling, Klaus
%B Proceedings of the 7th ACM/SPEC International Conference on Performance Engineering (ICPE 2016)
%D 2016
%I ACM
%P 27--35
%T {Automated Extraction of Network Traffic Models Suitable for Performance Simulation}
%U http://dl.acm.org/citation.cfm?doid=2851553.2851570
%X {Data centers are increasingly becoming larger and dynamic due to virtualization. In order to leverage the performance modeling and prediction techniques, such as Palladio Component Model or Descartes Modeling Language, in such a dynamic environments, it is necessary to automate the model extraction. Building and maintaining such models manually is not feasible anymore due to their size and the level of details. This paper is focused on traffic models that are an essential part of network infrastructure. Our goal is to decompose real traffic dumps into models suitable for performance prediction using Descartes Network Infrastructure modeling approach. The main challenge was to efficiently encode an arbitrary signal in the form of simple traffic generators while maintaining the shape of the original signal. We show that a typical 15 minute long tcpdump trace can be compressed to 0.4--15% of its original size whereas the relative median of extraction error is 0% for the most of the 69 examined traces.}

{SPEC Research Group Newsletter, vol. 2 no. 1}. Kounev, Samuel; van Hoorn, Andre; Rygielski, Piotr; (2016, March).

Published by Standard Performance Evaluation Corporation (SPEC)

[ BibTeX ]
[ EndNote ]
[ URL ]
[ Download ]

@misc{SPEC-RG-NEWSLETTER-5,
  author = {Kounev, Samuel and van Hoorn, Andre and Rygielski, Piotr},
  keywords = {SPEC},
  month = {03},
  note = {Published by Standard Performance Evaluation Corporation (SPEC)},
  title = {{SPEC Research Group Newsletter, vol. 2 no. 1}},
  year = 2016
}

%0 Generic
%1 SPEC-RG-NEWSLETTER-5
%A Kounev, Samuel
%A van Hoorn, Andre
%A Rygielski, Piotr
%D 2016
%T {SPEC Research Group Newsletter, vol. 2 no. 1}
%U http://research.spec.org/en/newsletter.html

{Analysis of the Trade-offs in Different Modeling Approaches for Performance Prediction of Software Systems}. Kounev, Samuel; Brosig, Fabian; Meier, Philipp; Becker, Steffen; Koziolek, Anne; Koziolek, Heiko; Rygielski, Piotr; in Software Engineering 2016 (SE 2016), Fachtagung des GI-Fachbereichs Softwaretechnik, 23.-26. Feb 2016, Vienna, Austria (2016). 47–48. GI, Vienna, Austria.

[ BibTeX ]
[ EndNote ]
[ Download ]

@inproceedings{KoBrMeBeKoKoRy2016-SE-tradeoffs_perf_prediction_approaches,
  address = {Vienna, Austria},
  author = {Kounev, Samuel and Brosig, Fabian and Meier, Philipp and Becker, Steffen and Koziolek, Anne and Koziolek, Heiko and Rygielski, Piotr},
  booktitle = {Software Engineering 2016 (SE 2016), Fachtagung des GI-Fachbereichs Softwaretechnik, 23.-26. Feb 2016, Vienna, Austria},
  keywords = {Formal_architecture_modeling},
  month = {02},
  pages = {47–48},
  publisher = {GI},
  series = {Lecture Notes in Informatics (LNI)},
  title = {{Analysis of the Trade-offs in Different Modeling Approaches for Performance Prediction of Software Systems}},
  year = 2016
}

%0 Conference Paper
%1 KoBrMeBeKoKoRy2016-SE-tradeoffs_perf_prediction_approaches
%A Kounev, Samuel
%A Brosig, Fabian
%A Meier, Philipp
%A Becker, Steffen
%A Koziolek, Anne
%A Koziolek, Heiko
%A Rygielski, Piotr
%B Software Engineering 2016 (SE 2016), Fachtagung des GI-Fachbereichs Softwaretechnik, 23.-26. Feb 2016, Vienna, Austria
%C Vienna, Austria
%D 2016
%I GI
%P 47--48
%T {Analysis of the Trade-offs in Different Modeling Approaches for Performance Prediction of Software Systems}

{Enabling Fluid Analysis for Queueing Petri Nets via Model Transformation}. M{ü}ller, Christoph; Rygielski, Piotr; Spinner, Simon; Kounev, Samuel; in Electronic Notes in Theoretical Computer Science (2016). 327 71–91. Elsevier.

The 8th International Workshop on Practical Application of Stochastic Modeling, PASM 2016

[ Abstract ]
[ BibTeX ]
[ EndNote ]
[ URL ]
[ Download ]

Abstract Due to the growing size of modern \{IT\} systems, their performance analysis becomes an even more challenging task. Existing simulators are unable to analyze the behavior of large systems in a reasonable time, whereas analytical methods suffer from the state space explosion problem. Fluid analysis techniques can be used to approximate the solution of high-order Markov chain models enabling time efficient analysis of large performance models. In this paper, we describe a model-to-model transformation from queueing Petri nets (QPN) into layered queueing networks (LQN). Obtained \{LQN\} models can benefit from three existing solvers: LINE, LQNS, LQSIM. \{LINE\} internally utilize fluid limits approximation to speed up the solving process for large models. We present the incentives for developing the automated model-to-model transformation and present a systematic approach that we followed in its design. We demonstrate the transformations using representative examples. Finally, we evaluate and compare the performance predictions of existing analytical, simulation and fluid analysis solvers. We analyze solvers' limitations, solving time, and memory consumption.

@article{MuRySpKo2016-PASM-QPN-LQN-Transformation,
  abstract = {Abstract Due to the growing size of modern \{IT\} systems, their performance analysis becomes an even more challenging task. Existing simulators are unable to analyze the behavior of large systems in a reasonable time, whereas analytical methods suffer from the state space explosion problem. Fluid analysis techniques can be used to approximate the solution of high-order Markov chain models enabling time efficient analysis of large performance models. In this paper, we describe a model-to-model transformation from queueing Petri nets (QPN) into layered queueing networks (LQN). Obtained \{LQN\} models can benefit from three existing solvers: LINE, LQNS, LQSIM. \{LINE\} internally utilize fluid limits approximation to speed up the solving process for large models. We present the incentives for developing the automated model-to-model transformation and present a systematic approach that we followed in its design. We demonstrate the transformations using representative examples. Finally, we evaluate and compare the performance predictions of existing analytical, simulation and fluid analysis solvers. We analyze solvers' limitations, solving time, and memory consumption.},
  author = {M{\"u}ller, Christoph and Rygielski, Piotr and Spinner, Simon and Kounev, Samuel},
  journal = {Electronic Notes in Theoretical Computer Science},
  keywords = {QPN},
  note = {The 8th International Workshop on Practical Application of Stochastic Modeling, PASM 2016},
  pages = {71–91},
  publisher = {Elsevier},
  title = {{Enabling Fluid Analysis for Queueing Petri Nets via Model Transformation}},
  volume = 327,
  year = 2016
}

%0 Journal Article
%1 MuRySpKo2016-PASM-QPN-LQN-Transformation
%A M{ü}ller, Christoph
%A Rygielski, Piotr
%A Spinner, Simon
%A Kounev, Samuel
%D 2016
%I Elsevier
%J Electronic Notes in Theoretical Computer Science
%P 71--91
%T {Enabling Fluid Analysis for Queueing Petri Nets via Model Transformation}
%U http://www.sciencedirect.com/science/article/pii/S157106611630069X
%V 327
%X Abstract Due to the growing size of modern \{IT\} systems, their performance analysis becomes an even more challenging task. Existing simulators are unable to analyze the behavior of large systems in a reasonable time, whereas analytical methods suffer from the state space explosion problem. Fluid analysis techniques can be used to approximate the solution of high-order Markov chain models enabling time efficient analysis of large performance models. In this paper, we describe a model-to-model transformation from queueing Petri nets (QPN) into layered queueing networks (LQN). Obtained \{LQN\} models can benefit from three existing solvers: LINE, LQNS, LQSIM. \{LINE\} internally utilize fluid limits approximation to speed up the solving process for large models. We present the incentives for developing the automated model-to-model transformation and present a systematic approach that we followed in its design. We demonstrate the transformations using representative examples. Finally, we evaluate and compare the performance predictions of existing analytical, simulation and fluid analysis solvers. We analyze solvers' limitations, solving time, and memory consumption.

{Specialized Heuristics for the Controller Placement Problem in Large Scale SDN Networks}. Lange, Stanislav; Gebert, Steffen; Spoerhase, Joachim; Rygielski, Piotr; Zinner, Thomas; Kounev, Samuel; Tran-Gia, Phuoc; in 27th International Teletraffic Congress ({ITC 2015}) (2015). 210–218. Ghent, Belgium.

[ Abstract ]
[ BibTeX ]
[ EndNote ]
[ URL ]
[ Download ]

{The Software Defined Networking~(SDN) concept introduces a paradigm shift in the networking world towards an externalized control plane which is logically centralized. When designing an SDN-based WAN architecture, it is of vital importance to find a feasible solution to the controller placement problem, i.e., to decide where to position a limited amount of resources within the network. In addition to time-independent constraints regarding aspects like scalability, resilience, and control plane communication delays, dynamically changing network conditions like traffic patterns or bandwidth demands need to be considered as well. Consequently, such dynamic environments call for a regular and fast recalculation of placements in order to adapt to the current situation in a timely manner. While an exhaustive evaluation of all possible solutions can be performed within a practically feasible time frame for small and medium-sized networks, such an approach is out of scope for large problem instances which have significantly higher time and memory requirements. Therefore, this work investigates a specialized heuristic, which takes into account a particular set of optimization objectives and returns solutions representing the possible trade-offs between them. Due to its low computation time and acceptable margin of error, this heuristic can be employed by automatic decision systems operating in dynamic environments.}

@inproceedings{LaGeSpRyZiKoTG-SDN-Controller-Placement-ITC2015,
  abstract = {{The Software Defined Networking (SDN) concept introduces a paradigm shift in the networking world towards an externalized control plane which is logically centralized. When designing an SDN-based WAN architecture, it is of vital importance to find a feasible solution to the controller placement problem, i.e., to decide where to position a limited amount of resources within the network. In addition to time-independent constraints regarding aspects like scalability, resilience, and control plane communication delays, dynamically changing network conditions like traffic patterns or bandwidth demands need to be considered as well. Consequently, such dynamic environments call for a regular and fast recalculation of placements in order to adapt to the current situation in a timely manner. While an exhaustive evaluation of all possible solutions can be performed within a practically feasible time frame for small and medium-sized networks, such an approach is out of scope for large problem instances which have significantly higher time and memory requirements. Therefore, this work investigates a specialized heuristic, which takes into account a particular set of optimization objectives and returns solutions representing the possible trade-offs between them. Due to its low computation time and acceptable margin of error, this heuristic can be employed by automatic decision systems operating in dynamic environments.}},
  address = {Ghent, Belgium},
  author = {Lange, Stanislav and Gebert, Steffen and Spoerhase, Joachim and Rygielski, Piotr and Zinner, Thomas and Kounev, Samuel and Tran-Gia, Phuoc},
  booktitle = {27th International Teletraffic Congress ({ITC 2015})},
  keywords = {Optimization},
  month = {09},
  pages = {210–218},
  title = {{Specialized Heuristics for the Controller Placement Problem in Large Scale SDN Networks}},
  year = 2015
}

%0 Conference Paper
%1 LaGeSpRyZiKoTG-SDN-Controller-Placement-ITC2015
%A Lange, Stanislav
%A Gebert, Steffen
%A Spoerhase, Joachim
%A Rygielski, Piotr
%A Zinner, Thomas
%A Kounev, Samuel
%A Tran-Gia, Phuoc
%B 27th International Teletraffic Congress ({ITC 2015})
%C Ghent, Belgium
%D 2015
%P 210--218
%T {Specialized Heuristics for the Controller Placement Problem in Large Scale SDN Networks}
%U http://dx.doi.org/10.1109/ITC.2015.32
%X {The Software Defined Networking~(SDN) concept introduces a paradigm shift in the networking world towards an externalized control plane which is logically centralized. When designing an SDN-based WAN architecture, it is of vital importance to find a feasible solution to the controller placement problem, i.e., to decide where to position a limited amount of resources within the network. In addition to time-independent constraints regarding aspects like scalability, resilience, and control plane communication delays, dynamically changing network conditions like traffic patterns or bandwidth demands need to be considered as well. Consequently, such dynamic environments call for a regular and fast recalculation of placements in order to adapt to the current situation in a timely manner. While an exhaustive evaluation of all possible solutions can be performed within a practically feasible time frame for small and medium-sized networks, such an approach is out of scope for large problem instances which have significantly higher time and memory requirements. Therefore, this work investigates a specialized heuristic, which takes into account a particular set of optimization objectives and returns solutions representing the possible trade-offs between them. Due to its low computation time and acceptable margin of error, this heuristic can be employed by automatic decision systems operating in dynamic environments.}

{Flexible Performance Prediction of Data Center Networks using Automatically Generated Simulation Models}. Rygielski, Piotr; Kounev, Samuel; Tran-Gia, Phuoc; in Proceedings of the Eighth International Conference on Simulation Tools and Techniques (SIMUTools 2015) (2015). 119–128.

[ Abstract ]
[ BibTeX ]
[ EndNote ]
[ Download ]

{Using different modeling and simulation approaches for predicting network performance requires extensive experience and involves a number of time consuming manual steps regarding each of the modeling formalisms. In this paper, we propose a generic approach to modeling the performance of data center networks. The approach offers multiple performance models but requires to use only a single modeling language. We propose a two-step modeling methodology, in which a high-level descriptive model of the network is built in the first step, and in the second step model-to-model transformations are used to automatically transform the descriptive model to different network simulation models. We automatically generate three performance models defined at different levels of abstraction to analyze network throughput. By offering multiple simulation models in parallel, we provide flexibility in trading-off between the modeling accuracy and the simulation overhead. We analyze the simulation models by comparing the prediction accuracy with respect to the simulation duration. We observe, that in the investigated scenarios the solution duration of coarser simulation models is up to 300 times shorter, whereas the average prediction accuracy decreases only by 4 percent.}

@inproceedings{RyKoTr2015-SIMUTools-FlexPerformancePrediction,
  abstract = {{Using different modeling and simulation approaches for predicting network performance requires extensive experience and involves a number of time consuming manual steps regarding each of the modeling formalisms. In this paper, we propose a generic approach to modeling the performance of data center networks. The approach offers multiple performance models but requires to use only a single modeling language. We propose a two-step modeling methodology, in which a high-level descriptive model of the network is built in the first step, and in the second step model-to-model transformations are used to automatically transform the descriptive model to different network simulation models. We automatically generate three performance models defined at different levels of abstraction to analyze network throughput. By offering multiple simulation models in parallel, we provide flexibility in trading-off between the modeling accuracy and the simulation overhead. We analyze the simulation models by comparing the prediction accuracy with respect to the simulation duration. We observe, that in the investigated scenarios the solution duration of coarser simulation models is up to 300 times shorter, whereas the average prediction accuracy decreases only by 4 percent.}},
  author = {Rygielski, Piotr and Kounev, Samuel and Tran-Gia, Phuoc},
  booktitle = {Proceedings of the Eighth International Conference on Simulation Tools and Techniques (SIMUTools 2015)},
  keywords = {QPN},
  month = {08},
  pages = {119–128},
  title = {{Flexible Performance Prediction of Data Center Networks using Automatically Generated Simulation Models}},
  year = 2015
}

%0 Conference Paper
%1 RyKoTr2015-SIMUTools-FlexPerformancePrediction
%A Rygielski, Piotr
%A Kounev, Samuel
%A Tran-Gia, Phuoc
%B Proceedings of the Eighth International Conference on Simulation Tools and Techniques (SIMUTools 2015)
%D 2015
%P 119--128
%T {Flexible Performance Prediction of Data Center Networks using Automatically Generated Simulation Models}
%X {Using different modeling and simulation approaches for predicting network performance requires extensive experience and involves a number of time consuming manual steps regarding each of the modeling formalisms. In this paper, we propose a generic approach to modeling the performance of data center networks. The approach offers multiple performance models but requires to use only a single modeling language. We propose a two-step modeling methodology, in which a high-level descriptive model of the network is built in the first step, and in the second step model-to-model transformations are used to automatically transform the descriptive model to different network simulation models. We automatically generate three performance models defined at different levels of abstraction to analyze network throughput. By offering multiple simulation models in parallel, we provide flexibility in trading-off between the modeling accuracy and the simulation overhead. We analyze the simulation models by comparing the prediction accuracy with respect to the simulation duration. We observe, that in the investigated scenarios the solution duration of coarser simulation models is up to 300 times shorter, whereas the average prediction accuracy decreases only by 4 percent.}

{SPEC Research Group Newsletter, vol. 1 no. 4}. Kounev, Samuel; Sachs, Kai; Rygielski, Piotr; (2015, January).

Published by Standard Performance Evaluation Corporation (SPEC)

[ BibTeX ]
[ EndNote ]
[ URL ]
[ Download ]

@misc{SPEC-RG-NEWSLETTER-4,
  author = {Kounev, Samuel and Sachs, Kai and Rygielski, Piotr},
  keywords = {SPEC},
  month = {01},
  note = {Published by Standard Performance Evaluation Corporation (SPEC)},
  title = {{SPEC Research Group Newsletter, vol. 1 no. 4}},
  year = 2015
}

%0 Generic
%1 SPEC-RG-NEWSLETTER-4
%A Kounev, Samuel
%A Sachs, Kai
%A Rygielski, Piotr
%D 2015
%T {SPEC Research Group Newsletter, vol. 1 no. 4}
%U http://research.spec.org/en/newsletter.html

{Descartes Network Infrastructures (DNI) Manual: Meta-models, Transformations, Examples} Rygielski, Piotr; Kounev, Samuel; (2014). Chair of Software Engineering, University of W{ü}rzburg, Am Hubland, 97074 W{ü}rzburg.

[ Abstract ]
[ BibTeX ]
[ EndNote ]
[ URL ]
[ Download ]

The goal of this document is to present the DNI Meta-Model, its instances, sub-meta-models, and model transformations in more details than in an usual conference or journal paper. We describe the meta-models and the transformations in details, give example of systems modeled using the meta-models, and present the transformations in a step-by-step manner.

@techreport{RyKo-DNI-Manual-TR,
  abstract = {The goal of this document is to present the DNI Meta-Model, its instances, sub-meta-models, and model transformations in more details than in an usual conference or journal paper. We describe the meta-models and the transformations in details, give example of systems modeled using the meta-models, and present the transformations in a step-by-step manner.},
  address = {Am Hubland, 97074 W{\"u}rzburg},
  author = {Rygielski, Piotr and Kounev, Samuel},
  institution = {Chair of Software Engineering, University of W{\"u}rzburg},
  keywords = {DNI},
  month = {09},
  title = {{Descartes Network Infrastructures (DNI) Manual: Meta-models, Transformations, Examples}},
  type = {{Technical Report v.0.3}},
  year = 2014
}

%0 Report
%1 RyKo-DNI-Manual-TR
%A Rygielski, Piotr
%A Kounev, Samuel
%C Am Hubland, 97074 W{ü}rzburg
%D 2014
%T {Descartes Network Infrastructures (DNI) Manual: Meta-models, Transformations, Examples}
%U http://se.informatik.uni-wuerzburg.de/staff/piotr_rygielski/dni_manual/
%X The goal of this document is to present the DNI Meta-Model, its instances, sub-meta-models, and model transformations in more details than in an usual conference or journal paper. We describe the meta-models and the transformations in details, give example of systems modeled using the meta-models, and present the transformations in a step-by-step manner.

{Data Center Network Throughput Analysis using Queueing Petri Nets}. Rygielski, Piotr; Kounev, Samuel; in 34th IEEE International Conference on Distributed Computing Systems Workshops (ICDCS 2014 Workshops). 4th International Workshop on Data Center Performance, (DCPerf 2014) (2014). 100–105.

[ Abstract ]
[ BibTeX ]
[ EndNote ]
[ Download ]

In this paper, we address the problem of performance analysis in computer networks. We present a metamodel designed for the performance modeling of network infrastructures in modern data centers. Instances of our metamodel can be automatically transformed into stochastic simulation models for performance prediction. In this paper, we present the transformation to Queueing Petri Nets (QPNs) and simulate them using SimQPN simulator. We show that despite the high level of abstraction of the QPNs, we are able to estimate the utilization of resources with good accuracy within a short time.

@inproceedings{RyKo2014-DCPerf-DNI2QPN,
  abstract = {In this paper, we address the problem of performance analysis in computer networks. We present a metamodel designed for the performance modeling of network infrastructures in modern data centers. Instances of our metamodel can be automatically transformed into stochastic simulation models for performance prediction. In this paper, we present the transformation to Queueing Petri Nets (QPNs) and simulate them using SimQPN simulator. We show that despite the high level of abstraction of the QPNs, we are able to estimate the utilization of resources with good accuracy within a short time.},
  author = {Rygielski, Piotr and Kounev, Samuel},
  booktitle = {34th IEEE International Conference on Distributed Computing Systems Workshops (ICDCS 2014 Workshops). 4th International Workshop on Data Center Performance, (DCPerf 2014)},
  keywords = {DNI},
  month = {06},
  pages = {100–105},
  title = {{Data Center Network Throughput Analysis using Queueing Petri Nets}},
  year = 2014
}

%0 Conference Paper
%1 RyKo2014-DCPerf-DNI2QPN
%A Rygielski, Piotr
%A Kounev, Samuel
%B 34th IEEE International Conference on Distributed Computing Systems Workshops (ICDCS 2014 Workshops). 4th International Workshop on Data Center Performance, (DCPerf 2014)
%D 2014
%P 100--105
%T {Data Center Network Throughput Analysis using Queueing Petri Nets}
%X In this paper, we address the problem of performance analysis in computer networks. We present a metamodel designed for the performance modeling of network infrastructures in modern data centers. Instances of our metamodel can be automatically transformed into stochastic simulation models for performance prediction. In this paper, we present the transformation to Queueing Petri Nets (QPNs) and simulate them using SimQPN simulator. We show that despite the high level of abstraction of the QPNs, we are able to estimate the utilization of resources with good accuracy within a short time.

{SPEC Research Group Newsletter, vol. 1 no. 3}. Kounev, Samuel; Sachs, Kai; Rygielski, Piotr; (2014, March).

Published by Standard Performance Evaluation Corporation (SPEC)

[ BibTeX ]
[ EndNote ]
[ URL ]
[ Download ]

@misc{SPEC-RG-NEWSLETTER-3,
  author = {Kounev, Samuel and Sachs, Kai and Rygielski, Piotr},
  keywords = {SPEC},
  month = {03},
  note = {Published by Standard Performance Evaluation Corporation (SPEC)},
  title = {{SPEC Research Group Newsletter, vol. 1 no. 3}},
  year = 2014
}

%0 Generic
%1 SPEC-RG-NEWSLETTER-3
%A Kounev, Samuel
%A Sachs, Kai
%A Rygielski, Piotr
%D 2014
%T {SPEC Research Group Newsletter, vol. 1 no. 3}
%U http://research.spec.org/en/newsletter.html

{Model-Based Throughput Prediction in Data Center Networks}. Rygielski, Piotr; Kounev, Samuel; Zschaler, Steffen; in {Proceedings of the 2nd IEEE International Workshop on Measurements and Networking (M\&N 2013)} (2013). 167–172.

[ Abstract ]
[ BibTeX ]
[ EndNote ]
[ Download ]

In this paper, we address the problem of performance analysis in computer networks. We present a new meta-model designed for the performance modeling of network infrastructures in modern data centers. Instances of our metamodel can be automatically transformed into stochastic simulation models for performance prediction. We evaluate the approach in a case study of a road traffic monitoring system. We compare the performance prediction results against the real system and a benchmark. The presented results show that our approach, despite of introducing many modeling abstractions, delivers predictions with errors less than 32% and correctly detects bottlenecks in the modeled network.

@inproceedings{RyKoZs2013-ThroughputPrediction,
  abstract = {In this paper, we address the problem of performance analysis in computer networks. We present a new meta-model designed for the performance modeling of network infrastructures in modern data centers. Instances of our metamodel can be automatically transformed into stochastic simulation models for performance prediction. We evaluate the approach in a case study of a road traffic monitoring system. We compare the performance prediction results against the real system and a benchmark. The presented results show that our approach, despite of introducing many modeling abstractions, delivers predictions with errors less than 32% and correctly detects bottlenecks in the modeled network.},
  author = {Rygielski, Piotr and Kounev, Samuel and Zschaler, Steffen},
  booktitle = {{Proceedings of the 2nd IEEE International Workshop on Measurements and Networking (M\&N 2013)}},
  keywords = {DNI},
  month = 10,
  pages = {167–172},
  title = {{Model-Based Throughput Prediction in Data Center Networks}},
  year = 2013
}

%0 Conference Paper
%1 RyKoZs2013-ThroughputPrediction
%A Rygielski, Piotr
%A Kounev, Samuel
%A Zschaler, Steffen
%B {Proceedings of the 2nd IEEE International Workshop on Measurements and Networking (M\&N 2013)}
%D 2013
%P 167--172
%T {Model-Based Throughput Prediction in Data Center Networks}
%X In this paper, we address the problem of performance analysis in computer networks. We present a new meta-model designed for the performance modeling of network infrastructures in modern data centers. Instances of our metamodel can be automatically transformed into stochastic simulation models for performance prediction. We evaluate the approach in a case study of a road traffic monitoring system. We compare the performance prediction results against the real system and a benchmark. The presented results show that our approach, despite of introducing many modeling abstractions, delivers predictions with errors less than 32% and correctly detects bottlenecks in the modeled network.

{SPEC Research Group Newsletter, vol. 1 no. 2}. Kounev, Samuel; Sachs, Kai; Rygielski, Piotr; (2013, June).

Published by Standard Performance Evaluation Corporation (SPEC)

[ BibTeX ]
[ EndNote ]
[ URL ]
[ Download ]

@misc{SPEC-RG-NEWSLETTER-2,
  author = {Kounev, Samuel and Sachs, Kai and Rygielski, Piotr},
  keywords = {SPEC},
  month = {06},
  note = {Published by Standard Performance Evaluation Corporation (SPEC)},
  title = {{SPEC Research Group Newsletter, vol. 1 no. 2}},
  year = 2013
}

%0 Generic
%1 SPEC-RG-NEWSLETTER-2
%A Kounev, Samuel
%A Sachs, Kai
%A Rygielski, Piotr
%D 2013
%T {SPEC Research Group Newsletter, vol. 1 no. 2}
%U http://research.spec.org/en/newsletter.html

{Cloud Usage Patterns: A Formalism for Description of Cloud Usage Scenarios} Milenkoski, Aleksandar; Iosup, Alexandru; Kounev, Samuel; Sachs, Kai; Rygielski, Piotr; Ding, Jason; Cirne, Walfredo; Rosenberg, Florian; (2013). SPEC Research Group - Cloud Working Group, Standard Performance Evaluation Corporation (SPEC), {7001 Heritage Village Plaza Suite 225, Gainesville, VA 20155, USA}.

[ Abstract ]
[ BibTeX ]
[ EndNote ]
[ URL ]
[ Download ]

{Cloud computing is becoming an increasingly lucrative branch of the existing information and communication technologies (ICT). Enabling a debate about cloud usage scenarios can help with attracting new customers, sharing best-practices, and designing new cloud services. In contrast to previous approaches, which have attempted mainly to formalize the common service delivery models (i.e., Infrastructure-as-a-Service, Platform-as-a-Service, and Software-as-a-Service), in this work, we propose a formalism for describing common cloud usage scenarios referred to as cloud usage patterns. Our formalism takes a structuralist approach allowing decomposition of a cloud usage scenario into elements corresponding to the common cloud service delivery models. Furthermore, our formalism considers several cloud usage patterns that have recently emerged, such as hybrid services and value chains in which mediators are involved, also referred to as value chains with mediators. We propose a simple yet expressive textual and visual language for our formalism, and we show how it can be used in practice for describing a variety of real-world cloud usage scenarios. The scenarios for which we demonstrate our formalism include resource provisioning of global providers of infrastructure and/or platform resources, online social networking services, user-data processing services, online customer and ticketing services, online asset management and banking applications, CRM (Customer Relationship Management) applications, and online social gaming applications.}

@techreport{MiIoKoSaRyDiCiRo2013-TechReport-CloudUsagePatterns,
  abstract = {{Cloud computing is becoming an increasingly lucrative branch of the existing information and communication technologies (ICT). Enabling a debate about cloud usage scenarios can help with attracting new customers, sharing best-practices, and designing new cloud services. In contrast to previous approaches, which have attempted mainly to formalize the common service delivery models (i.e., Infrastructure-as-a-Service, Platform-as-a-Service, and Software-as-a-Service), in this work, we propose a formalism for describing common cloud usage scenarios referred to as cloud usage patterns. Our formalism takes a structuralist approach allowing decomposition of a cloud usage scenario into elements corresponding to the common cloud service delivery models. Furthermore, our formalism considers several cloud usage patterns that have recently emerged, such as hybrid services and value chains in which mediators are involved, also referred to as value chains with mediators. We propose a simple yet expressive textual and visual language for our formalism, and we show how it can be used in practice for describing a variety of real-world cloud usage scenarios. The scenarios for which we demonstrate our formalism include resource provisioning of global providers of infrastructure and/or platform resources, online social networking services, user-data processing services, online customer and ticketing services, online asset management and banking applications, CRM (Customer Relationship Management) applications, and online social gaming applications.}},
  address = {{7001 Heritage Village Plaza Suite 225, Gainesville, VA 20155, USA}},
  author = {Milenkoski, Aleksandar and Iosup, Alexandru and Kounev, Samuel and Sachs, Kai and Rygielski, Piotr and Ding, Jason and Cirne, Walfredo and Rosenberg, Florian},
  institution = {SPEC Research Group - Cloud Working Group, Standard Performance Evaluation Corporation (SPEC)},
  keywords = {Virtualization},
  month = {05},
  title = {{Cloud Usage Patterns: A Formalism for Description of Cloud Usage Scenarios}},
  type = {{Technical Report SPEC-RG-2013-001 v.1.0.1}},
  year = 2013
}

%0 Report
%1 MiIoKoSaRyDiCiRo2013-TechReport-CloudUsagePatterns
%A Milenkoski, Aleksandar
%A Iosup, Alexandru
%A Kounev, Samuel
%A Sachs, Kai
%A Rygielski, Piotr
%A Ding, Jason
%A Cirne, Walfredo
%A Rosenberg, Florian
%C {7001 Heritage Village Plaza Suite 225, Gainesville, VA 20155, USA}
%D 2013
%T {Cloud Usage Patterns: A Formalism for Description of Cloud Usage Scenarios}
%U http://research.spec.org/fileadmin/user_upload/documents/rg_cloud/endorsed_publications/SPEC-RG-2013-001_CloudUsagePatterns.pdf
%X {Cloud computing is becoming an increasingly lucrative branch of the existing information and communication technologies (ICT). Enabling a debate about cloud usage scenarios can help with attracting new customers, sharing best-practices, and designing new cloud services. In contrast to previous approaches, which have attempted mainly to formalize the common service delivery models (i.e., Infrastructure-as-a-Service, Platform-as-a-Service, and Software-as-a-Service), in this work, we propose a formalism for describing common cloud usage scenarios referred to as cloud usage patterns. Our formalism takes a structuralist approach allowing decomposition of a cloud usage scenario into elements corresponding to the common cloud service delivery models. Furthermore, our formalism considers several cloud usage patterns that have recently emerged, such as hybrid services and value chains in which mediators are involved, also referred to as value chains with mediators. We propose a simple yet expressive textual and visual language for our formalism, and we show how it can be used in practice for describing a variety of real-world cloud usage scenarios. The scenarios for which we demonstrate our formalism include resource provisioning of global providers of infrastructure and/or platform resources, online social networking services, user-data processing services, online customer and ticketing services, online asset management and banking applications, CRM (Customer Relationship Management) applications, and online social gaming applications.}

{A Meta-Model for Performance Modeling of Dynamic Virtualized Network Infrastructures}. Rygielski, Piotr; Zschaler, Steffen; Kounev, Samuel; in Proceedings of the 4th ACM/SPEC International Conference on Performance Engineering (ICPE 2013) (2013). 327–330. ACM, New York, NY, USA.

[ Abstract ]
[ BibTeX ]
[ EndNote ]
[ URL ]
[ Download ]

In this work-in-progress paper, we present a new meta-model designed for the performance modeling of dynamic data center network infrastructures. Our approach models characteristic aspects of Cloud data centers which were not crucial in classical data centers. We present our meta-model and demonstrate its use for performance modeling and analysis through an example, including a transformation into OMNeT++ for performance simulation.

@inproceedings{RyZsKo2013-DNI-meta-model,
  abstract = {In this work-in-progress paper, we present a new meta-model designed for the performance modeling of dynamic data center network infrastructures. Our approach models characteristic aspects of Cloud data centers which were not crucial in classical data centers. We present our meta-model and demonstrate its use for performance modeling and analysis through an example, including a transformation into OMNeT++ for performance simulation.},
  address = {New York, NY, USA},
  author = {Rygielski, Piotr and Zschaler, Steffen and Kounev, Samuel},
  booktitle = {Proceedings of the 4th ACM/SPEC International Conference on Performance Engineering (ICPE 2013)},
  keywords = {DNI},
  month = {04},
  pages = {327–330},
  publisher = {ACM},
  title = {{A Meta-Model for Performance Modeling of Dynamic Virtualized Network Infrastructures}},
  year = 2013
}

%0 Conference Paper
%1 RyZsKo2013-DNI-meta-model
%A Rygielski, Piotr
%A Zschaler, Steffen
%A Kounev, Samuel
%B Proceedings of the 4th ACM/SPEC International Conference on Performance Engineering (ICPE 2013)
%C New York, NY, USA
%D 2013
%I ACM
%P 327--330
%T {A Meta-Model for Performance Modeling of Dynamic Virtualized Network Infrastructures}
%U http://icpe2013.ipd.kit.edu/
%X In this work-in-progress paper, we present a new meta-model designed for the performance modeling of dynamic data center network infrastructures. Our approach models characteristic aspects of Cloud data centers which were not crucial in classical data centers. We present our meta-model and demonstrate its use for performance modeling and analysis through an example, including a transformation into OMNeT++ for performance simulation.

{Network Virtualization for QoS-Aware Resource Management in Cloud Data Centers: A Survey}. Rygielski, Piotr; Kounev, Samuel; in PIK --- Praxis der Informationsverarbeitung und Kommunikation (2013). 36(1) 55–64. de Gruyter.

[ Abstract ]
[ BibTeX ]
[ EndNote ]
[ URL ]
[ Download ]

The increasing popularity of Cloud Computing is leading to the emergence of large virtualized data centers hosting increasingly complex and dynamic IT systems and services. Over the past decade, the efficient sharing of computational resources through virtualization has been subject to intensive research, while network management in cloud data centers has received less attention. A variety of network-intensive applications require QoS (Quality-of-Service) provisioning, performance isolation and support for flexible and efficient migration of virtual machines. In this paper, we survey existing network virtualization approaches and evaluate the extent to which they can be used as a basis for realizing the mentioned requirements in a cloud data center. More specifically, we identify generic network virtualization techniques, characterize them according to their features related to QoS management and performance isolation, and show how they can be composed together and used as building blocks for complex network virtualization solutions. We then present an overview of selected representative cloud platforms and show how they leverage the generic techniques as a basis for network resource management. Finally, we outline open issues and research challenges in the area of performance modeling and proactive resource management of virtualized data center infrastructures.

@article{RyKo2013,
  abstract = {The increasing popularity of Cloud Computing is leading to the emergence of large virtualized data centers hosting increasingly complex and dynamic IT systems and services. Over the past decade, the efficient sharing of computational resources through virtualization has been subject to intensive research, while network management in cloud data centers has received less attention. A variety of network-intensive applications require QoS (Quality-of-Service) provisioning, performance isolation and support for flexible and efficient migration of virtual machines. In this paper, we survey existing network virtualization approaches and evaluate the extent to which they can be used as a basis for realizing the mentioned requirements in a cloud data center. More specifically, we identify generic network virtualization techniques, characterize them according to their features related to QoS management and performance isolation, and show how they can be composed together and used as building blocks for complex network virtualization solutions. We then present an overview of selected representative cloud platforms and show how they leverage the generic techniques as a basis for network resource management. Finally, we outline open issues and research challenges in the area of performance modeling and proactive resource management of virtualized data center infrastructures.},
  author = {Rygielski, Piotr and Kounev, Samuel},
  journal = {PIK — Praxis der Informationsverarbeitung und Kommunikation},
  keywords = {SDN},
  month = {02},
  number = 1,
  pages = {55–64},
  publisher = {de Gruyter},
  title = {{Network Virtualization for QoS-Aware Resource Management in Cloud Data Centers: A Survey}},
  volume = 36,
  year = 2013
}

%0 Journal Article
%1 RyKo2013
%A Rygielski, Piotr
%A Kounev, Samuel
%D 2013
%I de Gruyter
%J PIK --- Praxis der Informationsverarbeitung und Kommunikation
%N 1
%P 55--64
%T {Network Virtualization for QoS-Aware Resource Management in Cloud Data Centers: A Survey}
%U http://www.degruyter.com/view/j/piko-2013-36-issue-1/pik-2012-0136/pik-2012-0136.xml?format=INT
%V 36
%X The increasing popularity of Cloud Computing is leading to the emergence of large virtualized data centers hosting increasingly complex and dynamic IT systems and services. Over the past decade, the efficient sharing of computational resources through virtualization has been subject to intensive research, while network management in cloud data centers has received less attention. A variety of network-intensive applications require QoS (Quality-of-Service) provisioning, performance isolation and support for flexible and efficient migration of virtual machines. In this paper, we survey existing network virtualization approaches and evaluate the extent to which they can be used as a basis for realizing the mentioned requirements in a cloud data center. More specifically, we identify generic network virtualization techniques, characterize them according to their features related to QoS management and performance isolation, and show how they can be composed together and used as building blocks for complex network virtualization solutions. We then present an overview of selected representative cloud platforms and show how they leverage the generic techniques as a basis for network resource management. Finally, we outline open issues and research challenges in the area of performance modeling and proactive resource management of virtualized data center infrastructures.

{SPEC Research Group Newsletter, vol. 1 no. 1}. Kounev, Samuel; Sachs, Kai; Rygielski, Piotr; (2012, September).

Published by Standard Performance Evaluation Corporation (SPEC)

[ BibTeX ]
[ EndNote ]
[ URL ]
[ Download ]

@misc{SPEC-RG-NEWSLETTER-1,
  author = {Kounev, Samuel and Sachs, Kai and Rygielski, Piotr},
  keywords = {SPEC},
  month = {09},
  note = {Published by Standard Performance Evaluation Corporation (SPEC)},
  title = {{SPEC Research Group Newsletter, vol. 1 no. 1}},
  year = 2012
}

%0 Generic
%1 SPEC-RG-NEWSLETTER-1
%A Kounev, Samuel
%A Sachs, Kai
%A Rygielski, Piotr
%D 2012
%T {SPEC Research Group Newsletter, vol. 1 no. 1}
%U http://research.spec.org/en/newsletter.html

{Modeling Virtualized Cloud Data Center Networks: Do We need QoS in Networks?}. Rygielski, Piotr; (2012, June).

[ BibTeX ]
[ EndNote ]

@misc{talk-Rygielski-OEW2012,
  author = {Rygielski, Piotr},
  howpublished = {Open Excellence Workshop (Invited Talk), Charles University in Prague, Czech Republic.},
  keywords = {Talks},
  month = {06},
  title = {{Modeling Virtualized Cloud Data Center Networks: Do We need QoS in Networks?}},
  year = 2012
}

%0 Generic
%1 talk-Rygielski-OEW2012
%A Rygielski, Piotr
%D 2012
%T {Modeling Virtualized Cloud Data Center Networks: Do We need QoS in Networks?}

{User Assignment and Movement Prediction in Wireless Networks}. {{\’S}}wi\k{a}tek, Pawe{l}; Rygielski, Piotr; Juszczyszyn, Krzysztof; Grzech, Adam; in {Cybernetics and Systems: An International Journal (CBS)} (2012). 43(4) 340–353. Taylor & Francis, Inc., Bristol, PA, USA.

5-Year Impact Factor (2014): 0.968

[ Abstract ]
[ BibTeX ]
[ EndNote ]
[ URL ]
[ Download ]

The article is devoted to the problem of mobility and resource management in heterogeneous wireless networks. It is assumed that in certain areas covered by multiple overlapping wireless networks there are a certain number of mobile clients that consume networks resources by use of the available communication services (e.g., voice or data transmission) delivered by network providers. Moreover, it is assumed that the continuity of communication services may be assured by the use of common handover techniques supporting client mobility (e.g., Mobile IPv6, IEEE 802.21, etc.). The task of mobility and resource management consists of making decisions concerning the moment and the network to which particular clients should be handed over in order to optimize certain quality criterion (e.g., utilization of network resources). In this article we show that gathering knowledge about client movements and prediction of their future positions may significantly improve the overall quality of the services delivered and network resource utilization.

@article{SwRyJuGr2012-CBS,
  abstract = {The article is devoted to the problem of mobility and resource management in heterogeneous wireless networks. It is assumed that in certain areas covered by multiple overlapping wireless networks there are a certain number of mobile clients that consume networks resources by use of the available communication services (e.g., voice or data transmission) delivered by network providers. Moreover, it is assumed that the continuity of communication services may be assured by the use of common handover techniques supporting client mobility (e.g., Mobile IPv6, IEEE 802.21, etc.). The task of mobility and resource management consists of making decisions concerning the moment and the network to which particular clients should be handed over in order to optimize certain quality criterion (e.g., utilization of network resources). In this article we show that gathering knowledge about client movements and prediction of their future positions may significantly improve the overall quality of the services delivered and network resource utilization.},
  address = {Bristol, PA, USA},
  author = {{\'S}wi\k{a}tek, Pawe{l} and Rygielski, Piotr and Juszczyszyn, Krzysztof and Grzech, Adam},
  journal = {{Cybernetics and Systems: An International Journal (CBS)}},
  keywords = {t_journalmagazine},
  month = {05},
  note = {5-Year Impact Factor (2014): 0.968},
  number = 4,
  pages = {340–353},
  publisher = {Taylor & Francis, Inc.},
  title = {{User Assignment and Movement Prediction in Wireless Networks}},
  volume = 43,
  year = 2012
}

%0 Journal Article
%1 SwRyJuGr2012-CBS
%A {{\'S}}wi\k{a}tek, Pawe{l}
%A Rygielski, Piotr
%A Juszczyszyn, Krzysztof
%A Grzech, Adam
%C Bristol, PA, USA
%D 2012
%I Taylor & Francis, Inc.
%J {Cybernetics and Systems: An International Journal (CBS)}
%N 4
%P 340--353
%T {User Assignment and Movement Prediction in Wireless Networks}
%U http://www.tandfonline.com/doi/abs/10.1080/01969722.2012.678219
%V 43
%X The article is devoted to the problem of mobility and resource management in heterogeneous wireless networks. It is assumed that in certain areas covered by multiple overlapping wireless networks there are a certain number of mobile clients that consume networks resources by use of the available communication services (e.g., voice or data transmission) delivered by network providers. Moreover, it is assumed that the continuity of communication services may be assured by the use of common handover techniques supporting client mobility (e.g., Mobile IPv6, IEEE 802.21, etc.). The task of mobility and resource management consists of making decisions concerning the moment and the network to which particular clients should be handed over in order to optimize certain quality criterion (e.g., utilization of network resources). In this article we show that gathering knowledge about client movements and prediction of their future positions may significantly improve the overall quality of the services delivered and network resource utilization.

{Resources Management and Services Personalization in Future Internet Applications}. {{\’S}}wi\k{a}tek, Pawel; Rygielski, Piotr; Grzech, Adam; in Advances in Electronics and Telecommunications (2011). 2(3) 50–54. Pozna{ń} University of Technology Press, Pozna{ń}, Poland.

[ BibTeX ]
[ EndNote ]
[ URL ]

@article{SwRyGr2011-EAT,
  address = {Pozna{\'n}, Poland},
  author = {{\'S}wi\k{a}tek, Pawel and Rygielski, Piotr and Grzech, Adam},
  journal = {Advances in Electronics and Telecommunications},
  keywords = {t_journalmagazine},
  month = 11,
  number = 3,
  pages = {50–54},
  publisher = {Pozna{\'n} University of Technology Press},
  title = {{Resources Management and Services Personalization in Future Internet Applications}},
  volume = 2,
  year = 2011
}

%0 Journal Article
%1 SwRyGr2011-EAT
%A {{\'S}}wi\k{a}tek, Pawel
%A Rygielski, Piotr
%A Grzech, Adam
%C Pozna{ń}, Poland
%D 2011
%I Pozna{ń} University of Technology Press
%J Advances in Electronics and Telecommunications
%N 3
%P 50--54
%T {Resources Management and Services Personalization in Future Internet Applications}
%U http://www.advances.et.put.poznan.pl/
%V 2

{Universal Comunication Platform for QoS-aware Delivery of Complex Services}. {{\’S}}wi\k{a}tek, Pawe{\l}; Rygielski, Piotr; in {Proceedings of the VIth International Scientific and Technical Conference (CSIT 2011)} (2011). 136–139. Publishing House Vezha&Co.

[ BibTeX ]
[ EndNote ]

@inproceedings{SwRy2011-CIST,
  author = {{\'S}wi\k{a}tek, Pawe{\l} and Rygielski, Piotr},
  booktitle = {{Proceedings of the VIth International Scientific and Technical Conference (CSIT 2011)}},
  keywords = {Virtualization},
  month = 11,
  pages = {136–139},
  publisher = {Publishing House Vezha&Co},
  title = {{Universal Comunication Platform for QoS-aware Delivery of Complex Services}},
  year = 2011
}

%0 Conference Paper
%1 SwRy2011-CIST
%A {{\'S}}wi\k{a}tek, Pawe{\l}
%A Rygielski, Piotr
%B {Proceedings of the VIth International Scientific and Technical Conference (CSIT 2011)}
%D 2011
%I Publishing House Vezha&Co
%P 136--139
%T {Universal Comunication Platform for QoS-aware Delivery of Complex Services}

{Context Change Detection for Resource Allocation in Service-Oriented Systems}. Rygielski, Piotr; Tomczak, Jakub; in Knowledge-Based and Intelligent Information and Engineering Systems, Part II (KES 2011), A. Koenig, A. Dengel, K. Hinkelmann, K. Kise, R. Howlett, L. Jain (eds.) (2011). (1st ed., Vol. 6882) 591–600. Springer-Verlag, Berlin, Heidelberg.

[ Abstract ]
[ BibTeX ]
[ EndNote ]
[ Download ]

In this paper, the problem of detecting the major changes in the stream of service requests is formulated. The change of stream component varies over time and depends on, e.g., a time of a day. The underlying cause of the change is called a context. Hence, at each moment there exists a probability distribution determining the probability of requesting the system service conditioned by the context. The aim is to find such a moment in which the distributions change. To solve that problem dissimilarity measures between two probability distributions are given. Nevertheless, detecting every change is not interesting but only long-lasting changes because of the costs of the service system resources reallocation. Therefore, in the proposed algorithm an issue of sensitivity to temporary changes detection is considered

@inproceedings{RyTo2011-KES,
  abstract = {In this paper, the problem of detecting the major changes in the stream of service requests is formulated. The change of stream component varies over time and depends on, e.g., a time of a day. The underlying cause of the change is called a context. Hence, at each moment there exists a probability distribution determining the probability of requesting the system service conditioned by the context. The aim is to find such a moment in which the distributions change. To solve that problem dissimilarity measures between two probability distributions are given. Nevertheless, detecting every change is not interesting but only long-lasting changes because of the costs of the service system resources reallocation. Therefore, in the proposed algorithm an issue of sensitivity to temporary changes detection is considered},
  address = {Berlin, Heidelberg},
  author = {Rygielski, Piotr and Tomczak, Jakub},
  booktitle = {Knowledge-Based and Intelligent Information and Engineering Systems, Part II (KES 2011)},
  edition = 1,
  editor = {Koenig, A. and Dengel, A. and Hinkelmann, K. and Kise, K. and Howlett, R.J. and Jain, L.C.},
  keywords = {descartes},
  month = {09},
  pages = {591–600},
  publisher = {Springer-Verlag},
  series = {{Lecture Notes in Computer Science (LNCS)}},
  title = {{Context Change Detection for Resource Allocation in Service-Oriented Systems}},
  volume = 6882,
  year = 2011
}

%0 Conference Paper
%1 RyTo2011-KES
%A Rygielski, Piotr
%A Tomczak, Jakub
%B Knowledge-Based and Intelligent Information and Engineering Systems, Part II (KES 2011)
%C Berlin, Heidelberg
%D 2011
%E Koenig, A.
%E Dengel, A.
%E Hinkelmann, K.
%E Kise, K.
%E Howlett, R.J.
%E Jain, L.C.
%I Springer-Verlag
%P 591--600
%T {Context Change Detection for Resource Allocation in Service-Oriented Systems}
%V 6882
%X In this paper, the problem of detecting the major changes in the stream of service requests is formulated. The change of stream component varies over time and depends on, e.g., a time of a day. The underlying cause of the change is called a context. Hence, at each moment there exists a probability distribution determining the probability of requesting the system service conditioned by the context. The aim is to find such a moment in which the distributions change. To solve that problem dissimilarity measures between two probability distributions are given. Nevertheless, detecting every change is not interesting but only long-lasting changes because of the costs of the service system resources reallocation. Therefore, in the proposed algorithm an issue of sensitivity to temporary changes detection is considered
%7 1

{Prediction Based Handovers for Wireless Networks Resources Management}. Rygielski, Piotr; {{\’S}}wi\k{a}tek, Pawel; Juszczyszyn, Krzysztof; Grzech, Adam; in Knowledge-Based and Intelligent Information and Engineering Systems, Part II (KES 2011), A. Koenig, A. Dengel, K. Hinkelmann, K. Kise, R. Howlett, L. Jain (eds.) (2011). (1st ed., Vol. 6882) 687–696. Springer-Verlag, Berlin, Heidelberg.

[ Abstract ]
[ BibTeX ]
[ EndNote ]
[ URL ]
[ Download ]

The paper is devoted to the problem of mobility and resources management in heterogeneous wireless networks. It is assumed that in certain area covered by multiple overlapping wireless networks there is certain number of mobile client which consume networks resources by use of available communication services (e.g., voice or data transmission) delivered by network providers. Moreover it is assumed, that communication services continuity may be assured with use of common handover techniques supporting clients mobility (e.g: MIPv6, IEEE 802.21, etc.). The task of mobility and resources management consists of making decisions concerning the moment and the network to which particular clients should be handed over in order to optimize certain quality criterion (e.g. utilization of network resources). In this paper we show that gathering knowledge about clients movement and prediction of their future position may significantly improve the overall quality of delivered services and network resources utilization.

@inproceedings{RySwJuGr2011-KES,
  abstract = {The paper is devoted to the problem of mobility and resources management in heterogeneous wireless networks. It is assumed that in certain area covered by multiple overlapping wireless networks there is certain number of mobile client which consume networks resources by use of available communication services (e.g., voice or data transmission) delivered by network providers. Moreover it is assumed, that communication services continuity may be assured with use of common handover techniques supporting clients mobility (e.g: MIPv6, IEEE 802.21, etc.). The task of mobility and resources management consists of making decisions concerning the moment and the network to which particular clients should be handed over in order to optimize certain quality criterion (e.g. utilization of network resources). In this paper we show that gathering knowledge about clients movement and prediction of their future position may significantly improve the overall quality of delivered services and network resources utilization.},
  address = {Berlin, Heidelberg},
  author = {Rygielski, Piotr and {\'S}wi\k{a}tek, Pawel and Juszczyszyn, Krzysztof and Grzech, Adam},
  booktitle = {Knowledge-Based and Intelligent Information and Engineering Systems, Part II (KES 2011)},
  edition = 1,
  editor = {Koenig, A. and Dengel, A. and Hinkelmann, K. and Kise, K. and Howlett, R.J. and Jain, L.C.},
  keywords = {Prediction},
  month = {09},
  pages = {687–696},
  publisher = {Springer-Verlag},
  series = {{Lecture Notes in Computer Science (LNCS)}},
  title = {{Prediction Based Handovers for Wireless Networks Resources Management}},
  volume = 6882,
  year = 2011
}

%0 Conference Paper
%1 RySwJuGr2011-KES
%A Rygielski, Piotr
%A {{\'S}}wi\k{a}tek, Pawel
%A Juszczyszyn, Krzysztof
%A Grzech, Adam
%B Knowledge-Based and Intelligent Information and Engineering Systems, Part II (KES 2011)
%C Berlin, Heidelberg
%D 2011
%E Koenig, A.
%E Dengel, A.
%E Hinkelmann, K.
%E Kise, K.
%E Howlett, R.J.
%E Jain, L.C.
%I Springer-Verlag
%P 687--696
%T {Prediction Based Handovers for Wireless Networks Resources Management}
%U http://dl.acm.org/citation.cfm?id=2041341.2041419
%V 6882
%X The paper is devoted to the problem of mobility and resources management in heterogeneous wireless networks. It is assumed that in certain area covered by multiple overlapping wireless networks there is certain number of mobile client which consume networks resources by use of available communication services (e.g., voice or data transmission) delivered by network providers. Moreover it is assumed, that communication services continuity may be assured with use of common handover techniques supporting clients mobility (e.g: MIPv6, IEEE 802.21, etc.). The task of mobility and resources management consists of making decisions concerning the moment and the network to which particular clients should be handed over in order to optimize certain quality criterion (e.g. utilization of network resources). In this paper we show that gathering knowledge about clients movement and prediction of their future position may significantly improve the overall quality of delivered services and network resources utilization.
%7 1

{Migration-aware Optimization of Virtualized Computational Resources Allocation in Complex Systems}. Rygielski, Piotr; Gonczarek, Adam; in ICSEng 2011: Proceedings of the 21st international conference on Systems Engineering (ICSEng 2011), H. Selvaraj, D. Zydek (eds.) (2011). 212–216. IEEE Computer Society’s Conference Publishing Services, Los Alamitos, California USA.

[ Abstract ]
[ BibTeX ]
[ EndNote ]
[ Download ]

In this paper a task of resources allocation in the complex system is considered. Novelty of the formulated task consists of assumption that the applications assigned with resources of one machine can be migrated to another machine during system lifetime. The formulated task has been solved using proposed heuristic optimization method. Due to non-convex set of valid solutions the optimization procedure has been decomposed into two stages and forms approach similar to the relax-and-round approach. Proposed decomposition approach facilitates fast algorithm convergence and guaranties that achieved solution satisfies assumed constraints

@inproceedings{RyGo2011-ICSEng,
  abstract = {In this paper a task of resources allocation in the complex system is considered. Novelty of the formulated task consists of assumption that the applications assigned with resources of one machine can be migrated to another machine during system lifetime. The formulated task has been solved using proposed heuristic optimization method. Due to non-convex set of valid solutions the optimization procedure has been decomposed into two stages and forms approach similar to the relax-and-round approach. Proposed decomposition approach facilitates fast algorithm convergence and guaranties that achieved solution satisfies assumed constraints},
  address = {Los Alamitos, California USA},
  author = {Rygielski, Piotr and Gonczarek, Adam},
  booktitle = {ICSEng 2011: Proceedings of the 21st international conference on Systems Engineering (ICSEng 2011)},
  editor = {Selvaraj, Henry and Zydek, Dawid},
  keywords = {Optimization},
  month = {08},
  pages = {212–216},
  publisher = {IEEE Computer Society's Conference Publishing Services},
  title = {{Migration-aware Optimization of Virtualized Computational Resources Allocation in Complex Systems}},
  year = 2011
}

%0 Conference Paper
%1 RyGo2011-ICSEng
%A Rygielski, Piotr
%A Gonczarek, Adam
%B ICSEng 2011: Proceedings of the 21st international conference on Systems Engineering (ICSEng 2011)
%C Los Alamitos, California USA
%D 2011
%E Selvaraj, Henry
%E Zydek, Dawid
%I IEEE Computer Society's Conference Publishing Services
%P 212--216
%T {Migration-aware Optimization of Virtualized Computational Resources Allocation in Complex Systems}
%X In this paper a task of resources allocation in the complex system is considered. Novelty of the formulated task consists of assumption that the applications assigned with resources of one machine can be migrated to another machine during system lifetime. The formulated task has been solved using proposed heuristic optimization method. Due to non-convex set of valid solutions the optimization procedure has been decomposed into two stages and forms approach similar to the relax-and-round approach. Proposed decomposition approach facilitates fast algorithm convergence and guaranties that achieved solution satisfies assumed constraints

{Handover: a Tool for Optimization of Wireless Networks}. {{\’S}}wi\k{a}tek, Pawel; Rygielski, Piotr; Grzech, Adam; in {Proceedings of the First European Teletraffic Seminar: an initiative to strengthen collaboration on Network Design and Performance (ETS 2011)}, G. Danilewicz (ed.) (2011). 80–84. ASART STUDIO Agnieszka Chwalisz, Pozna{ń}, Poland.

[ Abstract ]
[ BibTeX ]
[ EndNote ]
[ Download ]

The growth of mobile devices equipped with wireless network interface on the market puts researchers focus on the new area of wireless connection management. In this paper we introduce an approach of wireless network management with handovers which occurs when user is moving through the area that is covered with more than one wireless network. The task of userÃ‚Â’s assignment to the wireless network is considered in this paper. There have been two main tasks formulated: local optimization, where user chooses the network to connect and global one, where the network management system picks users in order to maximize users satisfaction. The users have to be assigned with proper amount of communicational resources in every moment of the passing of considered geographical area. I this paper we propose three heuristic algorithms of user QoS-constrained assignment to networks. In two algorithms the user makes decision basing on his knowledge about network and his mobile device state and in the third algorithm, the networks management system decides which users to connect. The evaluation of proposed algorithms is done by means of computer simulation.

@inproceedings{GrSwRy2011-ETS,
  abstract = {The growth of mobile devices equipped with wireless network interface on the market puts researchers focus on the new area of wireless connection management. In this paper we introduce an approach of wireless network management with handovers which occurs when user is moving through the area that is covered with more than one wireless network. The task of userÃ‚Â’s assignment to the wireless network is considered in this paper. There have been two main tasks formulated: local optimization, where user chooses the network to connect and global one, where the network management system picks users in order to maximize users satisfaction. The users have to be assigned with proper amount of communicational resources in every moment of the passing of considered geographical area. I this paper we propose three heuristic algorithms of user QoS-constrained assignment to networks. In two algorithms the user makes decision basing on his knowledge about network and his mobile device state and in the third algorithm, the networks management system decides which users to connect. The evaluation of proposed algorithms is done by means of computer simulation.},
  address = {Pozna{\'n}, Poland},
  author = {{\'S}wi\k{a}tek, Pawel and Rygielski, Piotr and Grzech, Adam},
  booktitle = {{Proceedings of the First European Teletraffic Seminar: an initiative to strengthen collaboration on Network Design and Performance (ETS 2011)}},
  editor = {Danilewicz, Grzegorz},
  keywords = {descartes},
  month = {02},
  pages = {80–84},
  publisher = {ASART STUDIO Agnieszka Chwalisz},
  title = {{Handover: a Tool for Optimization of Wireless Networks}},
  year = 2011
}

%0 Conference Paper
%1 GrSwRy2011-ETS
%A {{\'S}}wi\k{a}tek, Pawel
%A Rygielski, Piotr
%A Grzech, Adam
%B {Proceedings of the First European Teletraffic Seminar: an initiative to strengthen collaboration on Network Design and Performance (ETS 2011)}
%C Pozna{ń}, Poland
%D 2011
%E Danilewicz, Grzegorz
%I ASART STUDIO Agnieszka Chwalisz
%P 80--84
%T {Handover: a Tool for Optimization of Wireless Networks}
%X The growth of mobile devices equipped with wireless network interface on the market puts researchers focus on the new area of wireless connection management. In this paper we introduce an approach of wireless network management with handovers which occurs when user is moving through the area that is covered with more than one wireless network. The task of userÃ‚Â’s assignment to the wireless network is considered in this paper. There have been two main tasks formulated: local optimization, where user chooses the network to connect and global one, where the network management system picks users in order to maximize users satisfaction. The users have to be assigned with proper amount of communicational resources in every moment of the passing of considered geographical area. I this paper we propose three heuristic algorithms of user QoS-constrained assignment to networks. In two algorithms the user makes decision basing on his knowledge about network and his mobile device state and in the third algorithm, the networks management system decides which users to connect. The evaluation of proposed algorithms is done by means of computer simulation.

$Automatyczna kompozycja uslug monitorowania dla systemu wspomagania treningu wytrzymalo{\'s}ciowego sportowców$

Automatyczna kompozycja uslug monitorowania dla systemu wspomagania treningu wytrzymalo{\’s}ciowego sportowców. Brzostowski, Krzysztof; Rygielski, Piotr; in Przegl\k{a}d Telekomunikacyjny, Wiadomo{{\’s}}ci Telekomunikacyjne (2011). 84 1017–1022.

In Polish

[ BibTeX ]
[ EndNote ]
[ Download ]

@article{PT2011-kompozycja,
  author = {Brzostowski, Krzysztof and Rygielski, Piotr},
  journal = {Przegl\k{a}d Telekomunikacyjny, Wiadomo{\'s}ci Telekomunikacyjne},
  keywords = {t_journalmagazine},
  note = {In Polish},
  pages = {1017–1022},
  title = {Automatyczna kompozycja uslug monitorowania dla systemu wspomagania treningu wytrzymalo\'sciowego sportowc\'ow},
  volume = 84,
  year = 2011
}

%0 Journal Article
%1 PT2011-kompozycja
%A Brzostowski, Krzysztof
%A Rygielski, Piotr
%D 2011
%J Przegl\k{a}d Telekomunikacyjny, Wiadomo{{\'s}}ci Telekomunikacyjne
%P 1017--1022
%T Automatyczna kompozycja uslug monitorowania dla systemu wspomagania treningu wytrzymalo{\'s}ciowego sportowców
%V 84

Translations of Service Level Agreement in Systems Based on Service Oriented Architectures. Grzech, Adam; {{\’S}}wi\k{a}tek, Pawel; Rygielski, Piotr; in {Cybernetics and Systems: An International Journal (CBS)} (2010). 41(8) 610–627. Taylor & Francis, Inc., Bristol, PA, USA.

5-Year Impact Factor (2014): 0.968

[ Abstract ]
[ BibTeX ]
[ EndNote ]
[ URL ]
[ Download ]

The gain of the article is to introduce and to discuss a formal specification of a computer system's service level agreement (SLA) and its translation into the structure of complex services (composed of atomic services) delivering required functionalities and nonfunctionalities in a distributed environment. It is assumed that the SLA is composed of two parts specifying quantitative and qualitative requirements. The former requirements define the structure of the adequate complex services in form of a directed graph, where potential parallelism of atomic services performance may be taken into account. The latter qualitative requirements are applied to select the optimal complex service realization scenario; it is based on assumption that various atomic services distinguished in the complex services structures are available at the considered distributed environment in different versions and locations. Different versions of atomic services are atomic services delivering the required functionalities and satisfy non-functionalities at various levels. Different locations (installation place) of available atomic services means that the cost of atomic services delivery (communication and calculation) depends on parts of the distributed systems where the services are performed. The proposed model of SLA translation into complex services structures and variants may be applied among others to calculate upper and lower complex services delivery times and to estimate the validity of possible parallelism in complex services.

@article{GrSwRy2010-CBS,
  abstract = {The gain of the article is to introduce and to discuss a formal specification of a computer system's service level agreement (SLA) and its translation into the structure of complex services (composed of atomic services) delivering required functionalities and nonfunctionalities in a distributed environment. It is assumed that the SLA is composed of two parts specifying quantitative and qualitative requirements. The former requirements define the structure of the adequate complex services in form of a directed graph, where potential parallelism of atomic services performance may be taken into account. The latter qualitative requirements are applied to select the optimal complex service realization scenario; it is based on assumption that various atomic services distinguished in the complex services structures are available at the considered distributed environment in different versions and locations. Different versions of atomic services are atomic services delivering the required functionalities and satisfy non-functionalities at various levels. Different locations (installation place) of available atomic services means that the cost of atomic services delivery (communication and calculation) depends on parts of the distributed systems where the services are performed. The proposed model of SLA translation into complex services structures and variants may be applied among others to calculate upper and lower complex services delivery times and to estimate the validity of possible parallelism in complex services.},
  address = {Bristol, PA, USA},
  author = {Grzech, Adam and {\'S}wi\k{a}tek, Pawel and Rygielski, Piotr},
  journal = {{Cybernetics and Systems: An International Journal (CBS)}},
  keywords = {t_journalmagazine},
  month = 11,
  note = {5-Year Impact Factor (2014): 0.968},
  number = 8,
  pages = {610–627},
  publisher = {Taylor & Francis, Inc.},
  title = {Translations of Service Level Agreement in Systems Based on Service Oriented Architectures},
  volume = 41,
  year = 2010
}

%0 Journal Article
%1 GrSwRy2010-CBS
%A Grzech, Adam
%A {{\'S}}wi\k{a}tek, Pawel
%A Rygielski, Piotr
%C Bristol, PA, USA
%D 2010
%I Taylor & Francis, Inc.
%J {Cybernetics and Systems: An International Journal (CBS)}
%N 8
%P 610--627
%T Translations of Service Level Agreement in Systems Based on Service Oriented Architectures
%U http://dx.doi.org/10.1080/01969722.2010.520225
%V 41
%X The gain of the article is to introduce and to discuss a formal specification of a computer system's service level agreement (SLA) and its translation into the structure of complex services (composed of atomic services) delivering required functionalities and nonfunctionalities in a distributed environment. It is assumed that the SLA is composed of two parts specifying quantitative and qualitative requirements. The former requirements define the structure of the adequate complex services in form of a directed graph, where potential parallelism of atomic services performance may be taken into account. The latter qualitative requirements are applied to select the optimal complex service realization scenario; it is based on assumption that various atomic services distinguished in the complex services structures are available at the considered distributed environment in different versions and locations. Different versions of atomic services are atomic services delivering the required functionalities and satisfy non-functionalities at various levels. Different locations (installation place) of available atomic services means that the cost of atomic services delivery (communication and calculation) depends on parts of the distributed systems where the services are performed. The proposed model of SLA translation into complex services structures and variants may be applied among others to calculate upper and lower complex services delivery times and to estimate the validity of possible parallelism in complex services.

{Dynamic Resources Allocation for Delivery of Personalized Services}. Grzech, Adam; {{\’S}}wi\k{a}tek, Pawel; Rygielski, Piotr; in Software Services for e-World, W. Cellary, E. Estevez (eds.) (2010). (Vol. 341) 17–28. Springer, Boston.

[ Abstract ]
[ BibTeX ]
[ EndNote ]
[ URL ]
[ Download ]

The aim of this paper is to introduce a problem of e-health services quality management. The process of delivering e-health services to users consists of two major tasks: service personalization and resources allocation. In this paper we introduce a use-cases of e-health system and distinguish services that can be offered. In order to satisfy user requirements one have to manage resources properly especially when communication conditions change (e.g. in an ambulance). An exemplary solution has been presented and conclusions for further work have been formulated.

@incollection{GrSwRy2010-IFIP,
  abstract = {The aim of this paper is to introduce a problem of e-health services quality management. The process of delivering e-health services to users consists of two major tasks: service personalization and resources allocation. In this paper we introduce a use-cases of e-health system and distinguish services that can be offered. In order to satisfy user requirements one have to manage resources properly especially when communication conditions change (e.g. in an ambulance). An exemplary solution has been presented and conclusions for further work have been formulated.},
  address = {Boston},
  author = {Grzech, Adam and {\'S}wi\k{a}tek, Pawel and Rygielski, Piotr},
  booktitle = {Software Services for e-World},
  editor = {Cellary, Wojciech and Estevez, Elsa},
  keywords = {Virtualization},
  month = 11,
  pages = {17–28},
  publisher = {Springer},
  series = {IFIP Advances in Information and Communication Technology},
  title = {{Dynamic Resources Allocation for Delivery of Personalized Services}},
  volume = 341,
  year = 2010
}

%0 Book Section
%1 GrSwRy2010-IFIP
%A Grzech, Adam
%A {{\'S}}wi\k{a}tek, Pawel
%A Rygielski, Piotr
%B Software Services for e-World
%C Boston
%D 2010
%E Cellary, Wojciech
%E Estevez, Elsa
%I Springer
%P 17--28
%T {Dynamic Resources Allocation for Delivery of Personalized Services}
%U http://dx.doi.org/10.1007/978-3-642-16283-1_6
%V 341
%X The aim of this paper is to introduce a problem of e-health services quality management. The process of delivering e-health services to users consists of two major tasks: service personalization and resources allocation. In this paper we introduce a use-cases of e-health system and distinguish services that can be offered. In order to satisfy user requirements one have to manage resources properly especially when communication conditions change (e.g. in an ambulance). An exemplary solution has been presented and conclusions for further work have been formulated.

{Wireless Network Management Through Network-Enforced Handover}. Rygielski, Piotr; {{\’S}}wi\k{a}tek, Pawe{\l}{}; in Applications of Systems Science, A. Grzech, P. {{\’S}}wi\k{a}tek, K. Brzostowski (eds.) (2010). 227–236. Exit, ul. Maszynowa 5/9, 02-392 Warszawa, Poland.

[ BibTeX ]
[ EndNote ]

@incollection{RyPs2010-ICSS-handover,
  address = {ul. Maszynowa 5/9, 02-392 Warszawa, Poland},
  author = {Rygielski, Piotr and {\'S}wi\k{a}tek, Pawe{\l}{}},
  booktitle = {Applications of Systems Science},
  editor = {Grzech, Adam and {\'S}wi\k{a}tek, Pawel and Brzostowski, Krzysztof},
  keywords = {Optimization},
  month = {09},
  pages = {227–236},
  publisher = {Exit},
  title = {{Wireless Network Management Through Network-Enforced Handover}},
  year = 2010
}

%0 Book Section
%1 RyPs2010-ICSS-handover
%A Rygielski, Piotr
%A {{\'S}}wi\k{a}tek, Pawe{\l}{}
%B Applications of Systems Science
%C ul. Maszynowa 5/9, 02-392 Warszawa, Poland
%D 2010
%E Grzech, Adam
%E {{\'S}}wi\k{a}tek, Pawel
%E Brzostowski, Krzysztof
%I Exit
%P 227--236
%T {Wireless Network Management Through Network-Enforced Handover}

{Optimal Complex Services Composition in SOA Systems}. Rygielski, Piotr; {{\’S}}wi\k{a}tek, Pawe{\l}{}; in Applications of Systems Science, A. Grzech, P. {{\’S}}wi\k{a}tek, K. Brzostowski (eds.) (2010). 217–226. Exit, ul. Maszynowa 5/9, 02-392 Warszawa, Poland.

Most Promising Student Paper Award

[ Abstract ]
[ BibTeX ]
[ EndNote ]
[ Download ]

One of the most important tasks in service oriented architecture paradigm based systems is the task of composition of the complex service. Aim of this paper is to focus on the very last phase of the composition process, where proper atomic service versions are picked to execute the whole complex service. An exact algorithm is proposed in this paper solving two tasks based on popular quality of service delivery approaches: best-effort and differentiated services. The procedure of graph reduction has been introduced to generate space of possible solutions in such way that decision is made in more efficient way. The graph-fold algorithm was tested in simulation environment where its performance was compared to five reference algorithms. Moreover ability to deliver quality at desired level has been tested.

@incollection{RyPs2010-ICSS-GF,
  abstract = {One of the most important tasks in service oriented architecture paradigm based systems is the task of composition of the complex service. Aim of this paper is to focus on the very last phase of the composition process, where proper atomic service versions are picked to execute the whole complex service. An exact algorithm is proposed in this paper solving two tasks based on popular quality of service delivery approaches: best-effort and differentiated services. The procedure of graph reduction has been introduced to generate space of possible solutions in such way that decision is made in more efficient way. The graph-fold algorithm was tested in simulation environment where its performance was compared to five reference algorithms. Moreover ability to deliver quality at desired level has been tested.},
  address = {ul. Maszynowa 5/9, 02-392 Warszawa, Poland},
  author = {Rygielski, Piotr and {\'S}wi\k{a}tek, Pawe{\l}{}},
  booktitle = {Applications of Systems Science},
  editor = {Grzech, Adam and {\'S}wi\k{a}tek, Pawel and Brzostowski, Krzysztof},
  keywords = {Optimization},
  month = {09},
  note = {<b>Most Promising Student Paper Award</b>},
  pages = {217–226},
  publisher = {Exit},
  title = {{Optimal Complex Services Composition in SOA Systems}},
  year = 2010
}

%0 Book Section
%1 RyPs2010-ICSS-GF
%A Rygielski, Piotr
%A {{\'S}}wi\k{a}tek, Pawe{\l}{}
%B Applications of Systems Science
%C ul. Maszynowa 5/9, 02-392 Warszawa, Poland
%D 2010
%E Grzech, Adam
%E {{\'S}}wi\k{a}tek, Pawel
%E Brzostowski, Krzysztof
%I Exit
%P 217--226
%T {Optimal Complex Services Composition in SOA Systems}
%X One of the most important tasks in service oriented architecture paradigm based systems is the task of composition of the complex service. Aim of this paper is to focus on the very last phase of the composition process, where proper atomic service versions are picked to execute the whole complex service. An exact algorithm is proposed in this paper solving two tasks based on popular quality of service delivery approaches: best-effort and differentiated services. The procedure of graph reduction has been introduced to generate space of possible solutions in such way that decision is made in more efficient way. The graph-fold algorithm was tested in simulation environment where its performance was compared to five reference algorithms. Moreover ability to deliver quality at desired level has been tested.

{Translations of Service Level Agreement in Systems Based on Service Oriented Architecture}. Grzech, Adam; Rygielski, Piotr; in Proceedings of the 14th International Conference on Knowledge-based and Intelligent Information and Engineering Systems (KES 2010), R. Setchi, I. Jordanov (eds.) (2010). (Vol. 6277) 523–532. Springer-Verlag, Berlin, Heidelberg.

[ Abstract ]
[ BibTeX ]
[ EndNote ]
[ URL ]
[ Download ]

The gain of the paper is to introduce and to discuss a formal specification of computer system's Service Level Agreement (SLA) and its translation into structure of complex services (composed of atomic services) delivering required functionalities and non-functionalities in distributed environment. The SLA is composed of two parts specifying quantitative and qualitative requirements. The former requirements define structure of the adequate complex services as a directed graph, where potential parallelism of atomic services performance may be taken into account. The qualitative requirements are applied to select the optimal complex service realization scenario; it is based on assumption that various atomic services distinguished in the complex services structure are available in the environment in different versions and locations. Different versions of atomic services are delivering the required functionalities and satisfy non-functionalities at various levels. Various locations of atomic services means that the time and cost of atomic services delivery (communication and calculation) may vary. Proposed model of SLA translation into complex services causes that a scenario variants may be applied, among others, to calculate upper and lower complex services delivering times and to estimate validity of possible parallelism in complex services.

@inproceedings{GrRy2010-KES,
  abstract = {The gain of the paper is to introduce and to discuss a formal specification of computer system's Service Level Agreement (SLA) and its translation into structure of complex services (composed of atomic services) delivering required functionalities and non-functionalities in distributed environment. The SLA is composed of two parts specifying quantitative and qualitative requirements. The former requirements define structure of the adequate complex services as a directed graph, where potential parallelism of atomic services performance may be taken into account. The qualitative requirements are applied to select the optimal complex service realization scenario; it is based on assumption that various atomic services distinguished in the complex services structure are available in the environment in different versions and locations. Different versions of atomic services are delivering the required functionalities and satisfy non-functionalities at various levels. Various locations of atomic services means that the time and cost of atomic services delivery (communication and calculation) may vary. Proposed model of SLA translation into complex services causes that a scenario variants may be applied, among others, to calculate upper and lower complex services delivering times and to estimate validity of possible parallelism in complex services.},
  address = {Berlin, Heidelberg},
  author = {Grzech, Adam and Rygielski, Piotr},
  booktitle = {Proceedings of the 14th International Conference on Knowledge-based and Intelligent Information and Engineering Systems (KES 2010)},
  editor = {Setchi, Rossitza and Jordanov, Ivan},
  keywords = {descartes},
  month = {09},
  pages = {523–532},
  publisher = {Springer-Verlag},
  series = {Lecture Notes in Computer Science (LNCS)},
  title = {{Translations of Service Level Agreement in Systems Based on Service Oriented Architecture}},
  volume = 6277,
  year = 2010
}

%0 Conference Paper
%1 GrRy2010-KES
%A Grzech, Adam
%A Rygielski, Piotr
%B Proceedings of the 14th International Conference on Knowledge-based and Intelligent Information and Engineering Systems (KES 2010)
%C Berlin, Heidelberg
%D 2010
%E Setchi, Rossitza
%E Jordanov, Ivan
%I Springer-Verlag
%P 523--532
%T {Translations of Service Level Agreement in Systems Based on Service Oriented Architecture}
%U http://dl.acm.org/citation.cfm?id=1885375.1885435
%V 6277
%X The gain of the paper is to introduce and to discuss a formal specification of computer system's Service Level Agreement (SLA) and its translation into structure of complex services (composed of atomic services) delivering required functionalities and non-functionalities in distributed environment. The SLA is composed of two parts specifying quantitative and qualitative requirements. The former requirements define structure of the adequate complex services as a directed graph, where potential parallelism of atomic services performance may be taken into account. The qualitative requirements are applied to select the optimal complex service realization scenario; it is based on assumption that various atomic services distinguished in the complex services structure are available in the environment in different versions and locations. Different versions of atomic services are delivering the required functionalities and satisfy non-functionalities at various levels. Various locations of atomic services means that the time and cost of atomic services delivery (communication and calculation) may vary. Proposed model of SLA translation into complex services causes that a scenario variants may be applied, among others, to calculate upper and lower complex services delivering times and to estimate validity of possible parallelism in complex services.

{QoS-aware Infrastructure Resources Allocation in Systems Based on Service-Oriented Architecture Paradigm}. Grzech, Adam; Rygielski, Piotr; {{\’S}}wi\k{a}tek, Pawel; in Performance modelling and evaluation of heterogeneous networks, 6th Working International Conference (HET-NETs 2010), T. Czach{ó}rski (ed.) (2010). 35–47. Institute of Theoretical and Applied Informatics of the Polish Academy of Sciences, Ba{l}tycka 5, 44-100 Gliwice, Poland.

[ Abstract ]
[ BibTeX ]
[ EndNote ]
[ Download ]

In this paper the task of communication and computational resources allocation in systems based on SOA paradigm is considered. The task of resources allocation consists in assigning resources to each incoming service request in such a way, that required level of the quality of service is met. Complex services performance time in distributed environment is assumed as the quality of service measure. Models of the system and analysis of service response time presented in this paper allowed to formulate several tasks of resource allocation in terms of well known quality of service assurance models: best effort, IntServ and DiffServ. For each formulated task solution algorithms were proposed and their correctness was evaluated by means of simulation.

@inproceedings{GrRySw2009-HETNETS-QoS,
  abstract = {In this paper the task of communication and computational resources allocation in systems based on SOA paradigm is considered. The task of resources allocation consists in assigning resources to each incoming service request in such a way, that required level of the quality of service is met. Complex services performance time in distributed environment is assumed as the quality of service measure. Models of the system and analysis of service response time presented in this paper allowed to formulate several tasks of resource allocation in terms of well known quality of service assurance models: best effort, IntServ and DiffServ. For each formulated task solution algorithms were proposed and their correctness was evaluated by means of simulation.},
  address = {Ba{l}tycka 5, 44-100 Gliwice, Poland},
  author = {Grzech, Adam and Rygielski, Piotr and {\'S}wi\k{a}tek, Pawel},
  booktitle = {Performance modelling and evaluation of heterogeneous networks, 6th Working International Conference (HET-NETs 2010)},
  editor = {Czach{\'o}rski, Tadeusz},
  keywords = {descartes},
  month = {01},
  pages = {35–47},
  publisher = {Institute of Theoretical and Applied Informatics of the Polish Academy of Sciences},
  title = {{QoS-aware Infrastructure Resources Allocation in Systems Based on Service-Oriented Architecture Paradigm}},
  year = 2010
}

%0 Conference Paper
%1 GrRySw2009-HETNETS-QoS
%A Grzech, Adam
%A Rygielski, Piotr
%A {{\'S}}wi\k{a}tek, Pawel
%B Performance modelling and evaluation of heterogeneous networks, 6th Working International Conference (HET-NETs 2010)
%C Ba{l}tycka 5, 44-100 Gliwice, Poland
%D 2010
%E Czach{ó}rski, Tadeusz
%I Institute of Theoretical and Applied Informatics of the Polish Academy of Sciences
%P 35--47
%T {QoS-aware Infrastructure Resources Allocation in Systems Based on Service-Oriented Architecture Paradigm}
%X In this paper the task of communication and computational resources allocation in systems based on SOA paradigm is considered. The task of resources allocation consists in assigning resources to each incoming service request in such a way, that required level of the quality of service is met. Complex services performance time in distributed environment is assumed as the quality of service measure. Models of the system and analysis of service response time presented in this paper allowed to formulate several tasks of resource allocation in terms of well known quality of service assurance models: best effort, IntServ and DiffServ. For each formulated task solution algorithms were proposed and their correctness was evaluated by means of simulation.

{Simulation Environment for Delivering Quality of Service in Systems Based on Service-Oriented Architecture Paradigm}. Grzech, Adam; Rygielski, Piotr; {{\’S}}wi\k{a}tek, Pawel; in Performance modeling and evaluation of heterogeneous networks, 6th Working International Conference (HET-NETs 2010), T. Czach{ó}rski (ed.) (2010). 89–97. Institute of Theoretical and Applied Informatics of the Polish Academy of Sciences, Ba{l}tycka 5, 44-100 Gliwice, Poland.

[ Abstract ]
[ BibTeX ]
[ EndNote ]
[ Download ]

In this paper a model of complex service in service-oriented architecture (SOA) system is presented. A complex service is composed with a set of atomic services. Each atomic service is characterized with its own non-functional parameters what allows to formulate quality of service optimization tasks. A simulation environment has been developed to allow experiments execution to determine quality of service (QoS) of composed service.

@inproceedings{GrRySw2009-HETNETS-sim,
  abstract = {In this paper a model of complex service in service-oriented architecture (SOA) system is presented. A complex service is composed with a set of atomic services. Each atomic service is characterized with its own non-functional parameters what allows to formulate quality of service optimization tasks. A simulation environment has been developed to allow experiments execution to determine quality of service (QoS) of composed service.},
  address = {Ba{l}tycka 5, 44-100 Gliwice, Poland},
  author = {Grzech, Adam and Rygielski, Piotr and {\'S}wi\k{a}tek, Pawel},
  booktitle = {Performance modeling and evaluation of heterogeneous networks, 6th Working International Conference (HET-NETs 2010)},
  editor = {Czach{\'o}rski, Tadeusz},
  keywords = {descartes},
  month = {01},
  pages = {89–97},
  publisher = {Institute of Theoretical and Applied Informatics of the Polish Academy of Sciences},
  title = {{Simulation Environment for Delivering Quality of Service in Systems Based on Service-Oriented Architecture Paradigm}},
  year = 2010
}

%0 Conference Paper
%1 GrRySw2009-HETNETS-sim
%A Grzech, Adam
%A Rygielski, Piotr
%A {{\'S}}wi\k{a}tek, Pawel
%B Performance modeling and evaluation of heterogeneous networks, 6th Working International Conference (HET-NETs 2010)
%C Ba{l}tycka 5, 44-100 Gliwice, Poland
%D 2010
%E Czach{ó}rski, Tadeusz
%I Institute of Theoretical and Applied Informatics of the Polish Academy of Sciences
%P 89--97
%T {Simulation Environment for Delivering Quality of Service in Systems Based on Service-Oriented Architecture Paradigm}
%X In this paper a model of complex service in service-oriented architecture (SOA) system is presented. A complex service is composed with a set of atomic services. Each atomic service is characterized with its own non-functional parameters what allows to formulate quality of service optimization tasks. A simulation environment has been developed to allow experiments execution to determine quality of service (QoS) of composed service.

{QoS-aware Complex Service Composition in SOA-based Systems}. Grzech, Adam; Rygielski, Piotr; {{\’S}}wi\k{a}tek, Pawel; in SOA Infrastructure Tools: Concepts and Methods, S. Ambroszkiewicz, J. Brzezi{ń}ski, W. Cellary, A. Grzech, K. Zieli{{\"n}}ski (eds.) (2010). 289–312. Pozna{ń} University of Economics Press, Pozna{ń}, Poland.

[ Abstract ]
[ BibTeX ]
[ EndNote ]
[ Download ]

In this work, a method for the QoS-aware complex service composition in SOA-based systems is presented. The considered complex service composition process consists of three stages: complex service structure, scenario and plan composition. Complex service structure contains a set of required functionalities and precedence relations between them, and is derived directly from a service level agreement. Service scenario is derived from service structure by choosing the optimal (in the sense of certain quality criterion) order of execution of required functionalities. Finally, a service plan emerges from a scenario by choosing the best versions of atomic services for the delivery of required functionalities. For such distinguished composition process methods for complex service scenario and execution plan optimization are proposed. Optimization of a complex service scenario is based on the analysis of possible parallel executions of required functionalities. In order to deliver required level of the quality of service, well known QoS assurance models (i.e.: best effort, integrated services and differentiated services) are applied in the process of complex service execution plan optimization.

@incollection{GrRySw2010-SOAbook,
  abstract = {In this work, a method for the QoS-aware complex service composition in SOA-based systems is presented. The considered complex service composition process consists of three stages: complex service structure, scenario and plan composition. Complex service structure contains a set of required functionalities and precedence relations between them, and is derived directly from a service level agreement. Service scenario is derived from service structure by choosing the optimal (in the sense of certain quality criterion) order of execution of required functionalities. Finally, a service plan emerges from a scenario by choosing the best versions of atomic services for the delivery of required functionalities. For such distinguished composition process methods for complex service scenario and execution plan optimization are proposed. Optimization of a complex service scenario is based on the analysis of possible parallel executions of required functionalities. In order to deliver required level of the quality of service, well known QoS assurance models (i.e.: best effort, integrated services and differentiated services) are applied in the process of complex service execution plan optimization.},
  address = {Pozna{\'n}, Poland},
  author = {Grzech, Adam and Rygielski, Piotr and {\'S}wi\k{a}tek, Pawel},
  booktitle = {SOA Infrastructure Tools: Concepts and Methods},
  editor = {Ambroszkiewicz, Stanislaw and Brzezi{\'n}ski, Jerzy and Cellary, Wojciech and Grzech, Adam and Zieli{\"n}ski, Krzysztof},
  keywords = {descartes},
  pages = {289–312},
  publisher = {Pozna{\'n} University of Economics Press},
  title = {{QoS-aware Complex Service Composition in SOA-based Systems}},
  year = 2010
}

%0 Book Section
%1 GrRySw2010-SOAbook
%A Grzech, Adam
%A Rygielski, Piotr
%A {{\'S}}wi\k{a}tek, Pawel
%B SOA Infrastructure Tools: Concepts and Methods
%C Pozna{ń}, Poland
%D 2010
%E Ambroszkiewicz, Stanislaw
%E Brzezi{ń}ski, Jerzy
%E Cellary, Wojciech
%E Grzech, Adam
%E Zieli{{\"n}}ski, Krzysztof
%I Pozna{ń} University of Economics Press
%P 289--312
%T {QoS-aware Complex Service Composition in SOA-based Systems}
%X In this work, a method for the QoS-aware complex service composition in SOA-based systems is presented. The considered complex service composition process consists of three stages: complex service structure, scenario and plan composition. Complex service structure contains a set of required functionalities and precedence relations between them, and is derived directly from a service level agreement. Service scenario is derived from service structure by choosing the optimal (in the sense of certain quality criterion) order of execution of required functionalities. Finally, a service plan emerges from a scenario by choosing the best versions of atomic services for the delivery of required functionalities. For such distinguished composition process methods for complex service scenario and execution plan optimization are proposed. Optimization of a complex service scenario is based on the analysis of possible parallel executions of required functionalities. In order to deliver required level of the quality of service, well known QoS assurance models (i.e.: best effort, integrated services and differentiated services) are applied in the process of complex service execution plan optimization.

{Graph-fold: an Efficient Method for Complex Service Execution Plan Optimization}. Rygielski, Piotr; {{\’S}}wi\k{a}tek, Pawel; in Systems Science (2010). 36(3) 25–32. Wroclaw University of Technology Press, Wroclaw, Poland.

[ Abstract ]
[ BibTeX ]
[ EndNote ]
[ URL ]
[ Download ]

The task of optimization of the complex service execution plan is the last stage of the process of complex services composition in systems based on the SOA paradigm. In general this task consists of choosing proper versions of atomic services, delivering requested functionalities, such that non-functional requirements for complex service are satisfied. In most real-life cases this task is reduced to the problem of multidimensional knapsack problem (MKP), which is known to be NP-hard. Therefore, in order to facilitate effective complex service composition, it is crucial to provide an efficient MKP solution algorithm. In this paper a novel approach to the problem of optimization of complex service execution plan is introduced. In the proposed approach the MKP feasible solution space is constructed in such a way, that the optimal solution can be found in constant time. Of course, since MKP is NP-hard, the process of solution space construction takes an exponential time, This time, however, is amortized by multiple usages of single solution space for determination of optimal execution plans for multiple complex service requests.

@article{RySw2010-SS,
  abstract = {The task of optimization of the complex service execution plan is the last stage of the process of complex services composition in systems based on the SOA paradigm. In general this task consists of choosing proper versions of atomic services, delivering requested functionalities, such that non-functional requirements for complex service are satisfied. In most real-life cases this task is reduced to the problem of multidimensional knapsack problem (MKP), which is known to be NP-hard. Therefore, in order to facilitate effective complex service composition, it is crucial to provide an efficient MKP solution algorithm. In this paper a novel approach to the problem of optimization of complex service execution plan is introduced. In the proposed approach the MKP feasible solution space is constructed in such a way, that the optimal solution can be found in constant time. Of course, since MKP is NP-hard, the process of solution space construction takes an exponential time, This time, however, is amortized by multiple usages of single solution space for determination of optimal execution plans for multiple complex service requests.},
  address = {Wroclaw, Poland},
  author = {Rygielski, Piotr and {\'S}wi\k{a}tek, Pawel},
  journal = {Systems Science},
  keywords = {Optimization},
  number = 3,
  pages = {25–32},
  publisher = {Wroclaw University of Technology Press},
  title = {{Graph-fold: an Efficient Method for Complex Service Execution Plan Optimization}},
  volume = 36,
  year = 2010
}

%0 Journal Article
%1 RySw2010-SS
%A Rygielski, Piotr
%A {{\'S}}wi\k{a}tek, Pawel
%C Wroclaw, Poland
%D 2010
%I Wroclaw University of Technology Press
%J Systems Science
%N 3
%P 25--32
%T {Graph-fold: an Efficient Method for Complex Service Execution Plan Optimization}
%U http://linksource.ebsco.com/linking.aspx?issn=0137-1223&volume=36&spage=25
%V 36
%X The task of optimization of the complex service execution plan is the last stage of the process of complex services composition in systems based on the SOA paradigm. In general this task consists of choosing proper versions of atomic services, delivering requested functionalities, such that non-functional requirements for complex service are satisfied. In most real-life cases this task is reduced to the problem of multidimensional knapsack problem (MKP), which is known to be NP-hard. Therefore, in order to facilitate effective complex service composition, it is crucial to provide an efficient MKP solution algorithm. In this paper a novel approach to the problem of optimization of complex service execution plan is introduced. In the proposed approach the MKP feasible solution space is constructed in such a way, that the optimal solution can be found in constant time. Of course, since MKP is NP-hard, the process of solution space construction takes an exponential time, This time, however, is amortized by multiple usages of single solution space for determination of optimal execution plans for multiple complex service requests.

{Adaptive Packet Scheduling for Requests Delay Guaranties in Packet-Switched Communication Network}. Grzech, Adam; {{\’S}}wi\k{a}tek, Pawel; Rygielski, Piotr; in Systems Science (2010). 36(1) 7–12. Wroclaw University of Technology Press, Wroclaw, Poland.

[ Abstract ]
[ BibTeX ]
[ EndNote ]
[ URL ]
[ Download ]

In this paper the problem of packet scheduling in the node of packet-switched computer communication network is considered. Packet scheduling in the network edge nodes is one of the crucial mechanisms essential for delivery of required level of quality of end-to-end network services (QoS). In order to satisfy QoS guaranties for each incoming request belonging to one of distinguished traffic classes, packet scheduling algorithm must make decisions based on current state of the scheduling system (e.g. buffer lengths) and actual characteristics of the serviced traffic (e.g.: lengths of connections following requests, packet intensities within requests, etc.). The paper is devoted to propose a new packet scheduling algorithm based on Weighted Round Robin (WRR), which weights are adapted according to changes of networkÂ’s load and traffic characteristics. By means of computer simulation, on representative examples, it was shown, that utilization of additional knowledge about incoming traffic in the process of packet scheduling may improve QoS guaranties for serviced traffic.

@article{GrSwRy2010-SS,
  abstract = {In this paper the problem of packet scheduling in the node of packet-switched computer communication network is considered. Packet scheduling in the network edge nodes is one of the crucial mechanisms essential for delivery of required level of quality of end-to-end network services (QoS). In order to satisfy QoS guaranties for each incoming request belonging to one of distinguished traffic classes, packet scheduling algorithm must make decisions based on current state of the scheduling system (e.g. buffer lengths) and actual characteristics of the serviced traffic (e.g.: lengths of connections following requests, packet intensities within requests, etc.). The paper is devoted to propose a new packet scheduling algorithm based on Weighted Round Robin (WRR), which weights are adapted according to changes of networkÂ’s load and traffic characteristics. By means of computer simulation, on representative examples, it was shown, that utilization of additional knowledge about incoming traffic in the process of packet scheduling may improve QoS guaranties for serviced traffic.},
  address = {Wroclaw, Poland},
  author = {Grzech, Adam and {\'S}wi\k{a}tek, Pawel and Rygielski, Piotr},
  journal = {Systems Science},
  keywords = {t_journalmagazine},
  number = 1,
  pages = {7–12},
  publisher = {Wroclaw University of Technology Press},
  title = {{Adaptive Packet Scheduling for Requests Delay Guaranties in Packet-Switched Communication Network}},
  volume = 36,
  year = 2010
}

%0 Journal Article
%1 GrSwRy2010-SS
%A Grzech, Adam
%A {{\'S}}wi\k{a}tek, Pawel
%A Rygielski, Piotr
%C Wroclaw, Poland
%D 2010
%I Wroclaw University of Technology Press
%J Systems Science
%N 1
%P 7--12
%T {Adaptive Packet Scheduling for Requests Delay Guaranties in Packet-Switched Communication Network}
%U http://linksource.ebsco.com/linking.aspx?issn=0137-1223&volume=36&spage=7
%V 36
%X In this paper the problem of packet scheduling in the node of packet-switched computer communication network is considered. Packet scheduling in the network edge nodes is one of the crucial mechanisms essential for delivery of required level of quality of end-to-end network services (QoS). In order to satisfy QoS guaranties for each incoming request belonging to one of distinguished traffic classes, packet scheduling algorithm must make decisions based on current state of the scheduling system (e.g. buffer lengths) and actual characteristics of the serviced traffic (e.g.: lengths of connections following requests, packet intensities within requests, etc.). The paper is devoted to propose a new packet scheduling algorithm based on Weighted Round Robin (WRR), which weights are adapted according to changes of networkÂ’s load and traffic characteristics. By means of computer simulation, on representative examples, it was shown, that utilization of additional knowledge about incoming traffic in the process of packet scheduling may improve QoS guaranties for serviced traffic.

{Improving QoS Guaranties via Adaptive Packet Scheduling}. Grzech, Adam; {{\’S}}wi\k{a}tek, Pawel; Rygielski, Piotr; in Proceedings of the 16th Polish Teletraffic Symposium (PTS 2009) (2009). 53–56. Technical University of \L{}{ó}d{{\’Z}}.

Young Author Best Paper Award

[ Abstract ]
[ BibTeX ]
[ EndNote ]
[ Download ]

In this paper the problem of packet scheduling in the node of packet-switched computer communication network is considered. Packet scheduling in the network node is one of the crucial mechanisms essential for delivery of required level of quality of services (QoS). In order to satisfy QoS guaranties for each connection belonging to one of distinguished traffic classes, packet scheduling algorithm must make decisions basing on current state of the scheduling system (e.g. buffer lengths) and actual characteristics of the serviced traffic (e.g.: connections lengths, packet intensities within connections, etc.). Here we propose a new packet scheduling algorithm based on Weighted Round Robin (WRR), which weights are adapted according to changes of system and traffic characteristics. By means of computer simulation, on representative examples, we show, that utilization of additional knowledge in the process of packet scheduling may improve QoS guaranties for serviced traffic.

@inproceedings{GrSwRy2009-PTS,
  abstract = {In this paper the problem of packet scheduling in the node of packet-switched computer communication network is considered. Packet scheduling in the network node is one of the crucial mechanisms essential for delivery of required level of quality of services (QoS). In order to satisfy QoS guaranties for each connection belonging to one of distinguished traffic classes, packet scheduling algorithm must make decisions basing on current state of the scheduling system (e.g. buffer lengths) and actual characteristics of the serviced traffic (e.g.: connections lengths, packet intensities within connections, etc.). Here we propose a new packet scheduling algorithm based on Weighted Round Robin (WRR), which weights are adapted according to changes of system and traffic characteristics. By means of computer simulation, on representative examples, we show, that utilization of additional knowledge in the process of packet scheduling may improve QoS guaranties for serviced traffic.},
  author = {Grzech, Adam and {\'S}wi\k{a}tek, Pawel and Rygielski, Piotr},
  booktitle = {Proceedings of the 16th Polish Teletraffic Symposium (PTS 2009)},
  keywords = {Isolation},
  month = {09},
  note = {<b>Young Author Best Paper Award</b>},
  organization = {Technical University of \L{}{\'o}d{\'Z}},
  pages = {53–56},
  title = {{Improving QoS Guaranties via Adaptive Packet Scheduling}},
  year = 2009
}

%0 Conference Paper
%1 GrSwRy2009-PTS
%A Grzech, Adam
%A {{\'S}}wi\k{a}tek, Pawel
%A Rygielski, Piotr
%B Proceedings of the 16th Polish Teletraffic Symposium (PTS 2009)
%D 2009
%P 53--56
%T {Improving QoS Guaranties via Adaptive Packet Scheduling}
%X In this paper the problem of packet scheduling in the node of packet-switched computer communication network is considered. Packet scheduling in the network node is one of the crucial mechanisms essential for delivery of required level of quality of services (QoS). In order to satisfy QoS guaranties for each connection belonging to one of distinguished traffic classes, packet scheduling algorithm must make decisions basing on current state of the scheduling system (e.g. buffer lengths) and actual characteristics of the serviced traffic (e.g.: connections lengths, packet intensities within connections, etc.). Here we propose a new packet scheduling algorithm based on Weighted Round Robin (WRR), which weights are adapted according to changes of system and traffic characteristics. By means of computer simulation, on representative examples, we show, that utilization of additional knowledge in the process of packet scheduling may improve QoS guaranties for serviced traffic.

{Twostage Packet Scheduling in the Network Node}. Grzech, Adam; {{\’S}}wi\k{a}tek, Pawel; Rygielski, Piotr; in Proceedings of Twentieth International Conference on Systems Engineering, (ICSE 2009), K. J. Burnham, O. C. L. Haas (eds.) (2009). 181–184. Coventry University Press.

[ Abstract ]
[ BibTeX ]
[ EndNote ]
[ Download ]

In this paper the problem of two-stage packet scheduling on parallel processors is considered. It is assumed, that each processor schedules packets according to Weighted Round Robin (WRR) rule. In order to deliver required level of the quality of service (QoS) weights of local WRR algorithms are adapted such that QoS requirements are met for all distinguished traffic classes. Adaptation of WRR weights relies on the adaptation through identification (Bubnicki, 2005) methodology with the diagonal recurrent neural network (DRNN) applied as the model of QoS parameters. Simulation study of the performance of proposed scheduling methodology shows, that it can deliver better QoS guaranties and higher systems throughput than commonly used reference algorithms.

@inproceedings{GrSwRy2009-ICSE,
  abstract = {In this paper the problem of two-stage packet scheduling on parallel processors is considered. It is assumed, that each processor schedules packets according to Weighted Round Robin (WRR) rule. In order to deliver required level of the quality of service (QoS) weights of local WRR algorithms are adapted such that QoS requirements are met for all distinguished traffic classes. Adaptation of WRR weights relies on the adaptation through identification (Bubnicki, 2005) methodology with the diagonal recurrent neural network (DRNN) applied as the model of QoS parameters. Simulation study of the performance of proposed scheduling methodology shows, that it can deliver better QoS guaranties and higher systems throughput than commonly used reference algorithms.},
  author = {Grzech, Adam and {\'S}wi\k{a}tek, Pawel and Rygielski, Piotr},
  booktitle = {Proceedings of Twentieth International Conference on Systems Engineering, (ICSE 2009)},
  editor = {Burnham, Keith J. and Haas, Olivier C. L.},
  keywords = {descartes},
  month = {09},
  pages = {181–184},
  publisher = {Coventry University Press},
  title = {{Twostage Packet Scheduling in the Network Node}},
  year = 2009
}

%0 Conference Paper
%1 GrSwRy2009-ICSE
%A Grzech, Adam
%A {{\'S}}wi\k{a}tek, Pawel
%A Rygielski, Piotr
%B Proceedings of Twentieth International Conference on Systems Engineering, (ICSE 2009)
%D 2009
%E Burnham, Keith J.
%E Haas, Olivier C. L.
%I Coventry University Press
%P 181--184
%T {Twostage Packet Scheduling in the Network Node}
%X In this paper the problem of two-stage packet scheduling on parallel processors is considered. It is assumed, that each processor schedules packets according to Weighted Round Robin (WRR) rule. In order to deliver required level of the quality of service (QoS) weights of local WRR algorithms are adapted such that QoS requirements are met for all distinguished traffic classes. Adaptation of WRR weights relies on the adaptation through identification (Bubnicki, 2005) methodology with the diagonal recurrent neural network (DRNN) applied as the model of QoS parameters. Simulation study of the performance of proposed scheduling methodology shows, that it can deliver better QoS guaranties and higher systems throughput than commonly used reference algorithms.

{Software implementation of the simulation environment of the system for multistage parallel processing of teletraffic in the node of the packet-switched network for traffic control algorithms performance analysis purposes.}. Rygielski, Piotr; (2009, July). Wroclaw University of Technology, Wybrze{\.z}e Wyspia{ń}skiego 27, 50-370 Wroclaw, Poland.

The work is written in Polish language.

[ Abstract ]
[ BibTeX ]
[ EndNote ]
[ Download ]

In this thesis, the problem of controlling network traffic for guaranteeing demanded Quality of Service level was presented. An architecture for network node with parallel processing units was considered and exemplary problems of teletraffic control were formulated. The process of service is a multistage process. A simulation environment was designed and developed for the needs of quantitatively analysis of control algorithms placed on the node. There were load balancing and packet scheduling algorithms implemented. Exemplary simulations were run to present functionality of environment and the way, users should implement their own, new algorithms was presented. At the end, the work was summarised and the future work plans were presented.

@mastersthesis{rygielski2009a,
  abstract = {In this thesis, the problem of controlling network traffic for guaranteeing demanded Quality of Service level was presented. An architecture for network node with parallel processing units was considered and exemplary problems of teletraffic control were formulated. The process of service is a multistage process. A simulation environment was designed and developed for the needs of quantitatively analysis of control algorithms placed on the node. There were load balancing and packet scheduling algorithms implemented. Exemplary simulations were run to present functionality of environment and the way, users should implement their own, new algorithms was presented. At the end, the work was summarised and the future work plans were presented.},
  address = {Wybrze{\.z}e Wyspia{\'n}skiego 27, 50-370 Wroclaw, Poland},
  author = {Rygielski, Piotr},
  keywords = {descartes},
  month = {07},
  note = {The work is written in Polish language.},
  school = {Wroclaw University of Technology},
  title = {{Software implementation of the simulation environment of the system for multistage parallel processing of teletraffic in the node of the packet-switched network for traffic control algorithms performance analysis purposes.}},
  year = 2009
}

%0 Thesis
%1 rygielski2009a
%A Rygielski, Piotr
%C Wybrze{\.z}e Wyspia{ń}skiego 27, 50-370 Wroclaw, Poland
%D 2009
%T {Software implementation of the simulation environment of the system for multistage parallel processing of teletraffic in the node of the packet-switched network for traffic control algorithms performance analysis purposes.}
%X In this thesis, the problem of controlling network traffic for guaranteeing demanded Quality of Service level was presented. An architecture for network node with parallel processing units was considered and exemplary problems of teletraffic control were formulated. The process of service is a multistage process. A simulation environment was designed and developed for the needs of quantitatively analysis of control algorithms placed on the node. There were load balancing and packet scheduling algorithms implemented. Exemplary simulations were run to present functionality of environment and the way, users should implement their own, new algorithms was presented. At the end, the work was summarised and the future work plans were presented.

Publications of Piotr Rygielski

Publications

Data privacy protection

Data privacy protection

Picture credits