Subjective-cost policy routing

DOI10.1016/j.tcs.2007.02.020zbMath1120.68030OpenAlexW1965160415MaRDI QIDQ883998

Vahab S. Mirrokni, David R. Karger, Rahul Sami, Joan Feigenbaum

Publication date: 13 June 2007

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2007.02.020

zbMATH Keywords

algorithmic mechanism designpath-vector routingpolicy routing

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Network protocols (68M12)

Related Items (6)

Setting lower bounds on truthfulness ⋮ Subjective-cost policy routing ⋮ Deterministic Fault-Tolerant Connectivity Labeling Scheme ⋮ Incentive-compatible interdomain routing ⋮ Fault-tolerant distance labeling for planar graphs ⋮ Fault-tolerant distance labeling for planar graphs

Cites Work

• Subjective-cost policy routing
• Optimization, approximation, and complexity classes
• A BGP-based mechanism for lowest-cost routing
• Reducibility among Combinatorial Problems

This page was built for publication: Subjective-cost policy routing