发布求助
文献互助 智能选刊 最新文献

[1988] Proceedings. Computer Networking Symposium最新文献

筛选
英文 中文
Effect of ISDN traffic on the link blocking probabilities ISDN业务量对链路阻塞概率的影响
[1988] Proceedings. Computer Networking Symposium Pub Date : 1988-04-11 DOI: 10.1109/CNS.1988.4974
T. Saadawi, A. Jafari
{"title":"Effect of ISDN traffic on the link blocking probabilities","authors":"T. Saadawi, A. Jafari","doi":"10.1109/CNS.1988.4974","DOIUrl":"https://doi.org/10.1109/CNS.1988.4974","url":null,"abstract":"The authors present a mathematical model using a two-dimensional queuing model that obtains the link blocking probability in an ISDN (integrated-services digital network) environment for two types of traffic. The model can be applied to link reservation schemes, private virtual network (PVN), alternate routing, and priority traffic. This model is extended to networks, with several different types of traffic.<<ETX>>","PeriodicalId":112149,"journal":{"name":"[1988] Proceedings. Computer Networking Symposium","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1988-04-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129985930","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Updating software and configuration data in a distributed communications network 更新分布式通信网络中的软件和配置数据
[1988] Proceedings. Computer Networking Symposium Pub Date : 1988-04-11 DOI: 10.1109/CNS.1988.5011
C. Symborski
{"title":"Updating software and configuration data in a distributed communications network","authors":"C. Symborski","doi":"10.1109/CNS.1988.5011","DOIUrl":"https://doi.org/10.1109/CNS.1988.5011","url":null,"abstract":"The author presents a method for the organization and controlled distribution of software and configuration data throughout a communications network. Central to the discussion are two concepts: download, which can be thought of as a mechanism by which network software and data are obtained and installed in a network component, and data reconciliation, which can be thought of as the process by which the consistency of all downloaded information within a network component is assured. A network component can use data reconciliation to determine what data is needed for operation and when that data has changed, thus requiring update. The download process can then be used to obtain the needed data. The methodology is illustrated by its implementation in an advanced, commercially available packet switching network.<<ETX>>","PeriodicalId":112149,"journal":{"name":"[1988] Proceedings. Computer Networking Symposium","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1988-04-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131263019","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 6
Configuring UNIX STREAMS communication buffers based on an Erlang traffic model 基于Erlang流量模型配置UNIX STREAMS通信缓冲区
[1988] Proceedings. Computer Networking Symposium Pub Date : 1988-04-11 DOI: 10.1109/CNS.1988.5001
T. P. Lee, R. E. Barkley
{"title":"Configuring UNIX STREAMS communication buffers based on an Erlang traffic model","authors":"T. P. Lee, R. E. Barkley","doi":"10.1109/CNS.1988.5001","DOIUrl":"https://doi.org/10.1109/CNS.1988.5001","url":null,"abstract":"The authors describe a STREAMS communication buffer allocation algorithm based on the blocking probability, given the total amount of communication buffer memory. Memory requests are modeled as Erlang B traffic characterized by the mean interarrival time and mean buffer holding time for each size. The objective function to be minimized is the total number of blocked requests for the given traffic subject to the memory constraint.<<ETX>>","PeriodicalId":112149,"journal":{"name":"[1988] Proceedings. Computer Networking Symposium","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1988-04-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121834272","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 2
Survey of protocol verification techniques based on finite state machine models 基于有限状态机模型的协议验证技术综述
[1988] Proceedings. Computer Networking Symposium Pub Date : 1900-01-01 DOI: 10.1109/CNS.1988.4993
M. Yuang
{"title":"Survey of protocol verification techniques based on finite state machine models","authors":"M. Yuang","doi":"10.1109/CNS.1988.4993","DOIUrl":"https://doi.org/10.1109/CNS.1988.4993","url":null,"abstract":"A survey is presented of techniques for verifying correctness properties of communications protocol design based on finite-state-machine (FSM) models. The conventional reachability analysis is first described, giving advantages and limitations. One major limitation is the so-called state-space explosion problem. To approach this and other problems, a survey of different approaches is presented. The author classifies the various techniques into categories. These include closed covers, localized protocol verification, divide-and-conquer, modified reachability analysis, and partial state exploration. Each technique is described in detail, including an analysis of its strengths and weaknesses. Based on this analysis, one technique is proposed as the basis for further work on a protocol verifier and analyzer workstation which is being designed as a protocol development tool.<<ETX>>","PeriodicalId":112149,"journal":{"name":"[1988] Proceedings. Computer Networking Symposium","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124323380","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 37
The performance of a real time LAN architecture for sensor fusion applications 一种用于传感器融合应用的实时局域网架构性能
[1988] Proceedings. Computer Networking Symposium Pub Date : 1900-01-01 DOI: 10.1109/CNS.1988.4988
V. Cherkassky, H. Lari-Najaffi, N. Lawrie, D. Masson, D. Pritty
{"title":"The performance of a real time LAN architecture for sensor fusion applications","authors":"V. Cherkassky, H. Lari-Najaffi, N. Lawrie, D. Masson, D. Pritty","doi":"10.1109/CNS.1988.4988","DOIUrl":"https://doi.org/10.1109/CNS.1988.4988","url":null,"abstract":"A description is given of the key characteristics of a local area network (LAN) architecture, Instanet, which retains these merits but provides the added features of rapid real-time response to allow direct coupling of sensor-based modules to the network. Instanet uses a distributed interrupt facility to provide high levels of service to time-critical traffic without imposing restrictions on flow control and/or packet length for nontime-critical traffic. The Instanet architecture and its implementation is based on the IEEE 802.5 token ring standard. A detailed analytic model of Instanet's performance is presented. It is a generalization of the well-known walking server model (for token-passing networks) which takes into account provisions for priority handling. The analysis is backed up by simulation results which show performance of the network at various levels of real-time and nonreal-time traffic.<<ETX>>","PeriodicalId":112149,"journal":{"name":"[1988] Proceedings. Computer Networking Symposium","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126691056","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
首页 上一页
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整，为了账户安全，请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们：info@booksci.cn Book学术提供免费学术资源搜索服务，方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号：604180095
Book学术官方微信