1 Describing Information Security Concepts
Free Free Free | Cyber Security Courses | Get Certification
Free Free Free | Cyber Security Courses | Get Certification
BGP State
BGP State
Idle The BGP process is either administratively down or awaiting the next retry
attempt.
Connect The BGP process is waiting for the TCP connection to be completed. You
cannot determine from this state information whether the TCP connection
can complete.
Active The TCP connection has been completed, but no BGP messages have yet
been sent to the peer.
Opensent he TCP connection exists, and a BGP Open message has been sent to the
peer, but the matching Open message has not yet been received from the
other router.
Openconfirm An Open message has been both sent to and received from the other router.
The next step is to receive a BGP Keepalive message (to confirm that all
neighbor-related parameters match) or a BGP Notification message (to learn
that there is some mismatch in neighbor parameters).
Established ll neighbor parameters match, the neighbor relationship works, and the
peers can now exchange Update messages.
Idle The BGP process is either administratively down or awaiting the next retry
attempt.
Connect The BGP process is waiting for the TCP connection to be completed. You
cannot determine from this state information whether the TCP connection
can complete.
Active The TCP connection has been completed, but no BGP messages have yet
been sent to the peer.
Opensent he TCP connection exists, and a BGP Open message has been sent to the
peer, but the matching Open message has not yet been received from the
other router.
Openconfirm An Open message has been both sent to and received from the other router.
The next step is to receive a BGP Keepalive message (to confirm that all
neighbor-related parameters match) or a BGP Notification message (to learn
that there is some mismatch in neighbor parameters).
Established ll neighbor parameters match, the neighbor relationship works, and the
peers can now exchange Update messages.
Cybersecurity Essentials | All Quiz Answer | Cisco Certification
Step-1 go to below link
https://www.netacad.com/courses/security
Step-2 Enroll and login
Step-3 complete course then quizzes
Step-4 get Certification
watch video complete
https://youtu.be/-xCVeKSIhHM
Now choose course and start quiz
Following video is related to Cybersecurity Essentials Course
https://youtu.be/-wSJ2qKkmFk
OSPF State
OSPF State
The adjacency building process takes effect after multiple stages have been fulfilled. Routers that
become adjacent will have the exact link-state database. The following is a brief summary of the
states an interface passes through before becoming adjacent to another router:
Down: No information has been received from anybody on the segment.
Attempt: On non-broadcast multi-access clouds such as Frame Relay and X.25, this state
indicates that no recent information has been received from the neighbor. An effort should be
made to contact the neighbor by sending Hello packets at the reduced rate PollInterval.
Init: The interface has detected a Hello packet coming from a neighbor but bi-directional
communication has not yet been established.
Two-way: There is bi-directional communication with a neighbor. The router has seen itself in
the Hello packets coming from a neighbor. At the end of this stage the DR and BDR election
would have been done. At the end of the 2way stage, routers will decide whether to proceed
in building an adjacency or not. The decision is based on whether one of the routers is a DR
or BDR or the link is a point-to-point or a virtual link.
Exstart: Routers are trying to establish the initial sequence number that is going to be used in
the information exchange packets. The sequence number insures that routers always get the
most recent information. One router will become the primary and the other will become
secondary. The primary router will poll the secondary for information.
Exchange: Routers will describe their entire link-state database by sending database
description packets. At this state, packets could be flooded to other interfaces on the router.
Loading: At this state, routers are finalizing the information exchange. Routers have built a
link-state request list and a link-state retransmission list. Any information that looks incomplete
or outdated will be put on the request list. Any update that is sent will be put on the
retransmission list until it gets acknowledged.
Full: At this state, the adjacency is complete. The neighboring routers are fully adjacent.
Adjacent routers will have a similar link-state database.
The adjacency building process takes effect after multiple stages have been fulfilled. Routers that
become adjacent will have the exact link-state database. The following is a brief summary of the
states an interface passes through before becoming adjacent to another router:
Down: No information has been received from anybody on the segment.
Attempt: On non-broadcast multi-access clouds such as Frame Relay and X.25, this state
indicates that no recent information has been received from the neighbor. An effort should be
made to contact the neighbor by sending Hello packets at the reduced rate PollInterval.
Init: The interface has detected a Hello packet coming from a neighbor but bi-directional
communication has not yet been established.
Two-way: There is bi-directional communication with a neighbor. The router has seen itself in
the Hello packets coming from a neighbor. At the end of this stage the DR and BDR election
would have been done. At the end of the 2way stage, routers will decide whether to proceed
in building an adjacency or not. The decision is based on whether one of the routers is a DR
or BDR or the link is a point-to-point or a virtual link.
Exstart: Routers are trying to establish the initial sequence number that is going to be used in
the information exchange packets. The sequence number insures that routers always get the
most recent information. One router will become the primary and the other will become
secondary. The primary router will poll the secondary for information.
Exchange: Routers will describe their entire link-state database by sending database
description packets. At this state, packets could be flooded to other interfaces on the router.
Loading: At this state, routers are finalizing the information exchange. Routers have built a
link-state request list and a link-state retransmission list. Any information that looks incomplete
or outdated will be put on the request list. Any update that is sent will be put on the
retransmission list until it gets acknowledged.
Full: At this state, the adjacency is complete. The neighboring routers are fully adjacent.
Adjacent routers will have a similar link-state database.
Linux certification || demanding certification || free of cost
Valuable or demanding certification
Step-1 go to below link
https://training.linuxfoundation.org/resources/?_sft_content_type=free-course
Step-2 Registration then Enroll course
Step-3 Complete course and final exam
Step-4 Get certification
Watch complete video
https://youtu.be/VHMCtkh7m_0
Step-1 go to below link
https://training.linuxfoundation.org/resources/?_sft_content_type=free-course
Step-2 Registration then Enroll course
Step-3 Complete course and final exam
Step-4 Get certification
Watch complete video
https://youtu.be/VHMCtkh7m_0
Subscribe to:
Posts (Atom)
-
CCNA NEW BOOK CCNA 200-301 follow this blogger https://mega.nz/#!YgxmWShD key - aVCtCB_euTd-yeNqZAxCbZF5Nqdjni7Pu5fs8lqRizY ...
-
Route Redistribution - It is preferable to employ a single routing protocol in an internetwork environment, for simplicity and ease of m... -
STP(Spanning Tree Protocol) Switching Loops A Layer-2 switch belongs to only one broadcast domain, and will forward both broadcasts and...