We present, in this paper, an algorithm which integrates flow control and dynamic load balancing in Time Warp. The algorithm is intended for use in a distributed memory environme...
Abstract. We study computationally hard combinatorial problems arising from the important engineering question of how to maximize the number of connections that can be simultaneous...
In this paper, we study the exclusive perpetual exploration problem with mobile anonymous and oblivious robots in a discrete space. Our results hold for the most generic settings:...
The Rendezvous of anonymous mobile agents in a anonymous network is an intensively studied problem; it calls for k anonymous, mobile agents to gather in the same site. We study thi...
Stefan Dobrev, Paola Flocchini, Giuseppe Prencipe,...
—In this paper, we study the routing and wavelength assignment (RWA) tasks in WDM rings with heterogeneous wavelength conversion capabilities. By heterogeneous, we mean that diff...