{"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}
{"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}
{"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}
{"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}
{"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}
{"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}
{"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}
{"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}
{"title":"Multicast routing in bus-based computer networks","authors":"P. McKinley, J.W.-S. Liu","doi":"10.1109/CNS.1988.5006","DOIUrl":"https://doi.org/10.1109/CNS.1988.5006","url":null,"abstract":"The authors address multicast routing of integrated voice, video, and messages in bus-based computer networks, particularly in grids of buses. Graph theoretical formulations of the multicast routing problem are presented and an algorithm is given that produces optimal multicast routes in grids of buses. The performance of this algorithm is compared with that of heuristic algorithms. Finally, the bilevel grid, a hierarchical grid topology, is described, and an algorithm is given that produces optimal multicast routes in such networks.<<ETX>>","PeriodicalId":112149,"journal":{"name":"[1988] Proceedings. Computer Networking Symposium","volume":"25 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":"131850259","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}
{"title":"Ethernet with segmented carrier","authors":"W. Dobosiewicz, P. Gburzynski","doi":"10.1109/CNS.1988.4979","DOIUrl":"https://doi.org/10.1109/CNS.1988.4979","url":null,"abstract":"Two variations of a local area network based on a modified concept of Ethernet are presented. Unlike many other concepts (e.g. collision-free protocols, or the so-called new-generation collision protocols) the proposed modifications are simple, realistic and inexpensive. In particular, the essence of the CSMA/CD (carrier-sense multiaccess with collision detection) protocol is retained. The simpler of the two methods, called SCS (single carrier with segmentation), operates almost exactly as the standard Ethernet. The second network, DCS (double carrier with segmentation), is particularly interesting, as (despite the collision protocol) its asymptotic effective throughput turns out to be equal to the capacity of the carrier. The performance of both networks is demonstrated to be superior to the performance of the standard Ethernet.<<ETX>>","PeriodicalId":112149,"journal":{"name":"[1988] Proceedings. Computer Networking Symposium","volume":"14 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":"132751225","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}