{"title":"Extending an existing mail service to support X.400 message handling","authors":"W. F. Racke, K. Fischer","doi":"10.1109/CNS.1988.5003","DOIUrl":"https://doi.org/10.1109/CNS.1988.5003","url":null,"abstract":"The authors discuss the design and implementation of a prototype X.400 message-handling system for IBM's VM/SP operating system. The system is designed to provide an X.400 extension to the mail service of the professional office system PROFS. For the PROFS user the X.400 extension is transparently integrated into the PROFS user interface. The system allows the use of native X.400 services for interpersonal messaging and therefore is not a gateway between PROFS and X.400 protocols. The system consists of a user agent and a message transfer agent, which implement the X.400 P2 and P1 protocols.<<ETX>>","PeriodicalId":112149,"journal":{"name":"[1988] Proceedings. Computer Networking Symposium","volume":"9 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":"133606420","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":"Congestion avoidance in computer networks with a connectionless network layer: concepts, goals and methodology","authors":"Raj Jain, K. Ramakrishnan","doi":"10.1109/CNS.1988.4990","DOIUrl":"https://doi.org/10.1109/CNS.1988.4990","url":null,"abstract":"The authors compare the concept of congestion with that of flow control and congestion control. A number of possible alternatives for congestion avoidance are identified. From these a few are selected for study. The criteria for selection and goals for these schemes are described. In particular, the authors wanted the scheme to be globally efficient, fair, dynamic, convergent, robust, distributed, configuration-independent, etc. They model the network and the user policies for congestion avoidance as a feedback control system. The key components of a generic congestion-avoidance scheme are congestion detection, congestion feedback, feedback selector, signal filter, decision function, and increase/decrease algorithms.<<ETX>>","PeriodicalId":112149,"journal":{"name":"[1988] Proceedings. Computer Networking Symposium","volume":"258 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":"133217368","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":"Measurements of a transport implementation running over an IEEE 802.3 local area network","authors":"S. Heatley, D. Stokesberry","doi":"10.1109/CNS.1988.4975","DOIUrl":"https://doi.org/10.1109/CNS.1988.4975","url":null,"abstract":"The authors assess the performance of a typical commercially available implementation of the lower four layers of the Open System Interconnection (OSI) reference model (transport, network, data link, and physical). One-way delay and throughput measurements are reported for the Intel 310 microcomputer system running the iNA960 implementation of OSI transport over an IEEE 802.3 CSMA/CD (carrier-sense multiple-access with collision detection) local area network. The minimum one-way delay versus message size for various combinations of the lower four OSI layers is shown. These results show the increase in delay associated with increased protocol services. The maximum throughput for the Transport Class 4 service is reported and the effect of the main factors affecting maximum throughput is captured in a set of equations that are applicable to many implementations of transport and below.<<ETX>>","PeriodicalId":112149,"journal":{"name":"[1988] Proceedings. Computer Networking Symposium","volume":"47 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":"125936353","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":"Performance analysis of integrated voice/data services on a burst-switched network","authors":"B.N.W. Ma, J. Mark","doi":"10.1109/CNS.1988.4973","DOIUrl":"https://doi.org/10.1109/CNS.1988.4973","url":null,"abstract":"An approximate analysis method is developed for the performance evaluation of data in an integrated voice/data services burst-switched network. The method is based on the fluid approximation model. A set of differential equations can be set up from this model. By estimating appropriate boundary conditions, these differential equations can be solved numerically. Numerical results indicate that the approximate analysis method yields quite accurate results in the region of practical interests.<<ETX>>","PeriodicalId":112149,"journal":{"name":"[1988] Proceedings. Computer Networking Symposium","volume":"74 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":"129754173","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":"Performance evaluation of a hierarchical hybrid adaptive routing algorithm for large scale computer communication networks","authors":"F. Amer, Y. Lien, A. Ghieth","doi":"10.1109/CNS.1988.5005","DOIUrl":"https://doi.org/10.1109/CNS.1988.5005","url":null,"abstract":"A hierarchical hybrid adaptive routing algorithm (HHARA) is presented for dynamic large-scale computer communication networks (LSCCN). The performance of the proposed algorithm is evaluated and compared to that of nonhierarchical routing algorithms by simulation experiments on a 50-node network model. The major evaluation criteria are reliability, communication overhead, computation overhead, and average packet delay. A fixed routing algorithm, the most recent ARPANET routing algorithm, and HHARA are compared using simulation experiments. The simulation study indicates that HHARA makes a good balance between the reduction of routing database maintenance overhead, and the global routing capability as well as the local adaptivity to the network changes.<<ETX>>","PeriodicalId":112149,"journal":{"name":"[1988] Proceedings. Computer Networking Symposium","volume":"46 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":"131083336","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 functional and performance comparison of NETBIOS and APPC/PC","authors":"D. Lide, D. Walters","doi":"10.1109/CNS.1988.5002","DOIUrl":"https://doi.org/10.1109/CNS.1988.5002","url":null,"abstract":"The purpose of this study was to gather empirical performance data in order to help design and develop distributed systems. In particular, the authors were interested in peer-to-peer processing capabilities in support of such applications as real-time control and transaction processing services. They evaluated the processing to perform these capabilities, the complexity in interfacing to the protocol, and parameters such as buffer sizes which impact performance. The basic approach taken in the study was to develop a network testbed and perform a series of benchmarks on the protocols. The IEEE 802.5 token ring local area network (LAN) was chosen for the testbed. An overview and functional comparison of the two protocols are presented. The complexity of the software required to interface an application to these communications protocols is described and evaluated. The performance tests are described and their results are interpreted. The results provide an understanding of the services provided by these protocols, the software complexity of interfacing them, and quantitative measures of their performance.<<ETX>>","PeriodicalId":112149,"journal":{"name":"[1988] Proceedings. Computer Networking Symposium","volume":"72 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":"127244842","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":"Communication and computation tradeoffs for a network of intelligent sensors","authors":"Y.-C. Cheng, T. Robertazzi","doi":"10.1109/CNS.1988.4992","DOIUrl":"https://doi.org/10.1109/CNS.1988.4992","url":null,"abstract":"A linear network of intelligent sensors is examined. The objective is to solve a computational problem in a minimal amount of time. The sensors in the networks can be equipped either with front-end processors for communication off-loading or without front-end processors. The cases of equal division of processing load and optimal division of processing load are discussed for both the network with front-end processors and the network without front-end processors. An example of the inclusion of the solution time, the time taken for sensors to report the solution back to originator, is also presented.<<ETX>>","PeriodicalId":112149,"journal":{"name":"[1988] Proceedings. Computer Networking Symposium","volume":"24 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":"124292013","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":"Cut-through switching for integrated services packet networks","authors":"M. Ilyas, S. Bhatia","doi":"10.1109/CNS.1988.5019","DOIUrl":"https://doi.org/10.1109/CNS.1988.5019","url":null,"abstract":"The authors extend cut-through switching to integrated voice and data networks. In this technique, packets traveling through a network need not wait and be error-checked at intermediate nodes; they bypass free nodes after a minimal processing necessary for identification of address. Voice is assumed to be packetized. Computer simulation is used for analyzing the network behavior as an analytical model is mathematically intractable. The performance parameters include network throughput, average delay for both voice and data packets and power. The study shows that cut-through switching technique is particularly useful for integrated voice and data packet network.<<ETX>>","PeriodicalId":112149,"journal":{"name":"[1988] Proceedings. Computer Networking Symposium","volume":"2 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":"122061990","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":"Implementation of encryption services in the OSI upper layers","authors":"A. Lombardo, E. Merelli, S. Palazzo","doi":"10.1109/CNS.1988.4986","DOIUrl":"https://doi.org/10.1109/CNS.1988.4986","url":null,"abstract":"The authors deal with a proposal to implement an encryption service in the framework of the ISO Open Systems Interconnection (OSI) architectural model. In particular, some mechanisms for the integration of encryption provision into the OSI upper layers are proposed, showing how they can be fairly fitted in the relevant protocols and services currently defined for the presentation and application layers.<<ETX>>","PeriodicalId":112149,"journal":{"name":"[1988] Proceedings. Computer Networking Symposium","volume":"150 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":"123226442","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}
U. Mukherji, N. Maxemchuk, C.W. Wu, J. Swartzwelder
{"title":"Transmission format and receiver logic for random access strategies in a fiber-optic network","authors":"U. Mukherji, N. Maxemchuk, C.W. Wu, J. Swartzwelder","doi":"10.1109/CNS.1988.4981","DOIUrl":"https://doi.org/10.1109/CNS.1988.4981","url":null,"abstract":"In a random access, packet transmission system, the transmission from a source may overlap with, preempt, or be preempted by, transmission from other sources. A receiver must be able to accept the data contents of only all those packets that are uncorrupted. A solution to the bit-synchronous, digital logic aspects of this problem is presented that is based on a simple choice for transmission format and receiver logic. This format is being implemented for use in an experimental, high speed, fiber-optic, unidirectional bus network that is expected to support a variety of random-access strategies.<<ETX>>","PeriodicalId":112149,"journal":{"name":"[1988] Proceedings. Computer Networking Symposium","volume":"27 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":"121165922","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}