Internet routing between autonomous systems: fast algorithms for path trading

DOI10.1016/J.DAM.2014.11.025MaRDI QIDQ2341707zbMATH OpenOpenAlexFDO

Authors André Berger, Heiko Röglin, Ruben van der Zwaan

Publication date 28 April 2015

Published in Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.dam.2014.11.025

zbMATH Keywords

internet routingshortest pathssmoothed analysis

Mathematics Subject Classification ID

Distance in graphs (05C12) Extremal problems in graph theory (05C35) Paths and cycles (05C38) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Internet topics (68M11) Graph theory (including graph drawing) in computer science (68R10) Programming involving graphs or networks (90C35)

Recommendations

• Incentive-compatible interdomain routing
• A BGP-based mechanism for lowest-cost routing
• A BGP-based mechanism for lowest-cost routing
• Increasing internet capacity using local search
• Optimization of OSPF routing in IP networks

Cites work

• Discrete dynamic programming and capital allocation
• scientific article; zbMATH DE number 1099195 (Why is no real title available?)
• scientific article; zbMATH DE number 1981017 (Why is no real title available?)
• Smoothed analysis of algorithms

Cited in

(5)

• scientific article; zbMATH DE number 1717207 (Why is no real title available?)
• Smoothed analysis of local search algorithms
• Domain clustering for inter-domain path computation speed-up
• Policy-Preferred Paths in AS-level Internet Topology Graphs
• scientific article; zbMATH DE number 2247713 (Why is no real title available?)

This page was built for publication: Internet routing between autonomous systems: fast algorithms for path trading

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2341707)