The PAWS RTS has been enhanced to enable improved handling of ATLAS connection variables. The algorithm for determining switch paths involving connection variables was modified to achieve the following main goals:

1. Minimize relay resource conflicts. Previously, driven by the need to minimize run-time computer resources, the information regarding a single point to point route that was handed to the RTS was limited to a single route, the shortest. In many instances that would be sufficient; but situations exist where the set of the shortest paths between the multiple pair points that appear in an ATLAS connection field is not necessarily the desired solution. This is because conflicting use of a specific switch may be introduced when multiple pairs of points are introduced. With the current enhancement, path computation is performed with the objective of minimizing such conflicts.
2. Minimize sneak paths. When switches are ganged, unwanted sneak paths may result when multiple pairs of points appear in an ATLAS connection statement. With the current enhancement, path computation is performed with the objective of minimizing such sneak paths.

Back to the Contents Page