2020

1. Office Occupancy Detection based on Power Meters and BLE Beaconing (A. Rizky Pratama), University of Groningen, 2020.

   BibTeX

   
   @phdthesis{Pratama2020:thesis, title = "Office Occupancy Detection based on Power Meters and BLE Beaconing", author = "A. Rizky Pratama", year = "2020", doi = "10.33612/diss.147276967", language = "English", publisher = "University of Groningen", school = "University of Groningen", url = "https://www.rug.nl/research/portal/files/147276969/Complete_thesis.pdf" }

   ---

   urldoi
2. Optimization of energy distribution in smart grids (A. Sha), University of Groningen, 2020.

   BibTeX

   
   @phdthesis{Sha2020:thesis, title = "Optimization of energy distribution in smart grids", author = "A. Sha", year = "2020", language = "English", isbn = "978-94-034-2341-8", publisher = "University of Groningen", school = "University of Groningen", url = "https://www.rug.nl/research/portal/files/119593412/Complete_thesis.pdf" }

   ---

   url
3. Unsupervised approach towards analysing the public transport bunching swings formation phenomenon (V. Degeler, L. Heydenrijk-Ottens, D. Luo, van N. Oort and H. van Lint), In Public Transport, 2020.

   BibTeX

   
   @Article{Degeler2020, author={V. Degeler and L. Heydenrijk-Ottens and D. Luo and van N. Oort and H. van Lint}, title={Unsupervised approach towards analysing the public transport bunching swings formation phenomenon}, journal={Public Transport}, year={2020}, month={Sep}, day={07}, issn={1613-7159}, doi={10.1007/s12469-020-00251-z}, url={https://doi.org/10.1007/s12469-020-00251-z} }

   ---

   urldoi
4. Prediction-Based Underutilized and Destination Host Selection Approaches for Energy-Efficient Dynamic VM Consolidation in Data Centers (K. Haghshenas and S. Mohammadi), In The Journal of Supercomputing, 2020.

   Abstract

   Improving the energy efficiency while guaranteeing quality of services (QoS) is one of the main challenges of efficient resource management of large-scale data centers. Dynamic virtual machine (VM) consolidation is a promising approach that aims to reduce the energy consumption by reallocating VMs to hosts dynamically. Previous works mostly have considered only the current utilization of resources in the dynamic VM consolidation procedure, which imposes unnecessary migrations and host power mode transitions. Moreover, they select the destinations of VM migrations with conservative approaches to keep the service-level agreements , which is not in line with packing VMs on fewer physical hosts. In this paper, we propose a regression-based approach that predicts the resource utilization of the VMs and hosts based on their historical data and uses the predictions in different problems of the whole process. Predicting future utilization provides the opportunity of selecting the host with higher utilization for the destination of a VM migration, which leads to a better VMs placement from the viewpoint of VM consolidation. Results show that our proposed approach reduces the energy consumption of the modeled data center by up to 38% compared to other works in the area, guaranteeing the same QoS. Moreover, the results show a better scalability than all other approaches. Our proposed approach improves the energy efficiency even for the largest simulated benchmarks and takes less than 5% time overhead to execute for a data center with 7600 physical hosts.

   ---

   BibTeX

   
   @article{haghshenas2020:js, title = "Prediction-Based Underutilized and Destination Host Selection Approaches for Energy-Efficient Dynamic VM Consolidation in Data Centers", abstract = "Improving the energy efficiency while guaranteeing quality of services (QoS) is one of the main challenges of efficient resource management of large-scale data centers. Dynamic virtual machine (VM) consolidation is a promising approach that aims to reduce the energy consumption by reallocating VMs to hosts dynamically. Previous works mostly have considered only the current utilization of resources in the dynamic VM consolidation procedure, which imposes unnecessary migrations and host power mode transitions. Moreover, they select the destinations of VM migrations with conservative approaches to keep the service-level agreements , which is not in line with packing VMs on fewer physical hosts. In this paper, we propose a regression-based approach that predicts the resource utilization of the VMs and hosts based on their historical data and uses the predictions in different problems of the whole process. Predicting future utilization provides the opportunity of selecting the host with higher utilization for the destination of a VM migration, which leads to a better VMs placement from the viewpoint of VM consolidation. Results show that our proposed approach reduces the energy consumption of the modeled data center by up to 38% compared to other works in the area, guaranteeing the same QoS. Moreover, the results show a better scalability than all other approaches. Our proposed approach improves the energy efficiency even for the largest simulated benchmarks and takes less than 5% time overhead to execute for a data center with 7600 physical hosts.", author = "K. Haghshenas and S. Mohammadi", year = "2020", month = mar, url = "https://link.springer.com/article/10.1007/s11227-020-03248-4", language = "English", journal = "The Journal of Supercomputing", }

   ---

   url
5. Efficient conditional compliance checking of business process models (H. Groefsema, N.R.T.P. van Beest and A. Armas-Cervantes), In Computers in Industry, ELSEVIER SCIENCE BV, volume 115, 2020.

   Abstract

   When checking compliance of business processes against a set of business rules or regulations, the ability to handle and verify conditions in both the model and the rules is essential. Existing design-time verification approaches, however, either completely lack support for the verification of conditions or propose costly verification methods that also consider the full data perspective. This paper proposes a novel light-weight verification method, which is preferable over expensive approaches that include the data perspective when considering structural properties of a business process model. This novel approach generates partial models that capture only relevant execution states to the conditions under investigation. The resulting model can be verified using existing model checking techniques. The computation of such partial models fully abstracts conditions from the full models and specifications, thus avoiding the analysis of the full data perspective. The proposed method is complete with respect to the analyzed execution paths, while significantly reducing the state space complexity by pruning unreachable states given the conditions under investigation. This approach offers the ability to check if a process is compliant with rules and regulations on a much more fine-grained level, and it enables a more precise formulation of the conditions that should and should not hold in the processes. The approach is particularly useful in dynamic environments where processes are constantly changing and efficient conditional compliance checking is a necessity. The approach – implemented in Java and publicly available – is evaluated in terms of performance and practicability, and tested over both synthetic datasets and a real-life case from the Australian telecommunications sector.

   
   Keywords: Business process models, Formal verification, Conditional compliance, Data perspective, Temporal logic

   ---

   BibTeX

   
   @article{groefsema2020:cii, title = "Efficient conditional compliance checking of business process models", abstract = "When checking compliance of business processes against a set of business rules or regulations, the ability to handle and verify conditions in both the model and the rules is essential. Existing design-time verification approaches, however, either completely lack support for the verification of conditions or propose costly verification methods that also consider the full data perspective. This paper proposes a novel light-weight verification method, which is preferable over expensive approaches that include the data perspective when considering structural properties of a business process model. This novel approach generates partial models that capture only relevant execution states to the conditions under investigation. The resulting model can be verified using existing model checking techniques. The computation of such partial models fully abstracts conditions from the full models and specifications, thus avoiding the analysis of the full data perspective. The proposed method is complete with respect to the analyzed execution paths, while significantly reducing the state space complexity by pruning unreachable states given the conditions under investigation. This approach offers the ability to check if a process is compliant with rules and regulations on a much more fine-grained level, and it enables a more precise formulation of the conditions that should and should not hold in the processes. The approach is particularly useful in dynamic environments where processes are constantly changing and efficient conditional compliance checking is a necessity. The approach – implemented in Java and publicly available – is evaluated in terms of performance and practicability, and tested over both synthetic datasets and a real-life case from the Australian telecommunications sector.", keywords = "Business process models, Formal verification, Conditional compliance, Data perspective, Temporal logic", author = "H. Groefsema and N.R.T.P. {van Beest} and A. Armas-Cervantes", year = "2020", month = feb, doi = "10.1016/j.compind.2019.103181", url = "https://research.rug.nl/en/publications/efficient-conditional-compliance-checking-of-business-process-mod", pdf = "https://pure.rug.nl/ws/portalfiles/portal/128588560/1_s2.0_S0166361519303549_main.pdf", language = "English", volume = "115", journal = "Computers in Industry", issn = "0166-3615", publisher = "ELSEVIER SCIENCE BV", }

   ---

   urlpdfdoi
6. Infrastructure Aware Heterogeneous-Workloads Scheduling for Data Center Energy Cost Minimization (K. Haghshenas, S. Taheri, M. Goudarzi and S. Mohammadi), In IEEE Transactions on Cloud Computing, volume 10, 2020.

   Abstract

   A huge amount of energy consumption, the cost of this usage and environmental effects have become serious issues for commercial cloud providers. Solar energy is a promising clean energy source, to provide some portion of the Internet data center's (IDC's) energy usage which can reduce environmental effects and total energy costs. Moreover, due to the high energy consumption of the cooling system, considering cooling power in job scheduling can provide efficient solutions to reduce total energy consumption. In this article, we investigate the problem of minimizing the energy cost of an IDC and propose an algorithm which schedules heterogeneous IDC workloads, by considering available renewable energy, cooling subsystem, and electricity rate structure. We evaluate the effectiveness and feasibility of our algorithm using real and synthetic workload traces. The simulation results illustrate how our proposed solution reduces the data center's energy cost by up to 46 percent compared to previous solutions. Moreover, results show that our solution is capable of reducing energy cost of data centers under different weather conditions, and rate structures.

   ---

   BibTeX

   
   @article{haghshenas2020:tcc, title = "Infrastructure Aware Heterogeneous-Workloads Scheduling for Data Center Energy Cost Minimization", abstract = "A huge amount of energy consumption, the cost of this usage and environmental effects have become serious issues for commercial cloud providers. Solar energy is a promising clean energy source, to provide some portion of the Internet data center's (IDC's) energy usage which can reduce environmental effects and total energy costs. Moreover, due to the high energy consumption of the cooling system, considering cooling power in job scheduling can provide efficient solutions to reduce total energy consumption. In this article, we investigate the problem of minimizing the energy cost of an IDC and propose an algorithm which schedules heterogeneous IDC workloads, by considering available renewable energy, cooling subsystem, and electricity rate structure. We evaluate the effectiveness and feasibility of our algorithm using real and synthetic workload traces. The simulation results illustrate how our proposed solution reduces the data center's energy cost by up to 46 percent compared to previous solutions. Moreover, results show that our solution is capable of reducing energy cost of data centers under different weather conditions, and rate structures.", author = "K. Haghshenas and S. Taheri and M. Goudarzi and S. Mohammadi", year = "2020", month = feb, doi = "10.1109/TCC.2020.2977040", url = "https://ieeexplore.ieee.org/abstract/document/9017981", language = "English", volume = "10", pages = "972--983", journal = "IEEE Transactions on Cloud Computing", }

   ---

   urldoi
7. Prediction of academic performance at undergraduate graduation: Course grades or grade point average? (Ahmet Emin Tatar and Dilek Düştegör), In Applied Sciences (Switzerland), volume 10, 2020.

   Abstract

   Predicting the academic standing of a student at the graduation time can be very useful, for example, in helping institutions select among candidates, or in helping potentially weak students in overcoming educational challenges. Most studies use individual course grades to represent college performance, with a recent trend towards using grade point average (GPA) per semester. It is unknown however which of these representations can yield the best predictive power, due to the lack of a comparative study. To answer this question, a case study is conducted that generates two sets of classification models, using respectively individual course grades and GPAs. Comprehensive sets of experiments are conducted, spanning different student data, using several well-known machine learning algorithms, and trying various prediction window sizes. Results show that using course grades yields better accuracy if the prediction is done before the third term, whereas using GPAs achieves better accuracy otherwise. Most importantly, variance analysis on the experiment results reveals interesting insights easily generalizable: individual course grades with short prediction window induces noise, and using GPAs with long prediction window causes over-simplification. The demonstrated analytical approach can be applied to any dataset to determine when to use which college performance representation for enhanced prediction.

   ---

   BibTeX

   
   @article{Tatar2020, abstract = {Predicting the academic standing of a student at the graduation time can be very useful, for example, in helping institutions select among candidates, or in helping potentially weak students in overcoming educational challenges. Most studies use individual course grades to represent college performance, with a recent trend towards using grade point average (GPA) per semester. It is unknown however which of these representations can yield the best predictive power, due to the lack of a comparative study. To answer this question, a case study is conducted that generates two sets of classification models, using respectively individual course grades and GPAs. Comprehensive sets of experiments are conducted, spanning different student data, using several well-known machine learning algorithms, and trying various prediction window sizes. Results show that using course grades yields better accuracy if the prediction is done before the third term, whereas using GPAs achieves better accuracy otherwise. Most importantly, variance analysis on the experiment results reveals interesting insights easily generalizable: individual course grades with short prediction window induces noise, and using GPAs with long prediction window causes over-simplification. The demonstrated analytical approach can be applied to any dataset to determine when to use which college performance representation for enhanced prediction.}, author = {Ahmet Emin Tatar and Dilek Düştegör}, doi = {10.3390/app10144967}, issn = {20763417}, issue = {14}, journal = {Applied Sciences (Switzerland)}, title = {Prediction of academic performance at undergraduate graduation: Course grades or grade point average?}, volume = {10}, year = {2020}, }

   ---

   doi
8. The Internet of Everything: Smart things and their impact on business models (D. J. Langley, J. van Doorn, I. C. L. Ng, S. Stieglitz, A. Lazovik and A. Boonstra), In Journal of Business Research, 2020.

   BibTeX

   
   @article{Langley2020, title = "The Internet of Everything: Smart things and their impact on business models", journal = "Journal of Business Research", year = "2020", issn = "0148-2963", doi = "https://doi.org/10.1016/j.jbusres.2019.12.035", url = "http://www.sciencedirect.com/science/article/pii/S014829631930801X", author = "D. J. Langley and J. van Doorn and I. C. L. Ng and S. Stieglitz and A. Lazovik and A. Boonstra" }

   ---

   urldoi
9. Predicting academic success in higher education: literature review and best practices (E. Alyahyan and D. Düştegör), In International Journal of Educational Technology in Higher Education, volume 17, 2020.

   Abstract

   © 2020, The Author(s). Student success plays a vital role in educational institutions, as it is often used as a metric for the institution’s performance. Early detection of students at risk, along with preventive measures, can drastically improve their success. Lately, machine learning techniques have been extensively used for prediction purpose. While there is a plethora of success stories in the literature, these techniques are mainly accessible to “computer science”, or more precisely, “artificial intelligence” literate educators. Indeed, the effective and efficient application of data mining methods entail many decisions, ranging from how to define student’s success, through which student attributes to focus on, up to which machine learning method is more appropriate to the given problem. This study aims to provide a step-by-step set of guidelines for educators willing to apply data mining techniques to predict student success. For this, the literature has been reviewed, and the state-of-the-art has been compiled into a systematic process, where possible decisions and parameters are comprehensively covered and explained along with arguments. This study will provide to educators an easier access to data mining techniques, enabling all the potential of their application to the field of education.

   
   Keywords: Data mining, Guidelines, Higher education, Prediction, Review, Student success

   ---

   BibTeX

   
   @article{Alyahyan2020, abstract = {© 2020, The Author(s). Student success plays a vital role in educational institutions, as it is often used as a metric for the institution’s performance. Early detection of students at risk, along with preventive measures, can drastically improve their success. Lately, machine learning techniques have been extensively used for prediction purpose. While there is a plethora of success stories in the literature, these techniques are mainly accessible to “computer science”, or more precisely, “artificial intelligence” literate educators. Indeed, the effective and efficient application of data mining methods entail many decisions, ranging from how to define student’s success, through which student attributes to focus on, up to which machine learning method is more appropriate to the given problem. This study aims to provide a step-by-step set of guidelines for educators willing to apply data mining techniques to predict student success. For this, the literature has been reviewed, and the state-of-the-art has been compiled into a systematic process, where possible decisions and parameters are comprehensively covered and explained along with arguments. This study will provide to educators an easier access to data mining techniques, enabling all the potential of their application to the field of education.}, author = {E. Alyahyan and D. Düştegör}, doi = {10.1186/s41239-020-0177-7}, issn = {23659440}, issue = {1}, journal = {International Journal of Educational Technology in Higher Education}, keywords = {Data mining,Guidelines,Higher education,Prediction,Review,Student success}, title = {Predicting academic success in higher education: literature review and best practices}, volume = {17}, year = {2020}, }

   ---

   doi
10. Workload Scheduling on heterogeneous Mobile Edge Cloud in 5G networks to Minimize SLA Violation (M. Hadadian Nejad Yousefi, A. Ghiassi, BS. Hashemi and M. Goudarzi), In arXiv preprint arXiv:2003.02820, 2020.

    BibTeX

    
    @article{yousefi2020:workload, title={Workload Scheduling on heterogeneous Mobile Edge Cloud in 5G networks to Minimize SLA Violation}, author={M. Hadadian Nejad Yousefi and A. Ghiassi and BS. Hashemi and M. Goudarzi}, journal={arXiv preprint arXiv:2003.02820}, year={2020} }

    ---

11. OpenBNG: Central office network functions on programmable data plane hardware (R. Kundel, L. Nobach, J. Blendin, W. Maas, A. Zimber, H. Kolbe, G. Schyguda, V. Gurevich, R. Hark, B. Koldehofe and R. Steinmetz), In International Journal of Network Management, Wiley, 2020.

    BibTeX

    
    @Article{Kundel:NEM2020:P4BNG, author = {R. Kundel and L. Nobach and J. Blendin and W. Maas and A. Zimber and H. Kolbe and G. Schyguda and V. Gurevich and R. Hark and B. Koldehofe and R. Steinmetz}, title = {{OpenBNG}: Central office network functions on programmable data plane hardware}, journal = {International Journal of Network Management}, year = {2020}, publisher = {Wiley}, pages = {25 pages}, doi = {10.1002/nem.2134}, }

    ---

    doi
12. Grußwort der Gastherausgeber zum Thema Fog Computing (S. Schulte, B. Koldehofe, A. Reinhardt and T. Braun), In Informatik Spektrum, Springer Science and Business Media LLC, volume 42, 2020.

    BibTeX

    
    @Article{InformatikSpektrum:Schulte2020, author = {S. Schulte and B. Koldehofe and A. Reinhardt and T. Braun}, title = {Grußwort der Gastherausgeber zum Thema Fog Computing}, journal = {Informatik Spektrum}, year = {2020}, publisher = {Springer Science and Business Media {LLC}}, pages = {455---456}, volume = {42}, number = {6}, doi = {10.1007/s00287-019-01230-w}, }

    ---

    doi
13. Theorie: processen van voortijdig schoolverlaten en begeleiding om dat te voorkomen (M. A. E. van der Gaag, N. R. Snell A. C. Emerencia, F. J. Blaauw, G. G. Bron and E. S. Kunnen), Chapter in Voortijdig schoolverlaten voorkomen Perspectieven van wetenschap, praktijk en beleid (M. A. E. van der Gaag, N. R. Snell, G. G. Bron, E. S. Kunnen, eds.), Uitgeverij Acco, 2020.

    BibTeX

    
    @incollection{VanderGaag2020, address = {Leuven, Belgium}, author = {M. A. E. van der Gaag and N. R. Snell A. C. Emerencia and F. J. Blaauw and G. G. Bron and E. S. Kunnen}, booktitle = {Voortijdig schoolverlaten voorkomen Perspectieven van wetenschap, praktijk en beleid}, chapter = {3}, edition = {1}, editor = {M. A. E. van der Gaag and N. R. Snell and G. G. Bron and E. S. Kunnen}, isbn = {978-94-92398-36-9}, pages = {16--29}, publisher = {Uitgeverij Acco}, title = {{Theorie: processen van voortijdig schoolverlaten en begeleiding om dat te voorkomen}}, url = {https://u-can-act.nl/wp-content/uploads/2020/05/Van-der-Gaag-et-al.-2020-Voortijdig-schoolverlaten-voorkomen_-perspectieven-van-wetenschap-praktijk-en-beleid.pdf}, year = {2020} }

    ---

    url
14. Procesonderzoek: processen van uitvallen, blijven en begeleiding (N. R. Snell, G. G. Bron, A. C. Emerencia, E. S. Kunnen, F. J. Blaauw, P. de Jonge and M. van der Gaag), Chapter in Voortijdig schoolverlaten voorkomen Perspectieven van wetenschap, praktijk en beleid (M. A. E. van der Gaag, N. R. Snell, G. G. Bron, E. S. Kunnen, eds.), Uitgeverij Acco, 2020.

    BibTeX

    
    @incollection{VanderGaag2020a, address = {Leuven, Belgium}, author = {N. R. Snell and G. G. Bron and A. C. Emerencia and E. S. Kunnen and F. J. Blaauw and P. de Jonge and M. van der Gaag}, booktitle = {Voortijdig schoolverlaten voorkomen Perspectieven van wetenschap, praktijk en beleid}, chapter = {5}, edition = {1}, editor = {M. A. E. van der Gaag and N. R. Snell and G. G. Bron and E. S. Kunnen}, isbn = {978-94-92398-36-9}, pages = {59--139}, publisher = {Uitgeverij Acco}, title = {{Procesonderzoek: processen van uitvallen, blijven en begeleiding}}, url = {https://u-can-act.nl/wp-content/uploads/2020/05/Van-der-Gaag-et-al.-2020-Voortijdig-schoolverlaten-voorkomen_-perspectieven-van-wetenschap-praktijk-en-beleid.pdf}, year = {2020} }

    ---

    url
15. Towards Service-Oriented and Intelligent Microgrids (I. Georgievski, L. Fiorini and M. Aiello), In Proceedings of the 3rd International Conference on Applications of Intelligent Systems, Association for Computing Machinery, 2020.

    BibTeX

    
    @inproceedings{Georgievski2020:appis, author = {I. Georgievski and L. Fiorini and M. Aiello}, title = {Towards Service-Oriented and Intelligent Microgrids}, year = {2020}, isbn = {9781450376303}, publisher = {Association for Computing Machinery}, address = {New York, NY, USA}, url = {https://doi.org/10.1145/3378184.3378214}, doi = {10.1145/3378184.3378214}, booktitle = {Proceedings of the 3rd International Conference on Applications of Intelligent Systems}, articleno = {Article 18}, numpages = {6}, keywords = {demand reponse, Microgrids, services, planning}, location = {Las Palmas de Gran Canaria, Spain}, series = {APPIS 2020} }

    ---

    urldoi
16. Predictive Multi-Objective Scheduling with Dynamic Prices and Marginal CO2-Emission Intensities (L. Fiorini and M. Aiello), In ACM e-Energy 2020, 2020.

    BibTeX

    
    @inproceedings{Fiorini2020hems, author = {L. Fiorini and M. Aiello}, title = {Predictive Multi-Objective Scheduling with Dynamic Prices and Marginal CO2-Emission Intensities}, year = {2020}, location = {Melbourne, Australia}, booktitle = {ACM e-Energy 2020} }

    ---

17. Sustainability Choices when Cooking Pasta (L. Fiorini, L. Steg and M. Aiello), In ACM e-Energy 2020, 2020.

    BibTeX

    
    @inproceedings{Fiorini2020pasta, author = {L. Fiorini and L. Steg and M. Aiello}, title = {Sustainability Choices when Cooking Pasta}, year = {2020}, location = {Melbourne, Australia}, booktitle = {ACM e-Energy 2020} }

    ---

18. Operator as a Service: Stateful Serverless Complex Event Processing (M. Luthra, S. Hennig, K. Razavi, L. Wang and B. Koldehofe), In Proceedings of the 2020 IEEE International Conference on Big Data, IEEE, 2020.

    BibTeX

    
    @InProceedings{Luthra:SCDM2020:Serverless, author = {M. Luthra and S. Hennig and K. Razavi and L. Wang and B. Koldehofe}, booktitle = {Proceedings of the 2020 IEEE International Conference on Big Data}, title = {Operator as a Service: Stateful Serverless Complex Event Processing}, year = {2020}, pages = {1964--1973}, publisher = {IEEE}, doi = {10.1109/BigData50022.2020.9378142}, }

    ---

    doi
19. The Community Structure of Constraint Satisfaction Problems and Its Correlation with Search Time (M. Medema and A. Lazovik), In 2020 IEEE 32nd International Conference on Tools with Artificial Intelligence (ICTAI), 2020.

    BibTeX

    
    @INPROCEEDINGS{medema2020:ictai, author={M. Medema and A. Lazovik}, booktitle={2020 IEEE 32nd International Conference on Tools with Artificial Intelligence (ICTAI)}, title={The Community Structure of Constraint Satisfaction Problems and Its Correlation with Search Time}, year={2020}, pages={153-160}, doi={10.1109/ICTAI50040.2020.00034} }

    ---

    doi
20. Microbursts in Software and Hardware-based Traffic Load Generation (R. Kundel, A. Rizk and B. Koldehofe), In Proceedings of the IEEE/IFIP Network Operations and Management Symposium (NOMS), IEEE, 2020.

    BibTeX

    
    @InProceedings{Kundel:NOMS2020c:Microbursts, author = {R. Kundel and A. Rizk and B. Koldehofe}, title = {Microbursts in Software and Hardware-based Traffic Load Generation}, booktitle = {Proceedings of the IEEE/IFIP Network Operations and Management Symposium (NOMS)}, year = {2020}, pages = {2 pages}, publisher = {{IEEE}}, doi = {10.1109/noms47738.2020.9110305}, }

    ---

    doi
21. Flexible Content-based Publish/Subscribe over Programmable Data Planes (R. Kundel, C. Gaertner, M. Luthra, S. Bhowmik and B. Koldehofe), In Proceedings of the IEEE/IFIP Network Operations and Management Symposium (NOMS), IEEE, 2020.

    BibTeX

    
    @InProceedings{Kundel:NOMS2020:p4pubsub, author = {R. Kundel and C. Gaertner and M. Luthra and S. Bhowmik and B. Koldehofe}, booktitle = {Proceedings of the IEEE/IFIP Network Operations and Management Symposium (NOMS)}, title = {Flexible Content-based Publish/Subscribe over Programmable Data Planes}, year = {2020}, pages = {6 pages}, publisher = {IEEE}, doi = {10.1109/NOMS47738.2020.9110381}, }

    ---

    doi
22. P4STA: High Performance Packet Timestamping with Programmable Packet Processors (R. Kundel, F. Siegmund, J. Blendin, A. Rizk and B. Koldehofe), In Proceedings of the IEEE/IFIP Network Operations and Management Symposium (NOMS), IEEE, 2020.

    BibTeX

    
    @InProceedings{Kundel:NOMS2020:P4STA, author = {R. Kundel and F. Siegmund and J. Blendin and A. Rizk and B. Koldehofe}, title = {{P4STA}: High Performance Packet Timestamping with Programmable Packet Processors}, booktitle = {Proceedings of the IEEE/IFIP Network Operations and Management Symposium (NOMS)}, year = {2020}, pages = {9 pages}, publisher = {IEEE}, doi = {10.1109/NOMS47738.2020.9110290}, }

    ---

    doi