Abstract—Traditional Dijkstra and Bellman-Ford routing algorithms can only provide the best route to each destination based on a fixed link cost model. We propose a utility-base...
Gossip algorithms have recently received significant attention, mainly because they constitute simple and robust message-passing schemes for distributed information processing over...
We evaluate the impact of a gigabit network on the implementation of a distributed chemical process optimization application. The optimization problem is formulated as a stochasti...
—We study the dissemination of dynamic content, such as news or traffic information, over a mobile social network. In this application, mobile users subscribe to a dynamic-conte...
In this paper we deal with two problems which are of great interest in the field of distributed decision making and control. The first problem we tackle is the problem of achieving...
Kunal Srivastava, Angelia Nedic, Dusan M. Stipanov...