Incentive-compatible interdomain routing

DOI10.1007/S00446-011-0126-8zbMath1231.68054OpenAlexW2048570365MaRDI QIDQ658663

Vijay Ramachandran, Michael Schapira, Joan Feigenbaum

Publication date: 6 February 2012

Published in: Distributed Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00446-011-0126-8

zbMATH Keywords

algorithmic mechanism designBGPinter domain-routing protocolsrouting policies

Mathematics Subject Classification ID

Distributed systems (68M14) Internet topics (68M11)

Related Items (2)

Setting lower bounds on truthfulness ⋮ Incentive-compatible interdomain routing

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Worst-case equilibria
• Incentive-compatible interdomain routing
• Subjective-cost policy routing
• A BGP-based mechanism for lowest-cost routing
• Mechanism design for policy routing
• Specification faithfulness in networks with rational nodes
• Algorithmic mechanism design

This page was built for publication: Incentive-compatible interdomain routing