Search Sciweavers | Sciweavers

632 search results - page 7 / 127

» On Routing in Circulant Graphs

click to vote

TON
2012

213views Programming Languages» more TON 2012»

Independent Directed Acyclic Graphs for Resilient Multipath Routing

11 years 9 months ago

Download www2.engr.arizona.edu

—In order to achieve resilient multipath routing we introduce the concept of Independent Directed Acyclic Graphs (IDAGs) in this study. Link-independent (Node-independent) DAGs s...

Sangman Cho, Theodore Elhourani, Srinivasan Ramasu...

claim paper

Read More »

click to vote

STOC
2012
ACM

199views Algorithms» more STOC 2012»

Routing in undirected graphs with constant congestion

11 years 9 months ago

Download ttic.uchicago.edu

Julia Chuzhoy

claim paper

Read More »

click to vote

INFOCOM
2012
IEEE

205views Communications» more INFOCOM 2012»

Harnessing Internet topological stability in Thorup-Zwick compact routing

11 years 9 months ago

Download csperkins.org

—Thorup-Zwick (TZ) compact routing guarantees sublinear state growth with the size of the network by routing via landmarks and incurring some path stretch. It uses a pseudo-rando...

Stephen D. Strowes, Colin Perkins

claim paper

Read More »

click to vote

STOC
1993
ACM

109views Algorithms» more STOC 1993»

Routing permutations on graphs via matchings

13 years 11 months ago

Download www.cs.ust.hk

We consider a class of routing problems on connected graphs G. Initially, each vertex v of G is occupied by a “pebble” which has a unique destination π(v) in G (so that π is...

Noga Alon, Fan R. K. Chung, Ronald L. Graham

claim paper

Read More »

click to vote

DM
2006

70views more DM 2006»

The carvingwidth of hypercubes

13 years 7 months ago

Download www.math.u-szeged.hu

The notion of the carvingwidth of a graph was introduced by Seymour and Thomas [Call routing and the ratcatcher, Combinatorica

L. Sunil Chandran, Telikepalli Kavitha

claim paper