{"title":"ISDN环中的阻塞","authors":"G. Stamatelos, J. Hayes","doi":"10.1109/PACRIM.1989.48321","DOIUrl":null,"url":null,"abstract":"Results are presented of an exact analysis of the blocking conditions in a N nodes ring accessed by different classes of traffic. Blocking of a call request occurs when the number of slots required for the message transmission is not available on one (or more) of the tandem links that it traverses. The complexity of the technique proposed for the computation of the q(.) function increases exponentially with the number of nodes in the system. An approximation, therefore, may be required for the analysis of larger systems. The validity of the present work is not limited by this observation.<<ETX>>","PeriodicalId":256287,"journal":{"name":"Conference Proceeding IEEE Pacific Rim Conference on Communications, Computers and Signal Processing","volume":"30 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1989-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Blocking in an ISDN ring\",\"authors\":\"G. Stamatelos, J. Hayes\",\"doi\":\"10.1109/PACRIM.1989.48321\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Results are presented of an exact analysis of the blocking conditions in a N nodes ring accessed by different classes of traffic. Blocking of a call request occurs when the number of slots required for the message transmission is not available on one (or more) of the tandem links that it traverses. The complexity of the technique proposed for the computation of the q(.) function increases exponentially with the number of nodes in the system. An approximation, therefore, may be required for the analysis of larger systems. The validity of the present work is not limited by this observation.<<ETX>>\",\"PeriodicalId\":256287,\"journal\":{\"name\":\"Conference Proceeding IEEE Pacific Rim Conference on Communications, Computers and Signal Processing\",\"volume\":\"30 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1989-06-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Conference Proceeding IEEE Pacific Rim Conference on Communications, Computers and Signal Processing\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/PACRIM.1989.48321\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Conference Proceeding IEEE Pacific Rim Conference on Communications, Computers and Signal Processing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/PACRIM.1989.48321","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Results are presented of an exact analysis of the blocking conditions in a N nodes ring accessed by different classes of traffic. Blocking of a call request occurs when the number of slots required for the message transmission is not available on one (or more) of the tandem links that it traverses. The complexity of the technique proposed for the computation of the q(.) function increases exponentially with the number of nodes in the system. An approximation, therefore, may be required for the analysis of larger systems. The validity of the present work is not limited by this observation.<>