Abstract
Saturation routing means a flooding of a network with messages which
search for a particular subscriber's number without regard to where
that subscriber is located in the network. Saturation routing, often
thought of as inappropriate in a communication network, can be a
useful routing scheme with the use of state-of-the-art design. In
this paper, consideration will be spent on the kinds of networks
in which saturation routing is applicable, and how it compares with
other routing systems. The functional designs of saturation routing
will be combined with the appropriate variables to create a mathematical
model for performing of saturation routing in a network. The following
are some of the variables: i) processor rate; ii) transmission data
rate; iii) hierarchy; iv) queuing delays; v) traffic; vi) message
size. The paper will be concluded with an example of a realistic
network using saturation routing.
Users
Please
log in to take part in the discussion (add own reviews or comments).