The performance of a network based computing system that consists of a number of clients and a server, interconnected by a local area network, is studied. Each client represents a diskless or swapful workstation, or an X terminal, and generates application workload using either a conventional UNIX file system or the Network File System (NFS). To characterize the application workload and the effect of the protocol (login, rlogin, NFS), the user interface (workstation, X terminal) and its configuration (memory size, disk storage), a series of measurement experiments was performed in a controlled environment. During each experiment the traffic on the network and the activity on the various system resources were monitored. The measurements obtained are used to parameterize a queuing network model of the system, which is then used to project the performance of the system under various load conditions, to identify system bottlenecks, and to compare design alternatives.<>
{"title":"Analysis of a local computer network with workstations and X terminals","authors":"E. Drakopoulos","doi":"10.1109/LCN.1992.228157","DOIUrl":"https://doi.org/10.1109/LCN.1992.228157","url":null,"abstract":"The performance of a network based computing system that consists of a number of clients and a server, interconnected by a local area network, is studied. Each client represents a diskless or swapful workstation, or an X terminal, and generates application workload using either a conventional UNIX file system or the Network File System (NFS). To characterize the application workload and the effect of the protocol (login, rlogin, NFS), the user interface (workstation, X terminal) and its configuration (memory size, disk storage), a series of measurement experiments was performed in a controlled environment. During each experiment the traffic on the network and the activity on the various system resources were monitored. The measurements obtained are used to parameterize a queuing network model of the system, which is then used to project the performance of the system under various load conditions, to identify system bottlenecks, and to compare design alternatives.<<ETX>>","PeriodicalId":249184,"journal":{"name":"[1992] Proceedings 17th Conference on Local Computer Networks","volume":"76 12","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1992-09-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120979417","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}
A multichannel LAN based on a ring topology is proposed. This LAN, the multichannel token ring (MCTR), is designed to meet the demand for additional bandwidth while preserving, as much as possible, existing hardware and software. An emerging technology, wavelength division multiplexing (WDM), is reviewed as a candidate technology for implementing the multiple channels of the MCTR over a single fiber optic cable. When compared to single-channel LANs, the MCTR is shown to offer increased reliability, bandwidth scalability, and price-performance advantages.<>
{"title":"Parallel channel token ring local area networks","authors":"Kenneth J. Christensen, F. Noel","doi":"10.1109/LCN.1992.228135","DOIUrl":"https://doi.org/10.1109/LCN.1992.228135","url":null,"abstract":"A multichannel LAN based on a ring topology is proposed. This LAN, the multichannel token ring (MCTR), is designed to meet the demand for additional bandwidth while preserving, as much as possible, existing hardware and software. An emerging technology, wavelength division multiplexing (WDM), is reviewed as a candidate technology for implementing the multiple channels of the MCTR over a single fiber optic cable. When compared to single-channel LANs, the MCTR is shown to offer increased reliability, bandwidth scalability, and price-performance advantages.<<ETX>>","PeriodicalId":249184,"journal":{"name":"[1992] Proceedings 17th Conference on Local Computer Networks","volume":"77 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1992-09-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115984621","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. J. Betancor, J. Martin-Bernardo, A. Santamaria, V. M. Melián, F. J. López-Hernández
The design and implementation of a RS-232/RS-423/RS-422 (115200-Bd) modem which uses a wireless infrared link are discussed. This kind of system presents some advantages over the conventional cable systems or radio systems. When IREDs are used, the radiation is negligible for the users and harmless. These systems can be used to link two buildings (point-to-point) or to avoid cables inhouse environments such as laboratories or computer centers (diffuse or quasi diffuse).<>
{"title":"Infrared wireless system for high speed RS-232/RS-423/RS-422 communications","authors":"M. J. Betancor, J. Martin-Bernardo, A. Santamaria, V. M. Melián, F. J. López-Hernández","doi":"10.1109/LCN.1992.228150","DOIUrl":"https://doi.org/10.1109/LCN.1992.228150","url":null,"abstract":"The design and implementation of a RS-232/RS-423/RS-422 (115200-Bd) modem which uses a wireless infrared link are discussed. This kind of system presents some advantages over the conventional cable systems or radio systems. When IREDs are used, the radiation is negligible for the users and harmless. These systems can be used to link two buildings (point-to-point) or to avoid cables inhouse environments such as laboratories or computer centers (diffuse or quasi diffuse).<<ETX>>","PeriodicalId":249184,"journal":{"name":"[1992] Proceedings 17th Conference on Local Computer Networks","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1992-09-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122186260","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}
The digital signature is an ideal mechanism for authenticating with computer-generated messages. Recently, as enhanced network services have developed, the importance of a high-speed digital signature has become apparent. Previously, the best secure scheme of knowing digital signature systems has been RSA. However, this scheme has a problem in that the processing speed for generating signature messages is slow. A high-speed digital signature scheme is proposed to solve these problems. The proposed scheme has the security level even with the difficulty of factoring in large numbers. This scheme is based on a congruent polynomial of low degree to high processing speed. A random number is used in the generation of the signature, and inequality is used in verification. This scheme is compared with the RSA scheme to evaluate its performance.<>
{"title":"The new high-speed digital signature","authors":"P. Moon, J. Lee, Moon-Suk Jun, C. H. Lee","doi":"10.1109/LCN.1992.228123","DOIUrl":"https://doi.org/10.1109/LCN.1992.228123","url":null,"abstract":"The digital signature is an ideal mechanism for authenticating with computer-generated messages. Recently, as enhanced network services have developed, the importance of a high-speed digital signature has become apparent. Previously, the best secure scheme of knowing digital signature systems has been RSA. However, this scheme has a problem in that the processing speed for generating signature messages is slow. A high-speed digital signature scheme is proposed to solve these problems. The proposed scheme has the security level even with the difficulty of factoring in large numbers. This scheme is based on a congruent polynomial of low degree to high processing speed. A random number is used in the generation of the signature, and inequality is used in verification. This scheme is compared with the RSA scheme to evaluate its performance.<<ETX>>","PeriodicalId":249184,"journal":{"name":"[1992] Proceedings 17th Conference on Local Computer Networks","volume":"47 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1992-09-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129054054","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}
A graphical user interface program that uses a ray tracing algorithm to predict the radio propagation in the indoor radio channel from the layout of the floor plan is presented. The program allows the user to interactively specify the location of the walls in the floor plan, the type of material in the construction, and the location of the radio transmitter and receiver. The ray tracing algorithm determines the magnitude, phase, time of arrival, and direction of every signal path between the specified radio transmitter and receiver when an RF pulse is transmitted. The accuracy of the model is examined by comparing the simulation results with results of empirical measurements made in a complex laboratory environment.<>
{"title":"A computer graphics package for indoor radio channel simulation using a 2D ray tracing algorithm","authors":"T. Holt, K. Pahlavan, Jintae Lee","doi":"10.1109/LCN.1992.228149","DOIUrl":"https://doi.org/10.1109/LCN.1992.228149","url":null,"abstract":"A graphical user interface program that uses a ray tracing algorithm to predict the radio propagation in the indoor radio channel from the layout of the floor plan is presented. The program allows the user to interactively specify the location of the walls in the floor plan, the type of material in the construction, and the location of the radio transmitter and receiver. The ray tracing algorithm determines the magnitude, phase, time of arrival, and direction of every signal path between the specified radio transmitter and receiver when an RF pulse is transmitted. The accuracy of the model is examined by comparing the simulation results with results of empirical measurements made in a complex laboratory environment.<<ETX>>","PeriodicalId":249184,"journal":{"name":"[1992] Proceedings 17th Conference on Local Computer Networks","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1992-09-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126820273","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}
A simple, highly flexible admission control algorithm for ATM-based B-ISDN, known as the effective-bit-rate/table-lookup (EBR/TL) method, is proposed. An EBR method works by allocating bandwidth using a percentage, a(0>
{"title":"An effective bit rate/table lookup based admission control algorithm for the ATM B-ISDN","authors":"Ken DuBose, Hyong S. Kim","doi":"10.1109/LCN.1992.228178","DOIUrl":"https://doi.org/10.1109/LCN.1992.228178","url":null,"abstract":"A simple, highly flexible admission control algorithm for ATM-based B-ISDN, known as the effective-bit-rate/table-lookup (EBR/TL) method, is proposed. An EBR method works by allocating bandwidth using a percentage, a(0<a<or=100%), and multiplying this percentage by the traffic source's peak rate to yield the amount of bandwidth to allocate to a new connection. EBR percentages are based on studies performed offline which take into account the behavior of specific traffic types under various network load conditions. How traffic types can be classified in order to maintain reasonable table sizes is discussed. The results of a simulation study involving the EBR/TL method, in which a network configuration of multiple nodes is studied using a mix of several different traffic types and statistical models, are presented.<<ETX>>","PeriodicalId":249184,"journal":{"name":"[1992] Proceedings 17th Conference on Local Computer Networks","volume":"65 3","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1992-09-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120892766","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}
A possible network architecture suitable for a next-generation follow-up to FDDI Is presented. The solution can be scaled-up to arbitrary transmission rates (limited only by the technological barriers) and arbitrarily long networks. The protocol allows every station to transmit when the ring is silent, even when the station is not in possession of the token. The resulting token-passing protocol yields a capacity-1 network irrespective of the value of TTRT. Additionally, stations endure a very small access delay under light load. The need to single out synchronous traffic is eliminated, guaranteeing each station the right to transmit at fixed intervals. This modification allows graceful station insertion and deletion; moreover, the recovery of a lost token can be done on the fly without disrupting the operation of the network.<>
{"title":"Towards a gigabit FDDI","authors":"W. Dobosiewicz, P. Gburzynski","doi":"10.1109/LCN.1992.228132","DOIUrl":"https://doi.org/10.1109/LCN.1992.228132","url":null,"abstract":"A possible network architecture suitable for a next-generation follow-up to FDDI Is presented. The solution can be scaled-up to arbitrary transmission rates (limited only by the technological barriers) and arbitrarily long networks. The protocol allows every station to transmit when the ring is silent, even when the station is not in possession of the token. The resulting token-passing protocol yields a capacity-1 network irrespective of the value of TTRT. Additionally, stations endure a very small access delay under light load. The need to single out synchronous traffic is eliminated, guaranteeing each station the right to transmit at fixed intervals. This modification allows graceful station insertion and deletion; moreover, the recovery of a lost token can be done on the fly without disrupting the operation of the network.<<ETX>>","PeriodicalId":249184,"journal":{"name":"[1992] Proceedings 17th Conference on Local Computer Networks","volume":"46 1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1992-09-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124127802","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}
Broadband ATM networks at multi-megabit data rates will provide the necessary bandwidth for high-quality interactive video applications. Performance requirements for high-quality video services are introduced. Results of statistical simulations of broadband networks transmitting video signals are shown to demonstrate that VBR coding provides gains in multiplexed channel utilization and in access link capacity. Issues relating to protocol design for ATM networks, particularly congestion control and error control, are introduced. Various techniques for handling cell loss are compared.<>
{"title":"Issues in video transmission over broadband ATM networks","authors":"T. Mitchell, S. Blake","doi":"10.1109/LCN.1992.228147","DOIUrl":"https://doi.org/10.1109/LCN.1992.228147","url":null,"abstract":"Broadband ATM networks at multi-megabit data rates will provide the necessary bandwidth for high-quality interactive video applications. Performance requirements for high-quality video services are introduced. Results of statistical simulations of broadband networks transmitting video signals are shown to demonstrate that VBR coding provides gains in multiplexed channel utilization and in access link capacity. Issues relating to protocol design for ATM networks, particularly congestion control and error control, are introduced. Various techniques for handling cell loss are compared.<<ETX>>","PeriodicalId":249184,"journal":{"name":"[1992] Proceedings 17th Conference on Local Computer Networks","volume":"51 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1992-09-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122241097","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}
Several cell-based systems and discussed. The utility of these systems for voice video and data transmission is considered. It is suggested that statistical multiplexing of data and video information could be more effective if statistical characterization of such applications was more widely understood. Flow control and congestion control was useful additions to current system designs in some cases.<>
{"title":"DQDB, SMDS, B-ISDN and MAN","authors":"H. Salwen","doi":"10.1109/LCN.1992.228181","DOIUrl":"https://doi.org/10.1109/LCN.1992.228181","url":null,"abstract":"Several cell-based systems and discussed. The utility of these systems for voice video and data transmission is considered. It is suggested that statistical multiplexing of data and video information could be more effective if statistical characterization of such applications was more widely understood. Flow control and congestion control was useful additions to current system designs in some cases.<<ETX>>","PeriodicalId":249184,"journal":{"name":"[1992] Proceedings 17th Conference on Local Computer Networks","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1992-09-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127922816","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}
The design and implementation of a local area network architecture based on collision avoidance, called the collision avoidance multiple broadcast (CAMB) tree network, are described. The implementation follows the protocol layering architecture of the IEEE 802 local area networks and includes CAMB tree switches, station/network interface boards, and support of transport protocols. The performance measurements of the experimental CAMB tree network are presented.<>
{"title":"Design, implementation and measurement of a collision avoidance multiple broadcast tree network","authors":"H. Huang, T. Suda","doi":"10.1109/LCN.1992.228127","DOIUrl":"https://doi.org/10.1109/LCN.1992.228127","url":null,"abstract":"The design and implementation of a local area network architecture based on collision avoidance, called the collision avoidance multiple broadcast (CAMB) tree network, are described. The implementation follows the protocol layering architecture of the IEEE 802 local area networks and includes CAMB tree switches, station/network interface boards, and support of transport protocols. The performance measurements of the experimental CAMB tree network are presented.<<ETX>>","PeriodicalId":249184,"journal":{"name":"[1992] Proceedings 17th Conference on Local Computer Networks","volume":"94 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1992-09-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124373940","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}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：