Abstract: Various systems and methods for using strict path forwarding. For example, one method involves receiving an advertisement at a node. The advertisement includes a segment identifier (SID). In response to receiving the advertisement, the node determines whether the SID is a strict SID or not. If the SID is a strict SID, the node generates information, such as forwarding information that indicates how to forward packets along a strict shortest path corresponding to the strict SID.

Abstract: Various systems and methods for using strict path forwarding. For example, one method involves receiving an advertisement at a node. The advertisement includes a segment identifier (SID). In response to receiving the advertisement, the node determines whether the SID is a strict SID or not. If the SID is a strict SID, the node generates information, such as forwarding information that indicates how to forward packets along a strict shortest path corresponding to the strict SID.

Abstract: Various systems and methods for using strict path forwarding. For example, one method involves receiving an advertisement at a node. The advertisement includes a segment identifier (SID). In response to receiving the advertisement, the node determines whether the SID is a strict SID or not. If the SID is a strict SID, the node generates information, such as forwarding information that indicates how to forward packets along a strict shortest path corresponding to the strict SID.

Abstract: Various systems and methods for using strict path forwarding. For example, one method involves receiving an advertisement at a node. The advertisement includes a segment identifier (SID). In response to receiving the advertisement, the node determines whether the SID is a strict SID or not. If the SID is a strict SID, the node generates information, such as forwarding information that indicates how to forward packets along a strict shortest path corresponding to the strict SID.

Abstract: Various systems and methods for using strict path forwarding. For example, one method involves receiving an advertisement at a node. The advertisement includes a segment identifier (SID). In response to receiving the advertisement, the node determines whether the SID is a strict SID or not. If the SID is a strict SID, the node generates information, such as forwarding information that indicates how to forward packets along a strict shortest path corresponding to the strict SID.

Abstract: Various systems and methods for using strict path forwarding. For example, one method involves receiving an advertisement at a node. The advertisement includes a segment identifier (SID). In response to receiving the advertisement, the node determines whether the SID is a strict SID or not. If the SID is a strict SID, the node generates information, such as forwarding information that indicates how to forward packets along a strict shortest path corresponding to the strict SID.

Abstract: Various systems and methods for using strict path forwarding. For example, one method involves receiving an advertisement at a node. The advertisement includes a segment identifier (SID). In response to receiving the advertisement, the node determines whether the SID is a strict SID or not. If the SID is a strict SID, the node generates information, such as forwarding information that indicates how to forward packets along a strict shortest path corresponding to the strict SID.

Abstract: Various systems and methods for using strict path forwarding. For example, one method involves receiving an advertisement at a node. The advertisement includes a segment identifier (SID). In response to receiving the advertisement, the node determines whether the SID is a strict SID or not. If the SID is a strict SID, the node generates information, such as forwarding information that indicates how to forward packets along a strict shortest path corresponding to the strict SID.

Abstract: Various systems and methods for using strict path forwarding. For example, one method involves receiving an advertisement at a node. The advertisement includes a segment identifier (SID). In response to receiving the advertisement, the node determines whether the SID is a strict SID or not. If the SID is a strict SID, the node generates information, such as forwarding information, that indicates how to forward packets along a strict shortest path corresponding to the strict SID.

Abstract: Various systems and methods for using strict path forwarding. For example, one method involves receiving an advertisement at a node. The advertisement includes a segment identifier (SID). In response to receiving the advertisement, the node determines whether the SID is a strict SID or not. If the SID is a strict SID, the node generates information, such as forwarding information, that indicates how to forward packets along a strict shortest path corresponding to the strict SID.

Abstract: A method, apparatus and computer program product for providing dynamic routing support for Half-Duplex Virtual Routing and Forwarding (HDVRF) environments. The method, apparatus and computer program function to configure a forwarding Virtual Routing and Forwarding (VRF) table for a router with information to forward incoming packets to a central location within a hub and spoke environment. The method, apparatus and computer program also function to populate a routing Virtual Routing and Forwarding (VRF) table for the router with routing information received from ingress interfaces of the router. The method, apparatus and computer program function further forwards packets received on egress interfaces of the router according to the forwarding VRF table.

Abstract: A method, apparatus and computer program product each provides interconnectivity between autonomous systems. A control plane and a data plane are included in a network device. A single interface is included in the control plane for all customers. An interface is included in the data plane for each respective one of the customers.

Abstract: A first network node maintains separate routing policy information to forward network traffic depending on a direction of the network traffic. Upstream routing policy information at the first node identifies a second node to forward upstream traffic received from at least a first client communicating through the first node. Downstream routing policy information at the first node identifies how to forward downstream network traffic received from another node to the first client. By preventing use of the downstream policy routing information by the first client to route upstream network traffic, the first node is able to forward traffic along a path that the network traffic otherwise would have not traveled. For example, network traffic communicated through the first node can be forced to travel through another network node through which it would have not otherwise have passed if the downstream policy information was available to route the network traffic.

Abstract: A method, apparatus and computer program product for providing dynamic routing support for Half-Duplex Virtual Routing and Forwarding (HDVRF) environments. The method, apparatus and computer program function to configure a forwarding Virtual Routing and Forwarding (VRF) table for a router with information to forward incoming packets to a central location within a hub and spoke environment. The method, apparatus and computer program also function to populate a routing Virtual Routing and Forwarding (VRF) table for the router with routing information received from ingress interfaces of the router. The method, apparatus and computer program function further forwards packets received on egress interfaces of the router according to the forwarding VRF table.

Abstract: A method, apparatus and computer program product for providing dynamic routing support for Half-Duplex Virtual Routing and Forwarding (HDVRF) environments. The method, apparatus and computer program function to configure a forwarding Virtual Routing and Forwarding (VRF) table for a router with information to forward incoming packets to a central location within a hub and spoke environment. The method, apparatus and computer program also function to populate a routing Virtual Routing and Forwarding (VRF) table for the router with routing information received from ingress interfaces of the router. The method, apparatus and computer program function further forwards packets received on egress interfaces of the router according to the forwarding VRF table.

Abstract: A method and apparatus for producing and maintaining a repository of service level test points for network based VPNs is presented. A determination is made regarding whether there is more than one Autonomous System (AS) in a network for one or more VPNs. When there is not more than one AS then next hops are found for the VPN. Next, VPN prefixes associated with the VPN are found and a set of Label Switching Paths (LSPs) in use for the VPN are produced. When the determination is that there is more than one AS then routers in the present AS associated with the VPN are found. VPN label stacks are used to find all Provider Edge (PE) routers associated with the VPN.

Abstract: A first node generates and transmits a notification message including routing policy attributes such as network address information and a corresponding gateway identifier. The gateway identifier identifies a gateway in a physical network through which future generated data messages shall be forwarded to at least one host computer (e.g., any computer having an associated network address) as indicated by the network address information. A second node receiving the notification message utilizes the routing policy attributes to dynamically update its database identifying how to forward data packets. In this way, nodes (e.g., CE routers) of a network can be dynamically configured to support routing of messages based on the network address information and gateway identifier disseminated along with the notification message.

Abstract: A method and apparatus for producing and maintaining a repository of service level test points for network based VPNs is presented. A determination is made regarding whether there is more than one Autonomous System (AS) in a network for one or more VPNs. When there is not more than one AS then next hops are found for the VPN. Next, VPN prefixes associated with the VPN are found and a set of Label Switching Paths (LSPs) in use for the VPN are produced. When the determination is that there is more than one AS then routers in the present AS associated with the VPN are found. VPN label stacks are used to find all Provider Edge (PE) routers associated with the VPN.

Abstract: A method, apparatus and computer program product for providing dynamic routing support for Half-Duplex Virtual Routing and Forwarding (HDVRF) environments. The method, apparatus and computer program function to configure a forwarding Virtual Routing and Forwarding (VRF) table for a router with information to forward incoming packets to a central location within a hub and spoke environment. The method, apparatus and computer program also function to populate a routing Virtual Routing and Forwarding (VRF) table for the router with routing information received from ingress interfaces of the router. The method, apparatus and computer program function further forwards packets received on egress interfaces of the router according to the forwarding VRF table.

Abstract: A first network node maintains separate routing policy information to forward network traffic depending on a direction of the network traffic. Upstream routing policy information at the first node identifies a second node to forward upstream traffic received from at least a first client communicating through the first node. Downstream routing policy information at the first node identifies how to forward downstream network traffic received from another node to the first client. By preventing use of the downstream policy routing information by the first client to route upstream network traffic, the first node is able to forward traffic along a path that the network traffic otherwise would have not traveled. For example, network traffic communicated through the first node can be forced to travel through another network node through which it would have not otherwise have passed if the downstream policy information was available to route the network traffic.