Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

126

NETWORKS
2000

104views Computer Networks» more NETWORKS 2000»

Shortest path routing and fault-tolerant routing on de Bruijn networks

15 years 3 months ago

Shortest path routing and fault-tolerant routing on de Bruijn networks

Download par.cse.nsysu.edu.tw

Jyh-Wen Mao, Chang-Biau Yang

Real-time Traffic

Computer Networks | NETWORKS 2000 |

claim paper

Related Content

» Fault Free Shortest Path Routing on the de Bruijn Networks

» Hyper Butterfly Network A Scalable Optimally Fault Tolerant Architecture

» Fault Tolerant Energy Aware Data Dissemination Protocol in Sensor Networks

» PolynomialTime Computable Backup Tables for ShortestPath Routing

» MARA Maximum Alternative Routing Algorithm

» An Efficient Construction of Node Disjoint Paths in OTIS Networks

» Dynamic ZoneBalancing of TopologyAware PeertoPeer Networks

» Tailoring neighborhood search for the internet protocol network design problem with reliab...

» Moore An Extendable PeertoPeer Network Based on Incomplete Kautz Digraph with Constant Deg...

Post Info
More Details (n/a)

Added	19 Dec 2010
Updated	19 Dec 2010
Type	Journal
Year	2000
Where	NETWORKS
Authors	Jyh-Wen Mao, Chang-Biau Yang

Comments (0)