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

A Decentralized Primal-Dual Method for Constrained Minimization of a Strongly Convex Function

IEEE TRANSACTIONS ON AUTOMATIC CONTROL 2022年第11期67卷 5682-5697页

作者： Hamedani, Erfan Yazdandoost Aybat, Necdet Serhat Univ Arizona Syst & Ind Engn Dept Tucson AZ 85721 USA Penn State Univ Ind & Mfg Engn Dept State Coll PA 16801 USA

We propose decentralized primal-dual methods for cooperative multiagent consensus optimization problems over both static and time-varying communication networks, where only local communications are allowed. The objective is to minimize the sum of agent-specific convex functions over conic constraint sets defined by agent-specific nonlinear functions;hence, the optimal consensus decision should lie in the intersection of these private sets. Under the strong convexity assumption, we provide convergence rates for suboptimality, infeasibility, and consensus violation in terms of the number of communications required;examine the effect of underlying network topology on the convergence rates.

关键词： Optimization Convex functions Communication networks Minimization Ellipsoids Convergence Clocks Convergence analysis constrained optimization distributed algorithms saddle point problem

来源：评论

学校读者我要写书评

暂无评论

A Fast distributed Solver for Linear Systems Under Generalized Diagonal Dominance

引用

IEEE TRANSACTIONS ON AUTOMATIC CONTROL 2021年第5期66卷 2423-2429页

作者： Zhang, Zhaorong Cai, Qianqian Fu, Minyue Univ Newcastle Sch Elect Engn & Comp Univ Dr Callaghan NSW 2308 Australia Guangdong Univ Technol Sch Automat Guangdong Key Lab ioT Informat Technol Guangzhou 510006 Peoples R China

This article proposes a new distributed algorithm for solving linear systems associated with a sparse graph under a generalized diagonal dominance assumption. The algorithm runs iteratively on each node of the graph, with low complexities on local information exchange between neighboring nodes, local computation, and local storage. For an acyclic graph under the condition of diagonal dominance, the algorithm is shown to converge to the correct solution in a finite number of iterations, equaling the graph diameter. For a loopy graph, the algorithm is shown to converge to the correct solution asymptotically. Simulations verify that the proposed algorithm significantly outperforms the classical Jacobi method and an orthogonal projection-based method.

关键词： Linear systems distributed algorithms Jacobian matrices Information exchange Nickel Complexity theory Iterative methods distributed algorithm distributed estimation distributed optimization linear systems

来源：评论

学校读者我要写书评

暂无评论

Energy Block-Based Peer-to-Peer Contract Trading With Secure Multi-Party Computation in Nanogrid

引用

IEEE TRANSACTIONS ON SMART GRID 2022年第6期13卷 4759-4772页

作者： Mu, Chenggang Ding, Tao Sun, Yuge Huang, Yuhan Li, Fangxing Siano, Pierluigi Xi An Jiao Tong Univ Sch Elect Engn Xian 710049 Shaanxi Peoples R China Univ Tennessee Dept Elect Engn & Comp Sci Knoxville TN 37996 USA Univ Salerno Dept Management & Innovat Syst I-84084 Fisciano Italy

The emergence of nanogrid has led to active local energy markets. Renewable energy sources and flexible energy storages in nanogrids provide favorable conditions for establishing a sustainable bilateral trading market. However, due to the diversity of energy sources in nanogrids, it is difficult to establish a uniform scheduling scheme. To this end, this paper first establishes an effective peer-to-peer energy block contract market to provide a scheme for users to exchange energy at any time interval. The goal is to maximize contract volume while ensuring the economic profitability of all users. Beyond that, a garbled circuit-based price comparison mechanism is proposed based on a secure multi-party computation to achieve price comparison without revealing any individual user's data to other users for privacy preserving. Finally, a fully distributed algorithm is designed by constructing a local tracker to track the inequality amount in iteration. The algorithm also subtly parses the input data, which weakens the intertwined relationship in peer-to-peer transactions and improves computation efficiency. Case studies verify the privacy of the described method and the effectiveness of the energy block contract market.

关键词： Contracts Peer-to-peer computing distributed algorithms Privacy Real-time systems Renewable energy sources Power system stability Energy block peer-to-peer secure multi-party computation distributed algorithm privacy preserving

来源：评论

学校读者我要写书评

暂无评论

Payoff Distribution in Robust Coalitional Games on Time-Varying Networks

引用

IEEE TRANSACTIONS ON CONTROL OF NETWORK SYSTEMS 2022年第1期9卷 511-520页

作者： Raja, Aitazaz Ali Grammatico, Sergio Delft Univ Technol Delft Ctr Syst & Control NL-2628 CD Delft Netherlands

In this article, we consider a sequence of transferable utility coalitional games, where the actual coalitional values are unknown but vary within known bounds. As a solution to the resulting family of games, we formalize the notion of "robust core." Our main contribution is to design two distributed algorithms, namely 1) distributed payoff allocation and 2) distributed bargaining, which converge to a consensual payoff distribution in the robust core. We adopt an operator-theoretic perspective to show convergence of both algorithms executed on time-varying communication networks. An energy storage optimization application motivates our framework for "robust coalitional games."

关键词： distributed algorithms dynamic games energy systems game theory multiagent systems

来源：评论

学校读者我要写书评

暂无评论

distributed Service Placement in Ultra-Dense Edge Computing: A Game-Theoretical Approach 23

Distributed Service Placement in Ultra-Dense Edge Computing:...

引用

23rd IEEE International Conference on High Performance Computing and Communications, 7th IEEE International Conference on Data Science and Systems, 19th IEEE International Conference on Smart City and 7th IEEE International Conference on Dependability in Sensor, Cloud and Big Data Systems and Applications, HPCC-DSS-SmartCity-DependSys 2021

作者： He, Junyi Zhang, Di Li, Xishuo Zhou, Yuezhi Zhang, Yaoxue School of Software Engineering Beijing Jiaotong University China School of Science and Engineering The Chinese University of Hong Kong Shenzhen China School of Computer Science and Engineering Beihang University China Tsinghua University Department of Computer Science and Technology China

ISBN: (纸本)9781665494571

Ultra-dense mobile edge computing (MEC) is expected as an effective approach to provide services with ultra-low latency and massive connectivity, which is extremely important for delay-sensitive applications. In this paper, we study service instance (SI) placement for delay-sensitive applications in ultra-dense MEC, which decides where to place applications and the required data (programming codes and datasets). In general, the SI placement problem is a combinatorial optimization and usually does not have low-complexity optimal solutions. Existing centralized policies are difficult to implement due to the high complexity, especially when edge servers are densely deployed in the ultra-dense network (UDN). To design an approach that can make SI placement decisions quickly and efficiently, this paper investigates a distributed strategy for multi-user multi-server edge systems in UDN. We first formulate the SI placement problem as a non-linear combinatorial optimization, which is proven to be NP-hard to compute a centralized optimal solution. Then, we propose an uncooperative game to design a low-complexity distributed algorithm. We further analyze the properties of the game and prove the existence of pure strategy Nash Equilibrium. A polynomial-complexity distributed algorithm is proposed to get the Nash Equilibrium. Theoretical analysis shows the algorithm's convergence and the bound of the price of anarchy (PoA), which serves as a performance guarantee in the worst-case scenarios compared to the global optimum. Numerical results validate the convergence and near-optimal performance of the proposed distributed algorithm. © 2021 IEEE.

关键词： Performance evaluation Games Reinforcement learning Nash equilibrium Servers distributed algorithms Ultra-dense networks

来源：评论

学校读者我要写书评

暂无评论

Is Performance of Object Storage Predictable for Serverless I/O Workloads? A Comparative Study 31

Is Performance of Object Storage Predictable for Serverless ...

引用

31st IEEE International Conference on Network Protocols (ICNP)

作者： Eizaguirre, German T. Sanchez-Artigas, Marc Univ Rovira & Virgili Comp Sci & Math Tarragona Spain

ISBN: (纸本)9798350303223

Serverless architectures abstract resource provisioning away from the user. However, this property may be at odds with performance. One example of this is Function as a Service (FaaS), where the lack of network addressability compels developers to resort to serverless storage services such as AWS S3 to share (intermediate) data between the functions. For IO-bound workflows, the literature has shown that the performance of parallel reads and writes highly depends on the level of parallelism. Simply put, both an excess or a deficiency in the number of functions may lead to longer IO times. The good news is that the provisioning of functions is fast. Consequently, it is feasible to auto-provision the serverless functions to the optimal number to minimize IO latency. For this, the performance of object storage must be predictable and consistent. We confirmed this in the past for IBM COS. And in this paper, we show that the same occurs to AWS S3. Concretely, we prove that the optimal level of parallelism for parallel reads and writes can be approximated analytically for AWS S3.

关键词： distributed algorithms serverless computing resource management

来源：评论

学校读者我要写书评

暂无评论

Optimized Silent Self-Stabilizing Scheme for Tree-Based Constructions

引用

ALGORITHMICA 2022年第1期84卷 85-123页

作者： Devismes, Stephane Ilcinkas, David Johnen, Colette Univ Picardie Jules Verne Amiens France Univ Bordeaux Bordeaux INP LaBRI CNRSUMR5800 F-33400 Talence France

We propose a general scheme to compute tree-based data structures on arbitrary networks. This scheme is self-stabilizing, silent, and despite its generality, also efficient. It is written in the locally shared memory model with composite atomicity assuming the distributed unfair daemon, the weakest scheduling assumption of the model. Its stabilization time is in at most 4n(maxCC) rounds, where n(maxCC) is the maximum number of processes in any connected component of the network. We illustrate the versatility and efficiency of our approach by proposing several instantiations solving classical spanning tree problems such as DFS, BFS, shortest-path, or unconstrained spanning tree/forest constructions, as well as other fundamental problems like leader election or finding maximum-bottleneck-bandwidth paths. We also exhibit polynomial upper bounds on its stabilization time in steps and process moves, holding for a large class of instantiations. In several cases, the polynomial step and move complexities we obtain for those instantiations match the best known complexities of existing algorithms, despite the latter being dedicated to particular problems. Furthermore, a significant set of instantiations of our scheme requires only bounded memory space per process. This set includes, but is not limited to, DFS, BFS, and shortest-path spanning tree constructions.

关键词： distributed algorithms Self-stabilization Stabilization time Space complexity Spanning tree Leader election Spanning forest

来源：评论

学校读者我要写书评

暂无评论

"Semi-Asynchronous": A New Scheduler in distributed Computing

引用

IEEE ACCESS 2021年 9卷 41540-41557页

作者： Cicerone, Serafino di Stefano, Gabriele Navarra, Alfredo Univ Aquila Dept Informat Engn Comp Sci & Math I-67100 Laquila Italy Univ Perugia Dept Math & Comp Sci I-06123 Perugia Italy

The study of mobile entities that based on local information have to accomplish global tasks is of main interest for the scientific community. Classic models for the activation and synchronization of mobile entities are the fully-synchronous (FSync), semi-synchronous (SSync), and asynchronous (Async) models, where entities alternate between active and inactive states with different timing. According to the assumed synchronization model, very different results have been achieved in the field of distributed computing. One of the main outcomes is the big gap between the Async and the other models in terms of manageability and algorithm design. In fact, there are still many problems for which it is not known whether synchronicity is crucial for designing resolution algorithms or not. In order to better understand the Async case, here we propose a further model referred to as the semi-asynchronous (SAsync). This slightly deviates from SSync. In fact, like in SSync (and FSync), the duration of the activation of an entity is kept of fixed time whereas, like in Async, the starting instant of the activation is not fully synchronized with the possible activation of other entities. We show that for entities moving on graphs, the SSync model allows accomplishing more tasks than the SAsync that in turn allows accomplishing more tasks than the Async. Furthermore, our results show that, especially to tackle problems in the Euclidean plane, the SAsync model is already quite challenging, therefore there is no need to get involved with complications arising in the Async model.

关键词： Robots Computational modeling Synchronization Robot kinematics Task analysis distributed computing Standards distributed algorithms gathering mobile robots synchronization

来源：评论

学校读者我要写书评

暂无评论

Age of Information in Random Access Channels

引用

IEEE TRANSACTIONS ON INFORMATION THEORY 2022年第10期68卷 6548-6568页

作者： Chen, Xingran Gatsis, Konstantinos Hassani, Hamed Bidokhti, Shirin Saeedi Univ Penn Dept Elect & Syst Engn Philadelphia PA 19104 USA Univ Oxford Dept Engn Sci Oxford OX1 3PJ England

In applications of remote sensing, estimation, and control, timely communication is critical but not always ensured by high-rate communication. This work proposes decentralized age-efficient transmission policies for random access channels with M transmitters. We propose the notion of age-gain of a packet to quantify how much the packet will reduce the instantaneous age of information at the receiver side upon successful delivery. We then utilize this notion to propose a transmission policy in which transmitters act in a decentralized manner based on the age-gain of their available packets. In particular, each transmitter sends its latest packet only if its corresponding age-gain is beyond a certain threshold which could be computed adaptively using the collision feedback or found as a fixed value analytically in advance. Both methods improve age of information significantly compared to the state of the art. In the limit of large M, we prove that when the arrival rate is small (below 1/eM), slotted ALOHA-type algorithms are order optimal. As the arrival rate increases beyond 1/eM, while age increases under slotted ALOHA, it decreases significantly under the proposed age-based policies. For arrival rates theta, theta = 1/o(M) , the proposed algorithms provide a multiplicative gain of at least two compared to the minimum age under slotted ALOHA (minimum over all arrival rates). We conclude that it is beneficial to increase the sampling rate (and hence the arrival rate) and transmit packets selectively based on their age-gain. This is surprising and contrary to common practice where the arrival rate is optimized to attain the minimum AoI. We further extend our results to other random access technologies such as Carrier-sense multiple access (CSMA).

关键词： Age of information random access collision channel distributed algorithms stochastic arrival slotted ALOHA carrier sensing multiple access

来源：评论

学校读者我要写书评

暂无评论

distributed-Observer-Based Nash Equilibrium Seeking Algorithm for Quadratic Games With Nonlinear Dynamics

引用

IEEE TRANSACTIONS ON SYSTEMS MAN CYBERNETICS-SYSTEMS 2021年第11期51卷 7260-7268页

作者： Huang, Bomin Zou, Yao Meng, Ziyang Tsinghua Univ Dept Precis Instrument Beijing 100084 Peoples R China

In this article, a class of distributed quadratic games is considered over an undirected graph. The issue on the communication topology restriction is introduced and the players' dynamics are with nonlinear dynamics and unknown time-varying perturbation. A distributed Nash equilibrium seeking algorithm is proposed based on a high-gain observer method, and the convergence is analyzed by the Lyapunov stability theory. It is shown that each player estimates the rival players' states, and the errors between the players' states and the Nash equilibrium are ultimately bounded by a small bound. Moreover, the presented algorithm is free of chattering phenomena because it is designed using the hyperbolic tangent function instead of the signum function to dominant the perturbation. The effectiveness of the proposed algorithm is validated via a simulation of the oligopoly game in which five firms produce the same products in a duopoly market structure.

关键词： Games Nash equilibrium Nonlinear dynamical systems Heuristic algorithms Perturbation methods Cost function Topology distributed algorithms equilibrium seeking Nash equilibrium quadratic games

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：