Abstract: In an embodiment, a method comprises receiving a path advertisement comprising information about an available path and a well-known community value associated with the available path. A modified best path calculation is performed in response to receiving the available path either from a higher-ranked device or from a device that is not participating in diverse path calculation, resulting in creating a particular best path. The particular best path is advertised to other routers with or without a restriction indicator based on whether it is a client learned path or non-client iBGP peer learned path and based on whether the advertisement is directed to a client or a non-client iBGP peer.

Abstract: In an embodiment, a method comprises receiving a path advertisement comprising information about an available path and a well-known community value associated with the available path. A modified best path calculation is performed in response to receiving the available path either from a higher-ranked device or from a device that is not participating in diverse path calculation, resulting in creating a particular best path. The particular best path is advertised to other routers with or without a restriction indicator based on whether it is a client learned path or non-client iBGP peer learned path and based on whether the advertisement is directed to a client or a non-client iBGP peer.

Abstract: In an embodiment, a method comprises receiving a path advertisement comprising information about an available path and a well-known community value associated with the available path. A modified best path calculation is performed in response to receiving the available path either from a higher-ranked device or from a device that is not participating in diverse path calculation, resulting in creating a particular best path. The particular best path is advertised to other routers with or without a restriction indicator based on whether it is a client learned path or non-client iBGP peer learned path and based on whether the advertisement is directed to a client or a non-client iBGP peer.

Abstract: In an embodiment, a method comprises receiving a path advertisement comprising information about an available path and a well-known community value associated with the available path. A modified best path calculation is performed in response to receiving the available path either from a higher-ranked device or from a device that is not participating in diverse path calculation, resulting in creating a particular best path. The particular best path is advertised to other routers with or without a restriction indicator based on whether it is a client learned path or non-client iBGP peer learned path and based on whether the advertisement is directed to a client or a non-client iBGP peer.

Abstract: Approaches are disclosed for switching transport protocol connection keys. A first node sends a keychange request message to a second node, causing the second node to accept subsequent messages digitally signed with a first or second key. The second node sends an acknowledgment message to the first node, causing the first node to accept subsequent messages digitally signed with the first or second key. The first node receives a new message digitally signed with the second key from the second node and determines that there are no remaining messages to be received digitally signed with the first key. In response thereto, the first node only accepts messages digitally signed with the second key and sends a message signed with the second key to the second node, causing the second node to only accept messages digitally signed with the second key.

Abstract: Approaches are disclosed for switching transport protocol connection keys. In a transport protocol module configured to use a first key for signing messages associated with a transport protocol connection, a second key is configured for the transport protocol connection. A first message that is associated with the transport protocol connection is received. The first message includes a first signature. A first and a second message digests are computed for the first message, where the first message digest is based on the first key and the second message digest is based on the second key. The first message is validated if the first signature in the first message matches any one of the first message digest and the second message digest.