Incentive-compatible interdomain routing
From MaRDI portal
Publication:658663
DOI10.1007/S00446-011-0126-8zbMATH Open1231.68054OpenAlexW2048570365MaRDI QIDQ658663FDOQ658663
Authors: Joan Feigenbaum, Vijay Ramachandran, Michael Schapira 
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
Recommendations
Cites Work
- Worst-case equilibria
- Title not available (Why is that?)
- Algorithmic mechanism design
- Title not available (Why is that?)
- Specification faithfulness in networks with rational nodes
- A BGP-based mechanism for lowest-cost routing
- Distributed algorithmic mechanism design
- Mechanism design for policy routing
- Incentive-compatible interdomain routing
- Subjective-cost policy routing
Cited In (17)
- Acyclic Type-of-Relationship Problems on the Internet
- Interdomain Routing and Games
- Self-organization of inter-domain routing system
- Impact of routing parameters on route diversity and path inflation
- Autonomous security for autonomous systems
- (Un)-Stable Routing in the Internet: A Survey from the Algorithmic Perspective
- Increasing Bisemigroups and Algebraic Routing
- Incentive-compatible interdomain routing with linear utilities
- Internet resiliency to attacks and failures under BGP policy routing
- Origin authentication in interdomain routing
- Title not available (Why is that?)
- Visualizing Interdomain Routing with BGPlay
- Title not available (Why is that?)
- Routing policy management method for multi-ISP collaboration
- Setting lower bounds on truthfulness
- Incentive-compatible interdomain routing
- Subjective-cost policy routing
This page was built for publication: Incentive-compatible interdomain routing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q658663)
