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

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

筛选
英文 中文
Optimal routing in a network with unreliable links 链路不可靠网络中的最优路由
[1988] Proceedings. Computer Networking Symposium Pub Date : 1988-04-11 DOI: 10.1109/CNS.1988.5007
A.A. Economides, J. Silvester
{"title":"Optimal routing in a network with unreliable links","authors":"A.A. Economides, J. Silvester","doi":"10.1109/CNS.1988.5007","DOIUrl":"https://doi.org/10.1109/CNS.1988.5007","url":null,"abstract":"An investigation is conducted of the routing of packets in a network in which the link error rates vary. A queuing network model that incorporates the effect of the link error rates is developed and is used to find optimal routing assignments for fixed error rates. Single-path and multiple-path dynamic routing algorithms that minimize the average packet delay or the failure probability of packet transmission are proposed. In case the network state is not exactly known, stochastic learning automata are proposed to drive the routing process.<<ETX>>","PeriodicalId":112149,"journal":{"name":"[1988] Proceedings. Computer Networking Symposium","volume":"84 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":"123414824","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}
引用次数: 15
LCR: a linear conflict resolution algorithm for local/metropolitan area networks LCR:一种用于本地/城域网的线性冲突解决算法
[1988] Proceedings. Computer Networking Symposium Pub Date : 1988-04-11 DOI: 10.1109/CNS.1988.5014
J. Waramahaputi, S. Thanawastien
{"title":"LCR: a linear conflict resolution algorithm for local/metropolitan area networks","authors":"J. Waramahaputi, S. Thanawastien","doi":"10.1109/CNS.1988.5014","DOIUrl":"https://doi.org/10.1109/CNS.1988.5014","url":null,"abstract":"A protocol for unidirectional broadcast bus networks, called linear conflict resolution (LCR), is introduced. This protocol is shown to be suitable for both local-area-network and metropolitan-area-network environments. It is shown that not only could the maximum throughput of LCR be increased toward 100%, but also the network is able in that the delay is finite for all the operating conditions, and the channel capacity of the LCR protocol is less sensitive to the bus characteristics than most of the existing protocols. Numerical results indicate that LCR exhibits good performance over a wide range of network sizes, and, in general, its capacity is better than the capacities of the 13 existing protocols mentioned. The LCR protocol is particularly well suited for a fiber-optic local area network or metropolitan area network which is relatively long with a very high bandwidth and a large user population.<<ETX>>","PeriodicalId":112149,"journal":{"name":"[1988] Proceedings. Computer Networking Symposium","volume":"413 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":"123425320","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
A prediction-based flow control policy for ISDN token rings 基于预测的ISDN令牌环流控制策略
[1988] Proceedings. Computer Networking Symposium Pub Date : 1988-04-11 DOI: 10.1109/CNS.1988.4989
N. Matloff, G. Fuller, P. Tendick
{"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":"https://doi.org/10.1109/CNS.1988.4989","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.0,"publicationDate":"1988-04-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114567250","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
Specification and analysis of concurrent systems using STOCS model 基于STOCS模型的并发系统规范与分析
[1988] Proceedings. Computer Networking Symposium Pub Date : 1988-04-11 DOI: 10.1109/CNS.1988.4996
V. Garg
{"title":"Specification and analysis of concurrent systems using STOCS model","authors":"V. Garg","doi":"10.1109/CNS.1988.4996","DOIUrl":"https://doi.org/10.1109/CNS.1988.4996","url":null,"abstract":"The author presents a synchronous token-based communicating state (STOCS) model for specification and analysis of concurrent systems. The STOCS model attempts to combine algebraic and net-theoretic approaches for the study of concurrent systems. It shares the notion of tokens, transitions and reachability with the net theory and the notions of processes, interactions and traces with the algebraic theory of concurrent systems. It is shown that it has the same power as that of Petri nets but is more convenient for modeling and analysis. The author presents many examples of modeling by STOCS. He also presents techniques to analyze systems expressed in STOCS model for their correctness. A STOCS simulation and analysis package is implemented on Unix 4.2 BSD.<<ETX>>","PeriodicalId":112149,"journal":{"name":"[1988] Proceedings. Computer Networking Symposium","volume":"33 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":"132557998","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}
引用次数: 8
A method for testing data aspects of protocol implementation and its applications to the OSI session layer 一种测试协议实现的数据方面及其在OSI会话层的应用程序的方法
[1988] Proceedings. Computer Networking Symposium Pub Date : 1988-04-11 DOI: 10.1109/CNS.1988.4978
M. Soppé
{"title":"A method for testing data aspects of protocol implementation and its applications to the OSI session layer","authors":"M. Soppé","doi":"10.1109/CNS.1988.4978","DOIUrl":"https://doi.org/10.1109/CNS.1988.4978","url":null,"abstract":"A method is presented to design conformance tests especially for data. Test cases are defined in a systematic way. The method was applied to design tests for the connection phase of the OSI (Open System Interconnection) session protocol. The tests that were designed revealed bugs in implementations.<<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":"130476604","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}
引用次数: 1
On the state of affairs in OSI transaction processing 浅谈OSI事务处理的现状
[1988] Proceedings. Computer Networking Symposium Pub Date : 1988-04-11 DOI: 10.1109/CNS.1988.4977
J. Janas, R. Wilehle
{"title":"On the state of affairs in OSI transaction processing","authors":"J. Janas, R. Wilehle","doi":"10.1109/CNS.1988.4977","DOIUrl":"https://doi.org/10.1109/CNS.1988.4977","url":null,"abstract":"The authors briefly describe the technical contents of an ISO standardization project on distributed transaction processing, and report on the current state of the project. After an outline of the historical development, definitions of the basic technical concepts are given. Emphasis is on an explanation of transaction commitment. The two commitment procedures described in the current working documents are characterized, and their main differences are discussed. The major arguments used by the supporters of the two different procedures are presented. Some of the problems related to interworking of systems using different commitment procedures are mentioned. A rough survey of the complete set of services is given. The influence that a future standard on distributed transaction processing might have on OSI (Open System Interconnect) service conventions is considered.<<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":"133427483","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}
引用次数: 3
Protocols for a transparent, internet, distributed operating system 透明、互联网、分布式操作系统的协议
[1988] Proceedings. Computer Networking Symposium Pub Date : 1988-04-11 DOI: 10.1109/CNS.1988.5009
A. Downing, G. Popek
{"title":"Protocols for a transparent, internet, distributed operating system","authors":"A. Downing, G. Popek","doi":"10.1109/CNS.1988.5009","DOIUrl":"https://doi.org/10.1109/CNS.1988.5009","url":null,"abstract":"The value of network transparency increases with the size and complexity of the network. However, due to performance considerations, network transparency is difficult to achieve in an internet environment. Specialized protocols were developed for the IPLocus distributed operating system so that transparency is feasible over an internet. These protocols are examined and compared to traditional internet protocols.<<ETX>>","PeriodicalId":112149,"journal":{"name":"[1988] Proceedings. Computer Networking Symposium","volume":"197 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":"123014306","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
Distributed routing using internodal coordination 使用节点间协调的分布式路由
[1988] Proceedings. Computer Networking Symposium Pub Date : 1988-04-11 DOI: 10.1109/CNS.1988.5020
J. Garcia-Luna-Aceves
{"title":"Distributed routing using internodal coordination","authors":"J. Garcia-Luna-Aceves","doi":"10.1109/CNS.1988.5020","DOIUrl":"https://doi.org/10.1109/CNS.1988.5020","url":null,"abstract":"A distributed algorithm for the dynamic calculation of the shortest paths in a computer network is introduced. The algorithm is loop-free at every instant of time independently of the transmission and processing delays in the network or the changes in the topology. According to the algorithm, each node maintains the length of the shortest paths to each network destination; update messages from a node are sent only to its neighbors. It extends the Jaffe-Moss algorithm by allowing nodes to choose new successors to destinations with no need for internodal coordination after link cost increases if the new successors are considered to be at most at the same distance as the current successors. A complete description of the algorithms is listed.<<ETX>>","PeriodicalId":112149,"journal":{"name":"[1988] Proceedings. Computer Networking Symposium","volume":"13 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":"128050595","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
Structural properties of optimal policies in an ISDN circuit-switched access port ISDN电路交换接入端口中最优策略的结构特性
[1988] Proceedings. Computer Networking Symposium Pub Date : 1988-04-11 DOI: 10.1109/CNS.1988.4970
D. Tsang, K. Ross
{"title":"Structural properties of optimal policies in an ISDN circuit-switched access port","authors":"D. Tsang, K. Ross","doi":"10.1109/CNS.1988.4970","DOIUrl":"https://doi.org/10.1109/CNS.1988.4970","url":null,"abstract":"The authors are concerned with access policies for networks using multi-rate circuit switching. The access node consists of F bandwidth units, which simultaneously support K classes of calls with varying bandwidth requirements. A policy specifies which calls should be accepted as a function of the system state. They consider finding policies which maximize the average revenue. They first prove that for K=2, the optimal policies are of simple threshold type, with thresholds occurring only at the points where the number of idling channels are integral multiples of the bandwidth ratio. For the general case of K user classes, the authors consider the problem of finding the optimal static policy, where for each user class a portion of the channel is dedicated. An efficient finite-stage dynamic programming algorithm for locating the optimal static policy is presented. Furthermore, variants of the optimal static policy which allow some sharing among user classes are also discussed.<<ETX>>","PeriodicalId":112149,"journal":{"name":"[1988] Proceedings. Computer Networking Symposium","volume":"29 3","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1988-04-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114021948","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
A knowledge-based protocol engineering environment 基于知识的协议工程环境
[1988] Proceedings. Computer Networking Symposium Pub Date : 1988-04-11 DOI: 10.1109/CNS.1988.4995
I. B. Neumeier-Mackert, L. Mackert, A. Fleischmann
{"title":"A knowledge-based protocol engineering environment","authors":"I. B. Neumeier-Mackert, L. Mackert, A. Fleischmann","doi":"10.1109/CNS.1988.4995","DOIUrl":"https://doi.org/10.1109/CNS.1988.4995","url":null,"abstract":"The authors present the design of a knowledge-based protocol engineering environment. The appropriateness of artificial-intelligence techniques for such an environment is discussed and a system architecture is presented, which is a synthesis between conventional and knowledge-based technology. Algorithms are given for producing the heart of the environment, a protocol expert system, semi-automatically. Current experience suggests that this approach is applicable to complex, real-world protocols.<<ETX>>","PeriodicalId":112149,"journal":{"name":"[1988] Proceedings. Computer Networking Symposium","volume":"11 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":"115651868","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
下一页 尾页
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学术官方微信