Abstract
In this paper we 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) we 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. The first strategy results in the best distances. The constrained node degrees comes next, whereas the regular rings have slightly larger distances through all steps.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
