Proposal for st-routing protocol

Mohammad Mursalin Akon, Shah Asaduzzaman, Md Saidur Rahman, Mitsuji Matsumoto

Research output: Contribution to journalArticle

10 Citations (Scopus)

Abstract

A routing protocol chooses one of the several paths (routes) from a source node to a destination node in the computer network, to send a packet of information. In this paper, we propose a new routing protocol, which we call st-routing protocol, based on st-numbering of a graph. The protocol fits well in noisy environments where robustness of routing using alternative paths is a major issue. The proposed routing protocol provides a systematic way to retry alternative paths without generating any duplicate packets. The protocol works for only those networks that can be represented by biconnected graphs.

Original languageEnglish
Pages (from-to)287-298
Number of pages12
JournalTelecommunication Systems
Volume25
Issue number3-4
DOIs
Publication statusPublished - 2004 Mar

Keywords

  • Biconnected graph
  • Multi-path routing
  • Routing protocol
  • St-numbering

ASJC Scopus subject areas

  • Computer Networks and Communications

Fingerprint Dive into the research topics of 'Proposal for st-routing protocol'. Together they form a unique fingerprint.

  • Cite this

    Akon, M. M., Asaduzzaman, S., Rahman, M. S., & Matsumoto, M. (2004). Proposal for st-routing protocol. Telecommunication Systems, 25(3-4), 287-298. https://doi.org/10.1023/B:TELS.0000014786.39265.c0