Nowadays, numerous transport protocols utilizing different congestion signals are being developed to address network congestion in datacenter networks (DCNs) and meet the requirements of low latency and high throughpu...
详细信息
ISBN:
(纸本)9798350364613;9798350364606
Nowadays, numerous transport protocols utilizing different congestion signals are being developed to address network congestion in datacenter networks (DCNs) and meet the requirements of low latency and high throughput. As new transport protocols are gradually introduced, DCNs become heterogeneous and enter a different transport coexistence state where they often encounter unfair bandwidth allocation. Nevertheless, existing research has not provided a comprehensive and in-depth understanding of the underlying causes of this fairness issue. In this paper, we scrutinize the performance of numerous datacenter transport protocols in different transport coexistence scenarios and observe that this fairness issue is closely linked to the steady-state buffer length of a transport protocol. Through our in-depth analysis, we ascertain that the earlier a protocol reacts to network congestion, the more likely it is to experience bandwidth depletion.
Harmonic resonance is increasingly observed in many European residential low-voltage networks, warranting its characterization and detection. Various simulation models of such networks were developed to perform harmon...
详细信息
ISBN:
(数字)9781665466189
ISBN:
(纸本)9781665466189
Harmonic resonance is increasingly observed in many European residential low-voltage networks, warranting its characterization and detection. Various simulation models of such networks were developed to perform harmonic studies, but they are not optimized to represent the varying harmonic resonance characteristics and the parameters it affects. To bridge this gap, a detailed simulation model in the frequency domain is proposed in this paper. The model represents the low-voltage network including its residential customers. One of the novel contributions of this paper is the realistic modeling of customer-side harmonic impedance. Equivalent circuits of various time-dependent combinations of household devices are derived, which were identified based on customer behavior. The simulation model is validated against measurements obtained from German low-voltage networks for their representativeness. An application example is provided to highlight the usefulness of the proposed model.
Recently, plant disease detection has become a main concern in the field of agriculture. The early detection and identification of plant disease supports the farmers for considering precaution metrics by protecting th...
详细信息
Improving the overall quality of exercise is crucial for achieving effective and safe techniques during gym workouts. Moreover, identifying errors during workouts can optimize training benefits and minimize the risk o...
详细信息
ISBN:
(纸本)9798350384734;9798350384727
Improving the overall quality of exercise is crucial for achieving effective and safe techniques during gym workouts. Moreover, identifying errors during workouts can optimize training benefits and minimize the risk of injury. In this paper, we propose a cross-domain method to exploit angle information in human pose skeletons, aiming to detect fine-grained posture problems in complex real-world environments. Specifically, we integrate the Geometric Representation Extraction (GRE) module along with transformer-based pose estimation. Our approach demonstrates efficacy on the Fitness-AQA dataset, which comprises authentic exercise samples captured in real-world gym settings. This performance is achieved after pose estimation with approximately 164k parameters in its base configuration. The experimental results highlight that our method is a competitive approach compared to self-supervised video/image approaches in complex environments. In the Back Squat exercise, our method outperforms Motion Disentangling (MD) in detecting Knee Inward Error (KIE) with an F1-score of 0.4398. For Static Shallow Squat Error, it achieved the second-best F1-score of 0.8677, just 0.0017 below Cross-View Cross-Subject Pose Contrastive Learning (CVCSPC). In the Overhead Press exercise, the method significantly improved the detection of Knee error, achieving an Fl-score of 0.8160, surpassing CVCSPC and other methods. Overall, these results demonstrate that the proposed method provides competitive performance compared to the state-of-the-art models while using 187x fewer parameters than the model with the highest performance in the AQA dataset, the Motion Disentangling (MD) approach. Code will be available at: https://***/CaroFernando/G3inPose
The intricate stances, the need to comprehend multiple points of view, and the varied settings in which the action unfolds are the main obstacles. In this paper, a new Capsule Network (CapsNet) is proposed as a soluti...
详细信息
Students in content-based courses in Asia sometimes become passive in class as a result of the prevalence of traditional teacher-fronted instruction and lecture-based learning. As a result, there has been a current pu...
详细信息
Software-defined networking (SDN) is a transformative technology that systematically centralises and manages network resources. This paradigm shift allows for greater flexibility, agility, and efficiency in network ma...
详细信息
The scarcity of energy resources and computational capabilities poses significant challenges for Unmanned Aerial Vehicles (UAVs) when tasked with executing time-sensitive and complex demands, such as those necessary f...
详细信息
ISBN:
(纸本)9798350350227;9798350350210
The scarcity of energy resources and computational capabilities poses significant challenges for Unmanned Aerial Vehicles (UAVs) when tasked with executing time-sensitive and complex demands, such as those necessary for Artificial Intelligence (AI)-enabled applications. Integrating Unmanned Ground Vehicles (UGVs) in Ground-Air Cooperative systems offers a promising solution by providing additional computational and storage capacities near the point of need. However, these systems' distributed, dynamic, and resource-constrained nature presents a critical challenge for efficient task scheduling. This study introduces a novel two-tiered distributed online task scheduling approach aimed at optimizing the resource utilization of UGVs in edge computing environments. Our methodology encompasses two algorithms: a task dispatching algorithm designed to identify a UGV server that meets the deadline requirements while minimizing energy consumption and a computing scheduling algorithm that employs the Earliest Deadline First (EDF) strategy to refine the sequence in which tasks are processed, thereby reducing the average task completion time. We thoroughly assess the performance of the suggested algorithm with state-of-the-art methods using the OMNeT++ network simulator. The outcomes indicate that the proposed method significantly reduces the average task latency and energy consumption while meeting task deadline requirements.
The goal of (network) intrusion detection systems is to identify unauthorized or malicious activities within a computer network. In this work we consider the following theoretical model for intrusion detection systems...
详细信息
ISBN:
(纸本)9798350386066;9798350386059
The goal of (network) intrusion detection systems is to identify unauthorized or malicious activities within a computer network. In this work we consider the following theoretical model for intrusion detection systems in large data center networks. We assume that the network is modeled as a leaf-spine-architecture with m spine nodes and n leaves. In a sequence of observation periods, each spine node stores a snapshot of the communication graph and accumulates (an approximation of) the number of alerts caused by suspicious behavior. To identify the responsible malicious nodes, we apply a distributed reconstruction algorithm based on quantitative group testing: In quantitative group testing we are given a binary signal sigma of Hamming weight k along with a querying method. Each query pools multiple entries of s together and returns the sum of the entries in the pool. The goal is to reconstruct s using as few queries as possible. Our contributions in this paper are three-fold. First we mathematically analyze a distributed reconstruction algorithm for the quantitative group testing instance induced by our intrusion detection model. In particular, we analyze the performance assuming a communication graph where each leaf sends Geom(p) many packets to the spine nodes in each time interval, where p is a parameter of the model. Second, we prove that our algorithm achieves a performance that is optimal up to logarithmic factors. Finally, we simulate our approach and provide empirical data that show that our approach works well in practice. The main novelty of our analysis is that the test-design is given by the communication graphs that are accumulated in multiple observation periods. This is in contrast to classical group testing where the algorithm is allowed to decide on the test design, and we believe that our analysis of non-standard test designs is of independent interest to the distributed group testing community.
Bulletin boards (BB) are important cryptographic building blocks that, at their core, provide a broadcast channel with memory. BBs are widely used within many security protocols, including secure multi-party computati...
详细信息
ISBN:
(纸本)9798350362046;9798350362039
Bulletin boards (BB) are important cryptographic building blocks that, at their core, provide a broadcast channel with memory. BBs are widely used within many security protocols, including secure multi-party computation protocols, e-voting systems, and electronic auctions. Even though the security of protocols crucially depends on the underlying BB, as also highlighted by recent works, the literature on constructing secure BBs is sparse. The so-far only provably secure BBs requiretrusted components and sometimes also networks without message loss, which makes them unsuitable for applications with particularly high security needs where these assumptions might not always be met. In this work, we fill this gap by leveraging the concepts of accountability and universal composability (UC). More specifically, we propose the first ideal functionality for accountable BBs that formalizes the security requirements of such BBs in UC. We then propose Fabric*(BB) as a slight extension designed on top of Fabric*, which is a variant of the prominent Hyperledger Fabric distributed ledger protocol, and show that Fabric*(BB) UC-realizes our ideal BB functionality. This result makes Fabric*(BB) the first provably accountable BB, an often desired, but so far not formally proven property for BBs, and also the first BB that has been proven to be secure based only on standard cryptographic assumptions and without requiring trusted BB components or network assumptions. Through an implementation and performance evaluation we show that Fabric*(BB) is practical for many applications of BBs.
暂无评论