{"title":"Comparison of DQDB and FDDI MAC access protocols","authors":"S. Ghani, M. Schwartz","doi":"10.1109/LCN.1991.208053","DOIUrl":"https://doi.org/10.1109/LCN.1991.208053","url":null,"abstract":"A comparison of the MAC access protocols of the IEEE 802.6 DQDB MAN and FDDI standards is presented. The results are derived from simulation studies, and verified by analytical approximations. The comparison is based on average packet access delays of nodes on DQDB and FDDI networks. By setting the available bandwidth of the two networks to be equal, the authors draw broad conclusions regarding the relative strengths and weaknesses of each protocol. The results show the relative effect of varying various network parameters such as token rotation time, geographic size of the network, number of stations and total bandwidth on packet delay for the two protocols.<<ETX>>","PeriodicalId":163373,"journal":{"name":"[1991] Proceedings 16th Conference on Local Computer Networks","volume":"189 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1991-10-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127036529","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":"The evolution of FDDI at CERN and Digital Equipment Corporation's participation","authors":"Greg Grajew","doi":"10.1109/LCN.1991.208083","DOIUrl":"https://doi.org/10.1109/LCN.1991.208083","url":null,"abstract":"In 1987, CERN (European Laboratory for Particle Physics) began investigating FDDI technology. This was due to the increasing load on the then ethernet backbone, due to the LEP accelerator. CERN began to seek an alternative high-speed industry standard for their backbone. In an open environment such as CERN, this is of crucial importance. Moreover this key factor of interoperability amongst different vendors obviated early considerations of existing non-standard technologies. The author provides a brief overview of some of the highlights of operating FDDI in a multivendor environment.<<ETX>>","PeriodicalId":163373,"journal":{"name":"[1991] Proceedings 16th Conference on Local Computer Networks","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1991-10-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131364094","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":"Management of switched multimegabit data service (SMDS) using the simple network management protocol (SNMP)","authors":"Jeffrey D. Case","doi":"10.1109/LCN.1991.208087","DOIUrl":"https://doi.org/10.1109/LCN.1991.208087","url":null,"abstract":"The emerging switched multimegabit data service (SMDS) and the simple network management protocol (SNMP) are being coupled together, providing the opportunity for unique management capabilities. These unique capabilities include mechanisms for customers to retrieve management information directly from their SMDS service provider. It is also anticipated that the combination of SNMP and SMDS will lead to new opportunities for the SNMP management framework within telephony. This paper provides an overview of SMDS, SNMP, and the two is in combination. The challenges associated with using SNMP to manage SMDS are identified and discussed.<<ETX>>","PeriodicalId":163373,"journal":{"name":"[1991] Proceedings 16th Conference on Local Computer Networks","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1991-10-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131635133","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":"Conquering complexity: data networking trends as technology meets market reality","authors":"J. Hart","doi":"10.1109/LCN.1991.208042","DOIUrl":"https://doi.org/10.1109/LCN.1991.208042","url":null,"abstract":"Small data networks are usually easy to maintain. However, the cost of support for growing networks can start to increase exponentially. If allowed to continue, additional network expansion comes up against a limit known as the complexity barrier. It then becomes too costly to add new network capabilities. The article discusses how today's data networks can more adequately deal with complexity using existing technology, and how tomorrow's data networks will change using emerging technologies. Intended for networking professionals involved in the planning and implementation of current and future data networks, the article depicts a vision of how changes can simplify data networking across a variety of networking environments.<<ETX>>","PeriodicalId":163373,"journal":{"name":"[1991] Proceedings 16th Conference on Local Computer Networks","volume":"39 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1991-10-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131963044","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 parallel implementation of XTP on transputers","authors":"T. Braun, M. Zitterbart","doi":"10.1109/LCN.1991.208081","DOIUrl":"https://doi.org/10.1109/LCN.1991.208081","url":null,"abstract":"High performance communication systems have to provide very high data rates of more than 100 Mbit/s to new applications such as multimedia applications. To overcome the bottleneck in communication systems, the protocol processing of the layers above media access control layer, light weight protocols such as XTP (Xpress Transfer Protocol) are used. XTP is a protocol with functionality of layers three and four and was designed for protocol processing in reliable high speed networks such as FDDI, XTP is based on parallel finite state machines (FSMs) to support an efficient realization in VLSI. This paper presents a software implementation of XTP for a multiprocessor system. The implementation is based on these FSMs, which are mapped onto processes running on the processors of a multiprocessor architecture and communicating with each other by message passing.<<ETX>>","PeriodicalId":163373,"journal":{"name":"[1991] Proceedings 16th Conference on Local Computer Networks","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1991-10-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131052434","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 traffic control strategy for a DQDB-type MAN","authors":"R. Bolla, F. Davoli","doi":"10.1109/LCN.1991.208065","DOIUrl":"https://doi.org/10.1109/LCN.1991.208065","url":null,"abstract":"The joint problem of admission control of isochronous traffic and bandwidth sharing between isochronous and asynchronous traffic is addressed, in a MAN environment of the DQDB type. Local access controllers at the users' sites independently decide on the acceptance of each new isochronous call be applying a randomized decision rule. A central controller periodically reassigns bandwidth partitions (in slots/frame) between isochronous and asynchronous traffic, as well as upper bounds on the isochronous slots assigned on a per-user basis. This assignment is obtained by means of a parametric optimization that acts on a number of parameters characterizing the local decision rules, in order to minimize a suitable cost function, and depends on the overall system's state at the intervention time. The problem is formalized, and the application of a gradient projection method is considered, with cost functions spanning a finite or even infinite future time horizon.<<ETX>>","PeriodicalId":163373,"journal":{"name":"[1991] Proceedings 16th Conference on Local Computer Networks","volume":"20 4","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1991-10-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132236969","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 comparison of DQDB and FDDI for integrated networks","authors":"F. Tari, V. Frost","doi":"10.1109/LCN.1991.208054","DOIUrl":"https://doi.org/10.1109/LCN.1991.208054","url":null,"abstract":"The performance of two high speed network protocols, IEEE 802.6 distributed queue dual bus MAN and fiber distributed data interface are compared based on their ability to support integrated traffic. The comparison includes the asynchronous priority characteristics of the two protocols as well as the performance characteristics of their isochronous service classes. In the integrated network considered, voice stations are assigned to the isochronous class of both protocols. Video sources, which are models of video CODEC systems for ATM environments, are given the highest priority of the asynchronous class for both protocols. The asynchronous data traffic is distributed equally among three asynchronous classes. The two protocols are then compared on the basis of their throughput, delay, network utilization, and fairness.<<ETX>>","PeriodicalId":163373,"journal":{"name":"[1991] Proceedings 16th Conference on Local Computer Networks","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1991-10-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130147137","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}
Eric C. Cooper, O. Menzilcioglu, Robert D. Sansom, F. Bitz
{"title":"Host interface design for ATM LANs","authors":"Eric C. Cooper, O. Menzilcioglu, Robert D. Sansom, F. Bitz","doi":"10.1109/LCN.1991.208071","DOIUrl":"https://doi.org/10.1109/LCN.1991.208071","url":null,"abstract":"ATM (asynchronous transfer mode) is an international telecommunications standard designed for broadband integrated services; it is also well-suited for use within local-area networks. ATM LANs can provide the networking support needed for multimedia communication at rates of 100 Mbits/sec and higher. The authors first analyze the protocol processing required to handle ATM communication. Based on this analysis, they then discuss the architectural issues in the design of host interfaces for ATM local-area networks. In particular, they conclude that a simple host interface, which leaves most of the ATM protocol processing to be done by the host computer, supports good performance for data communication (around 100 Mbits/sec). However, to support real-time video and audio communication, the ATM interface should include an embedded processor.<<ETX>>","PeriodicalId":163373,"journal":{"name":"[1991] Proceedings 16th Conference on Local Computer Networks","volume":"52 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1991-10-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116300184","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}
M. Willebeek-LeMair, K. B. Ocheltree, Antonio Ruiz
{"title":"Graceful insertion and removal of stations in FDDI networks","authors":"M. Willebeek-LeMair, K. B. Ocheltree, Antonio Ruiz","doi":"10.1109/LCN.1991.208102","DOIUrl":"https://doi.org/10.1109/LCN.1991.208102","url":null,"abstract":"The effects of station insertion and removal from concentrators attached to the dual ring in FDDI networks are examined. The frame-loss caused by the insertion and removal of stations is compared to the frame-loss caused by the ring bit error rate (BER). This is found to be significant for most FDDI networks. Algorithms for 'graceful' insertion and removal are proposed to minimize the impact of these actions on the network performance. The effect on the network bandwidth of the proposed solutions is compared to the effect of normal insertion and removal. Overall, the merits of graceful insertion and removal are found to be marginally significant.<<ETX>>","PeriodicalId":163373,"journal":{"name":"[1991] Proceedings 16th Conference on Local Computer Networks","volume":"39 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1991-10-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121792594","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":"Strategies for using multicasting to locate resources","authors":"C. Wills","doi":"10.1109/LCN.1991.208112","DOIUrl":"https://doi.org/10.1109/LCN.1991.208112","url":null,"abstract":"One issue in distributed computing systems is how to locate and manage resource information that is inherently distributed within the computing environment. The article investigates the use of a technique called multicasting for location of such distributed information. It presents three different strategies for using the resources contained by a machine to dynamically compute the multicast addresses on which the machine should listen for requests of the information. The central goal of these strategies is to filter out requests for resource information at the network interface of a machine so that a machine only receives a request for information if it contains the resource.<<ETX>>","PeriodicalId":163373,"journal":{"name":"[1991] Proceedings 16th Conference on Local Computer Networks","volume":"67 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1991-10-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125527263","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}