A performance measurement of the processing overhead of TCP/IP on personal computers interconnected by Ethernet is given. In this measurement of the processing overhead comes from TCP and the Ethernet device driver. For TCP, a large portion of the overhead comes from the checksum computation. Almost all overhead of the lower layer comes from moving data from the main memory to the Ethernet card. Hence, if the bus speed can be increased and the TCP checksum can be performed by hardware, the processing overhead generated from TCP/IP and lower layers can be greatly reduced. The results presented shed light on designing communication protocols on personal computers.<>
{"title":"On performance measurements of TCP/IP and its device driver","authors":"Jau-Hsiung Huang, Chi-Wen Chen","doi":"10.1109/LCN.1992.228142","DOIUrl":"https://doi.org/10.1109/LCN.1992.228142","url":null,"abstract":"A performance measurement of the processing overhead of TCP/IP on personal computers interconnected by Ethernet is given. In this measurement of the processing overhead comes from TCP and the Ethernet device driver. For TCP, a large portion of the overhead comes from the checksum computation. Almost all overhead of the lower layer comes from moving data from the main memory to the Ethernet card. Hence, if the bus speed can be increased and the TCP checksum can be performed by hardware, the processing overhead generated from TCP/IP and lower layers can be greatly reduced. The results presented shed light on designing communication protocols on personal computers.<<ETX>>","PeriodicalId":249184,"journal":{"name":"[1992] Proceedings 17th Conference on Local Computer Networks","volume":"30 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":"122094542","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 advantages and disadvantages of isochronous and synchronous transport services of the fiber distributed data interface (FDDI) are summarized. A comparison of both services is made based on application requirements (e.g. real-time video and voice). These requirements include timing constraints, such as jitter and delay, bandwidth utilization, and end-station requirements. It is shown that synchronous traffic can support a wide range of application requirements efficiently at moderate cost when the connections between source and destination are on the same physical ring. However, isochronous traffic has advantages, particularly when the network traffic is well behaved (the peak data rate is close to the mean data rate) and when connections traverse multiple rings.<>
{"title":"Isochronous versus synchronous traffic in FDDI","authors":"M. Willebeek-LeMair, F. Schaffa, B. Patel","doi":"10.1109/LCN.1992.228169","DOIUrl":"https://doi.org/10.1109/LCN.1992.228169","url":null,"abstract":"The advantages and disadvantages of isochronous and synchronous transport services of the fiber distributed data interface (FDDI) are summarized. A comparison of both services is made based on application requirements (e.g. real-time video and voice). These requirements include timing constraints, such as jitter and delay, bandwidth utilization, and end-station requirements. It is shown that synchronous traffic can support a wide range of application requirements efficiently at moderate cost when the connections between source and destination are on the same physical ring. However, isochronous traffic has advantages, particularly when the network traffic is well behaved (the peak data rate is close to the mean data rate) and when connections traverse multiple rings.<<ETX>>","PeriodicalId":249184,"journal":{"name":"[1992] Proceedings 17th Conference on Local Computer Networks","volume":"76 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":"123821524","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}
Two possible applications of dual ring use in the fiber distributed data interface (FDDI) are described. First, a straightforward mechanism of load sharing on the MAC layer based on the assumption of a homogeneous dual MAC network is discussed. Second, the TCP/IP sublayer DMARP (dual MAC ARP) is introduced. This sublayer supports dual MAC operations in inhomogeneous FDDI networks. A way towards the use of dual MAC FDDI in general network protocols is identified.<>
{"title":"Dual MAC usage in FDDI","authors":"A. Thimmel, P. Kühn","doi":"10.1109/LCN.1992.228167","DOIUrl":"https://doi.org/10.1109/LCN.1992.228167","url":null,"abstract":"Two possible applications of dual ring use in the fiber distributed data interface (FDDI) are described. First, a straightforward mechanism of load sharing on the MAC layer based on the assumption of a homogeneous dual MAC network is discussed. Second, the TCP/IP sublayer DMARP (dual MAC ARP) is introduced. This sublayer supports dual MAC operations in inhomogeneous FDDI networks. A way towards the use of dual MAC FDDI in general network protocols is identified.<<ETX>>","PeriodicalId":249184,"journal":{"name":"[1992] Proceedings 17th Conference on Local Computer Networks","volume":"6 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":"123862103","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 implementation of a widely distributed multicomputer system for performing medium- and high-grain parallel computations is described. An n-cube hypercube is embedded in a ring with 2/sup n/ nodes using the Gray code scheme. Wavelength division multiplexing (WDM) fiber optic networks are used to crate the n direct connections between nodes not adjacent to each other.<>
{"title":"A parallel processing paradigm for wavelength division multiplexed networks","authors":"Dheeraj Singal, Jack Tan","doi":"10.1109/LCN.1992.228130","DOIUrl":"https://doi.org/10.1109/LCN.1992.228130","url":null,"abstract":"The implementation of a widely distributed multicomputer system for performing medium- and high-grain parallel computations is described. An n-cube hypercube is embedded in a ring with 2/sup n/ nodes using the Gray code scheme. Wavelength division multiplexing (WDM) fiber optic networks are used to crate the n direct connections between nodes not adjacent to each other.<<ETX>>","PeriodicalId":249184,"journal":{"name":"[1992] Proceedings 17th Conference on Local Computer Networks","volume":"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":"130089487","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}
Multiple access to a single user-network interface (UNI) is a cost-effective solution for the provision of B-ISDN services in customer premises. In a multiple access configuration, a fairly shared access must ensure that each terminal will get a guaranteed bandwidth to provide an acceptable quality of service (QoS) and that the allocation of the remaining bandwidth will result in the same improvement of QoS for all the terminals. An approach to allocating the remaining bandwidth is proposed. It is based on both the guaranteed bandwidth required by the terminal and the probability that the terminal's bit rate exceeds its guaranteed bandwidth. The basic generic flow control (GFC) protocol mechanism and the GFC field settings for a dual-bus customer premises network (CPN) are described.<>
{"title":"The concept of fairness and a GFC protocol","authors":"X. Hou, I. Niemegeers","doi":"10.1109/LCN.1992.228177","DOIUrl":"https://doi.org/10.1109/LCN.1992.228177","url":null,"abstract":"Multiple access to a single user-network interface (UNI) is a cost-effective solution for the provision of B-ISDN services in customer premises. In a multiple access configuration, a fairly shared access must ensure that each terminal will get a guaranteed bandwidth to provide an acceptable quality of service (QoS) and that the allocation of the remaining bandwidth will result in the same improvement of QoS for all the terminals. An approach to allocating the remaining bandwidth is proposed. It is based on both the guaranteed bandwidth required by the terminal and the probability that the terminal's bit rate exceeds its guaranteed bandwidth. The basic generic flow control (GFC) protocol mechanism and the GFC field settings for a dual-bus customer premises network (CPN) are described.<<ETX>>","PeriodicalId":249184,"journal":{"name":"[1992] Proceedings 17th Conference on Local Computer Networks","volume":"18 9","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1992-09-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120912741","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}
For LAN environments, a simple modification of the LRU replacement algorithm is proposed. By limiting the number of object replicas, the algorithm can substantially improve LRU performance over a wide range of parameters. The relatively simple LAN topology implies that much less state information need be available for good replacement decisions, compared to general network topologies.<>
{"title":"LRU-based replication strategies in a LAN remote caching architecture","authors":"A. Leff, J. Wolf, Philip S. Yu","doi":"10.1109/LCN.1992.228125","DOIUrl":"https://doi.org/10.1109/LCN.1992.228125","url":null,"abstract":"For LAN environments, a simple modification of the LRU replacement algorithm is proposed. By limiting the number of object replicas, the algorithm can substantially improve LRU performance over a wide range of parameters. The relatively simple LAN topology implies that much less state information need be available for good replacement decisions, compared to general network topologies.<<ETX>>","PeriodicalId":249184,"journal":{"name":"[1992] Proceedings 17th Conference on Local Computer Networks","volume":"37 5","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1992-09-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121003125","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 authors address two different communication problems in multiprocessor systems: all-to-all broadcast communication and one-to-all personalized communication. The networks selected for study are the torus and grid networks. New algorithms are presented for both the all-to-all broadcast and one-to-all personalized communication problems on the torus and grid networks.<>
{"title":"Broadcasting and personalized communication in a torus and grid network","authors":"A. Kapil, E. Ososanya","doi":"10.1109/LCN.1992.228111","DOIUrl":"https://doi.org/10.1109/LCN.1992.228111","url":null,"abstract":"The authors address two different communication problems in multiprocessor systems: all-to-all broadcast communication and one-to-all personalized communication. The networks selected for study are the torus and grid networks. New algorithms are presented for both the all-to-all broadcast and one-to-all personalized communication problems on the torus and grid networks.<<ETX>>","PeriodicalId":249184,"journal":{"name":"[1992] Proceedings 17th Conference on Local Computer Networks","volume":"93 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":"114202729","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 real customer applications where the switched multimegabit data service (SMDS) proved to be the best solution to address to customer's requirements are examined. The following examples are discussed: the Temple University MAN trial, disaster recovery, print plant and document imaging, a health information system database, medical imaging, and real estate listings.<>
{"title":"Bell Atlantic and SMDS applications","authors":"Mara Jill Spaulder","doi":"10.1109/LCN.1992.228180","DOIUrl":"https://doi.org/10.1109/LCN.1992.228180","url":null,"abstract":"Several real customer applications where the switched multimegabit data service (SMDS) proved to be the best solution to address to customer's requirements are examined. The following examples are discussed: the Temple University MAN trial, disaster recovery, print plant and document imaging, a health information system database, medical imaging, and real estate listings.<<ETX>>","PeriodicalId":249184,"journal":{"name":"[1992] Proceedings 17th Conference on Local Computer Networks","volume":"49 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":"125215199","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}
Two strategies which have recently been proposed for bandwidth allocation in distributed-queue dual-bus (DQDB) subnetworks of a metropolitan area network (MAN) are compared. Studied are packet delays for connection oriented variable-bit-rate (VBR) traffic such as real-time data and compressed voice and video. It turns out that the guaranteed bandwidth protocol is an excellent candidate for connection oriented data service in DQDB where support of delay-sensitive VBR traffic is a major concern. In contrast to this, a modified version of the bandwidth balancing mechanism suffers from slow convergence to the desired bandwidth allocation.<>
{"title":"Real-time communication in DQDB-a comparison of difference strategies","authors":"P. Martini, Georg Werschmann","doi":"10.1109/LCN.1992.228103","DOIUrl":"https://doi.org/10.1109/LCN.1992.228103","url":null,"abstract":"Two strategies which have recently been proposed for bandwidth allocation in distributed-queue dual-bus (DQDB) subnetworks of a metropolitan area network (MAN) are compared. Studied are packet delays for connection oriented variable-bit-rate (VBR) traffic such as real-time data and compressed voice and video. It turns out that the guaranteed bandwidth protocol is an excellent candidate for connection oriented data service in DQDB where support of delay-sensitive VBR traffic is a major concern. In contrast to this, a modified version of the bandwidth balancing mechanism suffers from slow convergence to the desired bandwidth allocation.<<ETX>>","PeriodicalId":249184,"journal":{"name":"[1992] Proceedings 17th Conference on Local Computer Networks","volume":"4 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":"123704173","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 new access protocol that handles isochronous traffic in a much better way than previous protocols for wavelength division multiplexing (WDM) star networks is presented. This protocol allows the stations to reserve part of the bandwidth for their isochronous traffic while the rest is used for asynchronous traffic. In addition, this technique requires only one transmitter and one receiver per station and is free from the constraint of a control channel.<>
{"title":"A method for isochronous traffic in a WDM star network","authors":"G. Semaan, P. Humblet","doi":"10.1109/LCN.1992.228145","DOIUrl":"https://doi.org/10.1109/LCN.1992.228145","url":null,"abstract":"A new access protocol that handles isochronous traffic in a much better way than previous protocols for wavelength division multiplexing (WDM) star networks is presented. This protocol allows the stations to reserve part of the bandwidth for their isochronous traffic while the rest is used for asynchronous traffic. In addition, this technique requires only one transmitter and one receiver per station and is free from the constraint of a control channel.<<ETX>>","PeriodicalId":249184,"journal":{"name":"[1992] Proceedings 17th Conference on Local Computer Networks","volume":"13 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":"121932409","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
扫码关注我们
求助内容：
应助结果提醒方式：