基于预测的ISDN令牌环流控制策略

[1988] Proceedings. Computer Networking Symposium Pub Date : 1988-04-11 DOI:10.1109/CNS.1988.4989

N. Matloff, G. Fuller, P. Tendick

{"title":"基于预测的ISDN令牌环流控制策略","authors":"N. Matloff, G. Fuller, P. Tendick","doi":"10.1109/CNS.1988.4989","DOIUrl":null,"url":null,"abstract":"A prediction-based policy is proposed for ISDN (integrated-services digital network) token rings, in which data stations attempt to predict times at which they may utilize extra bandwidth not needed by the real-time stations. It is shown that while prediction is not very feasible in a large class of cases, there are some cases in which it can be quite effective.<<ETX>>","PeriodicalId":112149,"journal":{"name":"[1988] Proceedings. Computer Networking Symposium","volume":"319 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1988-04-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"A prediction-based flow control policy for ISDN token rings\",\"authors\":\"N. Matloff, G. Fuller, P. Tendick\",\"doi\":\"10.1109/CNS.1988.4989\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A prediction-based policy is proposed for ISDN (integrated-services digital network) token rings, in which data stations attempt to predict times at which they may utilize extra bandwidth not needed by the real-time stations. It is shown that while prediction is not very feasible in a large class of cases, there are some cases in which it can be quite effective.<<ETX>>\",\"PeriodicalId\":112149,\"journal\":{\"name\":\"[1988] Proceedings. Computer Networking Symposium\",\"volume\":\"319 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1988-04-11\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"[1988] Proceedings. Computer Networking Symposium\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CNS.1988.4989\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"[1988] Proceedings. Computer Networking Symposium","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CNS.1988.4989","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 0

摘要

针对综合业务数字网(ISDN)令牌环提出了一种基于预测的策略，在该策略中，数据站尝试预测它们可能利用实时站不需要的额外带宽的时间。研究表明，虽然预测在大多数情况下不是很可行，但在某些情况下它是相当有效的。

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

查看原文本刊更多论文

A prediction-based flow control policy for ISDN token rings

A prediction-based policy is proposed for ISDN (integrated-services digital network) token rings, in which data stations attempt to predict times at which they may utilize extra bandwidth not needed by the real-time stations. It is shown that while prediction is not very feasible in a large class of cases, there are some cases in which it can be quite effective.<>

求助全文

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

来源期刊

[1988] Proceedings. Computer Networking Symposium

自引率

0.00%

发文量