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

IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP)

作者： Yu, Yi Zhao, Haiquan de Lamare, Rodrigo C. Zakharov, Yuriy Southwest Jiaotong Univ Sch Elect Engn Chengdu Sichuan Peoples R China Univ York Dept Elect Engn York YO10 5DD N Yorkshire England Pontificia Univ Catolica Rio de Janeiro CETUC BR-22451900 Rio de Janeiro Brazil

ISBN: (纸本)9781538646588

This work develops a robust diffusion recursive least squares algorithm to mitigate the performance degradation often experienced in networks of agents in the presence of impulsive noise. This algorithm minimizes an exponentially weighted least-squares cost function subject to a time-dependent constraint on the squared norm of the intermediate estimate update at each node. With the help of side information, the constraint is recursively updated in a diffusion strategy. Moreover, a control strategy for resetting the constraint is also proposed to retain good tracking capability when the estimated parameters suddenly change. Simulations show the superiority of the proposed algorithm over previously reported techniques in various impulsive noise scenarios.

关键词： Diffusion cooperation distributed algorithms impulsive noise robust recursive least squares

来源：评论

学校读者我要写书评

暂无评论

Brief Announcement: Space- Optimal Naming in Population Protocols 18

Brief Announcement: Space- Optimal Naming in Population Prot...

引用

37th ACM SIGACT-SIGOPS Symposium on Principles of distributed Computing (PODC)

作者： Burman, Janna Beauquier, Joffroy Sohier, Devan Univ Paris Saclay LRI CNRS Orsay France Univ Paris Saclay LI PaRAD Univ Versailles Versailles France

ISBN: (纸本)9781450357951

This paper gives a brief presentation of a comprehensive study on the necessary and sufficient state space conditions for the deterministic naming task in the population protocol model. This problem is studied under various combinations of model assumptions: weak or global fairness, arbitrary or uniform initialization of agents, existence or absence of a distinguishable agent (arbitrarily initialized or not), possibility of breaking symmetry in pair-wise interactions (symmetric or asymmetric transitions). For each possible combination of these assumptions, either an impossibility is proven or the necessary exact number of states (per mobile agent) is determined and an appropriate space-optimal naming protocol is given.

关键词： distributed algorithms population protocols self-stabilization deterministic naming exact space complexity tight lower bounds

来源：评论

学校读者我要写书评

暂无评论

Brief Announcement: Beeping a Time-Optimal Leader Election 18

Brief Announcement: Beeping a Time-Optimal Leader Election

引用

37th ACM SIGACT-SIGOPS Symposium on Principles of distributed Computing (PODC)

作者： Dufoulon, Fabien Burman, Janna Beauquier, Joffroy Univ Paris Saclay Univ Paris Sud CNRS LRI Orsay France

ISBN: (纸本)9781450357951

The beeping model is an extremely restrictive broadcast communication model that relies only on carrier sensing. In this model, we solve the deterministic leader election problem with an asymptotically optimal round complexity. Using this result, we obtain an asymptotically optimal randomized leader election algorithm for anonymous networks, as well as improved algorithms for symmetry-breaking and communication primitives. The techniques that we introduce give a new insight as to how local constraints on the exchangeable messages can result in efficient algorithms, when dealing with the beeping model.

关键词： distributed algorithms leader election beeping model time complexity deterministic algorithms

来源：评论

学校读者我要写书评

暂无评论

Window Based BFT Blockchain Consensus 11

Window Based BFT Blockchain Consensus

引用

IEEE International Congress on Cybermatics / IEEE Conferences on Internet of Things, Green Computing and Communications, Cyber, Physical and Social Computing, Smart Data, Blockchain, Computer and Information Technology

作者： Jalalzai, Mohammad M. Busch, Costas Louisiana State Univ Comp Sci & Engn Div Baton Rouge LA 70803 USA

ISBN: (纸本)9781538679753

There is surge of interest to the blockchain technology not only in the scientific community but in the business community as well. Proof of Work (PoW) and Byzantine Fault Tolerant (BFT) are the two main classes of consensus protocols that are used in the blockchain consensus layer. PoW is highly scalable but very slow with about 7 (transactions/second) performance. BFT based protocols are highly efficient but their scalability are limited to only tens of nodes. One of the main reasons for the BFT limitation is the quadratic O(n(2)) communication complexity of BFT based protocols for n nodes that requires n x n broadcasting. In this paper, we present the Musch protocol which is BFT based and provides communication complexity O(fn + n) for f failures and n nodes, where f < n/3, without compromising the latency. Hence, the performance adjusts to f such that for constant f the communication complexity is linear. Musch achieves this by introducing the notion of exponentially increasing windows of nodes to which complains are reported, instead of broadcasting to all the nodes. To our knowledge, this is the first BFT-based blockchain protocol which efficiently addresses simultaneously the issues of communication complexity and latency under the presence of failures.

关键词： BFT blockchain consensus complexity distributed systems distributed algorithms

来源：评论

学校读者我要写书评

暂无评论

Parallel Reachability in Almost Linear Work and Square Root Depth

Parallel Reachability in Almost Linear Work and Square Root ...

引用

Annual IEEE Symposium on Foundations of Computer Science

作者： Arun Jambulapati Yang P. Liu Aaron Sidford ICME Stanford University Palo Alto CA USA Stanford University Palo Alto CA USA MS&E Stanford University Palo Alto CA USA

In this paper we provide a parallel algorithm that given any n-node m-edge directed graph and source vertex s computes all vertices reachable from s with Õ(m) work and n {1/2 + o(1) } depth with high probability in n. This algorithm also computes a set of Õ(n) edges which when added to the graph preserves reachability and ensures that the diameter of the resulting graph is at most n {1/2 + o(1) }. Our result improves upon the previous best known almost linear work reachability algorithm due to Fineman [1] which had depth Õ(n 2/3 ). Further, we show how to leverage this algorithm to achieve improved distributed algorithms for single source reachability in the CONGEST model. In particular, we provide a distributed algorithm that given a n-node digraph of undirected hop-diameter D solves the single source reachability problem with Õ(n 1/2 + n 1/3+o(1) D 2/3 ) rounds of the communication in the CONGEST model with high probability in n. Our algorithm is nearly optimal whenever D = O(n 1/4-ε ) for any constant ε > 0 and is the first nearly optimal algorithm for general graphs whose diameter is Ω(n δ ) for any constant δ.

关键词： distributed algorithms Computational modeling Heuristic algorithms Parallel algorithms Directed graphs Complexity theory Optimization

来源：评论

学校读者我要写书评

暂无评论

On Maximum Elastic Scheduling of Virtual Machines for Cloud-based Data Center Networks

On Maximum Elastic Scheduling of Virtual Machines for Cloud-...

引用

IEEE International Conference on Communications (ICC) / Workshop on Integrating UAVs into 5G

作者： Wu, Jie Lu, Shuaibing Zheng, Huanyang Temple Univ Ctr Networked Comp Philadelphia PA 19122 USA Jilin Univ Coll Comp Sci & Technol Changchun Peoples R China

ISBN: (纸本)9781538631805

Task resource allocation has always been an important issue in cloud-based data center networks (DCNs). This paper considers provisioning the maximum admissible load (MAL) of virtual machines (VMs) in physical machines (PMs) with underlying tree-structured DCNs using the hose model for communication. The limitation of static load distribution is that it assigns tasks to nodes in a once-and-for-all manner, and thus, requires a priori knowledge of program behavior. To avoid load redistribution during a run time where the load grows, we introduce maximum elasticity scheduling, which has the maximum growth potential subject to the node and link capacities. Given a tree-based topology, this paper aims to find the schedule with the maximum elasticity across both nodes and links. A distributed linear solution has been found, and we discuss several extensions of the model. We conclude the paper by presenting various simulation results.

关键词： Data center networks (DCNs) cloud distributed algorithms elasticity hose model optimization

来源：评论

学校读者我要写书评

暂无评论

Risk and security tradeoffs in graphical coordination games

Risk and security tradeoffs in graphical coordination games

引用

IEEE Annual Conference on Decision and Control

作者： Keith Paarporn Mahnoosh Alizadeh Jason R. Marden

ISBN: (数字)9781728113982

ISBN: (纸本)9781728113999

A system relying on the collective behavior of decision-makers can be vulnerable to a variety of adversarial attacks. How well can a system operator protect performance in the face of these risks? We frame this question in the context of graphical coordination games, where the agents in a network choose among two conventions and derive benefits from coordinating neighbors, and system performance is measured in terms of the agents' welfare. In this paper, we assess an operator's ability to mitigate two types of adversarial attacks-1) broad attacks, where the adversary attaches a fake neighbor to each agent in the network and 2) focused attacks, where the adversary can force a selected subset of the agents to commit to a prescribed convention. As a mitigation strategy, the system operator can implement a class of distributed algorithms that govern the agents' decision-making process. We evaluate the extent to which the system is vulnerable to both types of attack, as well as characterize the operator's fundamental trade-off between security against worst-case broad attacks and vulnerability from focused attacks. Our work highlights the design challenges a system operator faces in maintaining resilience of networked distributed systems.

关键词： Games Measurement Security distributed algorithms Decision making Heuristic algorithms Network topology

来源：评论

学校读者我要写书评

暂无评论

Mechanism Design for Network Utility Maximization with Private Constraint Information

Mechanism Design for Network Utility Maximization with Priva...

引用

IEEE Annual Joint Conference: INFOCOM, IEEE Computer and Communications Societies

作者： Meng Zhang Jianwei Huang Dept. of Information Engineering The Chinese University of Hong Kong Hong Kong China School of Engineering and Science The Chinese University of Hong Kong Shenzhen China

Network utility maximization (NUM) is a general framework for optimally allocating constrained resources in many networked applications. When agents have asymmetric and private information, a fundamental economic challenge is how to solve the NUM Problem considering the self-interests of strategic agents. Many previous related works have proposed economic mechanisms that can cope with agents' private utilities. However, the related literature largely neglected the issue of information asymmetries regarding constraints, and limited closely related studies provided solutions only applicable to specific application scenarios. To tackle this issue, we propose the DeNUM Mechanism, the first mechanism for solving a general class of decomposable NUM Problems considering both private utility and constraint information. The key idea is to decentralize the decision process to agents, who will make resource allocation decisions without the need of revealing private information to others. We further show that the DeNUM mechanism yields the network-utility maximizing solution at an equilibrium, and achieves other desirable economic properties (such as individual rationality and budget balance). However, the corresponding equilibrium solution concept, the generalized Nash equilibrium (GNE), makes it difficult to achieve through a distributed algorithm. To address this issue, we further establish the connection between the structure of GNE and that of the primal-dual solution to a reformulated NUM problem, based on which we present the convergent DeNUM Algorithm that is provably convergent. Finally, as a case study, we apply the DeNUM Mechanism to solving the NUM problem for a user-provided network, and show that the DeNUM algorithm improves the network utility by 17% compared to a non-cooperation benchmark.

关键词： Resource management distributed algorithms Optimization Economics Throughput Nash equilibrium Bandwidth

来源：评论

学校读者我要写书评

暂无评论

BEE'S STRATEGY AGAINST BYZANTINES Replacing Byzantine Participants (Extended Abstract) 1

引用

20th International Symposium on Stabilization, Safety, and Security of distributed Systems (SSS)

作者： Shaer, Amitay Dolev, Shlomi Bonomi, Silvia Raynal, Michel Baldoni, Roberto Ben Gurion Univ Negev Dept Comp Sci Beer Sheva Israel Sapienza Univ Roma Dept Comp Control & Management Engn A Ruberti Res Ctr Cyber Intelligence & Informat Secur CIS Via Ariosto 25 I-00185 Rome Italy Univ Rennes IRISA F-35042 Rennes France

ISBN: (数字)9783030032326

ISBN: (纸本)9783030032326;9783030032319

Schemes for the identification and replacement of two-faced Byzantine processes are presented. The detection is based on the comparison of the (blackbox) decision result of a Byzantine consensus on input consisting of the inputs of each of the processes, in a system containing n processes p(1), . . . , p(n). Process p(i) that received a gossiped message from p(j) with the input of another process p(k), that differs from p(k)'s input value as received from p(k) by p(i), reports on p(k) and p(i) being two-faced. If enough processes (where enough means at least t +1, t < n is a threshold on the number of Byzantine participants) report on the same participant p(j) to be two-faced, participant p(j) is replaced. If less than the required t+1 processes threshold report on a participant p(j), both the reporting processes and the reported process are replaced. If one of them is not Byzantine, its replacement is the price to pay to cope with the uncertainty created by Byzantine processes. The scheme ensures that any two-faced Byzantine participant that prevents fast termination is eliminated and replaced. Such replacement may serve as a preparation for the next invocations of Byzantine agreement possibly used to implement a replicated state machine.

关键词： distributed algorithms Consensus Byzantine failures Detection

来源：评论

学校读者我要写书评

暂无评论

Simple Synchronous and Asynchronous algorithms for distributed Minimax Optimization

引用

SICE Journal of Control, Measurement, and System Integration 2017年第6期10卷 557-562页

作者： Kenta Hanada Ryosuke Morita Takayuki Wada Yasumasa Fujisaki Graduate School of Information Science and Technology Osaka University Faculty of Engineering Gifu University

Synchronous and asynchronous algorithms are presented for distributed minimax optimization. The objective here is to realize the minimization of the maximum of component functions over the standard multi-agent network, where each node of the network knows its own function and it exchanges its decision variable with its neighbors. In fact, the proposed algorithms are standard consensus and gossip based subgradient methods, while the original minimax optimization is recast as minimization of the sum of component functions by using a p-norm approximation. A scalable step size depending on the approximation ratio p is also presented in order to avoid slow convergence. Numerical examples illustrate that the algorithms with this step size work well even in the high approximation ratios.

关键词： distributed algorithms minimax optimization synchronous algorithms asynchronous algorithms

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：