In this paper, we consider a deterministic timed continuous Petri net model where conflicts at places are solved by using stationary routing parameters. We show how to compute the...
— In this paper, we extend the optimal worst-case QoS routing algorithm and metric definition given in [1]. We prove that in addition to the q-ary symmetric and q-ary erasure ch...
We present an optimal and scalable permutation routing algorithm for three reconfigurable models based on linear arrays that allow pipelining of information through an optical bus...
Jerry L. Trahan, Anu G. Bourgeois, Ramachandran Va...
XML-based data dissemination networks are rapidly gaining momentum. In these networks XML content is routed from data producers to data consumers throughout an overlay network of ...
We consider an online version of the oblivious routing problem. Oblivious routing is the problem of picking a routing between each pair of nodes (or a set of ows), without knowled...
Nikhil Bansal, Avrim Blum, Shuchi Chawla, Adam Mey...