Round Trip Time Research Articles

Optimal Usage of Resources through Quality Aware Scheduling in Containers based Cloud Computing Environment

For cloud computing, the Quality Aware Scheduling of Containers (QASC) model has been proposed for delay-sensitive tasks. Plan your cloud tasks. Typically, time constraints are met while resources are used effectively. It's a really difficult undertaking. In order to distribute containers more effectively, QASC takes into account a number of performance factors. Containers and their make-span logs, as well as input quality metrics like I/O-intensive workload, startup time, hot standby failure rate, and inter-container dependencies, are collected by the QASC model. A metric coefficient that indicates each container's overall rating is calculated by normalizing and averaging these values to determine it. In order to determine how well scheduling performed, the model also includes a quality coefficient that calculates this metric-coefficient threshold. It's also critical for QASC to be able to determine the remaining energy in each container, which represents its request capacity. In order to optimize cloud resources, energy use is also taken into account by the model. From the cloud-sim simulation, an experimental dataset including 50 containers and 1,200 internet protocol-capable users was employed. For the make-span ratio, round-trip time, and energy consumption analysis, this produced 20,000 data points. The RLSched, DSTS, and ADATSA models were contrasted with the QASC model. The outcomes showed that QASC performed better than these models in a number of crucial areas. Tasks may be managed better with the higher average make-span ratio and lower volatility. Its superior job scheduling and resource use were further demonstrated by its shorter round-trip durations and lower energy usage across loads. The QASC model is an extremely complex scheduling method for container-based systems and a significant advancement in cloud computing research. Its approaches and methods enable for more intelligent energy use as well as high-quality services while also improving system performance, particularly for tasks that are delay-sensitive.

Round Trip Time Evaluation Of Padangbai - Nusa Penida Crossing Vessels To Improve Performance At Roro Ferry In Bali Province

Padangbai Harbor is a port located in a village in Manggis District, Karangasem Regency, on the east side of Bali Island, Indonesia. Padangbai Port is a port that serves ship crossings from Bali to Lombok and Nusa Penida and vice versa serves ships heading to Bali. The Padangbai ferry port is a very busy ferry port because it has 2 routes, namely the Padangbai-Sheet route and the Padangbai-Nusa Penida route. There are 25 ships operating on the Padangbai - Selamat route, of which 2 ships belong to ASDP and 23 privately owned ships and 1 ship on the Padangbai - Nusa Penida route belongs to the Klungkung Regency Government. The Padangbai Ferry Port also has a schedule made by the Bali Class II Transportation Management Agency. However, there is a mismatch between the ship's arrival and departure times and the schedule that has been made. This research is research using qualitative methods. Based on the results of the analysis of problems in scheduling departures and arrivals at the Padangbai Ferry Port, delays of 20 minutes were still found which caused delays in the ship's onward performance. Therefore, it is very necessary to evaluate the ship's round trip time to improve performance at the Padangbai Ferry Port.

A low-cost wireless extension for object detection and data logging for educational robotics using the ESP-NOW protocol.

In recent years, inexpensive and easy to use robotics platforms have been incorporated into middle school, high school, and college educational curricula and competitions all over the world. Students have access to advanced microprocessors and sensor systems that engage, educate, and encourage their creativity. In this study, the capabilities of the widely available VEX Robotics System are extended using the wireless ESP-NOW protocol to allow for real-time data logging and to extend the computational capabilities of the system. Specifically, this study presents an open source system that interfaces a VEX V5 microprocessor, an OpenMV camera, and a computer. Images from OpenMV are sent to a computer where object detection algorithms can be run and instructions sent to the VEX V5 microprocessor while system data and sensor readings are sent from the VEX V5 microprocessor to the computer. System performance was evaluated as a function of distance between transmitter and receiver, data packet round trip timing, and object detection using YoloV8. Three sample applications are detailed including the evaluation of a vision-based object sorting machine, a drivetrain trajectory analysis, and a proportional-integral-derivative (PID) control algorithm tuning experiment. It was concluded that the system is well suited for real time object detection tasks and could play an important role in improving robotics education.

Real-time observation of dual-periodic dual-pulse synchronous and asynchronous pulsations in a spatiotemporal mode-locked fiber laser

We report the firstly experimental observation of dual-periodic dual-pulse synchronous pulsation (DDSP) and dual-periodic dual-pulse asynchronous pulsation (DDAP) in a spatiotemporal mode-locked fiber laser, composed of a short-period pulsation (SPP) lasting for tens of round-trip times (RTs) and a long-period pulsation (LPP) lasting for hundreds of RTs. It is found that the DDSP displays in-phase modulations between two pulses during the dual-periodic pulsation, while the DDAP demonstrates out-phase modulations in the SPP. Notably, the study reveals consistent pulsation periods across various transverse modes whether in the DDSP or DDAP, and the LPPs exhibit synchronization for different transverse modes, while the SPPs are asynchronous. Our findings illustrate that transverse modes do not influence the periodic modulation between two pulses. This exploration enhances the comprehension of multi-period pulsations in spatiotemporal mode-locked fiber lasers, and contributes to investigating high-dimensional nonlinear phenomena.

Consuming Patients' Days: Time Spent on Ambulatory Appointments by People With Cancer.

In qualitative work, patients report that seemingly short trips to clinic (eg, a supposed 10-minute blood draw) often turn into "all-day affairs." We sought to quantify the time patients with cancer spend attending ambulatory appointments. We conducted a retrospective study of patients scheduled for oncology-related ambulatory care (eg, labs, imaging, procedures, infusions, and clinician visits) at an academic cancer center over 1 week. The primary exposure was the ambulatory service type(s) (eg, clinician visit only, labs and infusion, etc.). We used Real-Time Location System badge data to calculate clinic times and estimated round-trip travel times and parking times. We calculated and summarized clinic and total (clinic + travel + parking) times for ambulatory service types. We included 435 patients. Across all service day type(s), the median (IQR) clinic time was 119 (78-202) minutes. The estimated median (IQR) round-trip driving distance and travel time was 34 (17-49) miles and 50 (36-68) minutes. The median (IQR) parking time was 14 (12-15) minutes. Overall, the median (IQR) total time was 197 (143-287) minutes. The median total times for specific service type(s) included: 99 minutes for lab-only, 144 minutes for clinician visit only, and 278 minutes for labs, clinician visit, and infusion. Patients often spent several hours pursuing ambulatory cancer care on a given day. Accounting for opportunity time costs and the coordination of activities around ambulatory care, these results highlight the substantial time burdens of cancer care, and support the notion that many days with ambulatory health care contact may represent "lost days."

Mobile Network Operators’ Assessment Based on Drive-Test Campaign in Urban Area for iPerf Scenario

The development of new telecommunication services requires the implementation of advanced technologies and the next generations of networks. Currently, the Long-Term Evolution (LTE) is a widely used standard. On the other hand, more and more mobile network operators (MNOs) are implementing the fifth-generation (5G) New Radio standard in their networks. It allows for increasing throughput, spectral, and energy efficiency and maximizing coverage, while reducing latency. The effectiveness of the introduced changes is measured by assessing the quality of service (QoS) in mobile networks. The paper presents the result evaluation of the QoS measurement campaign carried out using the drive test method in an urban area for four MNOs. We analyze the data transmission scenario, which is the basis of most modern telecommunications services. The result comparison provides an assessment of the 5G service implementation advancement by MNOs. In this analysis, we consider many QoS metrics (e.g., session time, throughput, and round-trip time) and parameters defining the radio signal quality (i.e., reference signal received power, signal-to-interference-plus-noise ratio). Our work also included searching for relationships between these parameters, using a correlation analysis. It allows for the selection of uncorrelated parameters to assess the quality of network, i.e., MNO evaluation, in terms of the provided QoS.

Theoretical model of passive mode-locking in terahertz quantum cascade lasers with distributed saturable absorbers

Abstract In research and engineering, short laser pulses are fundamental for metrology and communication. The generation of pulses by passive mode-locking is especially desirable due to the compact setup dimensions, without the need for active modulation requiring dedicated external circuitry. However, well-established models do not cover regular self-pulsing in gain media that recover faster than the cavity round trip time. For quantum cascade lasers (QCLs), this marked a significant limitation in their operation, as they exhibit picosecond gain dynamics associated with intersubband transitions. We present a model that gives detailed insights into the pulse dynamics of the first passively mode-locked QCL that was recently demonstrated. The presence of an incoherent saturable absorber, exemplarily realized by multilayer graphene distributed along the cavity, drives the laser into a pulsed state by exhibiting a similarly fast recovery time as the gain medium. This previously unstudied state of laser operation reveals a remarkable response of the gain medium on unevenly distributed intracavity intensity. We show that in presence of strong spatial hole burning in the laser gain medium, the pulse stabilizes itself by suppressing counter-propagating light and getting shortened again at the cavity facets. Finally, we study the robustness of passive mode-locking with respect to the saturable absorber properties and identify strategies for generating even shorter pulses. The obtained results may also have implications for other nanostructured mode-locked laser sources, for example, based on quantum dots.

Multi-Agent System in Web Services

The term "service-oriented architecture" (SOA) refers to a software paradigm for creating systems made up of a variety of services that interact with one another to accomplish a certain task. The communications involve more than just transmitting data back and forth; they also connect two or more services to coordinate the required operations. Cross-platform communication is necessary for the coordinating process when services are spread across several platforms. Several web service standards and specifications are used in the present SOA implementation. Based on the prototype's implementation and simulation, this proposed research study has been validated and evaluated. The suggested cross-platform communications architecture is implemented using NetBeans, JADE, WSIG, and OWL-S. An integrated development environment for Java is offered by Oracle in the form of NetBeans. Telecom Italia's Java Agent DEvelopment Framework (JADE) is an agent software framework that is entirely built in the Java language. Web Service Integration Gateway (WSIG), which helps to facilitate JADE agent services being called by Web service clients. The core fundamental engine of the suggested framework is OWL-S. It is a web ontology language used to describe Semantic Web Services in the Semantic Web's OWL-based framework. A quantitative approach is used in this study's performance analysis and comparative investigation for evaluation and validation. The prototype's major element is the Java agent development framework (JADE), which was used to create a multi-agent system for the agent-based MOM framework that has been presented. The creation of the multi-agent systems was facilitated by the JADE platform. JADE 3.7 was the version that was employed. Two key features of JADE are a FIPA-compliant agent platform and a package for creating Java agents. The implementation results show that the proposed agent-based MOM framework was successful communicate between multiple types of SOA application with a better performance of the average of round-trip time where the proposed framework was successful in responding to all the requests.

Server Redundancy: Performa Jaringan Mengunakan DNS Failover MikroTik pada Kasus Private Server dan Public Server

The digitization of user services has increased, in line with the need for VPS and cloud computing services, which are rampant among application and platform developers. Quite a few companies that create applications or application users have servers to handle user needs. Testing is carried out using the ICMP Protocol to get real-time results and can be measured. From Scenario 1, carrying out 20 test requests, we get a packet loss of 5% with RTT Avarage of 195,838ms and Mdev 4,103ms. If you apply DNS failover in scenario 2, the client will likely access the web a little slower, as evidenced by the packet loss being 25% greater in value. Compared to scenario 1, having a high standard deviation (Mdev) of round-trip times is not desirable. This variation is also known as jitter. Increased jitter can cause a bad user experience, especially in real-time audio and video streaming applications. However, this is still understandable because it only has a 1-5 second effect on the service. Next, in scenario 3, we can see that private and public servers have relatively high gab with 0% packet loss, which has a small Mdev value of 0.309ms. Therefore, the DNS failover method is a solution for network administrators who have problems related to server migration between public servers and private servers so that services can run even if a server is maintaining or downlinking.

SDN-Based Congestion Control and Bandwidth Allocation Scheme in 5G Networks

5G cellular networks are already more than six times faster than 4G networks, and their packet loss rate, especially in the Internet of Vehicles (IoV), can reach 0.5% in many cases, such as when there is high-speed movement or obstacles nearby. In such high bandwidth and high packet loss network environments, traditional congestion control algorithms, such as CUBIC and bottleneck bandwidth and round-trip propagation time (BBR), have been unable to balance flow fairness and high performance, and their flow rate often takes a long time to converge. We propose a congestion control algorithm based on bottleneck routing feedback using an in-network control mode called bottleneck routing feedback (BRF). We use SDN technology (OpenFlow protocol) to collect network bandwidth information, and BRF controls the data transmission rate of the sender. By adding the bandwidth information of the bottleneck in the option field in the ACK packet, considering the flow fairness and the flow convergence rate, a bandwidth allocation scheme compatible with multiple congestion control algorithms is proposed to ensure the fairness of all flows and make them converge faster. The performance of BRF is evaluated via Mininet. The experimental results show that BRF provides higher bandwidth utilization, faster convergence rate, and fairer bandwidth allocation than existing congestion control algorithms in 5G cellular networks.

A Dynamic Framework for Internet-Based Network Time Protocol.

Time synchronization is vital for accurate data collection and processing in sensor networks. Sensors in these networks often operate under fluctuating conditions. However, an accurate timekeeping mechanism is critical even in varying network conditions. Consequently, a synchronization method is required in sensor networks to ensure reliable timekeeping for correlating data accurately across the network. In this research, we present a novel dynamic NTP (Network Time Protocol) algorithm that significantly enhances the precision and reliability of the generalized NTP protocol. It incorporates a dynamic mechanism to determine the Round-Trip Time (RTT), which allows accurate timekeeping even in varying network conditions. The proposed approach has been implemented on an FPGA and a comprehensive performance analysis has been made, comparing three distinct NTP methods: dynamic NTP (DNTP), static NTP (SNTP), and GPS-based NTP (GNTP). As a result, key performance metrics such as variance, standard deviation, mean, and median accuracy have been evaluated. Our findings demonstrate that DNTP is markedly superior in dynamic network scenarios, a common characteristic in sensor networks. This adaptability is important for sensors installed in time-critical networks, such as real-time industrial IoTs, where precise and reliable time synchronization is necessary.

A precise solution to the shortest path optimization problem in graphs using Z-numbers

<p>Communication networks are exposed to internal or external risks that can affect all or part of the system. The most important components that form the infrastructure of these systems are routers, which act as nodes. In the field of graph theory, there are sophisticated techniques that can be used to optimize the path of a packet as it travels through various routers from its origin to its destination. A notable example of such an algorithm is Dijkstra's algorithm, which is designed to efficiently determine the shortest path. The algorithm works under the assumption that the system operates under ideal conditions. Real-time systems can perform better if risk factors and optimal conditions are taken into account. The relationship between the nodes can be expressed by various metrics such as distance, delay, and bandwidth. The aforementioned metrics facilitate the calculation of the optimal path, with the ultimate objective of achieving low-latency networks characterized by rapid response times. Round-trip time (RTT) can be employed as a metric for measuring enhancements in a range of latency types, including those associated with processing, transmission, queuing, and propagation. The use of Z-numbers was employed in this study to incorporate risk into the optimal path metric. RTT was the preferred metric and reliability was represented by fuzzy linguistic qualifiers. A comparison of several scenarios was shown using a numerical example of a communication network. It is expected that this study will have a significant impact on the evolution from models that consider only ideal conditions to real-time systems that include risks using Z-numbers.</p>

A Private SDR 5G SA Network: An Evaluation of the Quality of Service (QoS) and Computational Resource Allocation for eMBB Slice

This paper assesses the network performance in terms of Quality of Service (QoS) for the enhanced Mobile Broadband (eMBB) slicing of a private Stand-Alone (SA) network and a base station, identified as Next-Generation Node B (gNB), which is operating at 3.75GHz and using a Software Defined Radio (SDR) device. The contributions of this work are the evaluation of the computational resource allocation of a private 5G SA and the comparison of the QoS performance of the private SA network with a controlled laboratory testbed and a simulation tool, which is known as UERANSIM (User Equipment and Radio Access Network). Additionally, open-source monitoring systems were used in order to collect memory and CPU usage of the network during the experimentation. For the deployment of the SDR 5G SA gNB, the Universal Radio Software Peripheral (USRP) version B210 equipment was utilized. The results also consider the evaluation of QoS metrics i.e. throughput, jitter, round trip time and propagation delay to assess the performance of the private SDR 5G SA network.

Evaluating the Impact of Cyberattacks on PLC Performance: A Systematic Implementation and Empirical Investigation

Programmable Logic Controller plays a pivotal role in the operation of Industrial Control Systems, which are widely used to monitor and control critical infrastructure and manufacturing processes. However, the rise of Industry 4.0, coupled with the increasing sophistication of cyber threats poses a significant risk to the security of PLC. This study implements a wide range of attacks on a PLC, including Code Injection, Man in the Middle, and a Denial-of-Service attack. The study further scrutinizes the impact of these attacks on the performance of the PLC with a view to developing effective security measures to mitigate cyber risks in Operational Technology systems. The study employs throughput and round trip time as the key metrics to evaluate PLC performance under normal conditions and during cyberattacks. The results indicate a significant degradation in the PLC performance metrics during the attacks, with DoS having the highest impact followed by Man in the Middle attack. These results highlight the need for robust cybersecurity measures to secure PLC from potential cyber threats.

Filtering of hidden Markov renewal processes by continuous and counting observations

<p>This paper introduces a subclass of Markov renewal processes (MRPs) and presents a solution to the optimal filtering problem in a stochastic observation system, where the state is modeled by an MRP and observed indirectly through noisy measurements. The MRPs considered here can be interpreted as continuous-time Markov chains (CTMCs) with a finite set of abstract states representing distributions of random vectors. The paper outlines the probabilistic properties of MRPs, emphasizing the ability to express any arbitrary function of the MRP as the solution to a linear stochastic differential system (SDS) with a martingale on the right-hand side (RHS). Using these properties, an optimal filtering problem is formulated in stochastic observation systems, where the hidden state belongs to the class of MRPs, and the observations consist of both diffusion and counting components. The drift terms in all observations depend on the system state. An optimal filtering estimate for a scalar function of the MRP is provided through the solution of an SDS with innovation processes on the RHS. Additionally, the paper presents a version of the Kushner-Stratonovich equation, describing the evolution of the conditional probability density function (PDF). To demonstrate the practical application of the estimation method, the paper presents a communications-related example, focusing on monitoring the qualitative state and numerical characteristics of a network channel using noisy observations of round-trip time (RTT) and packet loss flow. The paper also highlights the robustness of the filtering algorithm in scenarios where the MRP distribution is uncertain.</p>

A Round Trip Time Weighting Model for One-Way Delay Estimation

A Round Trip Time Weighting Model for One-Way Delay Estimation

Count-Free Single-Photon 3D Imaging with Race Logic.

Single-photon cameras (SPCs) have emerged as a promising new technology for high-resolution 3D imaging. A single-photon 3D camera determines the round-trip time of a laser pulse by precisely capturing the arrival of individual photons at each camera pixel. Constructing photon-timestamp histograms is a fundamental operation for a single-photon 3D camera. However, in-pixel histogram processing is computationally expensive and requires large amount of memory per pixel. Digitizing and transferring photon timestamps to an off-sensor histogramming module is bandwidth and power hungry. Can we estimate distances without explicitly storing photon counts? Yes-here we present an online approach for distance estimation suitable for resource-constrained settings with limited bandwidth, memory and compute. The two key ingredients of our approach are (a) processing photon streams using race logic, which maintains photon data in the time-delay domain, and (b) constructing count-free equi-depth histograms as opposed to conventional equi-width histograms. Equi-depth histograms are a more succinct representation for "peaky" distributions, such as those obtained by an SPC pixel from a laser pulse reflected by a surface. Our approach uses a binner element that converges on the median (or, more generally, to another k-quantile) of a distribution. We cascade multiple binners to form an equi-depth histogrammer that produces multi-bin histograms. Our evaluation shows that this method can provide at least an order of magnitude reduction in bandwidth and power consumption while maintaining similar distance reconstruction accuracy as conventional histogram-based processing methods.

SCALABILITY IMPROVEMENT OF ACTIVE PROBING FOR FAILURE DETECTION IN LARGE-SCALE SOFTWARE DEFINED NETWORKS USING COMMUNITY DETECTION ALGORITHMS

Software-Defined Networking (SDN) is a networking approach that separates the network's control plane and data plane to provide better network control. The nature of SDN requires an essential focus on its reliability and availability, which includes failure detection aspects. Several techniques have been proposed to enhance SDN failure detection, including passive and active approaches. However, the Route Inspection (RI) algorithm, an example of the active probing method in active detection, has scalability issues when deployed in large-scale networks as it generates inefficient and lengthy probe paths. To address this, we propose using community detection (CD) algorithms to improve the probe path generation of the RI algorithm, resulting in the 'Failure Detection using Community Detection and probing (FDCD)' framework. With the aim to reduce travel paths, the proposed framework minimizes the network topology using CD algorithms to reduce the topology size into smaller communities. Then, the RI algorithm calculates the probe path in the communities instead of the single large topology, thus improving the efficiency of the failure detection mechanism. This paper adopts three community detection algorithms: Louvain, Label Propagation, and Girvan-Newman. We evaluate the framework using three well-known network topologies, COST266, PIORO40, and GERMANY50, in Mininet to observe the framework's performance. The results indicate that the proposed approach improves the algorithm's scalability against its baseline approach, improving the average probe round trip time by 66.87% and the average path installation time by 2.67%.

Optimizing Vertical Transportation in Buildings: Strategies for Efficiency, Safety, and User Experience

The design and planning of vertical transportation systems within buildings are critical components that profoundly impact the overall functionality, safety, and user experience. As urban landscapes evolve, with the construction of taller and more complex structures, the demand for efficient vertical mobility solutions becomes increasingly imperative. This abstract delves into key strategies for optimizing vertical transportation within buildings, encompassing considerations such as traffic analysis, smart systems, energy efficiency, and user experience. Key Words: vertical transportation, lifts, escalator, Round trip time, Waiting time, Rated speed.

Named Multipath Depth-First Search: An SDN-based Routing Strategy for Efficient Failure Handling and Content Delivery in NDN

Information-centric networking (ICN) architectures, such as named data networking (NDN), have emerged as potential solutions for efficiently retrieving and delivering content. However, challenges remain regarding routing scalability, resilience, and caching efficiency. Software-defined networking (SDN) offers opportunities to optimize NDN implementations through centralized control and programmability. In this paper, we propose Named Multipath DFS, an SDN-based routing and caching scheme for NDN networks. NMDFS leverages a centralized controller to pre-compute multipath routes and implement coordinated caching. We evaluate NMDFS on an emulated topology testbed against default NDN and Named-data link state routing. The results demonstrate significant improvements with NMDFS, reducing overhead signalling costs by 94% and 78%, respectively, compared with other schemes. Round-trip latencies for content retrieval were reduced by up to 98%. The SDN controller’s global network view and control are leveraged to optimize content caching through packet loss-driven adaptation and eliminate redundant messaging, leading to substantial performance gains.