一种新的宽带ISDN分层路由方法

Proceedings of the Fifteenth National Radio Science Conference. NRSC '98 (Cat. No.98EX109) Pub Date : 1998-02-24 DOI:10.1109/NRSC.1998.711469

I. Ali, A. El-Sawy, H. Mouftah

{"title":"一种新的宽带ISDN分层路由方法","authors":"I. Ali, A. El-Sawy, H. Mouftah","doi":"10.1109/NRSC.1998.711469","DOIUrl":null,"url":null,"abstract":"A new hierarchical routing model for broadband networks is proposed and one of the problems facing the design of the hierarchical routing model is addressed. A brief description of the PNNI hierarchical routing model is given and a new hierarchical model that proves to be simpler and requires less storage than the PNNI model is proposed. The problem addressed is the choice of the number of levels in the hierarchy and the group size at each level. The optimization criterion for this problem is the minimization of storage required at each node to store the topology status information necessary for routing decision.","PeriodicalId":128355,"journal":{"name":"Proceedings of the Fifteenth National Radio Science Conference. NRSC '98 (Cat. No.98EX109)","volume":"48 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1998-02-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"A new hierachical routing method for broadband ISDN\",\"authors\":\"I. Ali, A. El-Sawy, H. Mouftah\",\"doi\":\"10.1109/NRSC.1998.711469\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A new hierarchical routing model for broadband networks is proposed and one of the problems facing the design of the hierarchical routing model is addressed. A brief description of the PNNI hierarchical routing model is given and a new hierarchical model that proves to be simpler and requires less storage than the PNNI model is proposed. The problem addressed is the choice of the number of levels in the hierarchy and the group size at each level. The optimization criterion for this problem is the minimization of storage required at each node to store the topology status information necessary for routing decision.\",\"PeriodicalId\":128355,\"journal\":{\"name\":\"Proceedings of the Fifteenth National Radio Science Conference. NRSC '98 (Cat. No.98EX109)\",\"volume\":\"48 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1998-02-24\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of the Fifteenth National Radio Science Conference. NRSC '98 (Cat. No.98EX109)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/NRSC.1998.711469\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the Fifteenth National Radio Science Conference. NRSC '98 (Cat. No.98EX109)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/NRSC.1998.711469","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 1

摘要

提出了一种新的宽带网络分层路由模型，并解决了分层路由模型设计中面临的一个问题。简要介绍了PNNI分层路由模型，并提出了一种新的分层路由模型，该模型比PNNI模型更简单，所需存储空间更少。解决的问题是选择层次结构中的级别数量和每个级别上的组大小。该问题的优化准则是使每个节点存储路由决策所需的拓扑状态信息所需的存储空间最小化。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

A new hierachical routing method for broadband ISDN

A new hierarchical routing model for broadband networks is proposed and one of the problems facing the design of the hierarchical routing model is addressed. A brief description of the PNNI hierarchical routing model is given and a new hierarchical model that proves to be simpler and requires less storage than the PNNI model is proposed. The problem addressed is the choice of the number of levels in the hierarchy and the group size at each level. The optimization criterion for this problem is the minimization of storage required at each node to store the topology status information necessary for routing decision.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

Proceedings of the Fifteenth National Radio Science Conference. NRSC '98 (Cat. No.98EX109)

自引率

0.00%

发文量