{"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}
引用次数: 1
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.