Planar drawing algorithms of survivable telecommunication networks

Abstract

Visualizing survivable telecommunication networks on the screen has proven to be useful and helpful for the network designers. In fact, they can easily identify rings, perceive the interaction between rings, and then rapidly spot possible problems. Given a ring cover of survivable telecommunication networks, we provide two techniques for drawing a ring cover. We should mention that all these drawings should respect many criteria in order to preserve the readability of the drawing. These criteria are as follows: Rings must be easily identifiable within the picture, no crossing is acceptable and the resolution rule should be respected. As in most of the graph drawing algorithms, the area used for the drawing is very important. Our proposed algorithms produce drawings that require 0(n2) area, where n is the number of nodes in the ring cover.