Simple Queueing Research Articles

Formal Verification and Security Analysis of Go-based New Simple Queue System

Formal Verification and Security Analysis of Go-based New Simple Queue System

DESIGN OF A TRAFFIC RATE PRIORITY NETWORK CONNECTION MANAGEMENT SYSTEM ON A COMPUTER NETWORK

The practicum laboratory is one of the university facilities that accompany your studies, where students can practice their understanding of learning concepts through tests or practical exercises. In this sense the role of the laboratory is very important because the laboratory is a center for teaching and learning, where lectures are used for experiments, research or research. For this reason, in order to expedite the teaching and learning process, adequate facilities are needed in the laboratory, one of which is the Network. However, there are a number of problems that occur where when students download, zoom browsing activity becomes slow. Of course this will make the teaching and learning process less efficient. Based on the problems above, the author wants to conduct research by providing different bandwidth allocations and managing user bandwidth based on priority. The mangle method is used to mark data packets based on port, protocol, src and etc. addresses, and the simple queue method is used to set the amount of bandwidth and priority for each user. From the results of functional testing or research, it can be concluded that the results of applying the mangle method are used to mark a packet that will be restricted based on the configured dst port and the Simple Queue method as a determinant for setting the priority given to each user so that when the user uses zoom access, global, games and others can use the internet network smoothly without internet interference because traffic rate priority and bandwidth management has been carried out.

SPSC: Stream Processing Framework Atop Serverless Computing for Industrial Big Data.

With the advance of smart manufacturing and information technologies, the volume of data to process is increasing accordingly. Current solutions for big data processing resort to distributed stream processing systems, such as Apache Flink and Spark. However, such frameworks face challenges of resource underutilization and high latency in big data application scenarios. In this article, we propose SPSC, a serverless-based stream computing framework where events are discretized into the atomic stream and stateless Lambda functions are taken as context-irrelevant operators, achieving task parallelism and inherent data parallelism in processing. Also, we implement a prototype of the framework on Amazon Web service (AWS) using AWS Lambda, AWS simple queue service, and AWS DynamoDB. The evaluation shows that compared with Alibaba's real-time computing Flink version, SPSC outperforms by 10.12% when the overhead is close.

Leveraging AWS SNS/SQS for Real-Time Cache Synchronization in Distributed Systems

In distributed systems, maintaining consistency across multiple caches presents a significant challenge, often leading to data inconsistencies and degraded application performance. This paper proposes and evaluates a novel approach to cache synchronization using Amazon Web Services (AWS) Simple Notification Service (SNS) and Simple Queue Service (SQS). The proposed system leverages the pub-sub model of SNS combined with the reliable message queuing of SQS to create a scalable and robust cache synchronization mechanism. We present the architecture, implementation details, and performance analysis of this system, demonstrating significant reductions in database load and improvements in response times while ensuring eventual consistency across distributed caches. Comparative analysis with alternative solutions highlights the advantages of the SNS/SQS approach in terms of scalability, reliability, and ease of implementation. This research contributes to the field of distributed systems by offering a practical, cloud-native solution to the cache synchronization problem, applicable to a wide range of applications requiring consistent data across multiple instances or services.

Timed Petri Nets for Modeling and Performance Evaluation of a Priority Queueing System

The application of queueing theory is very broad. Examples include electronic communication systems and devices. New technologies, electronic communication systems, and devices are used by many modern organizations. However, this implies certain requirements and risks. The requirements are, first and foremost, reliability, which accounts for the complexity and interdependence of the system. On the other hand, the stochastic characteristics and complexity of these systems introduce risks related to the demands of reliability control, transmission quality, availability, and security. The research conducted so far is concerned with relatively simple queueing models that require certain assumptions to be made about the stochastic nature of the event stream. This is because complex queueing systems are very difficult to analyze using analytical methods. Hence, this paper attempts to use timed Petri nets in the modeling and performance evaluation of queueing systems belonging to the PQS (Priority Queueing System) group. IntServ and DiffServ architectures are discussed, as well as queueing systems used in quality-of-service assurance. A weighted PQS that eliminates the possibility of blocking lower-priority traffic is investigated. Based on a Petri model, the performance characteristics of the studied system are obtained. The impact of data generation on the system performance was analyzed, showing that temporal Petri nets can be effectively used in the modeling and performance evaluation of PQS systems.

PERANCANGAN DAN OPTIMALISASI KINERJA JARINGAN HOTSPOT SERVER BERBASIS MIKROTIK PADA SMK NEGERI 2 DOMPU

SMK Negeri 2 Dompu is one of the vocational high schools located in Dompu Regency, the school already has a wireless network, but the large number of uses in one access point device results in an unstable internet network or the network being slow because it has not used an optimal configuration. The proxy-based Hotspot Server network uses the Mikrotik Simple Queue feature at schools to centrally manage hotspot networks and can manage bandwidth evenly. The method used in this research is the data collection method, namely the method of observation and literature study methods, the method of quantitative data analysis using network performance parameters namely delay, throughtput, packet loss and the Wireshark application. The results of designing and optimizing the performance of the Mikrotik-based Hotspot Server network at schools can run well and Bandwidth management has been successfully managed by Simple Queue. In the throughput test, the average result is 46.9% KB. The average packet loss results are 0%, because after analyzing all packets there are no missing packets or in other words all packets have been sent to the destination. While Delay get an average result of 39 ms

Computer Network Design Using the Simple Queue Method in Maximising Network Performance in Companies

Computer Network Design Using the Simple Queue Method at CV. Ide Maju Berkarya is made to maximise the performance of existing networks in the company. This design is to provide network capacity for users evenly using the Simple Queue method and can monitor the existing network in the company so that there can be no more problems in getting network capacity where previously the capacity that each user got was uneven. This computer network design is based on a case study at CV. Ide Maju Berkarya which lasted for 4 (four) months. The object of activity carried out in the form of direct observation to the field to see the circumstances and situations that occur, how the performance of the existing network at CV. Ide Maju Berkarya. From the conditions that occur in the field, it can be seen that the distribution of nets for each employee is not evenly distributed, there is no network that can monitor the network in the company so that problems often occur when using the internet becomes slow and disconnected. Conclusions and suggestions on the design of this computer network are to be able to improve the performance of existing networks in the company by sharing the capacity of each user evenly when using internet access in the company and can monitor traffic and users connected to the network.

A queuing evacuation model with yielding behavior

A new super queue model with yielding behavior is proposed to model the orderly evacuation process of young pupils in a classroom building. A super queue is composed of a super leader and several simple queues. Based on this, a leader-follower model is proposed to model the orderly behavior between pupils in a super queue, and an exclusive channel model is proposed to model the yielding behavior between super queues. Taking the evacuation of a classroom building as an example, the super queues and yielding behavior are reproduced and are very similar to the actual behavior (both qualitatively and quantitatively). Based on the model, scenarios are simulated to analyze the impacts of several factors on evacuation efficiency. The results show the following: (1) The stop-and-go effect greatly affects the overall evacuation efficiency. Therefore, it is necessary for students to maintain sufficient concentration to shorten their reaction time during the stopping and going process, thereby improving the evacuation efficiency. (2) Different yielding strategies have little impact on the overall evacuation efficiency. Therefore, in an actual evacuation case, flexible yielding strategies can be adopted in order to consider the needs of each class. (3) By optimizing evacuees’ behaviors, such as improving their reaction times, the efficiency of an evacuation with queuing and yielding can become close to that of a disordered evacuation. At the same time, due to its higher safety and easier management process, a queuing and yielding evacuation can be a safe and relatively efficient method for real evacuations.

Analisa Quality of Services Pada Jaringan Sekolah Dengan Metode Queue Tree Studi Kasus: Lab Bahasa SMAN 47 Jakarta

Abstract - The use of the internet with a large number of users has problems with fair and equitable use of bandwidth. The use of the internet in the computer network of SMAN 47 Jakarta is a very large number of students and teachers. Computer networks in schools are provided not only to support the teaching and learning process but also to support the very high mobility of the learning community. Of the many teachers, staff and students at SMAN 47 Jakarta who are active internet users, some users download (using the Download manager), and some use it for browsing, running YouTube, Twitter, Instagram applications, and so on. . With limited bandwidth and no regulation of bandwidth usage, causing unfair and equitable distribution of bandwidth, bandwidth management is carried out using the simple queue method, as well as to make it easier for network administrators to configure. The success of bandwidth management is carried out through Quality of Services (QOS) with indicators: throughput, jitter, packet loss and delay. The value used as a barometer of QOS success is the THIPON index. From the test results of the proposed system made by the author, a case study in the Lab room, that the implementation of bandwidth management with the simple queue method resulted in a score of 4 THIPON indexes on all measured QoS indicators. Through this bandwidth management, network administrators can provide guarantees to users on the availability and fairness of bandwidth usage according to the user's priorities and needs. It is necessary to make a Standard Operational Procedure (SOP) regarding the bandwidth management mechanism so that bandwidth management can be carried out in accordance with the standards and carried out by whoever is the network administrator.

Markov decision processes with burstiness constraints

We consider a Markov Decision Process (MDP), over a finite or infinite horizon, augmented by so-called (σ,ρ)-burstiness constraints. Such constraints, which had been introduced within the framework of network calculus, are meant to limit some additive quantity to a given rate over any time interval, plus a term which allows for occasional and limited bursts. We introduce this class of constraints for MDP models, and formulate the corresponding constrained optimization problems. Due to the burstiness constraints, constrained optimal policies are generally history-dependent. We use a recursive form of the constraints to define an augmented-state model, for which sufficiency of Markov or stationary policies is recovered and the standard theory may be applied, albeit over a larger state space. The analysis is mainly devoted to a characterization of feasible policies, followed by application to the constrained MDP optimization problem. A simple queuing example serves to illustrate some of the concepts and calculations involved.

OPTIMALISASI MANAJEMEN TRAFIK DAN KEAMANAN DATA PADA JARINGAN INTRANET IBI-K 1957 DENGAN METODE USER BEHAVIOUR ANALYSIS

The incident of a data breach at one of the national banks as a result of the merger of several Islamic banks in Indonesia for economic reasons has significantly increased concerns about the security of the data of all organizations, including educational organizations such as universities, where there are such as a personal data system and also educational data for the academic community, the open internet sharing systems enabled by universities are highly vulnerable to cyber attacks. For this reason, an optimization measure for the security of the campus network was implemented in this study and, in addition, the Internet connection was made more stable, as it is perceived as very slow at certain hours or during working hours. The use of Mikrotik as a network security tool designed to establish a network security fortress against intruders. In addition to the fact that Mikrotik devices are easy to obtain and inexpensive, and have good security features, the use of the method of analyzing user behavior consists in using a firewall to detect users who download activities with certain criteria are recorded and marked by the firewall , to then restrict access for the user. The. In addition to utilizing Mikrotik's firewall capabilities, the Queue feature is also used with the Simple Queue and Queue Tree methods. In the Simple Queue method, it designates one of the hosts whose bandwidth is limited, while in Queue Tree, it limits the network segments that provide users with maximum bandwidth limits and guarantees bandwidth. Both can be used side by side and work optimally.

Perancangan Dan Implementasi Pembagian Bandwidth Menggunakan Mikrotik Di PT. Satria Jaya Prima (2023)

The increasing demand and use of internet networks at PT. Satria Jaya Prima to access a website-based sales system, the more user demand for problems that occur on user devices such as unstable internet networks. Currently the use of internet network at PT. Satria Jaya Prima has not been efficient because there is no balanced bandwidth regulation, thus making the internet network capacity usage gap and making the internet network unstable. Based on these problems, research is needed that can be applied to overcome these problems, namely managing bandwidth using Mikrotik. In the network, a device is needed that can manage the existing internet network. This device is called Mikrotik RouterBoard. Routers that will be used in the internet network of PT. Satria Jaya Prima runs with Mikrotik OS for bandwidth and user management and manages the existing internet network according to the internet needs of internet network users. In this study, Mikrotik is configured using Winbox using the Simple Queue Peer Connection Queue (PCQ) method, with bandwidth management and users using the Mikrotik Router, the internet network connection will be smoother, because the existing bandwidth is allocated to each user based on the bandwidth needs needed by each internet network user

Bandwidth Management Design Using the Simple Queue Method in Mikrotik RouterOS and The Winbox Application

The function of bandwidth is to manage network bandwidth so that each network user can get the same bandwidth even though there are many users on the network. The use of the internet and computer networks is needed to support company operations. bandwidth requirements used are not small. In many companies, they have to get an internet connection for their individual needs and because the internet speed is only 10 Mbps, if it is not used according to the needs of the job, it will interfere with other workers who want to use the internet at PT. Five Main Techniques. To realize good bandwidth management, therefore the author will make bandwidth management with the simple queue method so that PT. Panca Teknik Utama has a network that can be used stably and according to the needs of each user even though many are using the internet simultaneously. To be able to make bandwidth management the author uses the observation method, interview method, and literature study method to collect data and supporting devices for making this bandwidth management are Mikrotik RouterOS and the Winbox application.

Bandwidth Capacity Analysis on Fiber Optic Networks for E - learning at Pakuan University

Pakuan University (UNPAK) currently has 6 faculties for undergraduate programs, vocational schools, graduate, and post-graduate programs, with an interconnected fiber optic network. The management of the fiber optic network is carried out by Putik as O & M in collaboration with Moratel as the internet connection provider with a bandwidth of 550 Mbps. Analyzing the bandwidth capacity of the fiber optic network is crucial for the implementation of e-learning at Pakuan University. E-learning plays an important role in supporting the teaching and learning process during the Covid-19 pandemic, whether online or remote learning. Based on the daily user recapitulation, it is known that e-learning usage peaks between 08.50 – 10.30 Western Indonesian Time on an usual Monday with 6,505 users in total. The Faculty of Social and Cultural Sciences (FISIB) holds the highest usage of 143.23 Mbps, along with other faculties which exceeds the predetermined capacity of 40 Mbps each. This caused the Simple Queue method to experience access delays of even Request Time Out (RTO) conditions. Therefore, the Simple Queue method is no longer adequate, making the Queue Tree method the better option.

Antithetic Power Transformation in Monte Carlo Simulation: Correcting Hidden Errors in the Response Variable

Monte Carlo simulation is performed with uniformly distributed U(0,1) pseudo-random numbers. Because the numbers are generated from a mathematical formula, they will contain some serial correlation, even if very small. This serial correlation becomes embedded in the correlation structure of the response variable. The response variable becomes an asynchronous time series. This leads to hidden errors in the response variable. The purpose of this paper is to illustrate how this happens and how it can be corrected. The method is demonstrated for the case of a simple queue for which the time in the system is known exactly from theory. The paper derives the correlation between an exponential random variable and its antithetic counterpart obtained by power transform with an infinitesimal negative exponent.

ANALISIS PERBANDINGAN MANAJEMEN BANDWIDTH ANTARA METODE SIMPLE QUEUE DAN QUEUE TREE PADA KOPERASI KARYAWAN INDOCEMENT

The mobility of internet users is now increasingly being used, many providers currently provide various variations of the bandwidth used for their users. Koperasi Karyawan Indocement requires the use of bandwidth aimed at making the internet network connection stable and reducing the error rate in the network connection. Bandwidth management regulates bandwidth limitation so that it is evenly distributed to each client between the simple queue and queue tree
 methods, the problem faced by the Koperasi Karyawan Indocement is that there is no bandwidth limit applied. This study aims to solve the problems faced in Koperasi Karyawan Indocement by
 comparing bandwidth management between the simple queue and queue tree methods. Where from the results of this study will be applied which method is better for allocating bandwidth
 evenly.

Comparative Analysis of Network Quality Using QOS Parameters on Mikrotik Routers Using the Queue Tree and Simple Queue Methods

The research was conducted by researchers at Trienggadeng State Vocational School located on Jl Banda Aceh-Medan KM 152, Kec. Trienggadeng Regency. Pidie Jaya. This research is based on the importance of the network in the ongoing teaching and learning process in the network and computer labs, the network in the lab is currently not managed properly and the distribution of bandwidth is not evenly distributed. To get a good internet connection, it is necessary to distribute bandwidth evenly, which can be done using a proxy router. One of the features for distributing bandwidth evenly in the proxy router can be applied using the simple queue and queue tree methods, knowing network quality can be done using Quality of Service (QoS) measurements. This study aims to determine the analysis of network quality using Qos on proxy routers using the simple queue and queue tree methods. The method used in this study is to use the action research method (action research), the stages of the research are analyzing, data collection, data completeness, making network designs, and taking action. The results obtained for network analysis in a comparative study between simple queue and queue tree networks, the results for the delay obtained by the queue tree are 9 ms, packet loss = 0%, and throughput = 549 k. Whereas the simple queue obtains the value from the QoS measurement by performing calculations with the equation formula to obtain a value of delay = 8 ms, packet loss = 0.15% and throughput = 629 k. Based on the Tiphon standard, it can be concluded that for delay, a queue tree is better with a value above the simple queue with a very good index, the packet loss queue tree is better than the simple queue, the index is very good, the throughput of the simple queue is better compared to the throughput queue tree. This research shows that overall Queue Tree is more optimal for QoS.

Analysis And Implementation of Simple Queue and Queue Tree Methods For Optimizing Bandwitdh Management

This study analyzes the Simple Queue method with Queue tree using a Mikrotik Router to perform Bandwidth management. Both of these methods will be tested using the parameters of Quality of Services ( QOS ), namely throughput, delay, jitter and packet loss. The results of the analysis of the Quality of Services will be compared with weighting based on the TIPHON standard, then the results of the analysis will be tested using the wireshark application . The results of the analysis of these two methods, the Simple Queue method is more suitable because it gets a higher value based on the TIPHON standard. Therefore it is recommended to use Bandwidth management using the Simple Queue method

Analisis Perbandingan Manajemen Bandwidth Antara Metode Simple Queue Dan Queue Tree Pada Koperasi Karyawan Indocement

The mobility of internet users is now increasingly being used, many providers currently provide various variations of the bandwidth used for their users. Koperasi Karyawan Indocement requires the use of bandwidth aimed at making the internet network connection stable and reducing the error rate in the network connection.Bandwidth management regulates bandwidth limitation so that it is evenly distributed to each client between the simple queue and queue tree methods, the problem faced by the Koperasi Karyawan Indocement is that there is no bandwidth limit applied. This study aims to solve the problems faced in Koperasi Karyawan Indocement by comparing bandwidth management between the simple queue and queue tree methods. Where from the results of this study will be applied which method is better in allocating bandwidth evenly.

Decision biases in human queuing systems: a simulation model to use in the class

Human decision-making is affected by cognitive decision biases that can deviate human behaviour from purely rational actions. These effects can alter the behaviour of systems in which humans are involved; that is the case of queuing systems of people. Traditional Queuing Theory studies the performance of such systems without taking into account the idiosyncrasy of the human decision-making processes. In this work, we propose an interactive simulation tool to teach decision biases in queuing systems. We present a series of experiments to be carried out in the class to explore the behaviour of a simple queuing system of people exposed to people cognitive biases and discuss the expected dynamics. The simulation tool is freely accessible from GitHub.