First Page | Document Content | |
---|---|---|
Date: 2017-10-24 20:49:21Computing Mathematics Mathematical software Routing Internet architecture Emerging technologies Network architecture Load balancing Open Shortest Path First Computer network Solver Network topology | REPETITA: Repeatable Experiments for Performance Evaluation of Traffic-Engineering Algorithms Steven Gay ∗, Pierre Schaus ∗, Stefano Vissicchio † ∗ Universite catholique de Louvain, † University College LondonAdd to Reading ListSource URL: arxiv.orgDownload Document from Source WebsiteFile Size: 337,68 KBShare Document on Facebook |
Efficient Traffic Routing with Progress Guarantees Stefan Blumer Manuel Eichelberger Roger WattenhoferDocID: 1xVZy - View Document | |
Sweet Little Lies: Fake Topologies for Flexible Routing Stefano Vissicchio University of LouvainDocID: 1xVPP - View Document | |
Decoy Routing: Toward Unblockable Internet Communication Josh Karlin Daniel EllardDocID: 1xVLC - View Document | |
Hijacking Bitcoin: Routing Attacks on Cryptocurrencies https://btc-hijack.ethz.ch Maria Apostolaki Aviv ZoharDocID: 1xVI1 - View Document | |
Wheel + Ring = Reel: the Impact of Route Filtering on the Stability of Policy Routing Luca Cittadini Giuseppe Di BattistaDocID: 1xVsm - View Document |