{"title":"Performance evaluation of adaptive ARQ schemes over half duplex transmission line","authors":"Y. Ishibashi, Akira Iwabuchi","doi":"10.1109/INFCOM.1989.101501","DOIUrl":"https://doi.org/10.1109/INFCOM.1989.101501","url":null,"abstract":"An adaptive control procedure is proposed for the go-back-N and selective-repeat automatic repeat-request (ARQ) schemes. The procedure is to dynamically vary the number and length of continuously transmitted data blocks according to the bit error rate. The throughput of the adaptive ARQ schemes for a half-duplex transmission line is compared with the throughput of corresponding conventional schemes. Numerical results indicate that adaptive ARQ schemes are superior to conventional ARQ schemes when the bit error rate is not known or varies with time.<<ETX>>","PeriodicalId":275763,"journal":{"name":"IEEE INFOCOM '89, Proceedings of the Eighth Annual Joint Conference of the IEEE Computer and Communications Societies","volume":"53 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":"121617751","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":"Splitting algorithms in noisy channels with memory","authors":"I. Kessler, M. Sidi","doi":"10.1109/INFCOM.1989.101446","DOIUrl":"https://doi.org/10.1109/INFCOM.1989.101446","url":null,"abstract":"Multiaccess networks in which the shared channel is noisy are considered. A slotted-time collision-type channel, Poisson infinite-user model, and a ternary feedback are assumed. Due to the noise in the shared channel, the received signal may be detected as a collision event though no message or a single message is transmitted. This kind of imperfect feedback is referred to as an error. A common assumption in all previous studies of multiaccess algorithms in channels with errors is that the channel is memoryless. The problem of splitting algorithms when the channel is with memory is considered here. A two-state first-order Markovian model for the channel is introduced and the operation of the tree collision resolution algorithm in this channel is analyzed. A stability result, i.e. the necessary conditions on the channel parameters for stability conditions hold, the throughput of the algorithm is calculated. Extensions to more general channel models are discussed.<<ETX>>","PeriodicalId":275763,"journal":{"name":"IEEE INFOCOM '89, Proceedings of the Eighth Annual Joint Conference of the IEEE Computer and Communications Societies","volume":"28 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":"124876439","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":"On formal modeling of communication channels","authors":"P. Gburzynski, P. Rudnicki","doi":"10.1109/INFCOM.1989.101447","DOIUrl":"https://doi.org/10.1109/INFCOM.1989.101447","url":null,"abstract":"A formal semantics of a model for a communication channel is given. The model is the foundation of a simulation package which can be used for modeling of communication phenomena in distributed physical systems. The software system based on the model can be viewed as an emulator for LAN-type communication networks. The approach is centered around a formal model of s single CSMA/CD communication channel. The proposed model reflects all relevant elements of a real channel at the medium access control level.<<ETX>>","PeriodicalId":275763,"journal":{"name":"IEEE INFOCOM '89, Proceedings of the Eighth Annual Joint Conference of the IEEE Computer and Communications Societies","volume":"22 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":"125174368","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 fast distributed shortest path algorithm for a class of hierarchically structured data networks","authors":"J. Antonio, Garng M. Huang, W. Tsai","doi":"10.1109/INFCOM.1989.101451","DOIUrl":"https://doi.org/10.1109/INFCOM.1989.101451","url":null,"abstract":"A distributed algorithm is presented which finds the shortest path from every node in the network to a given destination node. The network topology is assumed to be organizable into a generalized balanced-tree hierarchy (BH). The BH topology is introduced and characterized, and it is shown that most large interconnected data networks are of this type. It is also shown that the algorithm converges in an asynchronous environment. Therefore, some of the difficulties associated with synchronizing the order of events can be avoided in the actual implementation of the proposed algorithm.<<ETX>>","PeriodicalId":275763,"journal":{"name":"IEEE INFOCOM '89, Proceedings of the Eighth Annual Joint Conference of the IEEE Computer and Communications Societies","volume":"141 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":"122551936","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":"SFPS: a synchronous fast packet switching architecture for very high speeds","authors":"Yeali S. Sun, M. Gerla","doi":"10.1109/INFCOM.1989.101510","DOIUrl":"https://doi.org/10.1109/INFCOM.1989.101510","url":null,"abstract":"A switching architecture, synchronous fast packet switching (SFPS), is proposed whereby an optical space switch provides a circuit-switching type of transmission to applications with rigid delay requirement and continuous traffic pattern (e.g., video). A fast packet switch fabric is connected to the space switch to handle packets of more conventional applications. The transmission scheme and the switch design are described.<<ETX>>","PeriodicalId":275763,"journal":{"name":"IEEE INFOCOM '89, Proceedings of the Eighth Annual Joint Conference of the IEEE Computer and Communications Societies","volume":"16 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":"131421882","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":"Multimedia communication for personal workstations","authors":"J. Robinson","doi":"10.1109/INFCOM.1989.101571","DOIUrl":"https://doi.org/10.1109/INFCOM.1989.101571","url":null,"abstract":"A multimedia interactive conferencing application is introduced as an example of the promises and challenges of multimedia communication. Its key capabilities and its overall structure are described. The derivation of a layered model of multimedia communications based on this structure is explained, and some implications for future development are considered.<<ETX>>","PeriodicalId":275763,"journal":{"name":"IEEE INFOCOM '89, Proceedings of the Eighth Annual Joint Conference of the IEEE Computer and Communications Societies","volume":"15 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":"114172342","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":"Interconnection of token rings by IEEE 802.6 metropolitan area networks","authors":"R. Vallee, L. Orozco-Barbosa, N. Georganas","doi":"10.1109/INFCOM.1989.101544","DOIUrl":"https://doi.org/10.1109/INFCOM.1989.101544","url":null,"abstract":"A performance study is presented of the proposed IEEE 802.6 standard (DQDB MAN) used as a backbone loop network in packet-switching mode to interconnect token rings that operate as specified in the ANSI/IEEE 802.5 standard. Interconnection between DQDB and token rings is provided by gateways that use assembly and segmentation processors and limited buffer sizes. The authors consider a network architecture in which Type 2 of the IEEE 802.2 logical-link-control (LLC) standard is used as end-to-end protocol between stations on the token rings. The use of the former and current DQDB slot formats are compared. Several window sizes, different policy schemes, and various traffic intensities and bit rates in token rings are also considered. Using the current DQDB slot size, results show that higher access priority should be allocated to the gateways in the token rings and also show the importance of reducing the time caused by the segmentation of packets in the gateways.<<ETX>>","PeriodicalId":275763,"journal":{"name":"IEEE INFOCOM '89, Proceedings of the Eighth Annual Joint Conference of the IEEE Computer and Communications Societies","volume":"272 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":"115904937","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 relaying service: an overview","authors":"W. Lai","doi":"10.1109/INFCOM.1989.101513","DOIUrl":"https://doi.org/10.1109/INFCOM.1989.101513","url":null,"abstract":"Frame relaying is a new CCITT-recommended packet-mode bearer service in ISDNs for data communications. Its major characteristics in terms of link layer multiplexing and out-of-band call control are summarized. The overview provides an introduction to frame relaying and serves as a foreword to the papers in a panel session on various aspects of frame relaying.<<ETX>>","PeriodicalId":275763,"journal":{"name":"IEEE INFOCOM '89, Proceedings of the Eighth Annual Joint Conference of the IEEE Computer and Communications Societies","volume":"85 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":"122648259","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":"Joint optimization of steady state and dynamic performance of ALOHA-type VSAT channels","authors":"D. Raychaudhuri, J. Harman","doi":"10.1109/INFCOM.1989.101534","DOIUrl":"https://doi.org/10.1109/INFCOM.1989.101534","url":null,"abstract":"An investigation is made of the stability and dynamic behavior of ALOHA-type protocols used in very small aperture terminal (VSAT) networks that support bursty, interactive data sources. A simulation model has been developed for dynamic performance analysis of unslotted ALOHA and selective reject (SREJ) ALOHA channels and used to obtain quantitative measures of stability in terms of transient response to pulsed traffic overload. For a typical 56-kb/s interactive station VSAT channel, the dependence is examined of pulse response (summarized in terms of a quantity called the backlog fall time) on selectable protocol parameters such as average transmission delays for nonadaptive systems or backoff policy parameters for adaptive systems. These results are augmented with average delay simulations, to obtain characteristic delay versus fall-time contours that permit the designer to select protocol parameters yielding the optimum combination of nominal steady-state and dynamic performance. For the ALOHA and SREJ-ALOHA channels under consideration, a surprisingly well-defined optimum region (in the form of a knee in the delay versus fall-time curves) is generally found to exist, underscoring the value of the joint steady-state/dynamic response design methodology proposed.<<ETX>>","PeriodicalId":275763,"journal":{"name":"IEEE INFOCOM '89, Proceedings of the Eighth Annual Joint Conference of the IEEE Computer and Communications Societies","volume":"648 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":"122700229","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 gateway allocation algorithm for interconnecting existing data networks","authors":"Song-Chyau Liang, J. Yee","doi":"10.1109/INFCOM.1989.101488","DOIUrl":"https://doi.org/10.1109/INFCOM.1989.101488","url":null,"abstract":"The problem of interconnecting two virtual circuit networks is considered. More specifically, the problem is to determine: (1) which nodes (one from each network) should be connected by gateways; and (2) the routing assignments to minimize the routing costs subject to a limitation on the cost of the gateways. This problem is NP-hard. The problem is formulated here as a linear combinatorial optimization problem. A two-phase algorithm is proposed to obtain good solutions. The first phase is a greedy heuristic algorithm. The second phase is an algorithm based on Lagrangian relaxation with the subgradient method. This method has been implemented. In the present computational experiments, the method determines gateway locations to interconnect networks (of various sizes) that are within a few percent of an optimal solution in a few minutes of CPU time.<<ETX>>","PeriodicalId":275763,"journal":{"name":"IEEE INFOCOM '89, Proceedings of the Eighth Annual Joint Conference of the IEEE Computer and Communications Societies","volume":"63 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":"130278987","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}