{"title":"Integrated MANs with hierarchical architecture","authors":"E. Cadorin, L. Fratta","doi":"10.1109/INFCOM.1989.101531","DOIUrl":"https://doi.org/10.1109/INFCOM.1989.101531","url":null,"abstract":"A description is given of metropolitan area networks (MANs) for integrated services that consist of local clusters connected through bridges to a backbone network. The services integration as well as the required flow control functions are obtained with simple procedures which operate at the media access control (MAC) level. The effectiveness of this hierarchical architecture is evaluated in the case where the local clusters and the backbone network are implemented using L-express buses. The efficiency of this architecture is compared with that of other alternatives and detailed performance results in saturation condition, obtained with simulations, 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":"32 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":"130401139","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":"The Poissonian-spectrum method for treating a loss system serving nonPoissonian multi-bit-rate traffic","authors":"M. Beshai","doi":"10.1109/INFCOM.1989.101553","DOIUrl":"https://doi.org/10.1109/INFCOM.1989.101553","url":null,"abstract":"A two-component simplification of the powerful Poissonian-spectrum method of analyzing a loss system serving a mixture of a nonPoissonian multi-bit-rate traffic system is proposed. The spectrum concept is implicit in L.E.N. Delbrouck's (1981) recursions for homogeneous and heterogeneous traffic and has its roots in Hayward's rather simplistic, yet accurate, method for treating homogeneous peaked traffic. The Poissonian-spectrum representation is not unique. To determine the sensitivity of the method to the spectrum shape, a study is made of three distinctly different representations. With appropriate selection of the spectrum shape, the method reduces to simple recursions. A layman's approach is used to derive these recursions as a natural extension of the Roberts-Kaufman recursion. The case of smooth traffic requires careful considerations, which 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":"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":"129638755","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 standard LAN protocols in time-constrained environments","authors":"Jorge Santos, J. Orozco, O. Alimenti","doi":"10.1109/INFCOM.1989.101554","DOIUrl":"https://doi.org/10.1109/INFCOM.1989.101554","url":null,"abstract":"A comparative evaluation of standard local area networks operating in time-constrained environments is performed. The analyzed protocols are token bus (IEEE 802.4), token ring (IEEE 802.5), and a modified version of CSMA/CD (carrier-sense multiple-access with collision detection) (IEEE 802.3). The priority disciplines necessary to make the systems crisis-free are discussed in connection with the relationships between the slot time, the number of nodes in the network, and their crisis times. In each case, the efficiency and the production of the system (in Mb/s) as functions of the length of the data field are determined.<<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":"121579742","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 compatible ISDN gateway for broadband metropolitan area networks","authors":"T. D. Todd","doi":"10.1109/INFCOM.1989.101530","DOIUrl":"https://doi.org/10.1109/INFCOM.1989.101530","url":null,"abstract":"A novel gateway design (referred to as T-SWIFT) is presented for integrating the flow of voice streams into existing broadband cable systems. The interface between the integrated voice subnetwork and the cable system is realized by a metropolitan area gateway (MAG) which is implemented at the broadband cable head-end. In T-SWIFT, an intelligent scheduling algorithm in the MAG dynamically allocates channel bandwidth using a variation of the data switch-filtering and fixed-frame synchronous voice/data integration techniques introduced by the author (see IEEE J. Selected Areas in Commun. vol., SAC-5, no.9, p.1391-1402 (1987)). The MAG accomplishes this by coordinating the transmission of inbound and outbound voice talkspurts in an upwardly compatible fashion with respect to the existing CSMA/CD data stations. Thus previously installed stations require no modification. Results are presented which indicate that the T-SWIFT design performs significantly better than previous compatible voice/data integration methods.<<ETX>>","PeriodicalId":275763,"journal":{"name":"IEEE INFOCOM '89, Proceedings of the Eighth Annual Joint Conference of the IEEE Computer and Communications Societies","volume":"56 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":"122637439","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 study of traffic imbalances in a fast packet switch","authors":"San-qi Li, Myung-Joo Lee","doi":"10.1109/INFCOM.1989.101498","DOIUrl":"https://doi.org/10.1109/INFCOM.1989.101498","url":null,"abstract":"The performance of a nonblocking space-division packet switch is studied given that traffics are imbalanced at input and output. Analysis shows that the performance of packet queuing delay at switch input, as well as the entire throughput of the switch, can be adversely affected by such imbalances. The work is then extended to examine a transient imbalance case, where the switch experiences the alternation of two transient periods, each at a different traffic imbalance mode. The alternation is modeled by a two-state Markov chain. Both balanced and imbalanced cases can be viewed as the two extremes of the transient case. It is observed that the system throughput and the queuing performance in the transient case heavily depend on both mean sojourn time and steady-state probability at each imbalance mode.<<ETX>>","PeriodicalId":275763,"journal":{"name":"IEEE INFOCOM '89, Proceedings of the Eighth Annual Joint Conference of the IEEE Computer and Communications Societies","volume":"39 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":"123028959","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 resilient replication method in distributed database systems","authors":"S. Son","doi":"10.1109/INFCOM.1989.101476","DOIUrl":"https://doi.org/10.1109/INFCOM.1989.101476","url":null,"abstract":"A scheme is presented for maintaining consistency and improving resiliency of replicated data in distributed systems. A multiversion technique is used to increase the degree of concurrency. To reduce storage requirement and communication overhead, multiple versions are maintained only at read-only sites. Recovery methods for replicated data in distributed systems are also discussed.<<ETX>>","PeriodicalId":275763,"journal":{"name":"IEEE INFOCOM '89, Proceedings of the Eighth Annual Joint Conference of the IEEE Computer and Communications Societies","volume":"24 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":"114168573","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 comparative performance study of various congestion controls for ISDN frame-relay networks","authors":"Kim-Joan Chen, K. Rege","doi":"10.1109/INFCOM.1989.101514","DOIUrl":"https://doi.org/10.1109/INFCOM.1989.101514","url":null,"abstract":"Detailed simulation results are presented to illustrate the throughput performance of various congestion control schemes that have been considered when using link access protocol D as the level-2 protocol. Three classes of adaptive window schemes, all of which use implicit detection, are examined. In all of them, receiving a REJECT frame (which is sent by the far end when it receives an out-of-sequence frame) is interpreted as a sign of congestion, and the control action taken by the end-systems is in the form of reducing their layer-2 window. It is shown that these schemes perform fairly well over a wide range of network parameters and traffic patterns, with one in particular providing a very robust performance over the range. It involves reducing the window size to 1/2 upon receiving a REJECT frame.<<ETX>>","PeriodicalId":275763,"journal":{"name":"IEEE INFOCOM '89, Proceedings of the Eighth Annual Joint Conference of the IEEE Computer and Communications Societies","volume":"27 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":"131491166","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 channel power sensing in terrestrial spread spectrum packet radio networks","authors":"E. Sousa","doi":"10.1109/INFCOM.1989.101560","DOIUrl":"https://doi.org/10.1109/INFCOM.1989.101560","url":null,"abstract":"The author considers the possibility of obtaining performance gains by using channel power sensing in the channel access protocol of a terrestrial spread-spectrum packet radio network as a generalization of the CSMA (carrier-sense multiple-access) protocol of narrowband networks. Channel load sensing is viewed as a method of estimating the interference at the receiver based on the interference measured at the transmitter. To do this, a bivariate probability distribution function of the interference at the two locations is required. The probability of packet success is then determined. Since it is difficult to evaluate numerically, a program was written to simulate it. The author gives simulation results for the case of a random network.<<ETX>>","PeriodicalId":275763,"journal":{"name":"IEEE INFOCOM '89, Proceedings of the Eighth Annual Joint Conference of the IEEE Computer and Communications Societies","volume":"356 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":"131607506","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":"Z-NET: a dual bus fiber-optic LAN using active and passive switchers","authors":"B. W. Abeysundara, A. Kamal","doi":"10.1109/INFCOM.1989.101429","DOIUrl":"https://doi.org/10.1109/INFCOM.1989.101429","url":null,"abstract":"Z-NET, a high-speed local area network scheme using a dual unidirectional bus architecture and an optical-fiber transmission medium, is introduced. At very light loads, the protocol behavior is similar to a random-access scheme with zero packet delay. As load increases, the operation is similar to an implicit token-passing scheme and ensures fair round-robin scheduling among stations. The protocol is completely distributed, with no station performing any special function. When collisions occur, one station always continues its transmission to completion. Thus, the wastage of bandwidth caused by collisions is minimized. This is achieved using active and passive switches on the buses. Delay performance of Z-NET is superior to Expressnet. Fasnet and tokenless protocols at very light loads. At heavy load, performance is similar to that of Expressnet, with bounded packet delay. No special mechanisms are used to start new rounds or for transition between random and controlled access modes of transmission. Thus, the proposed scheme has the added advantage of simplicity.<<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":"132317149","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 new voice scheduling scheme for broadcast bus local area networks","authors":"Wai Chen, San-qi Li, M. Schwartz","doi":"10.1109/INFCOM.1989.101486","DOIUrl":"https://doi.org/10.1109/INFCOM.1989.101486","url":null,"abstract":"Scheduling of voice traffic on broadcast-bus local area networks is considered. A voice scheduling scheme is proposed and evaluated. In this scheme, active voice calls are organized using a distributed global queue. Access scheduling overhead is reduced by voice packet arrival anticipation. To guarantee fairness and to reduce variance of the waiting time, the voice packet build-up during the overhead period is fairly shared among all calls by a round-robin service discipline. Three different voice packet service cases, namely nonexhaustive, exhaustive, and no-queueing, are evaluated. Simple closed-form approximation formulas have been proposed which show good agreement with simulation. The proposed scheme is shown to have performance approaching that of the centralized system.<<ETX>>","PeriodicalId":275763,"journal":{"name":"IEEE INFOCOM '89, Proceedings of the Eighth Annual Joint Conference of the IEEE Computer and Communications Societies","volume":"62 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":"114566878","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}