95 search results - page 6 / 19 » Node-Capacitated Ring Routing |
IPPS
2005
IEEE
15 years 3 months ago
2005
IEEE
: A fundamental problem in communication networks is wavelength assignment (WA): given a set of routing paths on a network, assign a wavelength to each path such that the paths wit...
ICALP
2001
Springer
15 years 2 months ago
2001
Springer
In contrast to classical offline k-k routing, the online packet routing problem allows for an arbitrary number of packets with arbitrary end points and release times. We study this...
ICPADS
2002
IEEE
15 years 2 months ago
2002
IEEE
Wormhole routing is most common in parallel architectures in which messages are sent in small fragments called flits. It is a lightweight and efficient method of routing message...
ANCS
2009
ACM
14 years 7 months ago
2009
ACM
Torus, mesh, and flattened butterfly networks have all been considered as candidate architectures for on-chip interconnection networks. In this paper, we study the problem of opti...
IPPS
2000
IEEE
15 years 2 months ago
2000
IEEE
A fault ring is a connection of only nonfaulty adjacent nodes and links such that the interior of the ring contains only faulty components. This paper proposes two wormhole routin...