ACM Home Page
Please provide us with feedback. Feedback
Pricing the internet with multibid auctions
Full text PdfPdf (716 KB)
Source IEEE/ACM Transactions on Networking (TON) archive
Volume 14 ,  Issue 5  (October 2006) table of contents
Pages: 992 - 1004  
Year of Publication: 2006
ISSN:1063-6692
Authors
Patrick Maillé  GET/ENST Bretagne, Cesson-Sévigné Cedex, France
Bruno Tuffin  INRIA-IRISA, Rennes, France
Publisher
IEEE Press  Piscataway, NJ, USA
Bibliometrics
Downloads (6 Weeks): 2,   Downloads (12 Months): 57,   Citation Count: 2
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Review this Article  
DOI Bookmark: 10.1109/TNET.2006.882861

ABSTRACT

Usage-based or congestion-based charging schemes have been regarded as a relevant way to control congestion and to differentiate services among users in telecommunication networks; auctioning for bandwidth appears as one of several possibilities. In a previous work, the authors designed a multibid auction scheme where users compete for bandwidth at a link by submitting several couples (e.g., amount of bandwidth asked, associated unit price) so that the link allocates the bandwidth and computes the charge according to the second price principle. They showed that incentive compatibility and efficiency among other properties are verified. We propose in the present paper to extend this scheme to the case of a network by using the properties/ assumptions that the backbone network is overprovisioned and the access networks have a tree structure.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
[1] L. Bernstein, "Managing the last mile," IEEE Commun. Mag., vol. 35, no. 10, pp. 72-76, Oct. 1997.
 
2
[2] C. Courcoubetis and R. Weber, Pricing Communication Networks: Economics, Technology and Modelling. New York: Wiley, 2003.
 
3
[3] B. Tuffin, "Charging the Internet without bandwidth reservation: An overview and bibliography of mathematical approaches," J. Inf. Sci. Eng., vol. 19, no. 5, pp. 765-786, Sep. 2003.
 
4
[4] L. A. DaSilva, "Pricing for QoS-enabled networks: A survey," IEEE Commun. Surveys, vol. 3, no. 2, pp. 2-8, 2000.
5
 
6
[6] J. Shu and P. Varaiya, "Pricing network services," in Proc. IEEE INFOCOM , 2003, vol. 2, pp. 1221-1230.
 
7
[7] R. J. Gibbens and F. P. Kelly, "Distributed connection acceptance control for a connectionless network," in Teletraffic Engineering in a Competitive World, P. Key and D. Smith, Eds. Amsterdam, The Netherlands: Elsevier, 1999, pp. 941-952.
 
8
[8] P. Marbach, "Priority service and max-min fairness," in Proc. IEEE INFOCOM, 2002, vol. 1, pp. 266-275.
 
9
[9] F. P. Kelly, A. K. Maulloo, and D. K. H. Tan, "Rate control in communication networks: Shadow prices, proportional fairness and stability," J. Oper. Res. Soc., vol. 49, pp. 237-252, 1998.
 
10
 
11
[11] P. Reichl, G. Fankhauser, and B. Stiller, "Auction models for multiprovider Internet connections," in Proc. Messung, Modelierung und Bewertung, Trier, Germany, Sep. 1999, pp. 71-75.
 
12
[12] N. Semret and A. A. Lazar, "Design, analysis and simulation of the progressive second price auction for network bandwidth sharing." CTR Tech. Rep., CU/CTR/TR 487-98-21, Apr. 1998.
 
13
[13] P. Maillé and B. Tuffin, "Multi-bid auctions for bandwidth allocation in communication networks," in Proc. IEEE INFOCOM, Mar. 2004.
 
14
 
15
[15] P. Maillé and B. Tuffin, "Multi-bid versus progressive second price auctions in a stochastic environment," in Proc. ICQT'04, Barcelona, Spain, Oct. 2004, LNCS 3266, pp. 318-327.
 
16
 
17
[17] C. Bisdikian, K. Maruyama, D. I. Seidman, and D. N. Serpanos, "Cable access beyond the hype: On residential broadband data services over HFC networks," IEEE Commun. Mag., vol. 34, no. 11, pp. 128-135, Nov. 1996.
 
18
[18] F. Houéto, S. Pierre, R. Beaubrun, and Y. Lemieux, "Reliability and cost evaluation of third-generation wireless access network topologies: A case study," IEEE Trans. Reliabil., vol. 51, no. 2, pp. 229-239, Jun. 2002.
 
19
[19] S. Sargento, R. Valadas, J. Gonçalves, and H. Sousa, "IP-based access networks for broadband multimedia services," IEEE Commun. Mag., vol. 41, no. 2, pp. 146-154, Feb. 2003.
 
20
 
21
 
22
[22] L. Andrew, S. Hanly, and R. Mukhtar, "CLAMP: Differentiated capacity allocation in access networks," in Proc. 22nd IEEE IPCCC, Apr. 2003, pp. 451-458.
 
23
[23] D. Fudenberg and J. Tirole, Game Theory. Cambridge, MA: MIT Press, 1991.
 
24
[24] W. Vickrey, "Counterspeculation, auctions, and competitive sealed tenders," J. Finance, vol. 16, no. 1, pp. 8-37, Mar. 1961.
 
25
[25] E. H. Clarke, "Multipart pricing of public goods," Public Choice, vol. 11, pp. 17-33, 1971.
 
26
[26] T. Groves, "Incentives in teams," Econometrica, vol. 41, no. 3, pp. 617-631, Jul. 1973.
 
27
[27] H. Chen and Y. Li, "Intelligent flow control under game theoretic framework," in Telecommunications Optimization: Heuristic and Adaptive Techniques, D. W. Come, G. D. Smith, and M. J. Oats, Eds. New York: Wiley, 2000.


Collaborative Colleagues:
Patrick Maillé: colleagues
Bruno Tuffin: colleagues