Traffic Forecast in QoS Routing

Facing some major challenges, QoS routing solutions can be classified into two categories, state-dependent and time-dependent, according to their awareness of future traffic demand of the network. This article examines both mechanisms under different traffic loads by selecting representative algorithms and studying their behaviors closely, and concludes that state-dependent mechanism has congenital shortcoming of adapting itself to the changes of traffic demand. The analysis of our observations reveals the importance of traffic forecast in the QoS routing context, yet traffic forecast is another open research area that needs further investigation.

[1]  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).

[2]  Andrew Odlyzko,et al.  Data Networks are Lightly Utilized, and will Stay that Way , 2003 .

[3]  Panos M. Pardalos,et al.  A Genetic Algorithm for the Weight Setting Problem in OSPF Routing , 2002, J. Comb. Optim..

[4]  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.

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

[6]  D. O. Awduche,et al.  MPLS and traffic engineering in IP networks , 1999, IEEE Commun. Mag..

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

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

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

[10]  Ariel Orda,et al.  QoS routing: the precomputation perspective , 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]  David L. Black,et al.  An Architecture for Differentiated Service , 1998 .

[13]  Eric C. Rosen,et al.  Multiprotocol Label Switching Architecture , 2001, RFC.

[14]  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).

[15]  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).

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

[17]  Scott Shenker,et al.  Integrated Services in the Internet Architecture : an Overview Status of this Memo , 1994 .

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