Abstract
Random trees (RTs) are widely used for testing various algorithms on tree-type networks and also for generating connected graphs similar to real nets. While random topologies based on RTs are generally accepted as networkmo dels, the task of their generation is almost unexplored. In this paper we discuss the set of basic algorithms for generating random trees. The fast algorithms with proven properties are presented for generating random trees under conditions for given restrictions, such as a limited node degree, fixed node degrees, and different probabilities of edge existence. Generating random graphs similar to physical networks are underway.
This paper was partially supported by BK21 program. Dr. H.Choo is the correspondent author
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
M. Doar, Multicast in the ATM environment. PhD thesis, Cambridge Univ., Computer Lab., September 1993.
M. Doar, “A Better Mode for Generating Test Networks,” Proc. Global Telecommunication Conf. GLOBECOM’96, pp. 86–93, 1996.
Chai-Keong Toh, “Performance Evaluation of Crossover Switch Discovery Algorithms for Wireless ATM LANs, ” Proc. of INFOCOM’96, pp. 1380–1387, 1993.
A.S. Rodionov, L.N. Postnikova, and O.K. Rodionova, “Program Complex for Graph Generating in the GRAPH-ES Package,” Materials of the Conf. “Computers and System Analysis,” Novosibirsk, 1982, pp. 13–15., 1982. (in Russian)
A.S. Rodionov, “Graph Generating in the GRAPH-ES Package,” Materials of the Conf. “ Methods and Programs for Solving Optimization Problems on Graphs and Nets,” Novosibirsk, 1982, Part 1, pp. 170–171., 1982. (in Russian)
M.I. Netchepurenko, V.K. Popkov, S.M. Mainagashev, etc, Algorithms and Programs for Solving Optimization Problems on Graphs and Networks. Novosibirsk, Nauka P.A., 1990, 515 p. (in Russian).
G. Omarova, “Program Complex for Graph Generating,” Proc. of Young Scientists Annual Conf., Institute of Computational Mathematics and Mathematical Geophysics of Siberian Division of the Russian Academy of Science, Novosibirsk, pp. 174–181, 1998. (in Russian)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Rodionov, A.S., Choo, H. (2003). On Generating Random Network Structures: Trees. In: Sloot, P.M.A., Abramson, D., Bogdanov, A.V., Gorbachev, Y.E., Dongarra, J.J., Zomaya, A.Y. (eds) Computational Science — ICCS 2003. ICCS 2003. Lecture Notes in Computer Science, vol 2658. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44862-4_95
Download citation
DOI: https://doi.org/10.1007/3-540-44862-4_95
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-40195-7
Online ISBN: 978-3-540-44862-4
eBook Packages: Springer Book Archive