Neighbor status changes Triggering the action of finding the neighbor list will create an empty entry (empty) Send a request (incomplete), wait for the other party to reply NA, if the reply (Reachable) It can be used normally if it is reachable. It can only be used for 30s. If used, the time will be […]
Tag: spf
Set the database to start with spfile by default, and set the database SGA size to 2G and PGA size to 200M.
Check the database default startup file first: SELECT value FROM v$parameter WHERE name = ‘spfile’; It can be seen that the database defaults to SPFILE startup Use the following command to check whether the current session is using SPFILE or PFILE: First, set the MEMORY_TARGET parameter to 0. This will ensure that Oracle does not […]
Subnetting, OSPF, VlanIF, DHCP, Eth-Trunk, single-arm routing (H1-6) Tianyan Technology Co., Ltd. network construction and maintenance
H1-6 Network construction and maintenance of Tianyan Technology Co., Ltd. (1) Task description Due to the development of its business, Tianyan Technology Co., Ltd. has established a new branch in other places. Now it requires network connectivity between the head office and the branch. The head office has three buildings, each with more than 600 […]
HUAWEIVLAN+OSPF+single-arm routing
Table of Contents Write in front 3.1. Topology diagram 3.2. Operational ideas 3.3. Configuration operation 3.3.1, LSW2 configuration 3.3.2, LSW3 configuration 3.3.3, R1 configuration 3.3.4, R2 configuration 3.3.5, LSW1 configuration 3.3.6. View configuration list 3.3.7. Test network Blog homepage: Are prawns delicious blog? Column address: huawei column Write in front VLAN: A VLAN (Virtual LAN) […]
OSPF and ISIS dual point dual distribution
2. Knowledge points 1. OSPF and ISIS dual-point bidirectional redistribution Introducing the routes of two routing domains to each other on the border router is called bidirectional route redistribution. There are two border routers in two routing domains, and both perform bidirectional route redistribution. This is called two-point bidirectional route redistribution. Dual-point bidirectional route redistribution […]
OSPF Dynamic Routing – Single Area Configuration
Title: OSPF single-area experimentExperimental requirements: Deploy single-area ospf between routers to realize communication between PC1 and PC2. Experimental steps: 1. Configure the IP addresses of the router and PC 2. Configure ospf on the router 3. Capture packets to view the five message types of ospf (screenshot) and observe the I, M, and M/S bits […]
Configuring OSPFv3 to import external routes and route filtering experiment
Configuring OSPFv3 to import external routes and route filtering experiment Experimental topology: Experimental content: Enable OSPFv3 routing protocol on R1, R2, R3, R4, and R5. R1 and R2 are in Area 0, R1 and R3 are in Area 2, R1 and R5 are in Area 1, and R2 and R4 are in Area3. After establishing […]
HCIEFRR+BFD+OSPF and BGP linkage
Directory 1. Experimental topology 2. Key Agreements 2.1 FRR 2.2 BFD 2.3 OSPF and BGP linkage 3. Experimental goals 4. Configuration script 4.1 Configure IP 4.2 Configure OSPF 4.3 Configure BGP 4.4 Configure FRR 4.5 Configure BFD 4.6 Configure Stub Router 5. Summary 1. Experimental topology 2. Key Agreement 2.1 FRR OSPF IP FRR is […]
Shortest path Dijkstra, spfa, graph theory bipartite graph algorithm AYIT—ACM training (template version)
Article directory Preface A – Dijkstra Algorithm 0x00 algorithm question 0x01 algorithm idea 0x02 code implementation B – longest road 0x00 algorithm question 0x01 algorithm idea 0x02 code implementation C – Maximum matching of bipartite graph 0x00 algorithm question 0x01 algorithm idea 0x02 code implementation D – with pilot 0x00 algorithm question 0x01 algorithm idea […]
OSPF link state (LS) routing algorithm (C/C++ code implementation)
A routing algorithm is a method used to determine the routing of packets among nodes. For each node in the network, the algorithm determines a routing table that matches the outgoing line at each destination. This algorithm should result in consistent routing, that is, no loops. This means that you should not route packets from […]