Abstract: A method establishes a session across a plurality of nodes in a computer network using a load balancing technique. The plurality of nodes includes a current node and a plurality of next nodes, and each next hop node is coupled with the current node via a link. To determine the next hop node from the current node, the method determines the residual capacity of the links between the current node and the next nodes, and generates a random number. Next, the method selects one of the next nodes as a function of the random number and the respective residual capacities of the links between the current node and the next nodes. After selecting the one next hop node, the method directs packets for the session from the current node to the one selected next hop node.

Abstract: A self-protecting router limits the extent to which its queues can be filled with potentially malicious or otherwise harmful messages received from outside the router, thereby ensuring the queues have sufficient room to accept messages generated internally within the router and are necessary for management and operation of the router. Such routers are, therefore, immune to attack by floods of messages from malicious or malfunctioning network nodes, such as computers, switches and other routers.

Abstract: A self-protecting router limits the extent to which its queues can be filled with potentially malicious or otherwise harmful messages received from outside the router, thereby ensuring the queues have sufficient room to accept messages generated internally within the router and are necessary for management and operation of the router. Such routers are, therefore, immune to attack by floods of messages from malicious or malfunctioning network nodes, such as computers, switches and other routers.

Abstract: A self-configuring router includes a resource allocator that automatically assigns processors to queues, such that queue workload is distributed as evenly as possible among the processors, and the processors are as fully utilized as possible. Consequently, packets do not remain on queues longer than necessary, thereby decreasing latency of packets traversing the router, and available and expensive resources, namely the processors, are kept busy. The router automatically allocates its own resources (processors) to its own queues.

Abstract: A self-configuring router includes a resource allocator that automatically assigns processors to queues, such that queue workload is distributed as evenly as possible among the processors, and the processors are as fully utilized as possible. Consequently, packets do not remain on queues longer than necessary, thereby decreasing latency of packets traversing the router, and available and expensive resources, namely the processors, are kept busy. The router automatically allocates its own resources (processors) to its own queues.

Abstract: A method establishes a session across a plurality of nodes in a computer network using a load balancing technique. The plurality of nodes includes a current node and a plurality of next nodes, and each next hop node is coupled with the current node via a link. To determine the next hop node from the current node, the method determines the residual capacity of the links between the current node and the next nodes, and generates a random number. Next, the method selects one of the next nodes as a function of the random number and the respective residual capacities of the links between the current node and the next nodes. After selecting the one next hop node, the method directs packets for the session from the current node to the one selected next hop node.

Abstract: A mechanism for ASBRs to identify the originating node, or router, in an LSP conversant autonomous system (AS), such as an MPLS VPN environment, maintains the identity of the originating node and successive nodes in subsequent autonomous systems along the path to the node to be pinged. The identity of the transporting nodes is stored in a stack or other object associated with the ping request (ping), such that the pinged node may employ the stored identity as a set of return path routing information. Successive ASBRs store their identity on the stack, in an ordered manner, along the path to the destination. Upon reaching the destination (ping) node, the destination node employs the identity of the first node on the stack to send the acknowledgment, or ping response. Each successive ASBR, therefore, pops (retrieves) the next node identity from the stack and redirects (sends) the ping response to the retrieved node.

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.