A trace on queue length and calculation on average queue length periodically are required in the original algorithm of RED, which poses a big load in the implementation. In TC, a better technique is...

A trace on queue length and calculation on average queue length periodically are required in the original algorithm of RED, which poses a big load in the implementation. In TC, a better technique is provided to reduce the load. You should observe the source code in the file sch red.c and try to picture a flowchart and describe how the problem is solved in the implementation.