Bài giảng Mạng máy tính nâng cao - Chương 12: Single-Area OSPF Implementation
Số trang: 21
Loại file: pdf
Dung lượng: 855.96 KB
Lượt xem: 13
Lượt tải: 0
Xem trước 3 trang đầu tiên của tài liệu này:
Thông tin tài liệu:
Bài giảng Mạng máy tính nâng cao - Chương 12: Single-Area OSPF Implementation includes OSPF Overview, OSPF Hierarchy Example, Configuring Loopback Interfaces, Verifying the OSPF Configuratio, OSPF debug Commands, Load Balancing with OSPF.
Nội dung trích xuất từ tài liệu:
Bài giảng Mạng máy tính nâng cao - Chương 12: Single-Area OSPF ImplementationMạng máy tính nâng cao-V11OSPF Overview◦ Creates a neighbor relationship by exchanginghello packets◦ Propagates LSAs rather than routing tableupdatesLink: Router interfaceState: Description of an interface and its relationship toneighboring routers◦ Floods LSAs to all OSPF routers in the area, notjust directly connected routers◦ Pieces together all the LSAs generated by theOSPF routers to create the OSPF link-statedatabase◦ Uses the SPF algorithm to calculate the shortestpath to each destination and places it in therouting tableOSPF Hierarchy ExampleMinimizes routing table entriesLocalizes the impact of a topology change within an areaNeighbor Adjacencies: The HelloPacketSPF Algorithm◦ Places each router at the root of a tree and calculates theshortest path to each destination based on the cumulativecost◦ Cost = Reference Bandwidth / Interface Bandwidth (b/s)
Nội dung trích xuất từ tài liệu:
Bài giảng Mạng máy tính nâng cao - Chương 12: Single-Area OSPF ImplementationMạng máy tính nâng cao-V11OSPF Overview◦ Creates a neighbor relationship by exchanginghello packets◦ Propagates LSAs rather than routing tableupdatesLink: Router interfaceState: Description of an interface and its relationship toneighboring routers◦ Floods LSAs to all OSPF routers in the area, notjust directly connected routers◦ Pieces together all the LSAs generated by theOSPF routers to create the OSPF link-statedatabase◦ Uses the SPF algorithm to calculate the shortestpath to each destination and places it in therouting tableOSPF Hierarchy ExampleMinimizes routing table entriesLocalizes the impact of a topology change within an areaNeighbor Adjacencies: The HelloPacketSPF Algorithm◦ Places each router at the root of a tree and calculates theshortest path to each destination based on the cumulativecost◦ Cost = Reference Bandwidth / Interface Bandwidth (b/s)
Tìm kiếm theo từ khóa liên quan:
Mạng máy tính nâng cao Bài giảng Mạng máy tính nâng cao Single Area OSPF Implementation OSPF Overview OSPF Hierarchy Example Configuring Loopback InterfacesGợi ý tài liệu liên quan:
-
Advanced Computer Networks: Lecture 7 - Dr. Amir Qayyum
29 trang 35 0 0 -
Advanced Computer Networks: Lecture 6 - Dr. Amir Qayyum
46 trang 30 0 0 -
Advanced Computer Networks: Lecture 8 - Dr. Amir Qayyum
34 trang 29 0 0 -
Advanced Computer Networks: Lecture 11 - Dr. Amir Qayyum
26 trang 27 0 0 -
Advanced Computer Networks: Lecture 35 - Dr. Amir Qayyum
16 trang 27 0 0 -
Advanced Computer Networks: Lecture 17 - Dr. Amir Qayyum
44 trang 26 0 0 -
Advanced Computer Networks: Lecture 39 - Dr. Amir Qayyum
32 trang 25 0 0 -
Advanced Computer Networks: Lecture 40 - Dr. Amir Qayyum
31 trang 24 0 0 -
Advanced Computer Networks: Lecture 18 - Dr. Amir Qayyum
8 trang 24 0 0 -
Advanced Computer Networks: Lecture 34 - Dr. Amir Qayyum
21 trang 24 0 0