On generating random network structures: trees

Authors:
Alexey S. Rodionov;Hyunseung Choo
Affiliations:
Institute of Computational Mathematics and Mathematical Geophysics, Siberian Division of the Russian Academy of Science, Novosibirsk, Russia;School of Information and Communication Engineering, Sungkyunkwan University, Suwon, Korea
Venue:
ICCS'03 Proceedings of the 2003 international conference on Computational science: PartII
Year:
2003

Citing 0
Cited 4

Estimated path selection for the delay constrained least cost path

PCI'05 Proceedings of the 10th Panhellenic conference on Advances in Informatics
Source-Based minimum cost multicasting: intermediate-node selection with potentially low cost

PCI'05 Proceedings of the 10th Panhellenic conference on Advances in Informatics
On algorithm for efficiently combining two independent measures in routing paths

ICCSA'05 Proceedings of the 2005 international conference on Computational Science and Its Applications - Volume Part IV
Mechanized extraction of topology anti-patterns in wireless networks

IFM'12 Proceedings of the 9th international conference on Integrated Formal Methods

Quantified Score

Hi-index	0.00

Visualization

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 taskof 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.