- 1、本文档共29页,可阅读全部内容。
- 2、有哪些信誉好的足球投注网站(book118)网站文档一经付费(服务费),不意味着购买了该文档的版权,仅供个人/单位学习、研究之用,不得用于商业用途,未经授权,严禁复制、发行、汇编、翻译或者网络传播等,侵权必究。
- 3、本站所有内容均由合作方或网友上传,本站不对文档的完整性、权威性及其观点立场正确性做任何保证或承诺!文档内容仅供研究参考,付费前请自行鉴别。如您付费,意味着您自己接受本站规则且自行承担风险,本站不退款、不进行额外附加服务;查看《如何避免下载的几个坑》。如果您已付费下载过本站文档,您可以点击 这里二次下载。
- 4、如文档侵犯商业秘密、侵犯著作权、侵犯人身权等,请点击“版权申诉”(推荐),也可以打举报电话:400-050-0827(电话支持时间:9:00-18:30)。
查看更多
Introducing the OSPF Protocol参考
Configuring OSPF Introducing the OSPF Protocol Link-State Protocols Link-State Data Structures Neighbor table: Also known as the adjacency database Contains list of recognized neighbors Topology table: Typically referred to as LSDB Contains all routers and their attached links in the area or network Identical LSDB for all routers within an area Routing table: Commonly named a forwarding database Contains list of best paths to destinations Link-State Routing Protocols Link-state routers recognize more information about the network than their distance vector counterparts. Each router has a full picture of the topology. Consequently, link-state routers tend to make more accurate decisions. Link-State Data Structure: Network Hierarchy Link-state routing requires a hierachical network structure that is enforced by OSPF. This two-level hierarchy consists of the following: Transit area (backbone or area 0) Regular areas (nonbackbone areas) OSPF Areas Area Terminology OSPF Adjacencies Routers discover neighbors by exchanging hello packets. Routers declare neighbors to be up after checking certain parameters or options in the hello packet. Forming OSPF Adjacencies Point-to-point WAN links: Both neighbors become fully adjacent. LAN links: Neighbors form a full adjacency with the DR and BDR. Routers maintain two-way state with the other routers (DROTHERs). Routing updates and topology information are passed only between adjacent routers. Once an adjacency is formed, LSDBs are synchronized by exchanging LSAs. LSAs are flooded reliably throughout the area (or network). OSPF Calculation Routers find the best paths to destinations by applying Dijkstra’s SPF algorithm to the link-state database as follows: Every router in an area has the identical link-state database. Each router in the area places itself into the root of the tree that is built. The best path is calculated with respect to the lowest total cost of links to a specific destination. Best routes are put i
您可能关注的文档
- Helping Consumers to Remember参考.ppt
- HRH传播集团成本控制案例研究参考.doc
- Hedge Funds参考.ppt
- HSPA专项改善优化参考.doc
- HSE管理体系培训资料参考.ppt
- Hypothesis Testing in the Linear Regression Model参考.ppt
- IATF16949汽车工业配件公司质量手册参考.doc
- HSE管理体系培训课件参考.ppt
- HY健康功能鞋纳米除臭鞋项目环评报告书参考.doc
- IBM培训体系介绍参考.ppt
- 2024年证券分析与咨询服务项目投资申请报告代可行性研究报告.docx
- 2024年铬酸酐项目资金申请报告代可行性研究报告.docx
- 2024年清洁胶项目资金申请报告代可行性研究报告.docx
- 2024年肉松饼项目投资申请报告代可行性研究报告.docx
- 2024年陆上泵项目资金需求报告代可行性研究报告.docx
- 2024年未硫化复合橡胶及其制品项目资金需求报告代可行性研究报告.docx
- 2024年精密温控节能设备项目资金筹措计划书代可行性研究报告.docx
- 2024年汽车覆盖件模具项目资金筹措计划书代可行性研究报告.docx
- 宋词行书钢笔字帖.pdf
- 我的暑假生活作文三年级300字10篇.pdf
文档评论(0)