Premium
Size and shape characteristics of SDH rings
Author(s) -
Naldi M.,
Agostini L.
Publication year - 2002
Publication title -
international journal of communication systems
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.344
H-Index - 49
eISSN - 1099-1131
pISSN - 1074-5351
DOI - 10.1002/dac.562
Subject(s) - ellipse , perimeter , ring (chemistry) , computer science , centroid , gaussian , ring size , statistics , statistical analysis , algorithm , geometry , mathematics , artificial intelligence , physics , chemistry , organic chemistry , quantum mechanics
Abstract A number of issues concerning the SDH networks (e.g. performance analysis of traffic management policies and statistical cost evaluation) may require a simulation approach that takes into account the size and shape of SDH rings. As a statistical support for the modelling of SDH rings for these purposes, the results of an analysis conducted on a real sample network of moderate‐to‐large dimensions are reported in this paper. Some items (e.g. the no. of nodes per ring, the area enclosed by the ring, and the perimeter vs area relationship) are selected to characterize the rings' size and shape. For each item the relevant statistics are supplied. In addition, models are proposed for the most relevant characteristics. Bounds are obtained for the average internodal distance on a ring. A log‐normal probability model is suggested for the internodal distances and a mixture of two Gaussian components is obtained for the distance between the ring's nodes and the ring's centroid. A power regression curve is instead used to fit the perimeter vs area experimental data, showing that the shape of SDH rings could be well modelled by an ellipse. Copyright © 2002 John Wiley & Sons, Ltd.