tcrules.awk 3.0 KB

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