Description: Modifies the Dijkstra (path-calculation) algorithm in this switch system to allow or disallow loops of paths when computing paths through Logical Group Nodes. When loops are disallowed (this parameter set to false), no path will be considered which enters the same Logical Group Node twice. This considerably lessens the time needed to compute the paths in complicated networks. However, under some crankback situations, this might fail to find a viable path to the desired nodal destination. Note that loops between lowest-level nodes (nodes within the local node's lowest-level peer group members) are always disallowed, regardless of the setting of this parameter.