检索结果-内蒙古大学图书馆

28th International Conference on Principles of Distributed Systems, OPODIS 2024

作者： Pourdamghani, Arash Avin, Chen Sama, Robert Shiran, Maryam Schmid, Stefan TU Berlin Germany Ben-Gurion University of the Negev Beersheba Israel University of Vienna Austria Fraunhofer SIT Berlin Germany

ISBN: (纸本)9783959773607

Distributed systems often serve dynamic workloads and resource demands evolve over time. Such a temporal behavior stands in contrast to the static and demand-oblivious nature of most data structures used by these systems. In this paper, we are particularly interested in consistent hashing, a fundamental building block in many large distributed systems. Our work is motivated by the hypothesis that a more adaptive approach to consistent hashing can leverage structure in the demand, and hence improve storage utilization and reduce access time. We initiate the study of demand-aware consistent hashing. Our main contribution is H&A, a constant-competitive online algorithm (i.e., it comes with provable performance guarantees over time). H&A is demand-aware and optimizes its internal structure to enable faster access times, while offering a high utilization of storage. We further evaluate H&A empirically. © Arash Pourdamghani, Chen Avin, Robert Sama, Maryam Shiran, and Stefan Schmid.

关键词： consensus algorithm

来源：评论

学校读者我要写书评

暂无评论

Unplugging Dijkstra’s algorithm as a Mechanical Device 7th

Unplugging Dijkstra’s Algorithm as a Mechanical Device

引用

7th International Conference on Creative Mathematical Sciences Communication, CMSC 2024

作者： Jacob, Riko Silvestri, Francesco IT University of Copenhagen Copenhagen Denmark University of Padua Padua Italy

ISBN: (纸本)9783031732560

Graphs are a fundamental concept in computer science, effectively modeling diverse scenarios such as social networks, protein interactions, and mobility. Dijkstra’s algorithm is crucial for computing single-source shortest path in graphs and is a key component of graph processing. This paper presents an educational activity designed to "unplug" graphs and Dijkstra’s algorithm, making these topics accessible to a broad audience. The activity utilizes a physical graph with chains as edges and key rings with retractable badge holders as nodes. By pulling two nodes of this graph apart, it is possible to find a shortest path between these nodes. This can be used to visualize how Dijkstra’s algorithm works, including how the graph models the world. It invites for discussing how much more efficient this is compared to enumerating all paths, and what additional insights computer scientists had to achieve impressive speedups over plain Dijkstra, allowing for route planning to be perceived as a solved problem, where we use the packaged solution without further thought. We discuss the implementation of this activity in public outreach events, such as Culture Nights and primary school classrooms. © The Author(s), under exclusive license to Springer Nature Switzerland AG 2025.

关键词： consensus algorithm

来源：评论

学校读者我要写书评

暂无评论

Next-Generation Relay Voting Scheme Design Leveraging consensus algorithms

Next-Generation Relay Voting Scheme Design Leveraging Consen...

引用

Power and Energy Conference at Illinois (PECI)

作者： Nicholas Jacobs Adam Summers Shamina Hossain-McKenzie Daniel Calzada Hanyue Li Zeyu Mao Chris Goes Katherine Davis Komal Shetye Sandia National Laboratories Texas A&M University

ISBN: (纸本)9781728186481;9781728186498

Traditional protective relay voting schemes utilize simple logic to achieve confidence in relay trip actions. However, the smart grid is rapidly evolving and there are new needs for a next-generation relay voting scheme. In such new schemes, aspects such as inter-relay relationships and out-of-band data can be included. In this work, we explore the use of consensus algorithms and how they can be utilized for groups of relays to vote on system protection actions and also reach consensus on the values of variables in the system. A proposed design is explored with a simple case study with two different scenarios, including simulation in PowerWorld Simulator, to demonstrate the consensus algorithm benefits and future directions are discussed.

关键词： Conferences Protective relaying consensus algorithm Load shedding Power systems Smart grids Security

来源：评论

学校读者我要写书评

暂无评论

Engineering Fully Dynamic Exact ∆-Orientation algorithms

Engineering Fully Dynamic Exact ∆-Orientation Algorithms

引用

2025 SIAM Symposium on algorithm Engineering and Experiments, ALENEX 2025

作者： Großmann, Ernestine Reinstädtler, Henrik Schulz, Christian Walliser, Fabian Heidelberg University Germany

ISBN: (纸本)9798331311995

A (fully) dynamic graph algorithm is a data structure that supports edge insertions, edge deletions, and answers specific queries pertinent to the problem at hand. In this work, we address the fully dynamic edge orientation problem, also known as the fully dynamic ∆-orientation problem. The objective is to maintain an orientation of the edges in an undirected graph such that the out-degree of any vertex remains low. When edges are inserted or deleted, it may be necessary to reorient some edges to prevent vertices from having excessively high out-degrees. In this paper, we introduce the first algorithm that maintains an optimal edge orientation during both insertions and deletions. In experiments comparing with recent nearly exact algorithms, we achieve a 32% lower running time. The update time of our algorithm is up to 6 orders of magnitude faster than static exact algorithms. Copyright © 2025 by SIAM.

关键词： consensus algorithm

来源：评论

学校读者我要写书评

暂无评论

Finding longer cycles via shortest colourful cycle 8

Finding longer cycles via shortest colourful cycle

引用

8th SIAM Symposium on Simplicity of algorithms, SOSA 2025

作者： Björklund, Andreas Husfeldt, Thore IT University of Copenhagen Denmark

ISBN: (纸本)9781611978315

We consider the parameterised k, e-Long Cycle problem, in which you are given an n-vertex undirected graph G, a specified edge e in G, and a positive integer k, and are asked to decide if the graph G has a simple cycle through e of length at least k. We show how to solve the problem in 1.731k poly(n) time, improving over the 2k poly(n) time algorithm by [Fomin et al., TALG 2024], but not the more recent 1.657k poly(n) time algorithm by [Eiben, Koana, and Wahlström, SODA 2024]. When the graph is bipartite, we can solve the problem in 2k/2 poly(n) time, matching the fastest known algorithm for finding a cycle of length exactly k in an undirected bipartite graph [Björklund et al., JCSS 2017]. Our results follow the approach taken by [Fomin et al., TALG 2024], which describes an efficient algorithm for finding cycles using many colours in a vertex-coloured undirected graph. Our contribution is twofold. First, we describe a new algorithm and analysis for the central colourful cycle problem, with the aim of providing a comparatively short and self-contained proof of correctness. Second, we give tighter reductions from k, e-Long Cycle to the colourful cycle problem, which lead to our improved running times. Copyright © 2025 Copyright for this paper is retained by authors.

关键词： consensus algorithm

来源：评论

学校读者我要写书评

暂无评论

Performance Evaluation of Blockchain consensus algorithms for Electronic Health Record Sharing

Performance Evaluation of Blockchain Consensus Algorithms fo...

引用

Global Congress on Electrical Engineering (GC-ElecEng)

作者： Faiza Hashim Khaled Shuaib Farag Sallabi College of Information Technology United Arab Emirates University Al Ain UAE

ISBN: (纸本)9781665420396

In any blockchain network, a consensus algorithm is considered a major factor in determining the performance of the network. This study aims to investigate consensus algorithms in healthcare blockchains for electronic health record (EHR) sharing by analyzing the scalability performance of these algorithms. Several consensus algorithms have been proposed in the literature and have been used for various types of blockchain networks. Herein, we analyze the performance of proof of work, practical Byzantine fault tolerance, and proof of authority (PoA) algorithms in the healthcare domain and propose an improved real-time PoA consensus algorithm for EHR sharing for faster consensus and block generation. Results of performed simulations show that the proposed algorithm outperforms previous consensus algorithms in terms of consensus time, number of blocks generated, network throughput, and scalability.

关键词： Performance evaluation Scalability Simulation consensus algorithm Medical services Throughput Proof of Work

来源：评论

学校读者我要写书评

暂无评论

Bipartite Domination in Graphs: Complexity and algorithms 11th

Bipartite Domination in Graphs: Complexity and Algorithms

引用

11th International Conference on algorithms and Discrete Applied Mathematics, CALDAM 2025

作者： Panda, Bhawani Sankar Joshi, Subhasmita Jacob, Dalu Department of Computer Science and Engineering The LNM Institute of Information Technology Jaipur302031 India Department of Mathematics Indian Institute of Technology Delhi Hauz Khas New Delhi110016 India

ISBN: (纸本)9783031834370

A set D⊆V of vertices of a graph G=(V,E) is called a dominating set of G if for every vertex u∈V\D, there exists a vertex v∈D such that uv∈E(G). A dominating set D is called a bipartite dominating set if G[D], the subgraph induced by D, is bipartite. The domination number of G is the minimum cardinality among all dominating sets of G and it is denoted by γ(G). The bipartite domination number of G is the minimum cardinality among all bipartite dominating sets of G and it is denoted by γbip(G). The Min Dom problem is to find a dominating set of minimum cardinality of a given graph G and Decide Dom is the decision version of the Min Dom problem. Similarly, the Min Bip-Dom problem is to find a bipartite dominating set of minimum cardinality of a given graph G and Decide Bip-Dom is the decision version of the Min Bip-Dom problem. In this paper, we initiate the algorithmic study of the Min Bip-Dom problem. First, we study the complexity difference between the Min Dom problem and the Min Bip-Dom problem. The difference between γbip(G) and γ(G) of a graph G can be arbitrarily large. However, the Decide Bip-Dom problem is the same as the Decide Dom problem for bipartite graphs and hence is NP-complete for bipartite graphs, as Decide Dom problem is known to be NP-complete for bipartite graphs. We show that Decide Bip-Dom is NP-complete for non-bipartite graphs as well. Finally, we propose polynomial-time algorithms for the Min Bip-Dom problem for interval graphs and block graphs. © The Author(s), under exclusive license to Springer Nature Switzerland AG 2025.

关键词： consensus algorithm

来源：评论

学校读者我要写书评

暂无评论

LBSV: Lightweight Blockchain Security Protocol for Secure Storage and Communication in SDN-Enabled IoV

引用

IEEE TRANSACTIONS ON VEHICULAR TECHNOLOGY 2022年第6期71卷 5983-5994页

作者： Vishwakarma, Lokendra Nahar, Ankur Das, Debasis Indian Inst Technol IIT Dept Comp Sci & Engn Comp Sci & Engn Jodhpur 342304 Rajasthan India

The development of modern software-defined networking (SDN) solutions brings new opportunities in Internet-of-Vehicles (IoVs). However, the autonomous nature of the vehicular environment leads to unpredictable security vulnerabilities and reliability issues. The high computation overhead and storage requirements also pose a significant challenge in message dissemination. To overcome these issues, we introduce a lightweight blockchain-based security protocol for secure communication and storage in SDN-enabled IoV, known as LBSV. The LBSV is a permissioned blockchain network that uses the proposed modified practical byzantine fault tolerance (mPBFT) consensus algorithm. Additionally, the SDN-enabled network exploits the blockchain framework and schedules different procedures. The secure message dissemination is achieved through various cryptographic functions (i.e., elliptic curve cryptography (ECC) and the secure hash algorithm (SHA256)). The security analysis shows that the LBSV withstands various cyberattacks regarding message dissemination privacy. The experimental results show that LBSV provides high performance with 85% less computational cost, 55% less storage and communication overhead and 90% less consensus delay compared with state-of-the-art schemes.

关键词： Blockchains Security Computer architecture Secure storage consensus algorithm Protocols Authentication Blockchain consensus algorithm Internet-of-Vehicle (IoV) software defined networking (SDN)

来源：评论

学校读者我要写书评

暂无评论

Nonsmooth Continuous-Time Distributed algorithms for Seeking Generalized Nash Equilibria of Noncooperative Games via Digraphs

引用

IEEE TRANSACTIONS ON CYBERNETICS 2022年第7期52卷 6196-6206页

作者： Lu, Kaihong Zhu, Qixin Jiangsu Univ Sch Elect & Informat Engn Zhenjiang 212013 Jiangsu Peoples R China Suzhou Univ Sci & Technol Sch Mech Engn Suzhou 215009 Peoples R China

In this article, the problem of distributed generalized Nash equilibrium (GNE) seeking in noncooperative games is investigated via multiagent networks, where each player aims to minimize his or her own cost function with a nonsmooth term. Each player's cost function and feasible action set in the noncooperative game are both determined by actions of others who may not be neighbors, as well as his/her own action. Particularly, feasible action sets are constrained by private convex inequalities and shared linear equations. Each player can only have access to his or her own cost function, private constraint, and a local block of shared constraints, and can only communicate with his or her neighbours via a digraph. To address this problem, a novel continuous-time distributed primal-dual algorithm involving Clarke's generalized gradient is proposed based on consensus algorithms and the primal-dual algorithm. Under mild assumptions on cost functions and graph, we prove that players' actions asymptotically converge to a GNE. Finally, a simulation is presented to demonstrate the effectiveness of our theoretical results.

关键词： Games Cost function Distributed algorithms Mathematical model consensus algorithm Topology Nash equilibrium Distributed algorithm multiagent networks Nash equilibrium (NE) noncooperative game

来源：评论

学校读者我要写书评

暂无评论

Multi-UAV Information Fusion and Cooperative Trajectory Optimization in Target Search

引用

IEEE SYSTEMS JOURNAL 2022年第3期16卷 4325-4333页

作者： Yao, Peng Wei, Xin Ocean Univ China Shandong Prov Key Lab Ocean Engn Qingdao 266100 Peoples R China Ocean Univ China Coll Engn Qingdao 266100 Peoples R China

With the increasing complexity of the search environment, it is particularly important for multiunmanned aerial vehicles (UAVs) to achieve a safe and efficient search for a dynamic target. For the communication network and information fusion among multi-UAVs, we adopt the minimum spanning tree structure as the communication network, and then based on this structure, the consensus algorithm with state predictor is utilized for the fusion of predicted target probability map. Moreover, based on the traditional model predictive control (MPC), the future-dependent MPC framework is proposed to realize the cooperative trajectory optimization and obtain the optimal control input, and especially the objective function of trajectory optimization is established by considering comprehensively the communication performance and the search performance. Finally, the feasibility of our method in the multi-UAV cooperative search task is verified via simulation.

关键词： Communication networks Trajectory optimization Task analysis consensus algorithm Mathematical models Interference Convergence Communication performance information fusion multiunmanned aerial vehicles (UAVs) search perfor-mance trajectory optimization

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：