|
[1]R. Braden. et al. “Resource ReSerVation Protocol (RSVP) -- Version 1 Functional Specification.”, RFC 2205, September 1997. [2]A. Parekh and R. Gallager, “A Generalized Processor Sharing Approach to Flow Control in Integrated Services Networks:The Single-Node Case”, IEEE/ACM Transactions on. Networking, vol. 1, no. 3, pp. 34-357, June 1993. [3]J. C. R. Bennett and H. Shang, “WF2Q:Worst-case Fair Weighted Fair Queueing ”, INFOCOM '96. Fifteenth Annual Joint Conference of the IEEE Computer Societies. Networking the Next Generation., Proceedings IEEE , vol: 1 , pp.120 -128 1996 [4]S. Shenker, “Fundamental Design Issues for the Future Internet,” IEEE Journal on Selected Areas in Communications, Vol. 13, no. 7, pp.1176-1188, September 1995. [5]Z. Cao and E. W. Zegura, “Utility Max-Min:An Application-Oriented Bandwidth Allocation Scheme”, INFOCOM '99. Eighteenth Annual Joint Conference of the IEEE Computer and Communications Societies. Proceedings. IEEE , Volume: 2 , pp.793 -801, 1999 [6]F. P. Kelly and A. K. Maulloo, and D. K. H. Tan, “Rate control for communication networks: shadow prices, proportional fairness and Stability,” Journal of the Opera-tional Research Society, pp.237-252, 1998. [7]Frank Kelly, “Charging and rate control for elastic traffic” European. Transactions on. Telecommunications. 8, pp.33-37, 1997. [8]D. A. Wismer and R. Chattergy, Introduction to nonlinear optimization :a problem solving approach . New York: North-Holland, 1978. [9]Lixia Zhang, “VirtualClock: a new traffic control algorithm for packet-switched networks”, ACM Transactions on Computer Systems. Vol. 9, no. 2, pp. 101-124, May 1991. [10]K. Kar and S. Sarkar, L. Tassiulas, “A Simple Rate Control Algorithm for Maximiz-ing Total User Utility”, Networking, IEEE/ACM Transactions on , Vol: 10 Issue: 2 , pp. 272 -286, April 2002. [11]N. S. Ko and H. S. Park, “Emulated weighted fair queueing algorithm for high-speed packet-switched networks”, Information Networking, 2001. Proceedings. 15th In-ternational Conference on , pp.52 -58, 2001. [12]S. H. Low, “Optimization Flow Control with On-line Measurement”, Proceedings of the 16th International Teletraffic Congress, Edinburgh, U.K.,June 1999. [13]L. Massoulie and J. Roberts. “Bandwidth sharing:objectives and algorithms”, Net-working, IEEE/ACM Transactions on , Volume: 10 Issue: 3, pp. 320 -328, Jun 2002 [14]S. H. Rhee and T. Konstantopoulos, “Optimal Flow Control and Capacity Allocatin in Multi-Service Networks”, Decision and Control, 1998. Proceedings of the 37th IEEE Conference on , vol.2, pp. 1662 -1667,1998. [15]H. Yaïche, R. R. Mazumdar, and C. Rosenberg, “Distributed algorithms for fair bandwidth allocation to elastic services in broadband networks”, INFOCOM 2000. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies. Proceedings. IEEE , vol.3., pp.1511 -1517, 2000 [16]S. Kunniyur and R. Srikant, “End-to-End Congestion Control Schemes:Utility Functions, Random Losses and ECN Marks” INFOCOM 2000. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies. Proceed-ings. IEEE , vol.3, pp.1323 -1332 , 2000 [17]E.L. Hahne, “Round-Robin Scheduling for Max-Min Fairness in Data Networks”, Selected Areas in Communications, IEEE Journal on , Volume: 9 Issue: 7 , pp. 1024 -1039, Sept. 1991 [18]K. Nichols. et al. “Definition of the Differentiated Services Field (DS Field) in the IPv4 and IPv6 Headers”. RFC 2474, December 1998. [19]S. Blake. et al. “An Architecture for Differentiated Service”, RFC 2475, December 1998. [20]P. Almquist. et al. “Type of Service in the Internet Protocol Suite”. RFC 1349, July 1992.
|