Browse Prior Art Database

A Method For Stress Testing Nodally Networked Systems Disclosure Number: IPCOM000013341D
Original Publication Date: 2001-Apr-22
Included in the Prior Art Database: 2003-Jun-18

Publishing Venue



Many server and computer designs are based on a network of nodes which are interconnected in a ring or a grid or a mesh of sorts. Each node will have a primary and an alternate path for data. The alternate path is typically used if the primary path (usually the most direct path) is or becomes defective. Typically these networks are tested using the most direct path. A more reliable network should be stress tested in some way. This disclosure describes how to use the network of nodes for the advantage of the user to apply more stress to the functions of the network, specifically the hopping function and testing all alternate paths. What means is used to ensure that a network is reliable, and the alternate paths are all working, since the alternate paths are used only when a primary path becomes defective. A solution to this test issue is to take advantage of the nodal network, and configure it to make all data travel from it's source to it's destination through the longest path. For example, refer to the drawing. If data is routed from node 0 to node 3 via node 0's port 0 then data will have to travel through node 1 and node 2 to get to node 3. Another example, if data is routed from node 3 to node 0 via node 3's port 0 then the data will have to travel through node 2 and node 1 to get to node 0. Testing this network under these routing conditions will not only test all alternate paths, which may be used when a primary path becomes defective but will also stress the hopping function. The hopping function is used when data is traveling to it's final destination but has to hop through one or more nodes to get there. The solution is to reconfigure the node routing to cause the data flow to take the longest path possible, then stress test and exercise the network, including every node's hopping function and all alternate paths. 1