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

Hard-state Protocol Independent Multicast-Source-Specific Multicast (HPIM-SSM)

IET NETWORKS 2024年第5-6期13卷 486-512页

作者： Grilo, Ana Catarina Oliveira, Pedro Valadas, Rui Univ Lisbon Inst Telecomunicacoes Lisbon Portugal Univ Lisbon Inst Super Tecn Lisbon Portugal

Source-specific multicast is a key technology for multicast services such as IPTV broadcasting, which relies on IGMPv3/MLDv2 for source-group membership signalling and multicast routing protocols such as PIM-SSM for building and maintaining receiver-initiated source-based distribution trees across the network. The authors propose the Hard-state Protocol Independent Multicast-Source-Specific Multicast (HPIM-SSM), a novel multicast routing protocol that keeps the design principles of PIM-SSM but overcomes its limitations, such as slow convergence and the possibility of creating suboptimal trees. The state machines of HPIM-SSM were designed to react promptly to all network events susceptible to reconfiguring the multicast trees, avoiding the need for soft-state maintenance through the periodic transmission of control messages. Moreover, the authors eliminated the need for designated routers, which led to suboptimal trees, and introduced a control-driven assert protocol that operates per source, allowing for considerable memory savings. Finally, the protocol enables the coexistence of multiple unicast routing protocols. HPIM-SSM was implemented in Python, and its correctness was extensively validated through model-checking techniques. Furthermore, a comparison between HPIM-SSM and PIM-SSM was conducted, encompassing both theoretical analysis and experimental evaluation of convergence times. The results demonstrate clearly that HPIM-SSM outperforms PIM-SSM, exhibiting significantly faster convergence times and completely avoiding suboptimal trees. The authors propose the Hard-state Protocol Independent Multicast-Source-Specific Multicast (HPIM-SSM), a novel multicast routing protocol that keeps the design principles of PIM-SSM but overcomes its limitations, such as slow convergence and the possibility of creating suboptimal trees. HPIM-SSM was implemented in Python and was extensively tested using model-checking techniques. Furthermore, a comparison between HPIM-SSM and

关键词： distributed algorithms fault tolerance multicast communication routing protocols

来源：评论

学校读者我要写书评

暂无评论

distributed Stochastic Dual Subgradient for Constraint-Coupled Optimization

引用

IEEE CONTROL SYSTEMS LETTERS 2022年 6卷 644-649页

作者： Camisa, Andrea Notarnicola, Ivano Notarstefano, Giuseppe Univ Bologna Dept Elect Elect & Informat Engn I-40136 Bologna Italy

In this letter we consider a distributed stochastic optimization framework in which agents in a network aim to cooperatively learn an optimal network-wide policy. The goal is to compute local functions to minimize the expected value of a given cost, subject to individual constraints and average coupling constraints. In order to handle the challenges of the distributed stochastic context, we resort to a Lagrangian duality approach that allows us to derive an associated stochastic dual problem with a separable structure. Thus, we propose a distributed algorithm, without a central coordinator, that exploits consensus iterations and stochastic approximation to find an optimal solution to the problem, with attractive scalability properties. We demonstrate convergence of the proposed scheme and validate its behavior through simulations.

关键词： Optimization Couplings Stochastic processes Resource management distributed algorithms Minimization IEEE members Optimization algorithms large-scale systems distributed control stochastic optimization

来源：评论

学校读者我要写书评

暂无评论

distributed learning algorithm with synchronized epochs for dynamic spectrum access in unknown environment using multi-user restless multi-armed bandit

引用

JOURNAL OF KING SAUD UNIVERSITY-COMPUTER AND INFORMATION SCIENCES 2022年第8期34卷 5435-5447页

作者： Agrawal, Himanshu Asawa, Krishna Jaypee Inst Informat Technol Dept Comp Sci & Engn & Informat Technol Noida 201304 India

Dynamic spectrum access using cognitive radio has many application areas like smart-grid, Internet of Things, and various other device-to-device communication paradigms. In dynamic spectrum access, a user picks a channel out of N channels to transmit during each time-slot. Thus, the user gets an arbitrary reward from a limited set of reward states, and the selected channel is termed as an active channel. The reward condition of the active channel evolves as per an unknown Markovian chain. In contrast, the reward condition of the passive channels evolves as an arbitrary strange random process. Notably, the objective of a channel selection strategy is to minimize regret by selecting the best channel in terms of mean-availability. A strategy based on consecutive selections (epochs) of channels, dubbed as Adaptive Sequencing of Exploration and Exploitation for Channel Selection in Unknown Environment (ASEE-CSUE), has been proposed. By reasonably planning the sequencing of epochs, ASEE-CSUE can achieve a logarithmic order of regret with time. Furthermore, the extensive simulation results indicate that colli-sions and switching cost are less than 7% and 2%, respectively, and the selection of the best channels is more than 90% of the total time-slots.(c) 2021 The Authors. Published by Elsevier B.V. on behalf of King Saud University. This is an open access article under the CC BY license (http://***/licenses/by/4.0/).

关键词： Restless multi -armed bandits Cognitive radio Decentralized network distributed algorithms Channel selection policy Dynamic spectrum access

来源：评论

学校读者我要写书评

暂无评论

Exponentially convergent distributed Nash equilibrium seeking for constrained aggregative games

引用

Autonomous Intelligent Systems 2022年第1期2卷 71-78页

作者： Shu Liang Peng Yi Yiguang Hong Kaixiang Peng Department of Control Science&Engineering Tongji UniversityShanghai200092China Shanghai Research Institute for Intelligent Autonomous Systems Shanghai201210China School of Automation and Electrical Engineering University of Science and Technology BeijingBeijing100083China

distributed Nash equilibrium seeking of aggregative games is investigated and a continuous-time algorithm is *** algorithm is designed by virtue of projected gradient play dynamics and aggregation tracking dynamics,and is applicable to games with constrained strategy sets and weight-balanced communication *** key feature of our method is that the proposed projected dynamics achieves exponential convergence,whereas such convergence results are only obtained for non-projected dynamics in existing works on distributed optimization and equilibrium *** examples illustrate the effectiveness of our methods.

关键词： distributed algorithms Aggregative games Projected gradient play Weight-balanced graph Exponential convergence

来源：评论

学校读者我要写书评

暂无评论

Game Theoretical Approaches for Optimizing Multi-Carrier Half-Duplex Successive Relaying Based Cooperative NOMA

IEEE OPEN JOURNAL OF VEHICULAR TECHNOLOGY

引用

IEEE OPEN JOURNAL OF VEHICULAR TECHNOLOGY 2024年 5卷 1663-1679页

作者： Horler, H. Rastegari, B. Ng, S. X. Univ Southampton Sch Elect & Comp Sci Southampton SO17 1BJ England

In this work, a novel power auctioneers network is proposed to allow the sharing of resources from Edge Users in exchange for performance gains using either the Cooperative Non-Orthogonal Multiple Access (C-NOMA) or Half-Duplex Successive Relaying based C-NOMA protocol. The latter is presented as a novel method of using two relays in C-NOMA through successive relaying to overcome the multiplexing loss in traditional C-NOMA of the far user. This system exploits two matching-based algorithms based on game theory, namely Conventional distributed Algorithm (CDA) and Pragmatic distributed Algorithm (PDA), to handle the challenge of user pairing and power allocation in multi-carrier networks. These approaches use distributed methods to perform tasks on user devices to remove the strain on the base station's resources. Monte Carlo simulations demonstrate that the addition of these games to a wireless network provides a significant performance gain compared to traditional orthogonal multiple access methods, unoptimised C-NOMA, and the distributed Matching Algorithm. Specifically, the cooperative game of PDA is shown to perform better in several scenarios, including when the subcarrier assignment was fixed and when EUs could occupy multiple subcarriers to enhance their throughput.

关键词： NOMA Resource management Games Relays Multiplexing Game theory distributed algorithms Quality of service Protocols Half-duplex system Auction cooperative game theory matching theory multi-carrier

来源：评论

学校读者我要写书评

暂无评论

A fast distributed algorithm for (Δ+1)-edge-coloring

引用

JOURNAL OF COMBINATORIAL THEORY SERIES B 2022年 152卷 319-352页

作者： Bernshteyn, Anton Carnegie Mellon Univ Dept Math Sci Pittsburgh PA 15213 USA Georgia Inst Technol Sch Math Atlanta GA 30332 USA

We present a deterministic distributed algorithm in the LOCAL model that finds a proper (Delta + 1)-edge-coloring of an n-vertex graph of maximum degree Delta in poly(Delta, log n) rounds. This is the first nontrivial distributed edge-coloring algorithm that uses only Delta + 1 colors (matching the bound given by Vizing's theorem). Our approach is inspired by the recent proof of the measurable version of Vizing's theorem due to Grebik and Pikhurko. (c) 2021 Elsevier Inc. All rights reserved.

关键词： Edge-coloring Vizing's theorem distributed algorithms LOCAL model

来源：评论

学校读者我要写书评

暂无评论

The canonical amoebot model: algorithms and concurrency control

引用

distributed COMPUTING 2023年第2期36卷 159-192页

作者： Daymude, Joshua J. Richa, Andrea W. Scheideler, Christian Arizona State Univ Sch Comp & Augmented Intelligence Tempe AZ 85281 USA Arizona State Univ Biodesign Ctr Biocomp Secur & Soc Tempe AZ 85281 USA Paderborn Univ Dept Comp Sci Paderborn Germany

The amoebot model abstracts active programmable matter as a collection of simple computational elements called amoebots that interact locally to collectively achieve tasks of coordination and movement. Since its introduction at SPAA 2014, a growing body of literature has adapted its assumptions for a variety of problems;however, without a standardized hierarchy of assumptions, precise systematic comparison of results under the amoebot model is difficult. We propose the canonical amoebot model, an updated formalization that distinguishes between core model features and families of assumption variants. A key improvement addressed by the canonical amoebot model is concurrency. Much of the existing literature implicitly assumes amoebot actions are isolated and reliable, reducing analysis to the sequential setting where at most one amoebot is active at a time. However, real programmable matter systems are concurrent. The canonical amoebot model formalizes all amoebot communication as message passing, leveraging adversarial activation models of concurrent executions. Under this granular treatment of time, we take two complementary approaches to concurrent algorithm design. We first establish a set of sufficient conditions for algorithm correctness under any concurrent execution, embedding concurrency control directly in algorithm design. We then present a concurrency control framework that uses locks to convert amoebot algorithms that terminate in the sequential setting and satisfy certain conventions into algorithms that exhibit equivalent behavior in the concurrent setting. As a case study, we demonstrate both approaches using a simple algorithm for hexagon formation. Together, the canonical amoebot model and these complementary approaches to concurrent algorithm design open new directions for distributed computing research on programmable matter.

关键词： Programmable matter Self-organization distributed algorithms Concurrency

来源：评论

学校读者我要写书评

暂无评论

Game-Based Formation Control of High-Order Multi-Agent Systems

引用

IEEE TRANSACTIONS ON NETWORK SCIENCE AND ENGINEERING 2023年第1期10卷 140-151页

作者： Deng, Zhenhua Cent South Univ Sch Automat Changsha 410075 Hunan Peoples R China

This paper studies the formation control of high-order multi-agent systems, where the dynamics of agents are $n$-order integrators. Different from existing results, this paper investigates the problem from the viewpoint of aggregative games. An interesting discovery is that the Nash equilibrium of a quadratic aggregative game constitutes the desired formation. Moreover, a distributed algorithm is designed for these high-order agents to form the desired formation by seeking the Nash equilibrium, where every agent estimates the aggregate of the game. Furthermore, the convergence of the algorithm is analyzed via Lyapunov stability theory. In contrast with existing formation protocols, the high-order agents with the proposed algorithm exponentially converge to the desired formation without using the (relative) positions and velocities of formation neighbors. Finally, two examples illustrate the algorithm.

关键词： Games Nash equilibrium Multi-agent systems Heuristic algorithms Formation control Aggregates distributed algorithms Aggregative games formation control high-order systems multi-agent systems nash equilibrium

来源：评论

学校读者我要写书评

暂无评论

A Dominating Tree Based Leader Election Algorithm for Smart Cities IoT Infrastructure

引用

MOBILE NETWORKS & APPLICATIONS 2023年第2期28卷 718-731页

作者： Kadjouh, Nabil Bounceur, Ahcene Bezoui, Madani Khanouche, Mohamed Essaid Euler, Reinhardt Hammoudeh, Mohammad Lagadec, Loic Jabbar, Sohail Al-Turjman, Fadi Univ Bejaia LIMED Lab Bejaia 06000 Algeria CNRS Lab STICC UMR 6285 Brest France Univ Bretagne Occidentale Brest France Univ Boumerdes Dept Math Boumerdes Algeria Manchester Metropolitan Univ Manchester Lancs England ENSTA Bretagne Brest France Antalya Bilim Univ Antalya Turkey

In wireless sensor and IoT networks dedicated to smart-cities, a leader node performs critical tasks such as generating encryption/decryption keys. In this paper, the leader is the node situated at the extreme left of the network. It is the node which starts the algorithm of searching the boundary nodes. These nodes will be used to monitor any sensitive, dangerous or inaccessible site. For this type of application, the used algorithm must be robust and fault-tolerant because it is difficult or even impossible to intervene in the presence of node failures. If this node is the leader, such a situation can be catastrophic. In this article, we present a new algorithm called DoTRo, which is based on a tree routing protocol. It starts with local leaders which will launch the flooding process to determine a spanning tree. During this process, their values will be forwarded. If two spanning trees meet, the tree that routes the best value continues its process while the other tree stops. The remaining tree root will be the leader. This algorithm is low energy consuming with reduction rates that can exceed 85%with respect to the classical minium finding algorithm. It is efficient and fault-tolerant since it works even in the presence of node failures and communication disconnectivity. Additionally, the energy consumption is well balanced between nodes. Finally, the complexity and the proof of convergence of the proposed algorithm is presented.

关键词： Wireless sensor network IoT Leader election distributed algorithms Dominating tree and smart-cities

来源：评论

学校读者我要写书评

暂无评论

On the dissertation "Scalable SAT Solving and its Application"

引用

IT-INFORMATION TECHNOLOGY 2025年第1期67卷 46-53页

作者： Schreiber, Dominik Karlsruhe Inst Technol Inst Informat Secur & Dependabil Karlsruhe Germany

The author's dissertation, entitled "Scalable SAT Solving and its Application", advances the efficient resolution of instances of the propositional satisfiability (SAT) problem, one of the prototypical "hard problems" of computer science with many scientific and industrial real-world applications. A particular focus is put on exploiting massively parallel computational environments, such as high-performance computing (HPC) systems or cloud computing. The dissertation has resulted in world-leading solutions for scalable automated reasoning and in a number of awards from the SAT community, and has most recently been acknowledged with a GI Dissertation Award. The article at hand summarizes the topic, approaches, and central results of the dissertation, estimates the work's long-term impact and its role for future research, and closes with some personal notes.

关键词： automated reasoning satisfiability symbolic AI high-performance computing distributed algorithms automated planning

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：