Auction-type framework for selling inter-domain paths
Misseri, Xavier; Rougier, Jean-Louis; Moretti, Stefano (2013), Auction-type framework for selling inter-domain paths, in Stiller, Burkhard, 9th International Conference on Network and Service Management (CNSM 2013), IEEE : Piscataway, NJ, p. 284-291. 10.1109/CNSM.2013.6727848
Type
Communication / ConférenceDate
2013Conference title
9th International Conference on Network and Service Management (CNSM 2013)Conference date
2013-10Conference city
ZürichConference country
SwitzerlandBook title
9th International Conference on Network and Service Management (CNSM 2013)Book author
Stiller, BurkhardPublisher
IEEE
Published in
Piscataway, NJ
ISBN
978-3-901882-53-1
Pages
284-291
Publication identifier
Metadata
Show full item recordAuthor(s)
Misseri, XavierLaboratoire Traitement et Communication de l'Information [LTCI]
Rougier, Jean-Louis
Laboratoire Traitement et Communication de l'Information [LTCI]
Moretti, Stefano

Laboratoire d'analyse et modélisation de systèmes pour l'aide à la décision [LAMSADE]
Abstract (EN)
In the present Internet, inter-domain routing is based on BGP-4 [1] which selects a single path per destination prefix, thereby preventing carriers and end-users to use the vast inherent path diversity [2]. Addition of multi-path capabilities to the Internet have long been advocated for both robustness and traffic engineering purposes. Some works [3], [4] propose inter-domain multipath architectures. In this paper we consider a new service where carriers offer additional routes to their customers (w.r.t. to BGP default route) as an added-value service. These alternate routes can be used by customers to help them to meet their traffic engineering objectives (better delays etc.) or just for robustness purposes (disjoint alternate routes). Announcing additional paths can lead to scalability issues [5], so one carrier will propagate only the paths that are most interesting for neighboring domains. We propose an auction-like framework adapted to this specific service, allowing one carrier to select the most interesting paths and determine the prices at which these routes can be sold. We consider the case where routes are sold as infinitely duplicable goods (assuming small demands with regards to route capacities). We design a winner determination mechanism, based on the maximization of the seller's revenue, that enforces fair allocation of goods and is loser collusion proof. We also propose a payment mechanism that is proven to be truthful when each bidder submits one (potentially combinatorial) bid.Subjects / Keywords
interdomain paths; multipath capabilities; robustness; traffic engineering purpose; interdomain multipath architectures; added-value serviceRelated items
Showing items related by title and author.
-
Bianzino, Aruna Prem; Chaudet, Claude; Rossi, Dario; Rougier, Jean-Louis; Moretti, Stefano (2011) Communication / Conférence
-
Bianzino, Aruna Prem; Chaudet, Claude; Moretti, Stefano; Rougier, Jean-Louis; Chiaraviglio, Luca; Le Rouzic, Esther (2012) Communication / Conférence
-
Moretti, Stefano; Rougier, Jean-Louis; Rossi, Dario; Chaudet, Claude; Bianzino, Aruna Prem (2010) Document de travail / Working paper
-
Bianzino, Aruna Prem; Roujean, Jean-Louis; Rossi, Dario; Moretti, Stefano (2010-07) Communication / Conférence
-
Renoux, Jean-Louis; Tallard, Michèle (2014) Communication / Conférence