{"title":"XTP in VLSI protocol decomposition for ASIC implementation","authors":"W. Schwaderer","doi":"10.1109/LCN.1990.128666","DOIUrl":"https://doi.org/10.1109/LCN.1990.128666","url":null,"abstract":"The provision of VLSI support for protocols is viewed as an exercise in decomposition of protocol processing. The Xpress transfer protocol (XTP) is described as a representative protocol with some new features. A general-purpose VLSI architecture is described that supports XTP and other protocols. It is shown how the coupled protocol engine hardware and XTP protocol design achieves data rivering rates for multiple protocols at previously unachievable price performance levels.<<ETX>>","PeriodicalId":122950,"journal":{"name":"[1990] Proceedings. 15th Conference on Local Computer Networks","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1990-09-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128463193","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 a secure gateway on Hughes Aircraft's engineering design network","authors":"P. Ho","doi":"10.1109/LCN.1990.128656","DOIUrl":"https://doi.org/10.1109/LCN.1990.128656","url":null,"abstract":"The implementation of a secure gateway on the Ethernet-based engineering design network (EDEN) at Hughes Aircraft Company is described. The philosophy and approach of the implementation are outlined along with some of the limitations of the design in terms of overall security. The implementation meets most of the primary objectives of the initial design. The design is simple and elegant and also is flexible enough to easily add functions to the gateway which was indeed the case in later enhancements to the gateway. Some limitations in security can be controlled by careful monitoring of all nodes on the network.<<ETX>>","PeriodicalId":122950,"journal":{"name":"[1990] Proceedings. 15th Conference on Local Computer Networks","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1990-09-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127430143","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":"Ada-based real-time network environment","authors":"D. E. Dinschel, Peter S. S. Wang","doi":"10.1109/LCN.1990.128676","DOIUrl":"https://doi.org/10.1109/LCN.1990.128676","url":null,"abstract":"The design of communications architecture to support Ada-based, real-time, distributed processing systems is described. An implementation of this architecture compatible with the open systems interconnection (OSI) seven-layer reference model is discussed. The foundation Ada real-time network environment (FARNE) is designed and implemented to provide a standard network communications interface to the distributed Ada applications such as those found in tactical systems. FARNE is also designed to support the low latency communication requirements commonly associated with the embedded/tactical systems. The development of FARNE has evolved through several iterations. It currently supports both Unix environment and the embedded processors. FARNE has been tested using optical and nonoptical media. The design and implementation of the FARNE are presented. Key conclusions drawn from results of extensive performance tests and plans for future implementations and enhancements are discussed.<<ETX>>","PeriodicalId":122950,"journal":{"name":"[1990] Proceedings. 15th Conference on Local Computer Networks","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1990-09-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121254580","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":"Internetworking dissimilar LANs with FDDI","authors":"Gershon Schatzberg","doi":"10.1109/LCN.1990.128654","DOIUrl":"https://doi.org/10.1109/LCN.1990.128654","url":null,"abstract":"An overview is presented of some of the issues the potential implementor of a large internetwork based on the fiber distributed data interface (FDDI) backbones faces. The qualities of FDDI as a backbone are illustrated. A review of bridges and routers as they relate to the requirements from the internetwork is presented. Available bridging methods are presented and evaluated. A number of issues particular to bridging FDDI to other LAN technologies are discussed.<<ETX>>","PeriodicalId":122950,"journal":{"name":"[1990] Proceedings. 15th Conference on Local Computer Networks","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1990-09-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121652882","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":"Register insertion/self-token protocol for high speed ring LANs","authors":"T. Taketa, K. Tanno","doi":"10.1109/LCN.1990.128641","DOIUrl":"https://doi.org/10.1109/LCN.1990.128641","url":null,"abstract":"A new ring access control scheme adopting a multiple-token protocol is investigated. In this protocol, each station distributed on a ring has a private token, called self-token, and a fixed-length register to carry out the register insertion protocol. The protocol shows good properties for shorter packets, becoming more superior to the token-ring and the FDDI-I protocols as the packet length decreases. Simulation results show that the protocol is more suitable for high-speed LANs than the Fiber Distributed Data Interface (FDDI) protocol.<<ETX>>","PeriodicalId":122950,"journal":{"name":"[1990] Proceedings. 15th Conference on Local Computer Networks","volume":"191 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1990-09-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122872381","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":"Telefax in local area networks","authors":"B. Heinrichs, P. Martini","doi":"10.1109/LCN.1990.128682","DOIUrl":"https://doi.org/10.1109/LCN.1990.128682","url":null,"abstract":"The integration of group 4 facsimile in local area networks (LANs) based on carrier-sense multiple-access with collision detection (CSMA/CD) is studied. A simulation program yields performance characteristics such as message and packet transmission delays, channel access delays and average throughput. Traffic on the LAN is modeled by group 4 fax generators and so-called base load generators. Both classical Poisson processes and interrupted Poisson processes are studied. A comparison of the simulation results shows the impact of the kind of base load generation on facsimile service. The sensitivity to the intensity of the generated facsimile and base load and to flow control mechanisms implemented on logical link control (LLC) or transport layer is evaluated.<<ETX>>","PeriodicalId":122950,"journal":{"name":"[1990] Proceedings. 15th Conference on Local Computer Networks","volume":"40 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1990-09-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126968709","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 efficient implementation of a high-speed protocol without data copying","authors":"Xi Zhang, A. Seneviratne","doi":"10.1109/LCN.1990.128664","DOIUrl":"https://doi.org/10.1109/LCN.1990.128664","url":null,"abstract":"An efficient approach for implementing a method of minimizing data copying developed by M.L. Woodside et al. (1989) is advocated. The method, referred to as buffer cut through (BCT), allows the passing of data buffer through layers without copying, relying on the principle of passing responsibility for the buffer from one layer to another. The method proposed for the implementation of BCT is the upcall approach of D. Clark (1985) which permits the use of efficient synchronous procedure calls. Arguments are presented to justify the idea that an upcall approach can support the implementation of BCT. A proposed BCT implementation scheme within the PC transmission control protocol/internet protocol (TCP/IP) using upcalls is presented. It is also concluded that uniform layer interface with m-map upcall can be a general solution to software communications between network layers.<<ETX>>","PeriodicalId":122950,"journal":{"name":"[1990] Proceedings. 15th Conference on Local Computer Networks","volume":"61 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1990-09-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132083042","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":"Frame content independent stripping for token rings","authors":"K. Ramakrishnan, Henry S. Yang","doi":"10.1109/LCN.1990.128687","DOIUrl":"https://doi.org/10.1109/LCN.1990.128687","url":null,"abstract":"A frame content independent stripping (FCIS) algorithm for token rings is described that can be used by source-routing bridges due to its simplicity and the fact that the resulting size of the fragments remaining on the ring is very small. The FCIS algorithm counts the number of outstanding frames that a station has transmitted but not yet stripped from the ring and in addition places a global delimiter such as a void frame at the end of the transmission of the information frames. The station then stops stripping when either the count goes to zero or when the void frame or token is received by the station. The algorithm is simple to implement and does not place any topological restrictions on the network. It also allows for interoperation with stations which do not implement the FCIS algorithm. With the FCIS algorithm, frames are stripped at the earliest possible moment. It is shown that the combination of both the count and void is necessary for an FCIS algorithm by demonstrating that the inclusion of either just the void or the count could result in considerable overstripping of frames on the ring due to errors on the ring. The void frame adds a total of 28 bytes of overhead to every transmission opportunity at a participating station.<<ETX>>","PeriodicalId":122950,"journal":{"name":"[1990] Proceedings. 15th Conference on Local Computer Networks","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1990-09-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122418136","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 of the Xpress transfer protocol in an Ethernet environment","authors":"Jing Chen, J. Atwood","doi":"10.1109/LCN.1990.128672","DOIUrl":"https://doi.org/10.1109/LCN.1990.128672","url":null,"abstract":"A simulation analysis is presented of the performance of the Xpress transfer protocol (XTP), a high-speed protocol intended for fiber distributed data interface (FDDI) or Ethernet environments. The local area network simulation facility (LANSF) is modified to support virtual circuit simulation, and then used to obtain the XTP performance statistics. The chosen simulation LAN environment is Ethernet. The analysis of XTP shows that it can provide high throughput to transport users for bulk data movement operations such as file transfer. Its bandwidth for short transfers is limited by the necessity of carrying the overhead of packet headers, packet trailers, and acknowledgment packets. However, it is not worse than most other protocols in this respect.<<ETX>>","PeriodicalId":122950,"journal":{"name":"[1990] Proceedings. 15th Conference on Local Computer Networks","volume":"47 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1990-09-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131642005","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":"LAN traffic analysis and workload characterization","authors":"K. Khalil, K. Luc, D. V. Wilson","doi":"10.1109/LCN.1990.128647","DOIUrl":"https://doi.org/10.1109/LCN.1990.128647","url":null,"abstract":"The results of a LAN traffic analysis are studied in order to characterize the workload in a typical Ethernet environment and to examine the mathematical modeling assumptions that are made regarding packet arrivals, packet size distributions, and user access patterns. These results show that the packet size distribution is application dependent and may not always follow a bimodal pattern. The overall packet arrival distribution is not Poisson, as is generally assumed, and is directly related to the network load. During the heavy load hours, the packet arrival process is strictly Poisson. On the other hand, during the light load periods, the hypothesis that the arrival process is Poisson is statistically rejected.<<ETX>>","PeriodicalId":122950,"journal":{"name":"[1990] Proceedings. 15th Conference on Local Computer Networks","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1990-09-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133483119","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}