scispace - formally typeset
Search or ask a question
Topic

Distributed algorithm

About: Distributed algorithm is a research topic. Over the lifetime, 20416 publications have been published within this topic receiving 548109 citations.


Papers
More filters
Patent
30 Mar 1995
TL;DR: In this paper, the authors present a method and an apparatus for executing a distributed algorithm or server in a Simple Network Management Protocol Version 1 (SNMPv1) based computer network.
Abstract: The present invention is directed at both a method and an apparatus for executing a distributed algorithm or server in a Simple Network Management Protocol Version 1 (SNMPv1) based computer network. The invention involves configuring a peer arrangement of agent/manager nodes and encapsulating the algorithm or server into SNMPv1. In a peer configuration, each node acts as a manager node, the manager node sends a Get message to an agent node to read a certain location in an agent node's managed information base (MIB) and sends a Set message to an agent node to write to a certain location in an agent node's MIB. This peer configuration also provides that each node act as an agent node, the agent node sends a GetResponse message to a manager node in response to a Get message and sends a Trap message to a manager node in response to an event. Encapsulating of the algorithm or server within SNMPv1 involves mapping the proprietary protocol to the SNMPv1 messages and mapping the algorithm or server variables to certain locations in the MIB. When mapping the algorithm or server, algorithm command variables, placeholder variables, and data variables are assigned to certain locations within the MIB.

223 citations

Proceedings ArticleDOI
16 Aug 2013
TL;DR: This paper establishes a connection to the field of local algorithms and distributed computing, and shows that existing local algorithms can be used to develop efficient coordination protocols in which each controller only needs to respond to events that take place in its local neighborhood.
Abstract: Large SDN networks will be partitioned in multiple controller domains; each controller is responsible for one domain, and the controllers of adjacent domains may need to communicate to enforce global policies. This paper studies the implications of the local network view of the controllers. In particular, we establish a connection to the field of local algorithms and distributed computing, and discuss lessons for the design of a distributed control plane. We show that existing local algorithms can be used to develop efficient coordination protocols in which each controller only needs to respond to events that take place in its local neighborhood. However, while existing algorithms can be used, SDN networks also suggest a new approach to the study of locality in distributed computing. We introduce the so-called supported locality model of distributed computing. The new model is more expressive than the classical models that are commonly used in the design and analysis of distributed algorithms, and it is a better match with the features of SDN networks.

223 citations

Journal ArticleDOI
TL;DR: This work proposes two linear distributed algorithms, deterministic and gossip, respectively for the cases where the inter-agent communication is synchronous and asynchronous, and develops algorithms that guarantee state averaging on arbitrary strongly connected digraphs.

223 citations

Proceedings ArticleDOI
14 May 2006
TL;DR: It is shown that many power control problems, with coupled constraints among the users, can be naturally formulated as potential games and, hence, efficiently solved.
Abstract: In this paper we propose a unified framework, based on the emergent potential games to deal with a variety of network resource allocation problems. We generalize the existing results on potential games to the cases where there exists coupling among the (possibly vector) strategies of all players. We derive sufficient conditions for the existence and uniqueness of the Nash Equilibrium, and provide different distributed algorithms along their convergence properties. Using this new framework, we then show that many power control problems (standard and non-standard) with coupled constraints among the users, can be naturally formulated as potential games and, hence, efficiently solved. Finally, we point out an interesting interplay existing between potential games, classical optimization theory, and Lyapunov stability theory.

221 citations

Journal ArticleDOI
TL;DR: It can be shown that the introduction of the virtual referee does not increase the complexity of the networks and is in charge of monitoring and improving the outcome of non-cooperative competition for resources among the distributed users.
Abstract: In this paper, a distributive non-cooperative game is proposed to perform sub-channel assignment, adaptive modulation, and power control for multi-cell multi-user orthogonal frequency division multiplexing access (OFDMA) networks. Each individual user's goal is to minimize his/her own transmitted power in a distributed manner under the constraints that the desirable rate is achieved and the transmitted power is bounded. The pure non-cooperative game may result in non-convergence or some undesirable Nash Equilibriums with low system and individual performances. To enhance the performances, a virtual referee is introduced to the networks and is in charge of monitoring and improving the outcome of non-cooperative competition for resources among the distributed users. If the game outcome is not desirable, either the required transmission rates should be reduced or some users should be prevented from using some radio resources such as sub-channels, so that the rest of users can share the limited resources more efficiently. Moreover, it can be shown that the introduction of the virtual referee does not increase the complexity of the networks. From the simulation results in a two-cell case, the proposed scheme reduces the transmitted power by 80% and 25% compared with the fixed channel assignment algorithm and the iterative water-filling algorithm in the literature, respectively. The achievable rate can be improved by 10%. In a multi-cell case, the proposed scheme can have up to 40% power reduction compared with the iterative water-filling algorithm when the co-channel interferences are severe.

221 citations


Network Information
Related Topics (5)
Server
79.5K papers, 1.4M citations
94% related
Scheduling (computing)
78.6K papers, 1.3M citations
91% related
Network packet
159.7K papers, 2.2M citations
91% related
Wireless network
122.5K papers, 2.1M citations
91% related
Wireless sensor network
142K papers, 2.4M citations
89% related
Performance
Metrics
No. of papers in the topic in previous years
YearPapers
202381
2022135
2021583
2020759
2019876
2018845