<--- Back to Details
First PageDocument Content
Network theory / Routing / Shortest path problem / Average path length / Degree distribution / Graph / Shortest path tree / IEEE 802.1aq / Small-world network / Graph theory / Mathematics / Theoretical computer science
Date: 2011-05-06 06:34:25
Network theory
Routing
Shortest path problem
Average path length
Degree distribution
Graph
Shortest path tree
IEEE 802.1aq
Small-world network
Graph theory
Mathematics
Theoretical computer science

doi:[removed]j.comnet[removed]

Add to Reading List

Source URL: jeremie.leguay.free.fr

Download Document from Source Website

File Size: 468,02 KB

Share Document on Facebook

Similar Documents

Efficient Traffic Routing with Progress Guarantees Stefan Blumer Manuel Eichelberger  Roger Wattenhofer

Efficient Traffic Routing with Progress Guarantees Stefan Blumer Manuel Eichelberger Roger Wattenhofer

DocID: 1xVZy - View Document

Sweet Little Lies: Fake Topologies for Flexible Routing Stefano Vissicchio University of Louvain

Sweet Little Lies: Fake Topologies for Flexible Routing Stefano Vissicchio University of Louvain

DocID: 1xVPP - View Document

Decoy Routing: Toward Unblockable Internet Communication Josh Karlin  Daniel Ellard

Decoy Routing: Toward Unblockable Internet Communication Josh Karlin Daniel Ellard

DocID: 1xVLC - View Document

Hijacking Bitcoin: Routing Attacks on Cryptocurrencies https://btc-hijack.ethz.ch Maria Apostolaki  Aviv Zohar

Hijacking Bitcoin: Routing Attacks on Cryptocurrencies https://btc-hijack.ethz.ch Maria Apostolaki Aviv Zohar

DocID: 1xVI1 - View Document

Wheel + Ring = Reel: the Impact of Route Filtering on the Stability of Policy Routing Luca Cittadini Giuseppe Di Battista

Wheel + Ring = Reel: the Impact of Route Filtering on the Stability of Policy Routing Luca Cittadini Giuseppe Di Battista

DocID: 1xVsm - View Document