{"title":"New Developments with SNMP and SNMPv2","authors":"S. Waldbusser","doi":"10.1109/CMPCMM.1993.659087","DOIUrl":"https://doi.org/10.1109/CMPCMM.1993.659087","url":null,"abstract":"","PeriodicalId":285275,"journal":{"name":"The 8th IEEE Workshop on Computer Communications","volume":"584 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1993-10-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123415497","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":"Backward Explicit Congestion Notification for ATM Local Area Networks","authors":"P. Newman","doi":"10.1109/CMPCMM.1993.659070","DOIUrl":"https://doi.org/10.1109/CMPCMM.1993.659070","url":null,"abstract":"The application of backward explicit congestion noti cation (BECN) to an ATM LAN is investigated in order to support the dynamic sharing of bandwidth between high-speed, bursty, data tra c sources. The results of a simulation study are presented which suggest that a BECN mechanism may provide simple and e ective tra c management for an ATM LAN or campus backbone network of up to at least 50 km diameter. Cell loss due to congestion may be prevented and a link utilization in excess of 80% may be maintained with only 0.08% of the link bandwidth, per active source, carrying backward congestion noti cation tra c during a congestion event.","PeriodicalId":285275,"journal":{"name":"The 8th IEEE Workshop on Computer Communications","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1993-10-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131468662","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 Diffusion Approximation of ATM Traffic for Statistical Multiplexing","authors":"H. Kobayashi, Q. Ren","doi":"10.1109/CMPCMM.1993.659079","DOIUrl":"https://doi.org/10.1109/CMPCMM.1993.659079","url":null,"abstract":"We introduce a diffusion process model to approximately characterize the output process of a statistical multiplexer for a heterogeneous set of traffic sources. Statistical multiplexing is the basic principle for ATM (asynchronous transfer mode) fast packet switching adopted by the B-ISDN (Broadband Integrated Services Digital Networks) architecture. This diffusion process can then be approximated by a multi-dimensional Ornstein-Uhlenbeck process. The packet arrival process is shown to be a Gaussian (but not Markov) process, which adequately captures the correlated nature of packet arrivals and determine the statistical behavior of the buffer content. Some simulated sample paths and estimated correlation functions will be shown to verify the diffusion approximation. We then apply our analytical results to evaluate the multiplexer’s dynamic behavior, i.e., the time-dependent packet loss probabilities and the transient periods at the cell and burst levels.","PeriodicalId":285275,"journal":{"name":"The 8th IEEE Workshop on Computer Communications","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1993-10-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114745899","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 Design Space for Host Interfaces","authors":"D. Tennenhouse","doi":"10.1109/CMPCMM.1993.659095","DOIUrl":"https://doi.org/10.1109/CMPCMM.1993.659095","url":null,"abstract":"","PeriodicalId":285275,"journal":{"name":"The 8th IEEE Workshop on Computer Communications","volume":"140 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1993-10-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133233231","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":"Homogeneous Signaling for ATM LANS, MANS, and WANS","authors":"T.F. La Ports, M. Veeraraghavan","doi":"10.1109/CMPCMM.1993.659073","DOIUrl":"https://doi.org/10.1109/CMPCMM.1993.659073","url":null,"abstract":"","PeriodicalId":285275,"journal":{"name":"The 8th IEEE Workshop on Computer Communications","volume":"216 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1993-10-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115217950","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":"ATOMIC: A High-Speed, Low-Cost, Local Communication Architecture","authors":"D. Cohen","doi":"10.1109/CMPCMM.1993.659091","DOIUrl":"https://doi.org/10.1109/CMPCMM.1993.659091","url":null,"abstract":"The ATOMIC network is a LAN application of the intra-computer communication technology that is used inside the Mosaic multicomputers. The Mosaic multicomputer is a latter-day version of the “Cosmic Cube” that Chuck Seitz and his research group in the Computer Science Department at Caltech has developed in the early 80’s. At that time, Seitz anticipated that within 10 years a complete node with its processor, memory, and communication would be reduced to a single chip. The Mosaic computer is based on repetitive use of the Mosaic-C chip, which is that single chip that he anticipated. Each of these chips has 4 bi-directional channels, and a 2-dimensional router that allows packets of arbitrary length to flow from any chip to any other chip within-a 128x128 array. These channels are asynchronous and operate between 500 and 800 Mb/s in each direction. ATOMIC is a LAN based on the Mosaic technology with several modifications as required for a LAN. The philosophy of ATOMIC is that a high performance LAN, with high bandwidth and low latency, is a large “back-plane” (i.e., large intra-computer communication) rather than a small WAN, such as ATM. However, the extension of the Mosaic communication to a LAN has to address a few new problems, such as:","PeriodicalId":285275,"journal":{"name":"The 8th IEEE Workshop on Computer Communications","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1993-10-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127525745","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}