Abstract
The topological design of a computer communication network assigns the links and link capacities for connecting network nodes within several constraints, with a goal to achieve a specified performance at a minimal cost. A reasonable approach is to generate a potential network topology. This paper presents a spanning tree based method for systematic numbering of nodes in any communication network. When the nodes are numbered in a systematic manner the potential network topology generated will have lesser amount of perturbation before an acceptable network is found.
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.
