Search for Articles:
Title / Keyword
Author / Affiliation / Email
Journal
Article Type
 
 
Advanced Search
 
Section
Special Issue
Volume
Issue
Number
Page
 
6.8
3.9
Journals
Sensors
Special Issues
Selected Papers from MASCOTS 2020 and Workshop
sensors-logo
Submit to Sensors Review for Sensors Propose a Special Issue

Journal Menu

► Journal Menu

Journal Browser

► Journal Browser
share announcement

Selected Papers from MASCOTS 2020 and Workshop

A special issue of Sensors (ISSN 1424-8220). This special issue belongs to the section "Sensor Networks".

Deadline for manuscript submissions: closed (31 May 2021) | Viewed by 10217

Special Issue Editors

Prof. Dr. Erol Gelenbe

E-Mail Website
Guest Editor
Institute of Theoretical and Applied Informatics, Polish Academy of Sciences, Bałtycka 5, 44-100 Gliwice, Poland
Interests: energy optimization; energy packet networks; networked systems; physical and biological networks; probability models; natural computation
Special Issues, Collections and Topics in MDPI journals
Prof. Dr. Maria Carla Calzarossa

E-Mail Website
Guest Editor
Director of the Performance Evaluation lab at Department of Electrical, Computer and Biomedical Engineering, University of Pavia, Italy
Interests: performance evaluation; workload characterization; cloud computing; social networks
Special Issues, Collections and Topics in MDPI journals

Special Issue Information

Dear Colleagues,

Advances in Performance Analysis and Quality of Service Engineering

The 2020 IEEE MASCOTS Conference is the 28th in the Series on Modelling, Analysis and Simulation of Computer and Telecommunication Systems. This Special Issue invites the submission of extended papers from among those that were accepted in the main program or the Workshop of this conference. Topics that are covered include analytical models, measurement experiments, performance optimization and the use of machine learning to interpret and exploit measurement data and optimize system performance.

Prof. Dr. Erol Gelenbe
Prof. Dr. Maria Carla Calzarossa
Guest Editors

Manuscript Submission Information

Manuscripts should be submitted online at www.mdpi.com by registering and logging in to this website. Once you are registered, click here to go to the submission form. Manuscripts can be submitted until the deadline. All submissions that pass pre-check are peer-reviewed. Accepted papers will be published continuously in the journal (as soon as accepted) and will be listed together on the special issue website. Research articles, review articles as well as short communications are invited. For planned papers, a title and short abstract (about 100 words) can be sent to the Editorial Office for announcement on this website.

Submitted manuscripts should not have been published previously, nor be under consideration for publication elsewhere (except conference proceedings papers). All manuscripts are thoroughly refereed through a single-blind peer-review process. A guide for authors and other relevant information for submission of manuscripts is available on the Instructions for Authors page. Sensors is an international peer-reviewed open access semimonthly journal published by MDPI.

Please visit the Instructions for Authors page before submitting a manuscript. The Article Processing Charge (APC) for publication in this open access journal is 2600 CHF (Swiss Francs). Submitted papers should be well formatted and use good English. Authors may use MDPI's English editing service prior to publication or during author revisions.

Published Papers (4 papers)

Download All Papers
Order results
Result details
Show export options expand_more Show export options expand_less
Select all
Export citation of selected articles as:

Research

30 pages, 1353 KiB  
Article
Diffusion Model of Preemptive-Resume Priority Systems and Its Application to Performance Evaluation of SDN Switches
by Tomasz Nycz, Tadeusz Czachórski and Monika Nycz
Sensors 2021, 21(15), 5042; https://doi.org/10.3390/s21155042 - 26 Jul 2021
Cited by 2 | Viewed by 1770
Abstract
The increasing use of Software-Defined Networks brings the need for their performance analysis and detailed analytical and numerical models of them. The primary element of such research is a model of a SDN switch. This model should take into account non-Poisson traffic and [...] Read more.
The increasing use of Software-Defined Networks brings the need for their performance analysis and detailed analytical and numerical models of them. The primary element of such research is a model of a SDN switch. This model should take into account non-Poisson traffic and general distributions of service times. Because of frequent changes in SDN flows, it should also analyze transient states of the queues. The method of diffusion approximation can meet these requirements. We present here a diffusion approximation of priority queues and apply it to build a more detailed model of SDN switch where packets returned by the central controller have higher priority than other packets. Full article
(This article belongs to the Special Issue Selected Papers from MASCOTS 2020 and Workshop)
►▼ Show Figures

Figure 1

33 pages, 1792 KiB  
Article
Performance Analysis of Packet Aggregation Mechanisms and Their Applications in Access (e.g., IoT, 4G/5G), Core, and Data Centre Networks
by Godlove Suila Kuaban, Tülin Atmaca, Amira Kamli, Tadeusz Czachórski and Piotr Czekalski
Sensors 2021, 21(11), 3898; https://doi.org/10.3390/s21113898 - 04 Jun 2021
Cited by 5 | Viewed by 2918
Abstract
The transmission of massive amounts of small packets generated by access networks through high-speed Internet core networks to other access networks or cloud computing data centres has introduced several challenges such as poor throughput, underutilisation of network resources, and higher energy consumption. Therefore, [...] Read more.
The transmission of massive amounts of small packets generated by access networks through high-speed Internet core networks to other access networks or cloud computing data centres has introduced several challenges such as poor throughput, underutilisation of network resources, and higher energy consumption. Therefore, it is essential to develop strategies to deal with these challenges. One of them is to aggregate smaller packets into a larger payload packet, and these groups of aggregated packets will share the same header, hence increasing throughput, improved resource utilisation, and reduction in energy consumption. This paper presents a review of packet aggregation applications in access networks (e.g., IoT and 4G/5G mobile networks), optical core networks, and cloud computing data centre networks. Then we propose new analytical models based on diffusion approximation for the evaluation of the performance of packet aggregation mechanisms. We demonstrate the use of measured traffic from real networks to evaluate the performance of packet aggregation mechanisms analytically. The use of diffusion approximation allows us to consider time-dependent queueing models with general interarrival and service time distributions. Therefore these models are more general than others presented till now. Full article
(This article belongs to the Special Issue Selected Papers from MASCOTS 2020 and Workshop)
►▼ Show Figures

Figure 1

17 pages, 488 KiB  
Article
Delay Analysis in IoT Sensor Networks
by Asaad Althoubi, Reem Alshahrani and Hassan Peyravi
Sensors 2021, 21(11), 3876; https://doi.org/10.3390/s21113876 - 04 Jun 2021
Cited by 11 | Viewed by 3394
Abstract
Internet of Things (IoT) devices, particularly those used for sensor networks, are often latency-sensitive devices. The topology of the sensor network largely depends on the overall system application. Various configurations include linear, star, hierarchical and mesh in 2D or 3D deployments. Other applications [...] Read more.
Internet of Things (IoT) devices, particularly those used for sensor networks, are often latency-sensitive devices. The topology of the sensor network largely depends on the overall system application. Various configurations include linear, star, hierarchical and mesh in 2D or 3D deployments. Other applications include underwater communication with high attenuation of radio waves, disaster relief networks, rural networking, environmental monitoring networks, and vehicular networks. These networks all share the same characteristics, including link latency, latency variation (jitter), and tail latency. Achieving a predictable performance is critical for many interactive and latency-sensitive applications. In this paper, a two-stage tandem queuing model is developed to estimate the average end-to-end latency and predict the latency variation in closed forms. This model also provides a feedback mechanism to investigate other major performance metrics, such as utilization, and the optimal number of computing units needed in a single cluster. The model is applied for two classes of networks, namely, Edge Sensor Networks (ESNs) and Data Center Networks (DCNs). While the proposed model is theoretically derived from a queuing-based model, the simulation results of various network topologies and under different traffic conditions prove the accuracy of our model. Full article
(This article belongs to the Special Issue Selected Papers from MASCOTS 2020 and Workshop)
►▼ Show Figures

Figure 1

14 pages, 331 KiB  
Article
Size-Based Routing Policies: Non-Asymptotic Analysis and Design of Decentralized Systems
by Eitan Bachmat and Josu Doncel
Sensors 2021, 21(8), 2701; https://doi.org/10.3390/s21082701 - 12 Apr 2021
Viewed by 1357
Abstract
Size-based routing policies are known to perform well when the variance of the distribution of the job size is very high. We consider two size-based policies in this paper: Task Assignment with Guessing Size (TAGS) and Size Interval Task Assignment (SITA). The latter [...] Read more.
Size-based routing policies are known to perform well when the variance of the distribution of the job size is very high. We consider two size-based policies in this paper: Task Assignment with Guessing Size (TAGS) and Size Interval Task Assignment (SITA). The latter assumes that the size of jobs is known, whereas the former does not. Recently, it has been shown by our previous work that when the ratio of the largest to shortest job tends to infinity and the system load is fixed and low, the average waiting time of SITA is, at most, two times less than that of TAGS. In this article, we first analyze the ratio between the mean waiting time of TAGS and the mean waiting time of SITA in a non-asymptotic regime, and we show that for two servers, and when the job size distribution is Bounded Pareto with parameter α=1, this ratio is unbounded from above. We then consider a system with an arbitrary number of servers and we compare the mean waiting time of TAGS with that of Size Interval Task Assignment with Equal load (SITA-E), which is a SITA policy where the load of all the servers are equal. We show that in the light traffic regime, the performance ratio under consideration is unbounded from above when (i) the job size distribution is Bounded Pareto with parameter α=1 and an arbitrary number of servers as well as (ii) for Bounded Pareto distributed job sizes with α∈(0,2)\{1} and the number of servers tends to infinity. Finally, we use the result of our previous work to show how to design decentralized systems with quality of service constraints. Full article
(This article belongs to the Special Issue Selected Papers from MASCOTS 2020 and Workshop)
►▼ Show Figures

Figure 1

Show export options expand_more Show export options expand_less
Select all
Export citation of selected articles as:
 
Displaying articles 1-4
Back to TopTop