Abstract
Routing is based on the principle that a destination that is n hops away from a router is one hop closer to the router’s immediate neighbor; that is, it is just (n-1) hops away from that immediate neighbor. As done in some prior chapters, we look at LinkedIn’s social networking setup as a good way to understand the routing possibilities of networks. This chapter surveys some of the similarities between a router network and LinkedIn’s implementation of its social networking service. The chapter then proceeds to identify the possible key differences and the implications of those differences for an organization’s network.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2015 Phani Raj Tadimety
About this chapter
Cite this chapter
Tadimety, P.R. (2015). The Secret of Routing Powers. In: OSPF: A Network Routing Protocol. Apress, Berkeley, CA. https://doi.org/10.1007/978-1-4842-1410-7_13
Download citation
DOI: https://doi.org/10.1007/978-1-4842-1410-7_13
Publisher Name: Apress, Berkeley, CA
Print ISBN: 978-1-4842-1411-4
Online ISBN: 978-1-4842-1410-7
eBook Packages: Professional and Applied ComputingApress Access BooksProfessional and Applied Computing (R0)