摘要：The high performance router to forward hundreds of millions of message packets per second due to rapid growth of the internet and explosively increasing traffic over the internet, call for a fast message packets forwarding using Fibonacci method. Message packets of varying length were generated and simulated using linear homogeneous recurrence relations with constant coefficients of degree two and three. The results of linear homogeneous recurrence relations with constant coefficients of degree two and three were compared and it was found that more message packets can be sent at a given time by coefficients of degree three than coefficient of degree two. It was also observed that performance of each constant coefficients of either degree two or three depends on their initial conditions.
