• DocumentCode
    1573124
  • Title

    Robust Routing

  • Author

    Agrawal, Himanshu ; Jennings, Andrew ; Gregory, Mark ; Channa, Daud

  • Author_Institution
    Sch. of Electr. & Comput. Eng., RMIT Univ. Australia, Melbourne, VIC
  • fYear
    2008
  • Firstpage
    695
  • Lastpage
    700
  • Abstract
    In a network, traffic demands are known with a degree of uncertainty, traffic engineering should take into account the traffic variability. In this research work we focus on the robust routing under changing network conditions. Daily Internet traffic pattern shows that network is vulnerable to malicious attacks, denial of service attacks, worms and viruses. Oblivious routing has a substantially better performance than open shortest path first [OSPF] routing for different level of uncertainty. We propose a theoretical framework for Robust Routing aiming to improve online and offline traffic engineering approaches.
  • Keywords
    Internet; graph theory; telecommunication network routing; telecommunication security; telecommunication traffic; Internet traffic pattern; denial of service attack; malicious attack; network traffic engineering; open shortest path first routing; robust routing; worm/virus; Computer crime; IP networks; Peer to peer computing; Robustness; Routing; Telecommunication traffic; Tellurium; Traffic control; Uncertainty; Viruses (medical); Oblivious Routing; Robust Routing; Traffic Matrix;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Computer and Information Science, 2008. ICIS 08. Seventh IEEE/ACIS International Conference on
  • Conference_Location
    Portland, OR
  • Print_ISBN
    978-0-7695-3131-1
  • Type

    conf

  • DOI
    10.1109/ICIS.2008.99
  • Filename
    4529898