Hostname: page-component-6898cfcb55-zkb6p Total loading time: 0 Render date: 2026-11-11T09:40:06.412Z Has data issue: false hasContentIssue false
  • English
  • Français

The convergency of some routing protocols

Published online by Cambridge University Press:  22 January 2016

Takuji Kawamoto
Takuji Kawamoto*
Affiliation:
Matsushita Information Systems, Research Laboratory Nagoya Co., LTD., Shirakawa Building Annex, 2-6-1 Sakae Naka-ku, Nagoya 460, Japan, E-mail address: kawamoto@miln.mei.co.jp
Rights & Permissions [Opens in a new window]

Extract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

In every network, many nodes with brains are connected by many links each other. Some nodes are, for example, computers, terminals, or routers. The both ends of a link can communicate directly each other. For example, local area network, in which every nodes are directly connected each other, looks like Figure 1, then every nodes can communicate directly to others.

Information

Type
Research Article
Information
Nagoya Mathematical Journal , Volume 143 , September 1996, pp. 13 - 29
Copyright
Copyright © Editorial Board of Nagoya Mathematical Journal 1996

References

[ 1 ] Bellman, R. E., Dynamic programming, Princeton University Press, Princeton, N. J. (1957).Google Scholar
[ 2 ] Bertsekas, D. P., and Gallaher, R. G., Data Networks, Prentice-Hall, Englewood Cliffs, N.J. (1987).Google Scholar
[ 3 ] Comer, D. E., Interworking with TCP/IP, Prentice Hall, Englewood Cliffs, N. J. (1991).Google Scholar
[ 4 ] Ford, L. R. Jr., and Fulkerson, D. R., Flows in Networks, Princeton University Press, Princeton, N. J. (1962).Google Scholar
[ 5 ] Hedrick, C., Routing information protocol, Request for Comments, 1058, DDN Network Information Center, SRI International (June 1988).Google Scholar
[ 6 ] Jech, T., Set Theory, New York, Academic Press (1978).Google Scholar
[ 7 ] Kenneth, K., Set Theory. An Introduction to Independence Proofs, Amsterdam, Northholland (1980).Google Scholar
[ 8 ] Malkin, G., RIP Version 2 protocol analysis, Request for Comments, 1387, DDN Network Information Center, SRI International (January 1993).Google Scholar
[ 9 ] Malkin, G., RIP Version 2 carrying additional information, Request for Comments, 1388, DDN Network Information Center, SRI International (January 1993).Google Scholar
[10] Mills, D. L., DCN local-network protocols, Request for Comments 891, DDN Network Information Center, SRI International (December 1983).Google Scholar
[11] Mills, D., and Braun, H-W., The NFSNET Backbone Network, Proceedings of ACM SIGCOMM ’87 (August 1987).Google Scholar
[12] Moy, J. (Editor), OSPF protocol analysis, Request for Comments, 1245, DDN Network Information Center, SRI International (July 1991).Google Scholar
[13] Moy, J. (Editor), Experience with the OSPF protocol, Request for Comments, 1246, DDN Network Information Center, SRI International (July 1991).Google Scholar
[14] Moy, J., OSPF Version 2, Request for Comments, 1247, DDN Network Information Center, SRI International (July 1991).Google Scholar