Simplification of network dynamics in large systems

IEEE/ACM Transactions on Networking

Volumn 13, Issue 4, 2005, Pages 813-826

  Lin, Xiaojun ^a   Shroff, Ness B ^a  

^a PURDUE UNIVERSITY   (United States)

Author keywords

Large systems; Network pricing; Routing; Simplicity

Indexed keywords

BIFURCATION (MATHEMATICS); LARGE SCALE SYSTEMS; OPTIMIZATION; PROBABILITY DISTRIBUTIONS; ROUTERS; TELECOMMUNICATION CONTROL;

DYNAMIC ROUTING; NETWORK PRICING; OPTIMAL DYNAMIC PRICING;

TELECOMMUNICATION NETWORKS;

EID: 24644517508     PISSN: 10636692     EISSN: None     Source Type: Journal    
DOI: 10.1109/TNET.2005.852886     Document Type: Article

References (24)

1. X. Lin and N. B. Shroff, "Pricing-based control of large networks," in Evolutionary Trends of the Internet, Proc. Tyrrhenian Int. Workshop on Digital Communications (IWDC 2001), Taormina, Italy, Sep. 2001, pp. 212-231.
2. X. Lin and N. B. Shroff, "Simplification of network dynamics in large systems," presented at the 10th Int. Workshop on Quality of Service (IWQoS 2002), Miami Beach, FL, May 2002.
3. J. K. Mackie-Mason and H. R. Varian, "Pricing the Internet," in Public Access to the Internet, B. Kahin and J. Keller, Eds. Cambridge, MA: MIT Press, 1995, pp. 269-314.
4. A. A. Lazar and N. Semret, "The progressive second price auction mechanism for network resource sharing," in Proc. 8th Int. Symp. Dynamic Games and Applications, Maastricht, The Netherlands, Jul. 1998, pp. 359-365.
5. F. P. Kelly, A. Maulloo, and D. Tan, "Rate control in communication networks: Shadow prices, proportional fairness and stability," J. Oper. Res. Soc., vol. 49, pp. 237-252, 1998.
6. S. H. Low and D. E. Lapsley, "Optimization flow control, I: Basic algorithm and convergence," IEEE/ACM Trans. Netw., vol. 7, no. 6, pp. 861-874, Dec. 1999.
7. H. Yaiche, R. Mazumdar, and C. Rosenberg, "A game theoretic framework for bandwidth allocation and pricing in broadband networks," IEEE/ACM Trans. Netw., vol. 8, no. 5, pp. 667-678, Oct. 2000.
8. I. Ch. Paschalidis and J. N. Tsitsiklis, "Congestion-dependent pricing of network services," IEEE/ACM Trans. Netw., vol. 8, no. 2, pp. 171-184; Apr. 2000.
9. I. Ch. Paschalidis and Y. Liu, "Pricing in multiservice loss networks: Static pricing, asymptotic optimality, and demand substitution effects," IEEE/ACM Trans. Netw., vol. 10, no. 3, pp. 425-438, Jun. 2002.
10. R. J. McEliece and K. N. Sivarajan, "Maximizing marginal revenue in generalized blocking service networks," in Proc. 30th Annu. Allerton Conf. Communication, Control, and Computing, 1992, pp. 455-464.
11. P. B. Key, "Optimal control and trunk reservation in loss networks," Prob. Eng. Inf. Sci., vol. 4, pp. 203-242, 1990.
12. T. Basar and R. Srikant, "Revenue-maximizing pricing and capacity expansion in a many-users regime," in Proc. IEEE INFOCOM, New York, Jun. 2002, pp. 1556-1563.
13. P. Tinnakornsrisuphap and A. M. Makowski, "TCP traffic modeling via limit theorems," Inst. for Systems Research, Univ. of Maryland, College Park, Tech. Rep., 2002.
14. A. A. Borovkov, "Ergodicity and stability theorems for a class of stochastic equations and their applications," Theory Prob. Appl., vol. 23, no. 2, pp. 227-247, Jun. 1978.
15. X. Lin and N. B. Shroff. (2001) Simplification of network dynamics in large systems. Purdue Univ., West Lafayette, IN. Tech. Rep.. [Online]. Available: http://min.ecn.purdue.edu/~linx/papers.html
16. S. Jin and A. Bestavros, "Small-world Internet topologies: Possible causes and implications on scalability of end-system multicast," Boston Univ., Boston, MA, Tech. Rep. BUCS-TR-2002-004, 2002.
17. F. P. Kelly, "Loss networks," Ann. Appl. Probabil., vol. 1, pp. 319-378, 1991.
18. A. Medina, A. Lakhina, I. Matta, and J. Byers, "BRITE: Universal topology generation from a user's perspective," presented at the Int. Workshop on Modeling, Analysis and Simulation of Computer and Telecommunications Systems (MASCOTS'01), Cincinnati, OH, Aug. 2001.
19. A. Barabasi and R. Albert, "Emergence of scaling in random networks," Science, vol. 286, pp. 509-512, 1999.
20. P. Marbach, O. Mihatsch, and J. N. Tsitsiklis, "Call admission control and routing in integrated service networks using neuro-dynamic programming," IEEE J. Sel. Areas Commun., vol. 18, no. 2, pp. 197-208, Feb. 2000.
21. P. Whittle, "Approximation in large-scale circuit-switched networks," Prob. Eng. Inf. Sci., vol. 2, pp. 279-291, 1988.
22. X. Lin and N. B. Shroff, "An optimization based approach for quality of service routing in high-bandwidth networks," in Proc. IEEE INFOCOM, Hong Kong, Mar. 2004.
23. D. Y. Burman, J. P. Lehoczky, and Y. Lim, "Insensitivity of blocking probabilities in a circuit-switching network," J. Appl. Prob., vol. 21, pp. 850-859, 1984.
24. F. Theberge, A. Simonian, and R. R. Mazumdar, "Upper bounds for blocking probabilities in large multi-rate loss networks," Telecommun. Syst., vol. 9, pp. 23-39, 1998.