Traffic-Predicting A Routing Algorithm Using Time Series Models
A routing algorithm is proposed that analyzes network traffic conditions using time series prediction models and determines the best-effort routing path. To predict network traffic, time series models are developed under the stationary assumption, which is evaluated using the Auto Correlation Function (ACF) and Partial Auto Correlation Function (PACF). Traffic congestion is assumed when the predicted result is larger than the permitted bandwidth. Although the proposed routing algorithm requires additional processing time to predict the number of packets, the packet transmission time is reduced by 5~10% and the amount of packet loss is also reduced by about 3% in comparison to the OSPF routing algorithm. With the proposed routing algorithm, the predicted network traffic allows the routing path to be modified to avoid traffic congestion. Consequently, the traffic predicting and load balancing by modifying the paths avoids path congestion and increases the network performance.
KeywordsPacket Loss Auto Correlation Function Network Traffic Time Series Model Auto Regressive
Unable to display preview. Download preview PDF.
- 1.Kastner, R., Bozorgzadeh, E., Sarrafzadeh, M.: Predictable routing, Computer Aided Design. In: IEEE/ACM International Conference, pp. 5–9 (2000)Google Scholar
- 4.Wilinger, W., Wilson, D., Taqqu, M.: Self-similar Traffic Modeling for Highspeed Networks, ConneXions (1994)Google Scholar
- 5.Shu, Y., Jin, Z., Zhang, L., Wang, L.: Traffic Prediction Using FARIMA Models. In: IEEE International Conference on Communications, pp. 891–895 (1999)Google Scholar
- 7.Hedrick, C.: Routing Information Protocol(RIP), Network Information Center, RFC 1058 (1988)Google Scholar
- 9.Moy, J.: OSPF version 2, RFC 1583 (1994)Google Scholar
- 12.SPSS for windows Trends Release 11.0, SPSS Inc. (2001)Google Scholar