Contents & References of Designing optimal rate allocation algorithms based on utility function in data networks
List:
Table of contents.. eight
Abstract..1
Chapter one: Introduction
1-1 Introduction..2
1-3 Explanation of the topic..5
1-2 Order of content presentation..6
Chapter two: Examining the concept of service quality in networks Data
2-1 Introduction. 7
2-2 Mechanisms in the network to create QoS. 8
2-3 Queuing methods with continuous work. 9
2-3-1 FIFO queuing method. 2-3-4 Round Robin queuing method.12
2-3-5 Bitwise Round Robin method.
2-3-6 practical method of fair bitwise round robin queuing. 2-3-9 Improved DRR method (DRR+) 15
2-3-10 Weighted Fair Queuing (WFQ) method 15
2-3-11 WF2Q method 15
2-3-12 Delay-EDD and Jitter-EDD methods 16
2-4 Queuing methods with work Non-persistent. 17
2-4-1 Leaky Bucket method 18 2-4-2 Token Bucket method 18 2-5 Methods used to drop packets 18 2-5-1 Tail Dropping 19 2-5-2 Random Early Detection (RED) 19
2-5-3 Weighted Random Early Detection (WRED). 19
2-6 types of service classes in data networks. 20
2-7 integrated services. ..25
Chapter three: rate control and the concept of justice in data networks
3-1 Introduction..26
3-2 The concept of rate control and its goals. 27. 3-2-1 window-based methods 27. 3-2-2 rate-based methods 28. 3-3 division of existing traffic at the network level 29. 3-4 concept of fairness in rate allocation in data networks 31. 4-1 network model 32.
3-4-2 maximum-minimum justice criterion.33
3-4-3 proportional justice criterion..34
3-4-4 minimum potential delay justice criterion.
3-4-5 weighted bandwidth allocation.
3-4-6 proportional justice criterion (W,a) 37. 3-5 Conclusion. 38. Chapter 4: Examining optimal rate allocation methods to network level users based on fluid flow perspective. 4-1 Introduction.
4-3 Rate control in computer networks using the concept of cost.46
4-3-1 Kelly algorithm for solving the network problem.49
..51
4-3-5 Time delays ..52
4-3-6 Matching users ..54
Simultaneous optimization of the path and rate of users. Conclusion..60
Chapter Five: Methods for Solving Constrained Convex Optimization Problems 1-5 Introduction ..61
5-2 Constrained Convex Optimization ..62
5-2-1 Gradient Image Method 63
5-2-2 Weighted Gradient Image and Newton Algorithms 65
5-2-3 Convergence check using slope method. 66
5-2-7 penalty function method. ..74
6-3 Proposed algorithms ..76
6-3-1 Algorithm I ..82
6-3-2 Algorithm II 96 6-3-4 Algorithm IV 100 6-4 Stability of algorithms with proportional justice in the presence of time delay IV with conventional algorithms 119 7-2-1 First example 120 7-2-2 Second example 129 7-2-3 Third example 140 7-2-4 Fourth example 151 7-2-5 Example Fifth (checking the mutual effect of bottlenecks). 158
7-3 Simulation of user entry and exit. 161
7-4 Simulation of other justice criteria in the fuzzy algorithm. 165
7-5 Discrete event simulation. 166
7-5-1 Part I. 168
7-5-2 Part II. 7-5-3 Simulation of Hierarchical Algorithm II in the presence of background traffic. 7-5-4 Comparison of fuzzy algorithm with Kelly. 179
8-2 Suggestions.184
List of abbreviations.186
References
Appendices
A-N) Supplementary figures related to computer simulation. . Attached CD
Q) Some computer programs used in the simulation. CD attachment
Source:
[1] Tanenbaum, A.S., Computer Networks, 3rd edition, Prentice Hall, New Jersey, 1996.
[2] Brakmo, L., TCP Vegas Release 0.8, Nov. 1994.
http://www.cs.arizona.edu/protocols
[3] Mitra, D. and Seery, J.B., “Dynamic adaptive window for high-speed data networks,” in Proc. ACM SIGCOMM'90 Conf., pp. 30-40, 1990.
[4] Mitra, D. and Seery, J.B., “Dynamic adaptive windows for high-speed data networks with multiple paths and propagation delays,” Computer Networks and ISDN Systems, (25), pp. 663-679, 1993.
[5] Floyd, S., “TCP and explicit congestion notification,” ACM Computer Communications Review, Vol. 24, No. 5, pp. 10-23, Oct. 1994.
[6] Fall, K. and Floyd, S., “Simulation-based comparison of tahoe, reno and sack TCP,” ACM Compu. Commun. Rev., Vol. 26, No. 3, pp. 5-21, July 1996.
[7] Kelly, F.P., Maulloo, A.K. and Tan, D.K.H., “Rate control for communication networks: shadow prices, proportional fairness and stability,” J. Oper. Res. Soc., Vol. 49, No. 3, pp. 237-252, Mar. 1998.
[8] Kunniyur, S. and Srikant, R., “End-to-End Congestion Control Schemes: Utility Functions, Random Losses and ECN Marks,” IEEE INFOCOM Mar. 2000.
[9] Fendick, K.W., Rodriguez, M.A. and Weiss, A., "Analysis of a rate-based feedback control strategy for long-haul data transport." Performance Evaluation, Vol. 16, pp. 67-84, 1992.
[10] Tan, D.K.H., Mathematical Models of Rate Control for Communication Networks, Ph.D. dissertation, pp. 35-61, Cambridge university, Aug. 1999.
[11] Johari, R. and Tan, D., “End-to-End congestion control for the Internet: Delays and Stability,” IEEE Trans. On Networking, Vol.9, No.6, pp. 818-832, Dec. 2001.
[12] Massoulié, L. and Roberts, J., “Bandwidth sharing: objectives and algorithms,” in Proc. IEEE INFOCOM, Vol.3, 1999, pp. 1395-1403.
[13] Mo, J. and Walrand, J., “Fair End-to-End Window-Based Congestion Control,” IEEE Transactions on Networking, Vol. 8, No. 5, pp. 556-567, Oct. 2000.
[14] Hurley, P., Le Boudec, J.Y. and Thiran, P., "A note on the fairness of additive increase and multiplicative decrease," in Proc. ITC-16, Edinburg, Scotland, pp. 467-478, June 1999.
[15] Bertsekas, D. and Tsitsiklis, J., Parallel and Distributed Computation. Englewood Cliffs, NJ: Prentice-Hall, 1989. [16] Gallagher, R.G. and Bertsekas, D., Data Networks, Prentice-Hall, NJ 1987. [17] Golestani, S.J., A Unified Theory of Flow Control and Routing in Data Communication Networks, Ph.D Dissertation, MIT, Jan. 1980. [18] Low, S.H. and Lapsley, D.E.