Download now Free registration required
In this paper, the authors explore different strategies for planning and expanding networks based on chordal rings. For chordal rings of different sizes (10, 30 and 50 nodes), and with two different traffic distributions (random and uniform) they study how average distance and diameter change as the chords are added. In the first strategy chords are added one by one, so that the distances are reduced in each step. In the second strategy a constraint is added, so that nodes can only have degree 3 or 4. In the last strategy chords are added gradually so that they fit into an initially calculated best, regular chordal ring of degree 3 or 4.
- Format: PDF
- Size: 368.65 KB