Browsing by Subject "Packet drops"
Now showing items 1-8 of 8
-
Conference Object
Feedback control over packet dropping network links
(2007)This paper studies stabilization schemes for a discrete-time control systems in which the feedback loop includes a network link that may suffer packet drops. We model the packet dropping network link as an erasure channel ...
-
Article
Network interface for a data driven network of workstations (D2 NOW)
(1999)This paper presents the network interface for the Data Driven Network Of Workstations (DzNOW), a multithreaded architecture that uses the decoupled data driven model of execution. D2NOW is built using commodity workstations. ...
-
Conference Object
Queue length based internet congestion control
(2007)In this paper we present a new queue length based Internet congestion control protocol which is shown through simulations to work effectively. The control objective is to regulate the queue size at each link so that it ...
-
Conference Object
Queue length based internet congestion control123
(2007)In this paper we present a new queue length based Internet congestion control protocol which is shown through simulations to work effectively. The control objective is to regulate the queue size at each link so that it ...
-
Conference Object
Queue length based internet congestion controlAAA
(2007)In this paper we present a new queue length based Internet congestion control protocol which is shown through simulations to work effectively. The control objective is to regulate the queue size at each link so that it ...
-
Article
Resilient networked control of distributed energy resources
(2012)This paper considers networked systems and develops distributed algorithm that is resilient against potential packet drops in the communication links between system components. We apply this algorithm to the problem of ...
-
Conference Object
Robust average consensus over packet dropping links: Analysis via coefficients of ergodicity
(2012)We consider a networked system in which each component (node) iteratively exchanges information with its neighbors according to an arbitrary, possibly directed topology. Based on an iterative exchange of (local and possibly ...
-
Article
Robust Distributed Average Consensus via Exchange of Running Sums
(2016)We consider a multi-component system in which each component (node) can send/receive information to/from sets of neighboring nodes via communication links (edges) that form a fixed strongly connected, possibly directed, ...