IDEAS home Printed from https://ideas.repec.org/a/sae/intdis/v5y2009i1p34-34.html
   My bibliography  Save this article

Routing Algorithms Based on Partial Deployment of SAVA Nodes in Trustworthy Internet

Author

Listed:
  • Lei Guo
  • Xingwei Wang
  • Dong Wang
  • Weigang Hou

Abstract

Although the fundamental principles of best-effort and destination address based packet forwarding in today's Internet have brought tremendous convenience, the trustworthy issue in Internet is a hot problem since the lack of source IP address checking in most cases makes it easy for the attackers to spoof the source address. Therefore, one challenge in trustworthy Internet is to build a feasible mechanism to verify the source address. Recently, a feasible mechanism called Source Address Validation Architecture (SAVA) has been proposed to specify standardization of methods for building effective source-address validation to ensure that packets forwarded hold authentic source addresses. In SAVA mechanism, if a packet has been recognized as a spoofed source address, it will be dropped by the SAVA router and not be transmitted to the next hop. In our work, we study the routing algorithms based on partial deployment of SAVA nodes in Internet and propose three kinds of routing algorithms, i.e., Shortest-Path Algorithm (SPA), SAVA based Shortest-Path Algorithm (SSPA), and SAVA based Shortest-Path Algorithm with Load Balancing (SSPALB). To the best of our best knowledge, this is the first investigation for SAVA mechanism from the point of routing method. In SPA, the packet will be routed on the shortest path that may not traverse the SAVA node, and then the SAVA requirement may not be ensured. In SSPA, the packet will be routed on the shortest path that must traverse one SAVA node such that the SAVA requirement can be ensured. In SSPALB, the packet will be routed on the shortest path that must traverse one SAVA node at the same time this SAVA node must be the least-load such that the SAVA requirement can be ensured and the load can be more balancing. We simulate an incremental traffic model for the three kinds of routing algorithms to compare the performances of SAVA Satisfactory Degree (SSD) and Load Balancing (LB). Simulation results show that: the SSDs of SSPA and SSPALB can reach 100% while the SSD of SPA is only 20%-30%, which means that SSPA and SSPALB are completely satisfactory for SAVA requirements but SPA cannot; the LB of SSPALB can reach 100% while the LBs of SPA and SSPA are only 70%-80%, which means that SSPALB is more favorable for the load balancing.

Suggested Citation

  • Lei Guo & Xingwei Wang & Dong Wang & Weigang Hou, 2009. "Routing Algorithms Based on Partial Deployment of SAVA Nodes in Trustworthy Internet," International Journal of Distributed Sensor Networks, , vol. 5(1), pages 34-34, January.
  • Handle: RePEc:sae:intdis:v:5:y:2009:i:1:p:34-34
    DOI: 10.1080/15501320802524003
    as

    Download full text from publisher

    File URL: https://journals.sagepub.com/doi/10.1080/15501320802524003
    Download Restriction: no

    File URL: https://libkey.io/10.1080/15501320802524003?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:sae:intdis:v:5:y:2009:i:1:p:34-34. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: SAGE Publications (email available below). General contact details of provider: .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.