In MPLS, a 20-bit unsigned integer in the range 0 through 1048575, used to identify a packet traveling along an LSP.
A signaling protocol used to establish an MPLS label- switched path. LDP uses the IGP shortest-path cost to each egress router in the network and is not capable of utilizing traffic-engineering concepts.
An RSVP message object that contains the label value allocated by the next downstream router.
Function performed by an MPLS router in which the top label in a label stack is removed from the data packet.
Function performed by an MPLS router in which a new label is added to the top of the data packet.
An RSVP message object that requests each router along the path of an LSP to allocate a label for forwarding purposes.
Function performed by an MPLS router in which the top label in a label stack is replaced with a new label before forwarding the data packet to the next-hop router.
Sequence of routers that cooperatively perform MPLS operations for a packet stream. The first router in an LSP is called the ingress router, and the last router in the path is called the egress router. An LSP is a point-to-point, simplex connection from the ingress router to the egress router. (The ingress and egress routers cannot be the same router.)
See Multiprotocol Label Switching (MPLS).
A router on which MPLS is enabled and is thus capable of processing label-switched packets.
A 20-bit field in an MPLS header used by routers to forward data traffic along an MPLS label-switched path.
Software protocol used for locating resources on a public or private network.
A method used to troubleshoot a problem with a physical transmission media. A transmission device in the network sends the data signal back to the originating router.
Communication path between two neighbors. A link is up when communication is possible between the two end points.
OSPF data packet used to inform a neighbor that a link-state update packet has been successfully received.
OSPF data structure that is advertised in a link-state update packet. Each LSA uniquely describes a portion of the OSPF network.
All routing knowledge in a link-state network is contained in this database. Each router runs the SPF algorithm against this database to locate the best network path to each destination in the network.
Packets that contain information about the state of adjacencies to neighboring systems in an IS-IS network.
A list generated by an OSPF router during the exchange of database information while forming an adjacency. Advertised information by a neighbor that the local router doesn't contain is placed onto this list.
OSPF data packet that a router uses to request database information from a neighboring router.
OSPF data packet that contains one or multiple LSAs. It is used to advertise routing knowledge into the network.
OSPF adjacency state where the local router is sending link-state request packets to its neighbor and is awaiting the appropriate link-state updates from that neighbor.
Optional BGP path attribute carried in internal BGP update packets that indicates the degree of preference for an external route.
Concept used in an MPLS network where the label values are unique only between two neighbor routers.
Logical software table that contains BGP routes used by the local router to forward data packets.
Characters used in a firewall filter to represent a Boolean AND or OR operation.
JUNOS software routing policy match type that represents all routes more specific than the given subnet, but not the given subnet itself. It is similar to a mathematical greater-than operation.
In the context of traffic engineering, a path that can use any route or any number of other intermediate (transit) points to reach the next address in the path. (Definition from RFC 791, modified to fit LSPs.)
Router in an MPLS named-path that is not required to be directly connected to the local router.