Maps of large networks can be hard to read. Often the nodes are close together, even on top of each other, and links cross other links in a dense web. WANDL's Java version of NPAT (Network Planning and Analysis Tools) now includes a "Distribute Points" algorithm that repositions the nodes to make the map clearer. Here are some examples:

• If there are several nodes in the same city, the program will spread them out in an understandable layout near the city. The map as a whole will have groups of nodes, each group clustered around its city.
• One can use groups within groups. If the nodes in a city come from different NPA's (area codes), for example, they can be distributed into several small groups around each city, where the small groups represent the NPA's.
• Nodes can be grouped in other ways, such as by site, hardware type, and Ethernet connection.
• To get a flat representation of the network, turn off the grouping and redistribute the whole network all at once.

Copyright © 2000 WANDL, Inc. All Rights Reserved.

Copyright © 2008 WANDL, Inc.