{"title":"On the optimal dynamic switching of voice and data in communication networks","authors":"I. Viniotis, A. Ephremides","doi":"10.1109/CNS.1988.4971","DOIUrl":"https://doi.org/10.1109/CNS.1988.4971","url":null,"abstract":"The authors address the problem of determining optimal access policies for a tandem ISDN network. They adopt a Markovian model to characterize the statistical behavior of the multiplexed channels. Using linear and dynamic programming arguments, they show that the optimal policy has the form of a switching curve in the appropriate space.<<ETX>>","PeriodicalId":112149,"journal":{"name":"[1988] Proceedings. Computer Networking Symposium","volume":"40 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":"126084676","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":"Throughput analysis of Maxemchuk's integrated voice/data local area network protocol","authors":"R. Kohli, A.C. Mingo, K. Vastola","doi":"10.1109/CNS.1988.5016","DOIUrl":"https://doi.org/10.1109/CNS.1988.5016","url":null,"abstract":"The authors deal with the analysis of a protocol allowing mixed voice and data transmission by different users on a common channel. The protocol is able to bound the delay of voice packets in a local area network environment. The protocol is modelled as continuous-time Markov Chain. First, the throughput of this protocol is evaluated given that a known number of voice users are utilizing the channel. Secondly, the throughput is averaged over the different number of users possible to yield the overall throughput of the system. To do this, the probability distribution for the number of voice users on the channel is evaluated. The throughput is evaluated and discussed in some detail. Limitations of the model and related work are also discussed.<<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":"131811830","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":"NIDX-an expert system for real-time network intrusion detection","authors":"D. S. Bauer, M. Koblentz","doi":"10.1109/CNS.1988.4983","DOIUrl":"https://doi.org/10.1109/CNS.1988.4983","url":null,"abstract":"A knowledge-based prototype network intrusion detection expert system (NIDX) for the Unix System V environment is described. NIDX combines knowledge describing the target system, history profiles of users' past activities, and intrusion detection heuristics from a knowledge-based system capable of detecting specific violations that occur on the target system. Intrusions are detected by classifying user activity from a real-time audit trail of Unix system calls and then, using system-specific knowledge and heuristics about typical intrusions and attack techniques, determining whether or not the activity is an intrusion. The authors describe the NIDX knowledge base, and Unix system audit trail mechanism and history profiles , and demonstrate the knowledge-based intrusion detection process.<<ETX>>","PeriodicalId":112149,"journal":{"name":"[1988] Proceedings. Computer Networking Symposium","volume":"55 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":"128017075","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":"Operating telephone company MAN trials: data collection and analysis","authors":"L. Theisen, Y.C. Lee","doi":"10.1109/CNS.1988.5021","DOIUrl":"https://doi.org/10.1109/CNS.1988.5021","url":null,"abstract":"During 1986 and 1987 Bell Communications Research Inc., has conducted concept trials of MANs (metropolitan area networks) in the OTCs (operating telephone companies). These trials were the first attempt by OTCs to provide a high-speed packet-switched service to their customers. One of the objectives of these trials was to gather information about the MAN architecture, technologies, services, and customer usage and needs for high-speed data networking capabilities. In addition to supporting the analysis of OTC MANs, the data collected is applicable to analyzing general data networking concepts in the OCs. An overview of the MAN trial architecture and technology is presented, concentrating on the capabilities implemented for collecting data on the trial MAN technologies and services. The traffic data parameters and analysis performed are discussed. Finally, some initial results from the OC MAN trials are presented.<<ETX>>","PeriodicalId":112149,"journal":{"name":"[1988] Proceedings. Computer Networking Symposium","volume":"35 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":"121096179","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":"OSILAB: an OSI prototyping laboratory","authors":"E. Gregori, D. Latella, L. Lenzini, E. Merelli","doi":"10.1109/CNS.1988.5004","DOIUrl":"https://doi.org/10.1109/CNS.1988.5004","url":null,"abstract":"The need for the laboratory, named OSILAB, where researchers can carry out an ongoing experimental program dealing with OSI technology is discussed. The environment in which OSILAB operates is introduced in terms of its requirements, and consideration is given to choices that satisfy these requirements. Emphasis is then put on the implementation architecture of the presentation layer, commitment concurrency and recovery (CCR) and distributed directory system. Architectural and implementation issues are then described and results so far obtained are shown.<<ETX>>","PeriodicalId":112149,"journal":{"name":"[1988] Proceedings. Computer Networking Symposium","volume":"48 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":"126141093","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 game theoretic approach to flow control in an integrated environment with two classes of users","authors":"C. Doubligeris, R. Mazumdar","doi":"10.1109/CNS.1988.4999","DOIUrl":"https://doi.org/10.1109/CNS.1988.4999","url":null,"abstract":"With the power as the performance criterion, a game-theoretical approach is proposed and analyzed. A network or system optimization solution leads to a Pareto optimal point. In a user or individual optimization setting the Nash and the Stackelberg equilibria are found. A decentralized and easily implementable algorithm is proved to converge to the Nash equilibrium. The choice of the strategy to be used depends on the particular application and the desirable overall performance.<<ETX>>","PeriodicalId":112149,"journal":{"name":"[1988] Proceedings. Computer Networking Symposium","volume":"6 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":"130924319","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":"An evolution towards ubiquitous wideband metropolitan area networks and wide area networks","authors":"M. Kramer, W. Johnston","doi":"10.1109/CNS.1988.5015","DOIUrl":"https://doi.org/10.1109/CNS.1988.5015","url":null,"abstract":"The authors explore the prospects of a relatively rapid evolution to public broadband data services. They define some guidelines for the support of broadband services and survey some network architectures that could support those services, with an emphasis on near-term deployability. They suggest how this base capability can evolve further to adapt to changing requirements.<<ETX>>","PeriodicalId":112149,"journal":{"name":"[1988] Proceedings. Computer Networking Symposium","volume":"51 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":"124264332","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":"Synthesizing protocol specifications from service specifications in FSM model","authors":"P. Chu, M.T. Liu","doi":"10.1109/CNS.1988.4994","DOIUrl":"https://doi.org/10.1109/CNS.1988.4994","url":null,"abstract":"The authors address the problem of deriving a protocol specification from a given service specification, which are both in the finite-state-machine (FSM) model. They provide an algorithm that yields protocol FSMs from a given service FSM in which the service model allows only sequential execution of service primitives at various service access points (SAPs). They then extend the service model to allow concurrent execution of service primitives at different SAPs, and the algorithm is also expanded to take care of the extended model. Finally, they present a procedure to construct an error-recoverable protocol from its error-free version generated from the proposed algorithm, thus enabling the algorithm to provide the generated protocol with error-recovery capability. Limitations of the model and the direction being taken in further work to relieve the limitations are stated.<<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":"131146558","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":"An improved model for service time on playthrough rings","authors":"H. Ghafir, C. B. Silio, M. Sui, E. Wasser","doi":"10.1109/CNS.1988.4982","DOIUrl":"https://doi.org/10.1109/CNS.1988.4982","url":null,"abstract":"Models are presented for message service time on playthrough rings, a class of multiserver computer communication subnetworks that uses circuit-switching on a ring topology. The playthrough protocol uses a perpetually circulating control token, source-removed update control messages, and destination removed data messages to provide concurrent transfer of multiple messages of arbitrary length on a single ring. Data messages share ring bandwidth with and are frequently interrupted at source transmitters by update control messages associated with other concurrent message transfers and the circulating token. The rate of interruptions to message service varies according to message outbound distance from source to destination. The authors use the concept of service completion time in a queuing system that experiences preemptive-resume interruption to predict mean and variance of message service time on playthrough rings for messages with geometrically distributed lengths. The models' predictions are validated using simulation data. These models are suited for use in analytical models for approximating queuing and total transfer times for messages.<<ETX>>","PeriodicalId":112149,"journal":{"name":"[1988] Proceedings. Computer Networking Symposium","volume":"7 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":"126888242","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 slotted ring with distributed buffering to enhance transmission concurrency and facilitate voice/data integration","authors":"G. E. Daddis, H. Torng","doi":"10.1109/CNS.1988.5017","DOIUrl":"https://doi.org/10.1109/CNS.1988.5017","url":null,"abstract":"An innovative local area network is presented which is based on a slotted ring with distributed frame buffering. The structure achieves three goals: efficient integration of circuit switching with packet switching; realization of a significant degree of transmission concurrency; and full utilization of the high bandwidth of optical fiber. Extensive computer simulations of the proposed structure and the token ring are carried out. Simulation results, which confirm expectations, are presented and discussed.<<ETX>>","PeriodicalId":112149,"journal":{"name":"[1988] Proceedings. Computer Networking Symposium","volume":"49 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":"126470849","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}