摘要
Although the reduced load approximation technique has been extensively applied to flat networks, the feasibility of applying it to hierarchical network model has seldom been described. However, hierarchical routing is essential for large networks, such as the Internet inter/intra-domain routing hierarchy and the PNNI standard. Furthermore, most of research focused on the performance evaluation with fixed routing. Hence, this paper proposes an efficient and accurate analytical model for evaluating the performance of adaptive hierarchical networks with multiple classes of traffic. The evaluation model is based on decomposing a hierarchical route into several analytic hierarchical segments, therefore the blocking of the hierarchical path can be computed from these segments blocking. Numerical results indicate that the proposed adaptive hierarchical reduced load approximation yields quite accurate blocking probabilities as compared to that of simulation results. We also investigate the speed of the convergence rate of the reduced load approximation analysis in both of OD pair level and alternative hierarchical path level.
原文 | English |
---|---|
頁面 | 1875-1879 |
頁數 | 5 |
出版狀態 | Published - 2002 |
事件 | GLOBECOM'02 - IEEE Global Telecommunications Conference - Taipei, Taiwan 持續時間: 17 11月 2002 → 21 11月 2002 |
Conference
Conference | GLOBECOM'02 - IEEE Global Telecommunications Conference |
---|---|
國家/地區 | Taiwan |
城市 | Taipei |
期間 | 17/11/02 → 21/11/02 |