Sciweavers

95 search results - page 6 / 19
» Node-Capacitated Ring Routing
Sort
View
IPPS
2005
IEEE
15 years 9 months ago
Tight Bounds for Wavelength Assignment on Trees of Rings
: 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...
Zhengbing Bian, Qian-Ping Gu, Xiao Zhou
ICALP
2001
Springer
15 years 8 months ago
Online Packet Routing on Linear Arrays and Rings
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...
Jessen T. Havill
145
Voted
ICPADS
2002
IEEE
15 years 8 months ago
Self-Stabilizing Wormhole Routing on Ring Networks
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...
Ajoy Kumar Datta, Maria Gradinariu, Anthony B. Ken...
ANCS
2009
ACM
15 years 1 months ago
Weighted random oblivious routing on torus networks
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...
Rohit Sunkam Ramanujam, Bill Lin
IPPS
2000
IEEE
15 years 8 months ago
Fault-Tolerant Wormhole Routing Algorithms in Meshes in the Presence of Concave Faults
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...
Seungjin Park, Jong-Hoon Youn, Bella Bose