Incentive compatible pricing strategies for QoS routing

Proceedings - IEEE INFOCOM

Volumn 2, Issue , 1999, Pages 891-899

  Korilis, Yannis A ^a   Orda, Ariel ^b  

^a LUCENT TECHNOLOGIES   (United States)

^b TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

Author keywords

Networking games; Pricing; QoS routing; Rate based schedulers

Indexed keywords

CONGESTION-BASED; EQUILIBRIUM POINT; INCENTIVE COMPATIBLE; MINIMAL COST; MULTI OBJECTIVE; NETWORKING GAMES; NONCOOPERATIVE GAME; PATH OPTIMIZATIONS; PATH SELECTION ALGORITHMS; PERFORMANCE REQUIREMENTS; PRICE FUNCTION; PRICING MECHANISM; PRICING SCHEME; PRICING STRATEGY; QOS ARCHITECTURE; QOS ROUTING; RATE-BASED SCHEDULERS; SOCIAL FUNCTION;

COMMUNICATION SYSTEMS; COMPUTER RESOURCE MANAGEMENT; ECONOMICS; MULTIOBJECTIVE OPTIMIZATION; NETWORK ROUTING; ALGORITHMS; COMPUTER ARCHITECTURE; RESOURCE ALLOCATION; ROUTERS;

COSTS; TELECOMMUNICATION SERVICES;

QUALITY OF SERVICE (QOS) ROUTING;

EID: 0032661702     PISSN: 0743166X     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/INFCOM.1999.751478     Document Type: Conference Paper

References (30)

1. Private Network-Network Interface Specification v1.0 (PNNI). ATM Forum Technical Committee, March 1996.
2. T. H. Cormen, C. E. Leiserson, and R. L. Rivest. Introduction to Algorithms. MIT Press, Cambridge, MA, 1990.
3. E. Crawley, R. Nair. B. Rajagopalan, and H. Sandick. A Framework for QoS-based Routing in the Internet - RFC No. 23S6. Internet RFC, August 1998.
4. S. Dafermos and F. T. Sparrow. Optimal resource allocation and toll patterns in user-optimised transport networks. Journal of Transport Economics and Policy, pages 184-200, 1971.
5. R. J. Edell, N. McKeown, and P. P. Varaiya. Billing Users and Pricing for TCP. IEEE Journal on Selected Areas in Communications. 13:1162-1175, September 1995.
6. D. Fudenberg and J. Tirole. Game Theory. MIT Press, Cambridge, Massachusetts, 1992.
7. M. Garey and D. Johnson. Computers and Intractability. Freeman, San Francisco. 1979.
8. L. Georgiadis, R. Guérin, V. Peris, and K. N. Sivarajan. Efficient Network QoS Provisioning Based on per Node Traffic Shaping. IEEE/ACM Transactions on Networking, 4(4):482-501, August 1996.
9. R. Guérin, S. Kamat, A. Orda, T. Przygienda, and D. Williams. QoS Routing Mechanisms and OSPF Extensions. Internet Draft, January 1998. Work in progress.
10. R. Guérin and A. Orda. QoS-based routing in networks with inaccurate state and metrics information. Research report, IBM, T. J. Watson Research Center, 1996. Conference version appeared in the Proceedings of Infocom'97, Kobe, Japan.
11. R. Guérin, A. Orda, and D. Williams. QoS Routing Mechanisms and OSPF Extensions. In Proceedings of the 2nd IEEE Global Internet MiniConference, Phoenix, AZ, November 1997.
12. R. Hassin. Approximation Schemes for the Restricted Shortest Path Problem. Mathematics of Operations Research, 17(1):36-42, February 1992.
13. S. Jordan and H. Jiang. Connection Establishment in High Speed Networks. IEEE Journal on Selected Areas in Communications, 13:1150-1161, September 1995.
14. F. P. Kelly. Tarrifs and Effective Bandwidths in Multiservice Networks. Proceedings of TTC'94, pages 401-410. 1993.
15. Y. A. Korilis and A. Orda. Incentive Compatible Pricing Strategies for QoS Routing. Research Report No. 1182, Department of Electrical Engineering, Technion, Haifa, Israel. December 1998. May be obtained from "ftp://ftp.technion.ac.il/pub/supported/ee/Network/ko.price98.ps".
16. Y. A. Korilis, T. A. Varvarigou, and S. R. Ahuja. Incentive-Compatible Pricing Strategies in Noncooperative Networks. In Proceedings of the IEEE INFOCOM'98, San Francisco, CA, April 1998.
17. S. H. Low and P. P. Varaiya. A New Approach to Service Provisioning in ATM Networks. IEEE/ACM Transactions on Networking, 1(3):547-553. 1993.
18. Q. Ma and P. Steenkiste. Quality of Service Routing for Traffic with Performance Guarantees. In Proceedings of IWQoS'97, Columbia University, New York, NY, May 1997.
19. J. K. MacKie-Mason and H. R. Varian. Pricing Cognestible Network Resources. IEEE Journal on Selected Areas in Communications, 13(7): 1141-1149, September 1995.
20. H. Mendelson and S. Whang. Optimal Incentive-Compatible Priority Pricing for the M/M/1 Queue. Operations Research, 38(5):870-883, 1990.
21. R. B. Myerson. Game Theory: Analysis of Conflict. Harvard University Press, Cambridge, Massachusetts, 1991.
22. A. Orda. Routing with End to End QoS Guarantees in Broadband Networks. In IEEE INFOCOM'98. San Francisco, CA, March 1998.
23. A. Orda and N. Shimkin. Incentive Pricing in Multi-Class Communication Networks. In Proceedings of the IEEE INFOCOM'97, Kobe. Japan, April 1997.
24. A. K. Parekh and R. Gallager. A Generalized Processor Sharing Approach to Flow Control in Integrated Services Networks: the Multiple Node Case. IEEE/ACM Transactions on Networking, 2:137-150. 1994.
25. S. Plotkin. Competitive routing in ATM networks. IEEE J. Selected Areas in Comm., pages 1128-1136, August 1995. Special issue on Advances in the Fundamentals of Networking.
26. C. Pornavalai, G. Chakraborty, and N. Shiratori. QoS Based Routing Algorithm in Integrated Services Packet Networks. In Proceedings of IEEE ICNP'97, Atlanta, GA, October 1997.
27. J. Sairamesh, D. F. Ferguson, and Y. Yemini. An Approach to Pricing, Optimal Allocation and Quality of Service Provisioning in High-Speed Packet Networks. In Proceeding of the IEEE INFOC0M, Boston, MA, April 1995.
28. S. Shenker, C. Partridge, and R. Guerin. Specification of Guaranteed Quality of Service-RFC No. 2212. Internet RFC. November 1997.
29. Z. Wang and J. Crowcroft. Quality-of-Service Routing for Supporting Multimedia Application. IEEE JSAC, 14(7).1288-1234, September 1996.
30. H. Zhang. Service Disciplines for Guaranteed Performance Service in Packet-Switching Networks. Proceedings of the IEEE, 83(10).1374-1399, October 1995.