Reduced load approximation analysis for fixed hierarchical routing

Ben Jye Chang*, Ren Hung Hwang

*此作品的通信作者

研究成果: Paper同行評審

4 引文 斯高帕斯(Scopus)

摘要

The reduced-load approximation technique has been investigated for flat networks successfully. Nevertheless, less attention has been focused on hierarchical network model. However, hierarchical routing is essential for large networks. For example, the ATM PNNI standard and the Internet inter/intra-domain routing hierarchy. Hence, the goal of this paper is to propose an efficient and accurate analytical model for evaluating performance of hierarchical networks with multiple classes of traffic. We first study the reduced-load approximation model for multirate loss networks, and then propose a new model for networks with hierarchical routing. Our numerical results show that the proposed hierarchical reduced-load approximation yield quite accurate blocking probabilities as compared to that of simulation results.

原文English
頁面2204-2208
頁數5
出版狀態Published - 2001
事件IEEE Global Telecommunicatins Conference GLOBECOM'01 - San Antonio, TX, United States
持續時間: 25 11月 200129 11月 2001

Conference

ConferenceIEEE Global Telecommunicatins Conference GLOBECOM'01
國家/地區United States
城市San Antonio, TX
期間25/11/0129/11/01

指紋

深入研究「Reduced load approximation analysis for fixed hierarchical routing」主題。共同形成了獨特的指紋。

引用此