Abstract
Routers filter the network traffic so that the only traffic that flows into and out of a network is required to go into a network. In many cases, there are several possible routes that can be taken between to nodes on different networks. Consider the network in Figure 36.1. In this case, the upper network shows the connection between two nodes A and B through routers 1 to 6. In can be seen from the lower diagram that there are four routes that the data can take. To stop traffic taking a long route or even one that does not exist, each router must maintain a routing table so that it knows where the data must be sent when it receives data destined for a remote node.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer Science+Business Media Dordrecht
About this chapter
Cite this chapter
Buchanan, B. (1999). Internet Routing Protocols. In: Handbook of Data Communications and Networks. Springer, Boston, MA. https://doi.org/10.1007/978-1-4757-0905-6_36
Download citation
DOI: https://doi.org/10.1007/978-1-4757-0905-6_36
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4757-0907-0
Online ISBN: 978-1-4757-0905-6
eBook Packages: Springer Book Archive