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.
|Number of pages||12|
|Publication status||Published - 2004 Mar|
- Biconnected graph
- Multi-path routing
- Routing protocol
ASJC Scopus subject areas
- Computer Networks and Communications