Incentive-compatible interdomain routing
type: Item
instance of: scholarly article
title: Incentive-compatible interdomain routing
zbMATH Open document ID: 1231.68054
author: Joan Feigenbaum
author: Vijay Ramachandran
author: Michael Schapira
published in: Distributed Computing
publication date: 2012-02-06T00:00:00Z
Mathematics Subject Classification ID: 68M11
Mathematics Subject Classification ID: 68M14
zbMATH DE Number: 6003846
zbMATH Keywords: inter domain-routing protocols
zbMATH Keywords: BGP
zbMATH Keywords: algorithmic mechanism design
zbMATH Keywords: routing policies
MaRDI profile type: Publication
full work available at URL: s00446-011-0126-8
OpenAlex ID: W2048570365
cites work: Subjective-cost policy routing
cites work: A BGP-based mechanism for lowest-cost routing
cites work: Mechanism design for policy routing
cites work: Q3524723
cites work: Q3208356
cites work: Worst-case equilibria
cites work: Q3549685
cites work: Algorithmic mechanism design
cites work: Specification faithfulness in networks with rational nodes
DOI: 10.1007/S00446-011-0126-8
description: scientific article; zbMATH DE number 6003846