{"title":"High speed bridges for high speed local area networks: packets per second vs. bits per second","authors":"P. Martini","doi":"10.1109/INFCOM.1989.101489","DOIUrl":"https://doi.org/10.1109/INFCOM.1989.101489","url":null,"abstract":"Packet delays imposed by state-of-the-art bridges are compared to delays imposed by the high-speed local area network (HSLAN) itself. The communication system for three different types of internet traffic, namely file transfer, interactive traffic, and a mixture of both is discussed. The analysis shows that even for long transmission medium, service capabilities of the HSLAN will not be the bottleneck but that, bridges available today generally are not able to process packets as fast as they can be forwarded by the HSLAN.<<ETX>>","PeriodicalId":275763,"journal":{"name":"IEEE INFOCOM '89, Proceedings of the Eighth Annual Joint Conference of the IEEE Computer and Communications Societies","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1989-04-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129546216","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":"Markov chain analysis of packet-switched banyans with arbitrary switch sizes, queue sizes, link multiplicities and speedups","authors":"T. Szymanski, S. Shaikh","doi":"10.1109/INFCOM.1989.101547","DOIUrl":"https://doi.org/10.1109/INFCOM.1989.101547","url":null,"abstract":"Approximate Markov chains for the performance of banyan networks built with basic switches of arbitrary size containing input queues, output queues or a combination of input buffers and output queues are presented. These chains are also extended to model banyans where each link is replaced by a number of parallel links. Comparison with simulations indicates that the chains are reasonably accurate for practical network loads. It is shown that banyans built with switches containing a combination of single input buffers and output queues outperforms banyans built with switches containing only input queues or only output queues. Banyans built with larger nodes are shown to outperform banyans built with smaller nodes. It is shown that banyan-based networks with multiple links can be designed to have extremely low blocking probabilities.<<ETX>>","PeriodicalId":275763,"journal":{"name":"IEEE INFOCOM '89, Proceedings of the Eighth Annual Joint Conference of the IEEE Computer and Communications Societies","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1989-04-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130857790","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 delay-throughput performance analysis of the p/sub i/-persistent protocol for unidirectional broadcast bus networks","authors":"S. Kasemlonnapa, J. Meditch, B. Mukherjee","doi":"10.1109/INFCOM.1989.101533","DOIUrl":"https://doi.org/10.1109/INFCOM.1989.101533","url":null,"abstract":"The authors investigate the delay-throughput performance of this protocol operating under either equal or nonuniform load conditions based on the fairness criterion of equal average packet delay. Because of the complexity of the system, an approximate analytical model for selecting the p/sub i/ for this fairness criterion is developed. The p/sub i/ that satisfy the fairness criterion are determined from a Markov chain model for the protocol. The authors begin by considering the finite-buffer case and then proceed to the infinite-buffer one. They find that the performance of the protocol is insensitive to bus length, data rate, and the number of stations on the network. Hence, the network is suitable for long-distance, high-bandwidth applications as in fiber-optic local and metropolitan area systems. Simulation studies which serve to establish the range of validity of the analytical model are presented.<<ETX>>","PeriodicalId":275763,"journal":{"name":"IEEE INFOCOM '89, Proceedings of the Eighth Annual Joint Conference of the IEEE Computer and Communications Societies","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1989-04-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125297751","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 evaluation of GAM-T-103 real-time transfer protocols","authors":"P. Minet","doi":"10.1109/INFCOM.1989.101525","DOIUrl":"https://doi.org/10.1109/INFCOM.1989.101525","url":null,"abstract":"GAM-T-103 is a French military standard specifying services provided by a real-time transport layer called the transfer layer. The main features of connection-oriented services are described. Three such features are evaluated: automatic point-to-point sampling, centralized multicast and centralized concentration. In order to compare GAM-T-103 with the ISO 8073 protocol, a generic model has been developed and implemented under a simulation tool called SPHINX. Simulation results highlight the benefits resulting from GAM-T-103 protocols: lower resource utilization ratios and better response times. GAM-T-103 protocols take advantage of the multicast capacity inherent with broadcast LANs and they relieve user application software from tedious tasks such as those related to periodic data transmissions or multipeer data transmissions.<<ETX>>","PeriodicalId":275763,"journal":{"name":"IEEE INFOCOM '89, Proceedings of the Eighth Annual Joint Conference of the IEEE Computer and Communications Societies","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1989-04-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131341569","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":"Comparison of deflection and store-and-forward techniques in the Manhattan Street and Shuffle-Exchange Networks","authors":"N. Maxemchuk","doi":"10.1109/INFCOM.1989.101529","DOIUrl":"https://doi.org/10.1109/INFCOM.1989.101529","url":null,"abstract":"The Manhattan Street Network (MS-Net) and Shuffle-Exchange Network (SX-Net) are two-connected networks with significantly different topologies. Fixed-size packets are transmitted between nodes in these networks. The nodes are synchronized so that all of the packets that are received by a node within a slot transmission time arrive at a switching point simultaneously. Instead of storing large numbers of packets at intermediate nodes, a deflection strategy similar to hot-potato routing is used. There are characteristics of the MS-Net that make it well suited for deflection routing. With no buffer, 55-70% of the throughput with an infinite number of buffers has been obtained; with a single buffer per node, the throughput increases to 80-90%. With uniform load the throughput does not decrease significantly as the network utilization increases. Therefore, additional flow control mechanisms are not required to achieve the highest network throughput. The SX-Net does not have the above characteristics of the MS-Net. However, deflection routing still provides a significant portion of the available throughput. In the SX-Net, more buffers are required than in the MS-Net, and a flow control mechanism must be used to achieve the greatest throughput.<<ETX>>","PeriodicalId":275763,"journal":{"name":"IEEE INFOCOM '89, Proceedings of the Eighth Annual Joint Conference of the IEEE Computer and Communications Societies","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1989-04-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132494715","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":"Resource allocation with load balancing consideration in distributed computing systems","authors":"Ge-Ming Chiu, C. Raghavendra, S. Ng","doi":"10.1109/INFCOM.1989.101524","DOIUrl":"https://doi.org/10.1109/INFCOM.1989.101524","url":null,"abstract":"A new resource allocation model is presented in which a given number of copies of a single resource are allocated to the processing sites in such a way that the total communication cost incurred is minimized. The accessing scheme considers both the communication costs and the load levels at the resource sites. Load leveling is imposed as a constraint. This improves system throughput as well as response time. The allocation provided by the model reflects the realistic environment more accurately and therefore gives a better dynamic performance. It is shown that the model can be extended to include other costs such as installation cost and communication cost due to 'write' accesses.<<ETX>>","PeriodicalId":275763,"journal":{"name":"IEEE INFOCOM '89, Proceedings of the Eighth Annual Joint Conference of the IEEE Computer and Communications Societies","volume":"40 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1989-04-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134074616","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 integrated services local area network with hybrid access","authors":"C. Raviraj, E. Jones","doi":"10.1109/INFCOM.1989.101485","DOIUrl":"https://doi.org/10.1109/INFCOM.1989.101485","url":null,"abstract":"A broadcast-bus type of integrated services local area network with hybrid access is proposed. The proposed media access protocol, slot reservation-CSMA/CD, uses an adaptive speech coding technique to provide a TDMA-like service to voice stations and a CSMA/CD-type service to data stations. Hence, contention between voice stations is totally avoided and contention between voice and data stations is kept to a very low level.<<ETX>>","PeriodicalId":275763,"journal":{"name":"IEEE INFOCOM '89, Proceedings of the Eighth Annual Joint Conference of the IEEE Computer and Communications Societies","volume":"124 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1989-04-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133877187","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 head-of-line approximation to delay-dependent scheduling in integrated packet-switched networks","authors":"J. Kobza, Steven S. Liu","doi":"10.1109/INFCOM.1989.101565","DOIUrl":"https://doi.org/10.1109/INFCOM.1989.101565","url":null,"abstract":"The chief cause of packet loss is the variability of end-to-end delay due to queuing at intermediate nodes. The queuing discipline used within the network directly affects this delay variance. In an integrated environment, scheduling must provide adequate performance for all classes. Simulation was used to compare the performance of several queuing disciplines for trunk scheduling at a packet switch with only voice traffic. A delay-dependent priority scheme, the budgeted residual-life-dependent discipline (BURD), resulted in the lowest packet loss rate at the node. BURD and a head-of-line discipline were then used to construct scheduling policies for networks with integrated traffic. It was found possible to approximate the performance of the delay-dependent priority schemes using more easily implemented head-of-line schemes and still provide adequate service for data traffic.<<ETX>>","PeriodicalId":275763,"journal":{"name":"IEEE INFOCOM '89, Proceedings of the Eighth Annual Joint Conference of the IEEE Computer and Communications Societies","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1989-04-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114071232","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":"Capacity allocation for integrated voice/data transmission at a packet switched TDM","authors":"Guo-Liang Wu, J. Mark","doi":"10.1109/INFCOM.1989.101484","DOIUrl":"https://doi.org/10.1109/INFCOM.1989.101484","url":null,"abstract":"The integrated transmission of voice and data at a time-division multiplexer (TDM) is discussed and analyzed. The system operates in a frame format and the channel capacity is governed by the frame size. The allocation of channel capacity for the transmission of voice and data is performed by a controller. Digital speech interpolation and embedded coding techniques are used to enhance the transmission efficiency and to facilitate the implementation of multiplexing. Using a dynamic programming approach, a capacity allocation policy that jointly optimizes the voice/data performances is introduced. Numerical results indicate that the aggregate throughput of the system can be improved with a slight degradation in voice quality.<<ETX>>","PeriodicalId":275763,"journal":{"name":"IEEE INFOCOM '89, Proceedings of the Eighth Annual Joint Conference of the IEEE Computer and Communications Societies","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1989-04-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117111388","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":"Flow and congestion control in the message handling environment","authors":"B. Brachman, S. Chanson","doi":"10.1109/INFCOM.1989.101520","DOIUrl":"https://doi.org/10.1109/INFCOM.1989.101520","url":null,"abstract":"A framework is presented for the design of application level store-and-forward message transfer systems. Flow control and congestion control issues in the message handling environment are discussed. A new model for message transport, the message stream, is proposed as a basis of the flow and congestion control functionality. Important design aspects, including message fragmentation and management of transit and recipient buffers, are addressed.<<ETX>>","PeriodicalId":275763,"journal":{"name":"IEEE INFOCOM '89, Proceedings of the Eighth Annual Joint Conference of the IEEE Computer and Communications Societies","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1989-04-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115582734","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}