%0 Journal Article %1 Ludwig77 %A Ludwig, G. %A Roy, R. %D 1977 %J Proceedings of the IEEE %K broadcast flooding saturation_routing %N 9 %P 1353 - 1362 %R 10.1109/PROC.1977.10712 %T Saturation routing network limits %V 65 %X 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.

@article{Ludwig77, 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.}, added-at = {2011-07-15T15:18:02.000+0200}, author = {Ludwig, G. and Roy, R.}, biburl = {https://www.bibsonomy.org/bibtex/26c6b046ccddedec54959395cf8882efb/msteele}, doi = {10.1109/PROC.1977.10712}, file = {:I\:\\My Documents\\Thesis\\Research\\Ludwig77.pdf:PDF}, interhash = {4a0f4a40a20dccd412eefb57e8a3e480}, intrahash = {6c6b046ccddedec54959395cf8882efb}, issn = {0018-9219}, journal = {Proceedings of the IEEE}, keywords = {broadcast flooding saturation_routing}, month = {sept.}, number = 9, owner = {msteele}, pages = { 1353 - 1362}, review = {In the direction of the earliest work on network flooding techniques. The switches in this paper are still managed semi-manually. Individual nodes are not assumed contain switching mechanisms. The "fixed infrastracture" is the set of switches and the mobile infrastructure is the set "subscribers." A saturation routing technique is described to find subscribers in the footprint of an arbitrary switch. This seems to be the pre-cursor to mesh networks. The problem here is that direct device-device communication is not supported and the main trunk bandwidth remains the primary limitation of direct communication. I beleive this is a pre-cursor to route discovery through flooding, rumor and epidemic techniques. The author suggests a hop limit after which satellite communication should be used to reach geographically seperated switching regions. Again this is an allusion to the mesh network concept that is seeing regained popularity in 90's DARPA programs and current DARPA programs.}, timestamp = {2011-07-15T20:47:31.000+0200}, title = {Saturation routing network limits}, volume = 65, year = 1977 }