Loss-cognizant pricing in networks with greedy users

Computer Networks

Volumn 51, Issue 6, 2007, Pages 1660-1683

  Al Daoud, Ashraf ^a   Alanyali, Murat ^a  

^a Boston University   (United States)

Author keywords

Congestion losses; Decentralized algorithms; Fluid models; Non cooperative sessions; Pricing; Social welfare maximization

Indexed keywords

ALGORITHMS; COMPUTER SIMULATION; DECENTRALIZED CONTROL; THROUGHPUT; TOPOLOGY; USER INTERFACES;

CONGESTION LOSSES; DECENTRALIZED ALGORITHMS; FLUID MODELS; NON-COOPERATIVE SESSIONS; PRICING; SOCIAL WELFARE MAXIMIZATION;

PACKET NETWORKS;

EID: 33846867071     PISSN: 13891286     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.comnet.2006.08.020     Document Type: Article

References (26)

1. Srikant R. The Mathematics of Internet Congestion Control (2004), Birkhauser
2. Floyd S., and Fall K. Promoting the use of end-to-end congestion control in the Internet. IEEE/ACM Transactions on Networking 7 (1999) 458-472
3. Floyd S., and Jacobson V. Random early detection gateways for congestion avoidance. IEEE/ACM Transactions on Networking 1 (1993) 397-413
4. Stoica I., Shenker S., and Zhang H. Core-stateless fair queueing: achieving approximately fair bandwidth allocations in high-speed networks. Proceedings of ACM/SIGCOMM (1998) 118-130
5. Feng W., Kandlur D., Saha D., and Shin K. Stochastic fair blue: a queue management algorithm enforcing fairness. Proceedings of IEEE INFOCOM (2001) 1520-1529
6. Lin D., and Morris R. Dynamics of random early detection. Proceedings of ACM/SIGCOMM (1997) 127-137
7. Pan R., Prabhakar B., and Psounis K. CHOKe a stateless active queue management scheme for approximating fair bandwidth allocation. Proceedings of IEEE INFOCOM 2 April (2000) 942-951
8. Tang A., Wang J., and Low S. Understanding CHOKe: throughput and spatial characteristics. Proceedings of IEEE INFOCOM 1 April (2003) 114-124
9. Kelly F.P. Charging and rate control for elastic traffic. European Transactions on Telecommuncations 8 (1997) 33-37
10. Kelly F., Maulloo A., and Tan D. Rate control for communication networks: shadow prices, proportional fairness and stability. Journal of the Operational Research Society 49 (1998) 237-252
11. Low S.H., and Lapsley D.E. Optimization flow control - I: Basic algorithm and convergence. IEEE/ACM Transactions on Networking 7 6 (1999) 861-874
12. La R.J., and Anantharam V. Utility-based rate control in the Internet for elastic traffic. IEEE/ACM Transactions on Networking 10 2 (2002) 272-286
13. Johari R., and Tsitsiklis J. Network resource allocation and a congestion game: the single link case. Proceedings of IEEE Conference on Decision and Control CDC 3 December (2003) 2112-2117
14. Sanghavi S., and Hajek B. Optimal allocation of a divisible good to strategic buyers. Proceedings of IEEE Conference on Decision and Control CDC (2004)
15. Gibbens R., and Kelly F. Resource pricing and the evolution of congestion control. Automatica 35 (1998) 1969-1985
16. Kunniyur S., and Srikant R. End-to-end congestion control: utility functions, random losses and ECN marks. Proceedings of IEEE INFOCOM March (2000) 1323-1332
17. Mazumdar R., Mason L.G., and Douligeris C. Fairness in network optimal flow control: optimality of product forms. IEEE Transactions on Communications 39 (1991) 775-782
18. T. Roughgarden, E. Tardos, How bad is selfish routing? in: IEEE Symposium on Foundations of Computer Science, 2000, pp. 93-102.
19. Shenker S. Making greed work in networks: a game theoretic analysis of switch service disciplines. IEEE/ACM Transactions on Networking 3 6 (1995) 819-831
20. Akella A., Seshan S., Karp R., Shenker S., and Papadimitriou C. Selfish behavior and stability of the Internet: a game-theoretic analysis of TCP. Proceedings of ACM SIGCOMM August (2002) 117-130
21. Dutta D., Goel A., and Heidemann J. Oblivious AQM and Nash equilibrium. IEEE INFOCOM May (2003)
22. Jiang W.J., Chiu D.M., and Lui J.C.S. On the interaction of multiple overlay routing. Journal of Performance Evaluation 62 (2005) 229-246
23. Altman E., Boulogne T., Azouzi R.E., Jimenez T., and Wynter L. A survey on networking games in telecommunications. Computers and Operations Research 33 2 (2006) 286-311
24. Kelly F.P. Routing in circuit-switched networks: Optimization, shadow prices and decentralization. Advances in Applied Probability 20 2 (1988) 112-144
25. Kelly F.P. Blocking probabilities in large circuit-switched networks. Advances in Applied Probability 18 (1986) 473-505
26. Sastry S. Nonlinear Systems (1999), Springer