Name
Abstract | ||
|---|---|---|
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. |
Year | DOI | Venue |
|---|---|---|
2004 | 10.1023/B:TELS.0000014786.39265.c0 | Telecommunications Systems |
Keywords | Field | DocType |
st-numbering,biconnected graph,multi-path routing,routing protocol,computer network | Link-state routing protocol,Dynamic Source Routing,Path vector protocol,Enhanced Interior Gateway Routing Protocol,Computer science,Computer network,Wireless Routing Protocol,Routing Information Protocol,Zone Routing Protocol,Routing protocol,Distributed computing | Journal |
Volume | Issue | ISSN |
25 | 3-4 | 1572-9451 |
Citations | PageRank | References |
4 | 0.46 | 18 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Mohammad Mursalin Akon | 1 | 25 | 5.32 |
| Shah Asaduzzaman | 2 | 38 | 5.08 |
| Md. Saidur Rahman | 3 | 342 | 41.83 |
| Mitsuji Matsumoto | 4 | 207 | 30.98 |