Sciweavers

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

14

CAAN
2004
Springer

favoriteEmaildiscussreport

119views Discrete Geometry» more CAAN 2004»

Cuts and Disjoint Paths in the Valley-Free Path Model of Internet BGP Routing

13 years 10 months ago

Cuts and Disjoint Paths in the Valley-Free Path Model of Internet BGP Routing

Download hall.lool.net

Thomas Erlebach, Alexander Hall, Alessandro Pancon

Real-time Traffic

CAAN 2004 |

claim paper

Related Content

» A fractional model of the border gateway protocol BGP

» OnDemand Computation of Policy Based Routes for LargeScale Network Simulation

» Limiting path exploration in BGP

» PEMP Peering Equilibrium MultiPath Routing

» Issues with inferring Internet topological attributes

» Modeling adoptability of secure BGP protocols

» QualityofService routing with path information aggregation

» Cyclops the ASlevel connectivity observatory

» Symmetric Key Approaches to Securing BGP A Little Bit Trust Is Enough

Post Info
More Details (n/a)

Added	01 Jul 2010
Updated	01 Jul 2010
Type	Conference
Year	2004
Where	CAAN
Authors	Thomas Erlebach, Alexander Hall, Alessandro Panconesi, Danica Vukadinovic

Comments (0)