18 search results - page 1 / 4 » O(n) routing in rearrangeable networks |
ANCS
2006
ACM
13 years 11 months ago
2006
ACM
Clos networks are an important class of switching networks due to their modular structure and much lower cost compared with crossbars. For routing I/O permutations of Clos network...
TON
2010
12 years 11 months ago
2010
Routing protocols for large wireless networks must address the challenges of reliable packet delivery at increasingly large scales and with highly limited resources. Attempts to re...
JSA
2000
13 years 4 months ago
2000
In (2n)1)-stage rearrangeable networks, the routing time for any arbitrary permutation is X(n2 ) compared to its propagation delay O(n) only. Here, we attempt to identify the sets...
NSDI
2007
13 years 7 months ago
2007
Routing protocols for wireless sensor networks must address the challenges of reliable packet delivery at increasingly large scale and highly constrained node resources. Attempts ...
JSAC
2007
13 years 4 months ago
2007
— In this paper, we study the Routing and Wavelength Assignment (RWA) problem in a semi-dynamic scenario where rearrangements are conducted in a series of sessions after traffic...