tcrules.awk 3.2 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128
  1. BEGIN {
  2. dmax=100
  3. if (!(linespeed > 0)) linespeed = 128
  4. FS=":"
  5. n = 0
  6. }
  7. ($1 != "") {
  8. n++
  9. class[n] = $1
  10. prio[n] = $2
  11. avgrate[n] = ($3 * linespeed / 100)
  12. pktsize[n] = $4
  13. delay[n] = $5
  14. maxrate[n] = ($6 * linespeed / 100)
  15. qdisc_esfq[n] = $7
  16. }
  17. END {
  18. allocated = 0
  19. maxdelay = 0
  20. for (i = 1; i <= n; i++) {
  21. # set defaults
  22. if (!(pktsize[i] > 0)) pktsize[i] = 1500
  23. if (!(prio[i] > 0)) prio[i] = 1
  24. allocated += avgrate[i]
  25. sum_prio += prio[i]
  26. if ((avgrate[i] > 0) && !(delay[i] > 0)) {
  27. sum_rtprio += prio[i]
  28. }
  29. }
  30. # allocation of m1 in rt classes:
  31. # sum(d * m1) must not exceed dmax * (linespeed - allocated)
  32. dmax = 0
  33. for (i = 1; i <= n; i++) {
  34. if (avgrate[i] > 0) {
  35. rtm2[i] = avgrate[i]
  36. if (delay[i] > 0) {
  37. d[i] = delay[i]
  38. } else {
  39. d[i] = 2 * pktsize[i] * 1000 / (linespeed * 1024)
  40. if (d[i] > dmax) dmax = d[i]
  41. }
  42. }
  43. }
  44. ds_avail = dmax * (linespeed - allocated)
  45. for (i = 1; i <= n; i++) {
  46. lsm1[i] = 0
  47. rtm1[i] = 0
  48. lsm2[i] = linespeed * prio[i] / sum_prio
  49. if ((avgrate[i] > 0) && (d[i] > 0)) {
  50. if (!(delay[i] > 0)) {
  51. ds = ds_avail * prio[i] / sum_rtprio
  52. ds_avail -= ds
  53. rtm1[i] = rtm2[i] + ds/d[i]
  54. }
  55. lsm1[i] = rtm1[i]
  56. }
  57. else {
  58. d[i] = 0
  59. }
  60. }
  61. # main qdisc
  62. for (i = 1; i <= n; i++) {
  63. printf "tc class add dev "device" parent 1:1 classid 1:"class[i]"0 hfsc"
  64. if (qdisc_esfq[i] != "") {
  65. # user requested esfq
  66. print "esfq " qdisc_esfq[i] " limit " ql
  67. } else if (rtm1[i] > 0) {
  68. # rt class - use sfq
  69. printf " rt m1 " int(rtm1[i]) "kbit d " int(d[i] * 1000) "us m2 " int(rtm2[i])"kbit"
  70. }
  71. printf " ls m1 " int(lsm1[i]) "kbit d " int(d[i] * 1000) "us m2 " int(lsm2[i]) "kbit"
  72. print " ul rate " int(maxrate[i]) "kbit"
  73. }
  74. # leaf qdisc
  75. avpkt = 1200
  76. for (i = 1; i <= n; i++) {
  77. printf "tc qdisc add dev "device" parent 1:"class[i]"0 handle "class[i]"00: "
  78. # RED parameters - also used to determine the queue length for sfq
  79. # calculate min value. for links <= 256 kbit, we use 1500 bytes
  80. # use 50 ms queue length as min threshold for faster links
  81. # max threshold is fixed to 3*min
  82. base_pkt=3000
  83. base_rate=256
  84. min_lat=50
  85. if (maxrate[i] <= base_rate) min = base_pkt
  86. else min = int(maxrate[i] * 1024 / 8 * 0.05)
  87. max = 3 * min
  88. limit = (min + max) * 3
  89. if (rtm1[i] > 0) {
  90. # rt class - use sfq
  91. print "sfq perturb 2 limit " limit
  92. } else {
  93. # non-rt class - use RED
  94. avpkt = pktsize[i]
  95. # don't use avpkt values less than 500 bytes
  96. if (avpkt < 500) avpkt = 500
  97. # if avpkt is too close to min, scale down avpkt to allow proper bursting
  98. if (avpkt > min * 0.70) avpkt *= 0.70
  99. # according to http://www.cs.unc.edu/~jeffay/papers/IEEE-ToN-01.pdf a drop
  100. # probability somewhere between 0.1 and 0.2 should be a good tradeoff
  101. # between link utilization and response time (0.1: response; 0.2: utilization)
  102. prob="0.12"
  103. rburst=int((2*min + max) / (3 * avpkt))
  104. if (rburst < 2) rburst = 2
  105. print "red min " min " max " max " burst " rburst " avpkt " avpkt " limit " limit " probability " prob " ecn"
  106. }
  107. }
  108. # filter rule
  109. for (i = 1; i <= n; i++) {
  110. print "tc filter add dev "device" parent 1: prio "class[i]" protocol ip handle "class[i]" fw flowid 1:"class[i] "0"
  111. }
  112. }