The role of traffic forecasting in QoS routing - a case study of time-dependent routing

QoS routing solutions can be classified into two categories, state-dependent and time-dependent, according to their awareness of the future traffic demand in the network. Compared with representative state-dependent routing algorithms, a time-dependent variation of WSP - TDWSP - is proposed in this paper to study the role of traffic forecasting in QoS routing, by customizing itself for a range of traffic demands. Our simulation results confirm the feasibility of traffic forecasting in the context of QoS routing, which empowers TDWSP to achieve better routing performance and to overcome QoS routing difficulties, even though completely accurate traffic prediction is not required. The case study involving TDWSP further reveals that even a static forecast can remain effective over a large area in the solvable traffic demand space, if the network topology and the peak traffic value are given. Thus, the role of traffic forecasting in QoS routing becomes more prominent.

[1]  Bal Azs.  Lagrange Relaxation Based Method for the QoS Routing Problem , 2001 .

[2]  Eitan Altman,et al.  Competitive routing in networks with polynomial cost , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).

[3]  Konstantina Papagiannaki,et al.  Long-term forecasting of Internet backbone traffic , 2005, IEEE Transactions on Neural Networks.

[4]  K TripathiSatish,et al.  Quality of service based routing , 1998 .

[5]  Klara Nahrstedt,et al.  Hop-by-hop routing algorithms for premium-class traffic in DiffServ networks , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.

[6]  Ariel Orda,et al.  QoS Routing Mechanisms and OSPF Extensions , 1999, RFC.

[7]  Marcelo Bagnulo,et al.  Internet Traffic Engineering , 2003, QofIS Final Report.

[8]  Ariel Orda,et al.  QoS based routing in networks with inaccurate information: theory and algorithms , 1997, Proceedings of INFOCOM '97.

[9]  Cheng Jin,et al.  MATE: MPLS adaptive traffic engineering , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).

[10]  Murali S. Kodialam,et al.  Minimum interference routing with applications to MPLS traffic engineering , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).

[11]  Konstantina Papagiannaki,et al.  Long-term forecasting of Internet backbone traffic: observations and initial models , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

[12]  Satish K. Tripathi,et al.  Intradomain QoS routing in IP networks: a feasibility and cost/benefit analysis , 1999, IEEE Netw..

[13]  Satish K. Tripathi,et al.  Quality of service based routing: a performance perspective , 1998, SIGCOMM '98.

[14]  Mischa Schwartz,et al.  Broadband integrated networks , 1996 .

[15]  Odlyzko Andrew.  Data Networks are Lightly Utilized, and Will Stay That Way , 1999 .

[16]  Marwan Krunz,et al.  Multi-constrained optimal path selection , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).

[17]  Subhash Suri,et al.  Profile-based routing and traffic engineering , 2003, Comput. Commun..

[18]  Klara Nahrstedt,et al.  An overview of quality of service routing for next-generation high-speed networks: problems and solutions , 1998, IEEE Netw..

[19]  Ariel Orda,et al.  QoS routing in networks with inaccurate information: theory and algorithms , 1999, TNET.

[20]  Hamid Ahmadi,et al.  Equivalent Capacity and Its Application to Bandwidth Allocation in High-Speed Networks , 1991, IEEE J. Sel. Areas Commun..

[21]  Ossama Younis,et al.  Constraint-based routing in the internet: Basic principles and recent research , 2003, IEEE Communications Surveys & Tutorials.