English
Related papers

Related papers: A Loosely Self-stabilizing Protocol for Randomized…

200 papers

A snap-stabilizing protocol, starting from any configuration, always behaves according to its specification. In this paper, we present a snap-stabilizing protocol to solve the message forwarding problem in a message-switched network. In…

Data Structures and Algorithms · Computer Science 2009-05-18 Alain Cournier , Swan Dubois , Vincent Villain

This article presents a novel class of control policies for networked control of Lyapunov-stable linear systems with bounded inputs. The control channel is assumed to have i.i.d. Bernoulli packet dropouts and the system is assumed to be…

Optimization and Control · Mathematics 2017-11-27 Prabhat K. Mishra , Debasish Chatterjee , Daniel E. Quevedo

We consider the problem of electing a leader among nodes in a highly dynamic network where the adversary has unbounded capacity to insert and remove nodes (including the leader) from the network and change connectivity at will. We present a…

Distributed, Parallel, and Cluster Computing · Computer Science 2013-10-21 John Augustine , Tejas Kulkarni , Paresh Nakhe , Peter Robinson

This dissertation is a study on the design and analysis of novel, optimal routing and rate control algorithms in wireless, mobile communication networks. Congestion control and routing algorithms upto now have been designed and optimized…

Networking and Internet Architecture · Computer Science 2012-01-20 Jung Ryu

A distributed algorithm is self-stabilizing if after faults and attacks hit the system and place it in some arbitrary global state, the system recovers from this catastrophic situation without external intervention in finite time. In this…

Data Structures and Algorithms · Computer Science 2009-04-20 Toshimitsu Masuzawa , Sébastien Tixeuil

This paper provides three nearly-optimal algorithms for scheduling $t$ jobs in the $\mathsf{CLIQUE}$ model. First, we present a deterministic scheduling algorithm that runs in $O(\mathsf{GlobalCongestion} + \mathsf{dilation})$ rounds for…

Distributed, Parallel, and Cluster Computing · Computer Science 2021-02-16 Keren Censor-Hillel , Yannic Maus , Volodymyr Polosukhin

In this paper we improve the approximation ratio for the problem of scheduling packets on line networks with bounded buffers, where the aim is that of maximizing the throughput. Each node in the network has a local buffer of bounded size…

Data Structures and Algorithms · Computer Science 2020-09-30 Guy Even , Moti Medina , Adi Rosén

In this paper, we tackle the open problem of snap-stabilization in message-passing systems. Snap-stabilization is a nice approach to design protocols that withstand transient faults. Compared to the well-known self-stabilizing approach,…

Distributed, Parallel, and Cluster Computing · Computer Science 2009-09-29 Sylvie Delaët , Stéphane Devismes , Mikhail Nesterenko , Sébastien Tixeuil

TCP is designed for networks with assumption that major losses occur only due to congestion of network traffic. On a wireless network TCP misinterprets the transmission losses due to bit errors and handoffs as losses caused by congestion,…

Networking and Internet Architecture · Computer Science 2009-08-10 Anshuman Sinha

Intelligent driving systems can be used to mitigate congestion through simple actions, thus improving many socioeconomic factors such as commute time and gas costs. However, these systems assume precise control over autonomous vehicle…

Machine Learning · Computer Science 2023-08-17 Aamir Hasan , Neeloy Chakraborty , Haonan Chen , Jung-Hoon Cho , Cathy Wu , Katherine Driggs-Campbell

We present a lightweight solution for state machine replication with commitment certificates. Specifically, we adapt and analyze a median rule for the stabilizing consensus problem [Doerr11] to operate in a client-server setting where…

Distributed, Parallel, and Cluster Computing · Computer Science 2025-11-18 Christian Cachin , Jinfeng Dou , Christian Scheideler , Philipp Schneider

In this work we focus on the problem of minimizing the sum of convex cost functions in a distributed fashion over a peer-to-peer network. In particular, we are interested in the case in which communications between nodes are prone to…

Optimization and Control · Mathematics 2020-07-24 Nicola Bastianello , Ruggero Carli , Luca Schenato , Marco Todescato

In this paper we consider a network of processors aiming at cooperatively solving linear programming problems subject to uncertainty. Each node only knows a common cost function and its local uncertain constraint set. We propose a…

Optimization and Control · Mathematics 2019-08-27 Mohammadreza Chamanbaz , Giuseppe Notarstefano , Roland Bouffanais

This paper develops a stochastic geometry-based approach for the modeling and analysis of single- and multi-cluster wireless networks. We first define finite homogeneous Poisson point processes to model the number and locations of the…

Information Theory · Computer Science 2017-12-27 Seyed Mohammad Azimi-Abarghouyi , Behrooz Makki , Martin Haenggi , Masoumeh Nasiri-Kenari , Tommy Svensson

A new era in wireless sensor network technology has been ushered in through the introduction of multimedia sensor networks, which has a major bottleneck in the form of network congestion. Congestion occurs when resources are in high demand…

Networking and Internet Architecture · Computer Science 2013-12-17 Srinjoy Ganguly , Arpita Chakraborty , Mrinal Kanti Naskar

We investigate control of a non-linear process when communication and processing capabilities are limited. The sensor communicates with a controller node through an erasure channel which introduces i.i.d. packet dropouts. Processor…

Optimization and Control · Mathematics 2016-11-15 Daniel E. Quevedo , Vijay Gupta , Wann-Jiun Ma , Serdar Yuksel

In this work, we investigate the problem of simultaneously learning and controlling a system subject to adversarial choices of disturbances and system parameters. We study the problem for a scalar system with $l_\infty$-norm bounded…

Optimization and Control · Mathematics 2018-12-31 Dimitar Ho , Nikolai Matni , John C. Doyle

This paper studies the stabilization problem of networked control systems (NCSs) with random packet dropouts caused by stochastic channels. To describe the effects of stochastic channels on the information transmission, the transmission…

Systems and Control · Electrical Eng. & Systems 2024-01-23 Wei Ren , Wei Wang , Zhuo-Rui Pan , Xi-Ming Sun , Andrew R. Teel , Dragan Nesic

Although delay-based congestion control protocols such as FAST promise to deliver better performance than traditional TCP Reno, they have not yet been widely incorporated to the Internet. Several factors have contributed to their lack of…

Networking and Internet Architecture · Computer Science 2014-05-22 Miguel Rodríguez Pérez , Sergio Herrería-Alonso , Manuel Fernández-Veiga , Cándido López-García

Throughput optimal scheduling policies in general require the solution of a complex and often NP-hard optimization problem. Related literature has shown that in the context of time-varying channels, randomized scheduling policies can be…

Networking and Internet Architecture · Computer Science 2016-11-17 Mahdi Lotfinezhad , Ben Liang , Elvino S. Sousa