Proposal for st-routing protocol

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

doi:10.1023/B:TELS.0000014786.39265.c0

Proposal for st-routing protocol

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

^*Corresponding author for this work

Waseda University

Research output: Contribution to journal › Article › peer-review

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 language	English
Pages (from-to)	287-298
Number of pages	12
Journal	Telecommunication Systems
Volume	25
Issue number	3-4
DOIs	https://doi.org/10.1023/B:TELS.0000014786.39265.c0
Publication status	Published - 2004 Mar

Keywords

Biconnected graph
Multi-path routing
Routing protocol
St-numbering

ASJC Scopus subject areas

Computer Networks and Communications

Access to Document

10.1023/B:TELS.0000014786.39265.c0

Cite this

@article{601022935c824f94ae9e674a11b5aa5e,

title = "Proposal for st-routing protocol",

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.",

keywords = "Biconnected graph, Multi-path routing, Routing protocol, St-numbering",

author = "Akon, {Mohammad Mursalin} and Shah Asaduzzaman and Rahman, {Md Saidur} and Mitsuji Matsumoto",

year = "2004",

month = mar,

doi = "10.1023/B:TELS.0000014786.39265.c0",

language = "English",

volume = "25",

pages = "287--298",

journal = "Telecommunication Systems",

issn = "1018-4864",

publisher = "Springer Netherlands",

number = "3-4",

}

TY - JOUR

T1 - Proposal for st-routing protocol

AU - Akon, Mohammad Mursalin

AU - Asaduzzaman, Shah

AU - Rahman, Md Saidur

AU - Matsumoto, Mitsuji

PY - 2004/3

Y1 - 2004/3

N2 - 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.

AB - 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.

KW - Biconnected graph

KW - Multi-path routing

KW - Routing protocol

KW - St-numbering

UR - http://www.scopus.com/inward/record.url?scp=3543117772&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=3543117772&partnerID=8YFLogxK

U2 - 10.1023/B:TELS.0000014786.39265.c0

DO - 10.1023/B:TELS.0000014786.39265.c0

M3 - Article

AN - SCOPUS:3543117772

SN - 1018-4864

VL - 25

SP - 287

EP - 298

JO - Telecommunication Systems

JF - Telecommunication Systems

IS - 3-4

ER -

Proposal for st-routing protocol

Abstract

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this