S. Requirements and .. , 54 1.3.1 Provided services 55 1.3.3 Data plane changes, Respecting Internet paradigms, p.57

R. Work, .. , and B. , 58 1.4.2 Source selectable path diversity via routing deflections, p.61

T. Contributions-of, 64 4.2.1 The need for identification 126 4.2.2 Identifying what and where ?, p.129

.. Analysis-of-specific-path-id-schemes, 131 4.3.1 Stub-to-Stub Path-ID use, p.131

P. Framework, On the difficulty to both being truthful and form the grand coalition, p.147

.. An-example-of-payment-function, 159 5.6.1 Payment function presentation, p.164

S. Ruthfield, The Internet's history and development, Crossroads, vol.2, issue.1, pp.2-4, 1995.
DOI : 10.1145/332198.332202

H. Katie and L. Matthew, Where Wizards Stay Up Late: The Origins Of The Internet, 1996.

M. Stephens, ???Which Communications Revolution is it, Anyway????, Journalism & Mass Communication Quarterly, vol.75, issue.1, pp.9-13, 1998.
DOI : 10.1177/107769909807500103

J. W. Carey, Historical pragmatism and the internet, New Media & Society, vol.50, issue.19, pp.443-455, 2005.
DOI : 10.1177/1461444805054107

R. Rayman, K. Croome, N. Galbraith, R. Mcclure, R. Morady et al., Long-distance robotic telesurgery: a feasibility study for care in remote environments, The International Journal of Medical Robotics and Computer Assisted Surgery, vol.9, issue.3, pp.216-224, 2006.
DOI : 10.1002/rcs.99

M. Pais-vieira, M. Lebedev, C. Kunicki, J. Wang, and M. A. Nicolelis, A brain-to-brain interface for real-time sharing of sensorimotor information Scientific reports, p.1319, 2013.

Y. Rekhter, T. Li, and S. Haresonline, RFC 4271 (Draft Standard), Internet Engineering Task Force bgp best path selection algorithm, A Border Gateway Protocol, vol.4, issue.6608, p.6793, 2006.

. Available, Configure BGP to Select Multiple BGP Paths, tk365/technologies_tech_ note09186a0080094431.shtml [10] Juniper

A. Akella, S. Seshan, and A. Shaikh, An empirical evaluation of wide-area internet bottlenecks, Proceedings of the 3rd ACM SIGCOMM conference on Internet measurement, ser. IMC '03, pp.101-114, 2003.

R. Serral-gracià, E. Cerqueira, M. Curado, M. Yannuzzi, E. Monteiro et al., An Overview of Quality of Experience Measurement Challenges for Video Applications in IP Networks, Proceedings of the 8th international conference on Wired/Wireless Internet Communications, ser. WWIC'10, pp.252-263, 2010.
DOI : 10.1007/978-3-642-13315-2_21

J. Rexford and C. Dovrolis, Future Internet architecture, Communications of the ACM, vol.53, issue.9, pp.36-40, 2010.
DOI : 10.1145/1810891.1810906

D. D. Clark, J. Wroclawski, K. R. Sollins, and R. Braden, Tussle in cyberspace: defining tomorrow's Internet, IEEE/ACM Transactions on Networking, vol.13, issue.3, pp.462-475, 2005.
DOI : 10.1109/TNET.2005.850224

J. Scudder, A. Retana, D. Walton, and E. Chen, Advertisement of Multiple Paths in BGP, IETF Internet Draft, 2012.

X. Yang and D. Wetherall, Source selectable path diversity via routing deflections, Proceedings of the 2006 conference on Applications, technologies, architectures, and protocols for computer communications, ser. SIGCOMM '06, pp.159-170, 2006.
DOI : 10.1145/1159913.1159933

M. Motiwala, M. Elmore, N. Feamster, and S. Vempala, Path splicing, Proceedings of the ACM SIGCOMM 2008 conference on Data communication, ser. SIGCOMM '08, pp.27-38, 2008.

F. Wang and L. Gao, Path Diversity Aware Interdomain Routing, IEEE INFOCOM 2009, The 28th Conference on Computer Communications, pp.307-315, 2009.
DOI : 10.1109/INFCOM.2009.5061934

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.353.2852

I. Ganichev, B. Dai, P. B. Godfrey, and S. Shenker, YAMR, ACM SIGCOMM Computer Communication Review, vol.40, issue.5, pp.13-19, 2010.
DOI : 10.1145/1880153.1880156

Y. Liao, L. Gao, R. Guerin, and Z. Zhang, Reliable interdomain routing through multiple complementary routing processes, Proceedings of the 2008 ACM CoNEXT Conference on, CONEXT '08, pp.681-68, 2008.
DOI : 10.1145/1544012.1544080

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.343.5856

N. Kushman, S. Kandula, D. Katabi, and B. M. Maggs, R-bgp: staying connected in a connected world, Proceedings of the 4th USENIX conference on Networked systems design & implementation, ser. NSDI'07, pp.25-25, 2007.

W. Xu and J. Rexford, MIRO, ACM SIGCOMM Computer Communication Review, vol.36, issue.4, pp.171-182, 2006.
DOI : 10.1145/1151659.1159934

P. B. Godfrey, I. Ganichev, S. Shenker, and I. Stoica, Pathlet routing, ACM SIGCOMM Computer Communication Review, vol.39, issue.4, pp.111-122, 2009.
DOI : 10.1145/1594977.1592583

X. Yang, D. Clark, A. A. Berger-]-i, D. Ganichev, P. B. Bin et al., NIRA: A New Inter-Domain Routing Architecture, IEEE/ACM Transactions on Networking, vol.15, issue.4, pp.775-788, 2009.
DOI : 10.1109/TNET.2007.893888

D. Farinacci, V. Fuller, D. Meyer, and D. Lewis, The Locator/ID Separation Protocol (LISP), " RFC 6830 (Experimental), Internet Engineering Task Force CAIDA AS rank, 2013.

R. Mahajan, D. Wetherall, and T. Anderson, Negotiation-based routing between neighboring isps, Proceedings of the 2nd conference on Symposium on Networked Systems Design & Implementation - ser. NSDI'05, pp.29-42, 2005.

L. Gao and J. Rexford, Stable Internet routing without global coordination, ACM SIGMETRICS Performance Evaluation Review, vol.28, issue.1, pp.307-317, 2000.
DOI : 10.1145/345063.339426

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.110.6928

T. Griffin, F. Shepherd, and G. Wilfong, The stable paths problem and interdomain routing, IEEE/ACM Transactions on Networking, vol.10, issue.2, pp.232-243, 2002.
DOI : 10.1109/90.993304

E. Rosen, A. Viswanathan, and R. Callon, Multiprotocol Label Switching Architecture RFC 3031 (Proposed Standard), Internet Engineering Task Force, 2001.
DOI : 10.17487/rfc3031

J. Mikians, A. Dhamdhere, C. Dovrolis, P. Barlet-ros, and J. Solé-pareta, Towards a Statistical Characterization of the Interdomain Traffic Matrix, Networking 2012, pp.111-123, 2012.
DOI : 10.1007/978-3-642-30054-7_9

K. Kwong and R. Guérin, Controlling the growth of internet routing tables through market mechanisms, Proceedings of the Re-Architecting the Internet Workshop on, ReARCH '10, pp.1-2, 2010.
DOI : 10.1145/1921233.1921236

J. Seedorf and E. Burger, Application-Layer Traffic Optimization (ALTO) Problem Statement Internet Engineering Task Force DrPeering International, RFC 5693 (Informational), 2009.

G. Huston, BGP Routing Table Analysis Report

R. Steenbergen, A survey of interdomain routing policies, North American Network Operators' Group (NANOG) 51, 2011.

X. Dimitropoulos, D. Krioukov, M. Fomenkov, B. Huffaker, Y. Hyun et al., AS relationships, ACM SIGCOMM Computer Communication Review, vol.37, issue.1, pp.29-40, 2007.
DOI : 10.1145/1198255.1198259

L. Subramanian, S. Agarwal, J. Rexford, and R. Katz, Characterizing the Internet hierarchy from multiple vantage points, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies, pp.618-627, 2002.
DOI : 10.1109/INFCOM.2002.1019307

R. Chandra, P. Traina, and T. Li, BGP Communities Attribute, Internet Engineering Task Force, 1996.
DOI : 10.17487/rfc1997

V. Giotsas and S. Zhou, Valley-free violation in Internet routing — Analysis based on BGP Community data, 2012 IEEE International Conference on Communications (ICC), pp.1193-1197, 2012.
DOI : 10.1109/ICC.2012.6363987

W. Mühlbauer, S. Uhlig, B. Fu, M. Meulle, and O. Maennel, In search for an appropriate granularity to model routing policies, ACM SIGCOMM Computer Communication Review, vol.37, issue.4, pp.145-156, 2007.
DOI : 10.1145/1282427.1282398

P. Gill, S. Goldberg, and M. Schapira, A survey of interdomain routing policies, North American Network Operators' Group (NANOG) 56, 2012.
DOI : 10.1145/2567561.2567566

C. Perkins, P. Calhoun, and J. Bharatia, Mobile IPv4 Challenge/Response Extensions (Revised), Internet Engineering Task Force, p.4721, 2007.
DOI : 10.17487/rfc4721

W. Mühlbauer, A. Feldmann, O. Maennel, M. Roughan, and S. Uhlig, Building an as-topology model that captures route diversity, Proceedings of the 2006 conference on Applications, technologies, architectures, and protocols for computer communications, ser. SIGCOMM '06, 2006.

C. Labovitz, A. Ahuja, A. Bose, and F. Jahanian, Delayed Internet routing convergence, ACM SIGCOMM Computer Communication Review, vol.30, issue.4, pp.175-187, 2000.
DOI : 10.1145/347057.347428

J. Chandrashekar, Z. Duan, Z. Zhang, and J. Krasky, Limiting path exploration in bgp, INFOCOM 2005. 24th Annual Joint Conference of the IEEE Computer and Communications Societies. Proceedings IEEE, pp.2337-2348

P. Bangera and S. Gorinsky, Impact of prefix hijacking on payments of providers, 2011 Third International Conference on Communication Systems and Networks (COMSNETS 2011), pp.1-10, 2011.
DOI : 10.1109/COMSNETS.2011.5716486

F. Contat, S. Nataf, and G. Valadon, Influence des bonnes pratiques sur les incidents bgp Available: https://www.sstic.org, 2012.

F. Wang, B. Dai, and J. Su, How Can Multipath Dissemination Help to Detect Prefix Hijacking?, 2011 Proceedings of 20th International Conference on Computer Communications and Networks (ICCCN), pp.1-8, 2011.
DOI : 10.1109/ICCCN.2011.6005930

K. K. Lakshminarayanan, I. Stoica, S. Shenker, and J. Rexford, Routing as a service, EECS Department, 2006.

A. Feldmann and J. Rexford, IP network configuration for intradomain traffic engineering, IEEE Network, vol.15, issue.5, pp.46-57, 2001.
DOI : 10.1109/65.953233

D. Awduche, L. Berger, D. Gan, T. Li, V. Srinivasan et al., RSVP-TE: Extensions to RSVP for LSP Tunnels, Internet Engineering Task Force, p.6790, 2001.
DOI : 10.17487/rfc3209

S. Uhlig and O. Bonaventure, Designing BGP-based outbound traffic engineering techniques for stub ASes, ACM SIGCOMM Computer Communication Review, vol.34, issue.5, 2004.
DOI : 10.1145/1039111.1039115

N. Feamster, J. Borkenhagen, and J. Rexford, Guidelines for interdomain traffic engineering, ACM SIGCOMM Computer Communication Review, vol.33, issue.5, pp.19-30, 2003.
DOI : 10.1145/963985.963988

Y. Wang and J. Rexford, A modular RCP for flexible interdomain route control, Proceedings of the 2006 ACM CoNEXT conference on , CoNEXT '06, pp.561-56, 2006.
DOI : 10.1145/1368436.1368501

N. Feamster, H. Balakrishnan, J. Rexford, A. Shaikh, and J. Van-der-merwe, The case for separating routing from routers, Proceedings of the ACM SIGCOMM workshop on Future directions in network architecture , FDNA '04, pp.5-12, 2004.
DOI : 10.1145/1016707.1016709

M. Caesar, D. Caldwell, N. Feamster, J. Rexford, A. Shaikh et al., Design and implementation of a routing control platform, Proceedings of the 2nd conference on Symposium on Networked Systems Design & Implementation - ser. NSDI'05, pp.15-28, 2005.

Y. Wang, I. Avramopoulos, and J. Rexford, Morpheus, Proceedings of the 2007 SIGCOMM workshop on Internet network management , INM '07, pp.285-286, 2007.
DOI : 10.1145/1321753.1321767

F. Wang and L. Gao, On inferring and characterizing internet routing policies, Proceedings of the 3rd ACM SIGCOMM conference on Internet measurement, ser. IMC '03, pp.15-26, 2003.

D. Meyer, L. Zhang, and K. Fall, Report from the IAB Workshop on Routing and Addressing, Internet Engineering Task Force, 2007.
DOI : 10.17487/rfc4984

K. Fall, G. Iannaccone, S. Ratnasamy, and P. Godfrey, Routing Tables: Is Smaller Really Much Better, Proceedings of HotNets, 2009.

B. Augustin, T. Friedman, and R. Teixeira, Measuring Multipath Routing in the Internet, IEEE/ACM Transactions on Networking, vol.19, issue.3, pp.830-840, 2011.
DOI : 10.1109/TNET.2010.2096232

URL : https://hal.archives-ouvertes.fr/hal-00832951

T. Bates, E. Chen, and R. Chandra, BGP Route Reflection: An Alternative to Full Mesh Internal BGP (IBGP), Internet Engineering Task Force, 2006.
DOI : 10.17487/rfc4456

T. Bates, Y. Rekhter, R. Chandra, and D. Katz, Multiprotocol Extensions for BGP-4 RFC 2858 (Proposed Standard), Internet Engineering Task Force, 2000.

D. Pei, M. Azuma, D. Massey, and L. Zhang, BGP-RCN: improving BGP convergence through root cause notification, Computer Networks, vol.48, issue.2, pp.175-194, 2005.
DOI : 10.1016/j.comnet.2004.09.008

Y. Liao, L. Gao, R. Guerin, and Z. Zhang, Multi-process inter-domain routing, ECE Department, 2008.

Y. Wang, M. Schapira, and J. Rexford, Neighbor-specific BGP, Proceedings of the eleventh international joint conference on Measurement and modeling of computer systems, SIGMETRICS '09, pp.217-228, 2009.
DOI : 10.1145/1555349.1555375

A. Gurney and T. Griffin, Neighbor-specific BGP: An algebraic exploration, The 18th IEEE International Conference on Network Protocols, pp.103-112
DOI : 10.1109/ICNP.2010.5762759

J. Hui, J. Vasseur, D. Culler, and V. Manral, An IPv6 Routing Header for Source Routes with the Routing Protocol for Low-Power and Lossy Networks (RPL), " RFC 6554 (Proposed Standard), Internet Engineering Task Force, 2012.

M. Yannuzzi, X. Masip-bruin, and O. Bonaventure, Open issues in interdomain routing: a survey, IEEE Network, vol.19, issue.6, pp.49-56, 2005.
DOI : 10.1109/MNET.2005.1541721

V. Van-den-schrieck, P. Francois, and O. Bonaventure, BGP Add-Paths: The Scaling/Performance Tradeoffs, IEEE Journal on Selected Areas in Communications, vol.28, issue.8, pp.1299-1307, 2010.
DOI : 10.1109/JSAC.2010.101007

J. He and J. Rexford, Toward internet-wide multipath routing, Network, IEEE, vol.22, issue.2, pp.16-21, 2008.

D. Saucez, L. Iannone, O. Bonaventure, and D. Farinacci, Designing a Deployable Internet: The Locator/Identifier Separation Protocol, IEEE Internet Computing, vol.16, issue.6, pp.14-21, 2012.
DOI : 10.1109/MIC.2012.98

B. Quoitin, L. Iannone, C. De-launois, and O. Bonaventure, Evaluating the benefits of the locator/identifier separation, Proceedings of first ACM/IEEE international workshop on Mobility in the evolving internet architecture , MobiArch '07, pp.1-5, 2007.
DOI : 10.1145/1366919.1366926

D. Lee, Domain names -concepts and facilities RFC 1034 (INTERNET STANDARD), Internet Engineering Task Force, p.5936, 1101.

J. Ahrenholz, Host Identity Protocol Distributed Hash Table Interface RFC 6537 (Experimental), Internet Engineering Task Force, Feb, 2012.

C. Perkins, Internet Engineering Task Force, Proposed Standard), 1996.

V. Fuller and D. Farinacci, Locator/ID Separation Protocol (LISP) Map- Server Interface, Internet Engineering Task Force, 2013.
DOI : 10.17487/rfc6833

P. Marques, R. Fernando, E. Chen, P. Mohapatra, and H. Gredler, Advertisement of the best external route in BGP, IETF Internet Draft, 2012.

D. Saucez, B. Donnet, L. Iannone, and O. Bonaventure, Interdomain traffic engineering in a locator/identifier separation context, 2008 IEEE Internet Network Management Workshop (INM), pp.1-6, 2008.
DOI : 10.1109/INETMW.2008.4660330

Y. Wang, M. Schapira, and J. Rexford, Neighbor-specific BGP, Proceedings of the eleventh international joint conference on Measurement and modeling of computer systems, SIGMETRICS '09, pp.217-228, 2009.
DOI : 10.1145/1555349.1555375

V. Van-den-schrieck, P. Francois, and O. Bonaventure, BGP Add-Paths: The Scaling/Performance Tradeoffs, IEEE Journal on Selected Areas in Communications, vol.28, issue.8, pp.1299-1307, 2010.
DOI : 10.1109/JSAC.2010.101007

M. Roughan, W. Willinger, O. Maennel, D. Perouli, and R. Bush, 10 lessons from 10 years of measuring and modeling the internet's autonomous systems Selected Areas in Communications, IEEE Journal on, vol.29, issue.9, pp.1810-1821, 2011.

S. Qiu, P. Mcdaniel, and F. Monrose, Toward Valley-Free Inter-domain Routing, 2007 IEEE International Conference on Communications, pp.2009-2016, 2007.
DOI : 10.1109/ICC.2007.334

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.63.4901

F. Wang, J. Qiu, L. Gao, and J. Wang, On Understanding Transient Interdomain Routing Failures, IEEE/ACM Transactions on Networking, vol.17, issue.3, pp.740-751, 2009.
DOI : 10.1109/TNET.2008.2001952

W. Mühlbauer, S. Uhlig, B. Fu, M. Meulle, and O. Maennel, In search for an appropriate granularity to model routing policies, Proceedings of the 2007 conference on Applications, technologies, architectures, and protocols for computer communications, ser. SIGCOMM '07, pp.145-156, 2007.

A. Elmokashfi, A. Kvalbein, and C. Dovrolis, BGP Churn Evolution: A Perspective From the Core, IEEE/ACM Transactions on Networking, vol.20, issue.2, pp.571-584, 2012.
DOI : 10.1109/TNET.2011.2168610

F. Wang, Z. M. Mao, J. Wang, L. Gao, and R. Bush, A measurement study on the impact of routing events on end-to-end internet path performance, ACM SIGCOMM Computer Communication Review, vol.36, issue.4, pp.375-386, 2006.
DOI : 10.1145/1151659.1159956

C. Villamizar, R. Chandra, and R. Govindan, BGP Route Flap Damping RFC 2439 (Proposed Standard), Internet Engineering Task Force, 1998.

L. Iannone and O. Bonaventure, On the cost of caching locator/ID mappings, Proceedings of the 2007 ACM CoNEXT conference on , CoNEXT '07, pp.1-712, 2007.
DOI : 10.1145/1364654.1364663

L. Iannone, D. Saucez, O. Bonaventure, R. Oliveira, D. Pei et al., Locator/ID Separation Protocol (LISP) Map-Versioning Internet Engineering Task Force The (in)completeness of the observed internet as-level structure, IEEE/ACM Trans. Netw, vol.18, issue.1, pp.6834-109, 2010.

S. Uhlig and S. Tandel, Quantifying the BGP Routes Diversity Inside a Tier-1 Network, Proceedings of the 5th international IFIP-TC6 conference on Networking Technologies, Services, and Protocols; Performance of Computer and Communication Networks; Mobile and Wireless Communications Systems, ser. NETWORKING'06, pp.1002-1013, 2006.
DOI : 10.1007/11753810_83

B. Quoitin, C. Pelsser, L. Swinnen, O. Bonaventure, and S. Uhlig, Interdomain traffic engineering with BGP, IEEE Communications Magazine, vol.41, issue.5, pp.122-128, 2003.
DOI : 10.1109/MCOM.2003.1200112

L. Jakab, A. Cabellos-aparicio, F. Coras, D. Saucez, and O. Bonaventure, Lisp-tree: A dns hierarchy to support the lisp mapping system Selected Areas in Communications, IEEE Journal on, vol.28, issue.8, pp.1332-1343, 2010.

V. Fuller, D. Farinacci, D. Meyer, D. A. Lewis, J. Farrel et al., Internet Engineering Task Force A Path Computation Element (PCE)-Based Architecture, Internet Engineering Task Force, 2006.

D. Farinacci, P. Lahiri, and M. Kowal, Lisp traffic engineering use-cases, ietf internet draft (work in progress), 2013.

D. Farinacci, D. Meyer, J. Snijders, R. Enns, M. Bjorklund et al., Lisp canonical address format (lcaf), ietf internet draft (work in progress), Internet Engineering Task Force, 2011.

T. Nadeau, C. Srinivasan, and A. Viswanathan, Multiprotocol Label Switching (MPLS) Forwarding Equivalence Class To Next Hop Label Forwarding Entry (FEC-To-NHLFE) Management Information Base (MIB), " RFC 3814 (Proposed Standard), Internet Engineering Task Force, 2004.

F. Valera, I. Van-beijnum, A. García-martínez, and M. Bagnulo, Multi-path BGP: motivations and solutions, 2011.
DOI : 10.1017/CBO9780511920950.013

M. Yannuzzi, X. Masip-bruin, S. Sanchez, J. Domingo-pascual, A. Oreda et al., On the challenges of establishing disjoint QoS IP/MPLS paths across multiple domains, IEEE Communications Magazine, vol.44, issue.12, pp.60-66, 2006.
DOI : 10.1109/MCOM.2006.273101

Y. Wang, I. Avramopoulos, and J. Rexford, Morpheus, Proceedings of the 2007 SIGCOMM workshop on Internet network management , INM '07, pp.802-809, 2007.
DOI : 10.1145/1321753.1321767

A. J. Gurney and T. G. Griffin, Neighbor-specific BGP: An algebraic exploration, The 18th IEEE International Conference on Network Protocols, pp.103-112, 2010.
DOI : 10.1109/ICNP.2010.5762759

T. Erlebach, A. Hall, A. Panconesi, and D. Vukadinovi´cvukadinovi´c, Cuts and Disjoint Paths in the Valley-Free Path Model of Internet BGP Routing, Combinatorial and Algorithmic Aspects of Networking, pp.95-95, 2005.
DOI : 10.1007/11527954_6

E. Rosen, D. Tappan, G. Fedorkow, Y. Rekhter, D. Farinacci et al., MPLS Label Stack Encoding, Internet Engineering Task Force, p.5586, 2001.
DOI : 10.17487/rfc3032

S. Amante, B. Carpenter, S. Jiang, and J. Rajahalme, IPv6 Flow Label Specification, Internet Engineering Task Force, 2011.
DOI : 10.17487/rfc6437

S. Secci, K. Liu, G. K. Rao, and B. Jabbari, Resilient Traffic Engineering in a Transit-Edge Separated Internet Routing, 2011 IEEE International Conference on Communications (ICC), pp.1-6, 2011.
DOI : 10.1109/icc.2011.5963439

URL : https://hal.archives-ouvertes.fr/hal-01282501

Z. Houidi and M. Meulle, A new VPN routing approach for large scale networks, The 18th IEEE International Conference on Network Protocols, pp.124-133, 2010.
DOI : 10.1109/ICNP.2010.5762761

R. Day and P. Milgrom, Core-selecting package auctions, International Journal of Game Theory, vol.46, issue.1, pp.393-407, 2007.
DOI : 10.1007/s00182-007-0100-7

L. M. Ausubel and P. Cramton, Vickrey auctions with reserve pricing, Tech. Rep, 2004.
DOI : 10.1007/s00199-003-0398-8

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.304.9420

P. Milgrom, Putting Auction Theory to Work, 2004.
DOI : 10.1017/cbo9780511813825

P. Maille and B. Tuffin, Why VCG auctions can hardly be applied to the pricing of inter-domain and ad hoc networks, 2007 Next Generation Internet Networks, pp.36-39, 2007.
DOI : 10.1109/NGI.2007.371195

L. M. Ausubel and P. Milgrom, The Lovely but Lonely Vickrey Auction, 2006.
DOI : 10.7551/mitpress/9780262033428.003.0002

B. Day and P. Milgrom, Optimal Incentives in Core???Selecting Auctions, Handbook of Market Design, 2010.
DOI : 10.1093/acprof:oso/9780199570515.003.0012

R. W. Day and S. Raghavan, Computing core payments in combinatorial auctions, ACM SIGecom Exchanges, vol.7, issue.1, pp.22-24, 2007.
DOI : 10.1145/1345037.1345042

A. Erdil and P. Klemperer, A NEW PAYMENT RULE FOR CORE-SELECTING PACKAGE AUCTIONS, Journal of the European Economic Association, vol.8, issue.2-3, pp.537-547, 2010.
DOI : 10.1111/j.1542-4774.2010.tb00524.x

P. Briest and P. Krysta, Single-minded unlimited supply pricing on sparse instances, Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm , SODA '06, pp.1093-1102, 2006.
DOI : 10.1145/1109557.1109678

M. Balcan and F. Constantin, Sequential Item Pricing for Unlimited Supply, Proceedings of the 6th international conference on Internet and network economics, ser. WINE'10, pp.50-62, 2010.
DOI : 10.1007/978-3-642-17572-5_5

M. Balcan and A. Blum, Approximation algorithms and online mechanisms for item pricing, Proceedings of the 7th ACM conference on Electronic commerce , EC '06, pp.29-35, 2006.
DOI : 10.1145/1134707.1134711

M. Balcan, A. Blum, and Y. Mansour, Item pricing for revenue maximization, Proceedings of the 9th ACM conference on Electronic commerce, ser. EC '08, pp.50-59, 2008.

G. Aggarwal, T. Feder, R. Motwani, and A. Zhu, Algorithms for Multi-product Pricing, Proceedings of the International Colloquium on Automata, Languages, and Programming, pp.72-83, 2004.
DOI : 10.1007/978-3-540-27836-8_9

J. D. Hartline and V. Koltun, Near-Optimal Pricing in Near-Linear Time, 9th Workshop on Algorithms and Data Structures, pp.422-431, 2005.
DOI : 10.1007/11534273_37

J. D. Hartline and R. Mcgrew, From optimal limited to unlimited supply auctions, Proceedings of the 6th ACM conference on Electronic commerce , EC '05, pp.175-182, 2005.
DOI : 10.1145/1064009.1064028

M. Balcan and A. Blum, Mechanism Design via Machine Learning, 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS'05), pp.605-614, 2005.
DOI : 10.1109/SFCS.2005.50

I. Segal, Optimal pricing mechanisms with unknown demand, American Economic Review, vol.93, 2003.

V. Guruswami, J. D. Hartline, A. R. Karlin, D. Kempe, C. Kenyon et al., On profit-maximizing envy-free pricing, Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms, ser. SODA '05, pp.1164-1173, 2005.

A. V. Goldberg, J. D. Hartline, and A. Wright, Competitive auctions and digital goods, Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms, ser. SODA '01, 2001.

A. Goldberg, J. , H. May, A. V. Goldberg, and J. D. Hartline, Competitive Auctions for Multiple Digital Goods, Proc. 9th European Symposium on Algorithms, 2001.
DOI : 10.1007/3-540-44676-1_35

Z. Bar-yossef, K. Hildrum, and F. Wu, Incentive-compatible online auctions for digital goods, Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms, ser. SODA '02, pp.964-970, 2002.

A. V. Goldberg and J. D. Hartline, Envy-free auctions for digital goods, Proceedings of the 4th ACM conference on Electronic commerce , EC '03, pp.29-35, 2003.
DOI : 10.1145/779928.779932

A. V. Goldberg, J. D. Hartline, A. R. Karlin, and M. Saks, A Lower Bound on the Competitive Ratio of Truthful Auctions, Proceedings 21st Symposium on Theoretical Aspects of Computer Science, pp.644-655, 2004.
DOI : 10.1007/978-3-540-24749-4_56

A. V. Goldberg, J. D. Hartline, A. R. Karlin, M. Saks, and A. Wright, Competitive auctions, Games and Economic Behavior, vol.55, issue.2, 2006.
DOI : 10.1016/j.geb.2006.02.003

P. Maille and B. Tuffin, Multi-bid auctions for bandwidth allocation in communication networks, IEEE INFOCOM 2004, 2004.
DOI : 10.1109/INFCOM.2004.1354481

M. Dramitinos, G. D. Stamoulis, and C. Courcoubetis, An auction mechanism for allocating the bandwidth of networks to their users, Computer Networks, vol.51, issue.18, pp.4979-4996, 2007.
DOI : 10.1016/j.comnet.2007.08.007

J. Feigenbaum, C. Papadimitriou, R. Sami, and S. Shenker, A BGP-based mechanism for lowest-cost routing, Proceedings of the twenty-first annual symposium on Principles of distributed computing , PODC '02, pp.61-72, 2005.
DOI : 10.1145/571825.571856

N. Nisan, T. Roughgarden, E. Tardos, and V. V. Vazirani, Algorithmic Game Theory, 2007.
DOI : 10.1017/CBO9780511800481

V. Valancius, N. Feamster, R. Johari, and V. Vazirani, MINT, Proceedings of the 2008 ACM CoNEXT Conference on, CONEXT '08, 2008.
DOI : 10.1145/1544012.1544082

D. Lehmann, L. I. O´callaghano´callaghan, and Y. Shoham, Truth revelation in approximately efficient combinatorial auctions, Journal of the ACM, vol.49, issue.5, pp.577-602, 2002.
DOI : 10.1145/585265.585266

P. Milgrom, Incentives in core-selecting auctions, 2006.

R. Day and P. Cramton, Quadratic Core-Selecting Payment Rules for Combinatorial Auctions, Operations Research, vol.60, issue.3, 2008.
DOI : 10.1287/opre.1110.1024

P. Cramton, Spectrum Auction Design, Review of Industrial Organization, vol.100, issue.2, 2009.
DOI : 10.1007/s11151-013-9376-x

C. H. Papadimitriou, Computational complexity, " in Encyclopedia of Computer Science, pp.260-265

G. Goth, Software-Defined Networking Could Shake Up More than Packets, IEEE Internet Computing, vol.15, issue.4, pp.6-9, 2011.
DOI : 10.1109/MIC.2011.96

D. Staessens, S. Sharma, D. Colle, M. Pickavet, and P. Demeester, Software defined networking: Meeting carrier grade requirements, 2011 18th IEEE Workshop on Local & Metropolitan Area Networks (LANMAN), pp.1-6, 2011.
DOI : 10.1109/LANMAN.2011.6076935

J. Kempf, S. Whyte, J. Ellithorpe, P. Kazemian, M. Haitjema et al., Openflow mpls and the open source label switched router, Proceedings of the 23rd International Teletraffic Congress, ser. ITC '11. ITCP, pp.8-14, 2011.

A. R. Sharafat, S. Das, G. Parulkar, and N. Mckeown, MPLS-TE and MPLS VPNS with openflow, ACM SIGCOMM Computer Communication Review, vol.41, issue.4, pp.452-453, 2011.
DOI : 10.1145/2043164.2018516

E. Cantillon and M. Pesendorfer, Combination Bidding in Multi-Unit Auctions, SSRN Electronic Journal, vol.6083, 2007.
DOI : 10.2139/ssrn.958730

A. Ford, C. Raiciu, M. Handley, S. Barre, and J. Iyengar, Architectural Guidelines for Multipath TCP Development, Internet Engineering Task Force, p.6182, 2011.
DOI : 10.17487/rfc6182

P. Reichljenkins, F. L. Faucheur, and N. Bitar, From charging for quality of service to charging for quality of experience Content Distribution Network Interconnection (CDNI) Problem Statement, Internet Engineering Task Force, pp.189-199, 2010.

G. Bertrand, E. Stephan, T. Burbridge, P. Eardley, K. Ma et al., Use Cases for Content Delivery Network Interconnection, 2012.
DOI : 10.17487/rfc6770