Sciweavers

213 search results - page 34 / 43
» Alternate Path Routing for Multicast
Sort
View
CORR
2011
Springer
210views Education» more  CORR 2011»
13 years 2 months ago
Competitive and Deterministic Embeddings of Virtual Networks
Network virtualization is a paradigm that allows for flexible and efficient allocation of the resources among multiple virtual networks (VNets). In this paper we deal with the p...
Guy Even, Moti Medina, Gregor Schaffrath, Stefan S...
STOC
2006
ACM
174views Algorithms» more  STOC 2006»
14 years 7 months ago
Edge-disjoint paths in Planar graphs with constant congestion
We study the maximum edge-disjoint paths problem in undirected planar graphs: given a graph G and node pairs s1t1, s2t2, . . ., sktk, the goal is to maximize the number of pairs t...
Chandra Chekuri, Sanjeev Khanna, F. Bruce Shepherd
IPPS
1997
IEEE
13 years 11 months ago
Nearly Optimal One-To-Many Parallel Routing in Star Networks
Star networks were proposedrecently as an attractive alternative to the well-known hypercube models for interconnection networks. Extensive research has been performed that shows ...
Chi-Chang Chen, Jianer Chen
CDES
2007
81views Hardware» more  CDES 2007»
13 years 9 months ago
Parallel and Fault-Tolerant Routing in Nanoscale Spin-Wave Architectures
- In this paper, we present a number of parallel and fault-tolerant routing schemes for a set of nanoscale spin-wave architectures. The architectures considered here have several f...
Mary Mehrnoosh Eshaghian-Wilner, Shiva Navab
CAAN
2007
Springer
14 years 1 months ago
Improving Topological Routing in N2R Networks
Topological routing is basically table free, and allows for very fast restoration and thus a high level of reliability in communication. It has already been satisfactorily proposed...
José M. Gutiérrez López, Rub&...