Dynamic multi-path routing has the potential to improve the reliability and performance of a communication network, but carries a risk. Routing needs to respond quickly to achieve...
We present an extension of Duato's necessary and sufficient condition a routing function must satisfy in order to be deadlock-free, to support environment constraints inducing...
Sami Taktak, Jean Lou Desbarbieux, Emmanuelle Encr...
This note studies the asymptotic stabilization problem for controllable and observable, single-input single-output, linear, time-invariant, continuous-time systems by means of mem...
A class of graphs called generalized ladder graphs is defined. A sufficient condition for pairs of these graphs to be chromatically equivalent is proven. In addition a formula for...
We consider complex systems that are composed of many interacting elements, evolving under some dynamics. We are interested in characterizing the ways in which these elements may b...
Jonathan E. Rowe, Michael D. Vose, Alden H. Wright
We study the issue of convergence of user rates and resource prices under a family of rate control schemes called dual algorithms with arbitrary communication delays. We first con...
Abstract The transformation protocol can allow two players to share an unconditionally secure secret key using a random deal of cards. A sufficient condition on the number of cards...
A class C of graphs is said to be H-bounded if each graph in the class C admits a homomorphism to H. We give a general necessary and sufficient condition for the existence of boun...
Timothy Marshall, Reza Nasraser, Jaroslav Nesetril
We prove a sufficient condition for a graph G to have a matching that interconnects all the components of a disconnected spanning subgraph of G. The condition is derived from a re...