Advertisement

On Generating Random Network Structures: Trees

  • Alexey S. Rodionov
  • Hyunseung Choo
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2658)

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.

Keywords

Connected Graph Random Graph Node Degree Random Tree Free Node 
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

  1. 1.
    M. Doar, Multicast in the ATM environment. PhD thesis, Cambridge Univ., Computer Lab., September 1993.Google Scholar
  2. 2.
    M. Doar, “A Better Mode for Generating Test Networks,” Proc. Global Telecommunication Conf. GLOBECOM’96, pp. 86–93, 1996.Google Scholar
  3. 3.
    Chai-Keong Toh, “Performance Evaluation of Crossover Switch Discovery Algorithms for Wireless ATM LANs, ” Proc. of INFOCOM’96, pp. 1380–1387, 1993.Google Scholar
  4. 4.
    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)Google Scholar
  5. 5.
    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)Google Scholar
  6. 6.
    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).Google Scholar
  7. 7.
    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)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2003

Authors and Affiliations

  • Alexey S. Rodionov
    • 1
  • Hyunseung Choo
    • 2
  1. 1.Institute of Computational Mathematics and Mathematical GeophysicsSiberian Division of the Russian Academy of ScienceNovosibirskRUSSIA
  2. 2.School of Information and Communication EngineeringSungkyunkwan UniversitySuwonKOREA

Personalised recommendations