{"title":"A centralized generic protocol for multipoint connections","authors":"P. McKinley, Y. Huang","doi":"10.1109/LCN.1997.631005","DOIUrl":"https://doi.org/10.1109/LCN.1997.631005","url":null,"abstract":"A centralized protocol, C-GMC, is proposed for the construction and maintenance of multipoint connections (MCs). The operation of the protocol is independent of the MC topology algorithm, which is rendered a \"plug-in\" module. The C-GMC protocol is targeted at networks based on link state routing and uses the concept of a per-MC server. The problems of server election and migration are modeled as consensus problems in distributed systems, and an efficient solution is proposed. Results of a simulation study show that the C-GMC protocol is able to efficiently handle worst case workloads generated by multiparty communication sessions with thousands of participants.","PeriodicalId":286255,"journal":{"name":"Proceedings of 22nd Annual Conference on Local Computer Networks","volume":"150 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1997-11-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122564779","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 approach for imprecise transmission of TIFF image files through congested real-time ATM networks","authors":"C. Wong, A. Cheng","doi":"10.1109/LCN.1997.631011","DOIUrl":"https://doi.org/10.1109/LCN.1997.631011","url":null,"abstract":"The paper presents an approach to pre-process and post-process TIFF image files in real-time applications for maintaining an acceptable image quality when these files are transmitted in a congested ATM network. Compared to existing techniques, the approach introduces a very low transmission and computational overhead, allows a higher cell-loss rate, and produces a less image degradation. In this approach, the preprocessor rearranges the content of image files, and then packs these fixed image files into ATM cells for transmission. The post-processor unpacks the cells, restores the original content orders, and if part of the data has been discarded, performs data recovery to reconstruct imprecise image files as close to their original versions as possible. By marking an appropriate number of cells, a user can specify an acceptable lower bound on the quality of the image that is delivered at the destination. This mates it possible to control and know which part of the image data can be discarded. The experimental results show that by using the proposed approach, the quality of the received/recovered images decreases more slowly than the proportional increase in network congestion.","PeriodicalId":286255,"journal":{"name":"Proceedings of 22nd Annual Conference on Local Computer Networks","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1997-11-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134574915","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 effectiveness of cell-level FEC for packet delivery in ATM networks","authors":"A. Guha, Tai-Sheng Chang","doi":"10.1109/LCN.1997.630996","DOIUrl":"https://doi.org/10.1109/LCN.1997.630996","url":null,"abstract":"The authors examine the issue of how packet delivery can be made more reliable over ATM networks. While forward error correction (FEC) techniques have been proposed in the past by many researchers to address the data loss issues in ATM networks, the focus of the paper is on analyzing the cost-performance aspects of cell-level FEC for packet traffic. Specifically, they examine the tradeoff between the cost of increased bandwidth consumed by the FEC code versus the gain in packet error rate both through simulation and simple analytical models. The paper presents new analyses and results in two broad areas: i) the conditions under which FEC is effective in improving packer error rates, in terms of correlated cell loss levels for different packet sizes over different network extents, and ii) the cost-performance evaluation of using FEC in absolute terms that account for end-to-end delay, and the corresponding determination of the minimum physical network diameter over which FEC would be effective.","PeriodicalId":286255,"journal":{"name":"Proceedings of 22nd Annual Conference on Local Computer Networks","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1997-11-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131158197","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":"Scaling CSMA/CD to 1 Gb/s with frame bursting","authors":"M. Molle, Mohan Kalkunte, J. Kadambi","doi":"10.1109/LCN.1997.630990","DOIUrl":"https://doi.org/10.1109/LCN.1997.630990","url":null,"abstract":"In Gigabit Ethernet, the round-trip propagation delay can be much greater than the transmission time for a minimum length frame. The authors describe some changes to the Ethernet CSMA/CD medium access control algorithm that allow CSMA/CD to be used in this case. First, carrier extension is used to increase the slot time without requiring a corresponding increase in the minimum frame length. Second, frame bursting is introduced so that a host may transmit more than one frame without releasing control of the channel, in a manner that increases the efficiency for small frames without changing its one-frame-at-a-time service interface. Using simulation, they show that CSMA/CD with carrier extension and frame bursting operating on 1 Gb/s links provides a significant performance increase over 100 Mb/s fast Ethernet. These changes are being adopted by the IEEE 802.32 task force, which is currently defining the standard for Gigabit Ethernet.","PeriodicalId":286255,"journal":{"name":"Proceedings of 22nd Annual Conference on Local Computer Networks","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1997-11-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124214358","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 routing algorithm for distributed communication networks","authors":"R. Beaubrun, S. Pierre","doi":"10.1109/LCN.1997.630934","DOIUrl":"https://doi.org/10.1109/LCN.1997.630934","url":null,"abstract":"As the speed and number of LANs continue to increase higher and higher demand is placed on wide area networks. To support the tremendous traffic and to avoid link congestion, such networks should utilize a robust routing strategy. This paper proposes a routing algorithm called MINDEL for assigning flows to distributed network links. With polynomial complexity this algorithm tends to minimize each packet delay by avoiding as much as possible the congested routes. Numerical results confirm the efficiency of such an algorithm, particularly for large networks, which convinces us that it could be efficiently used in high-speed networks.","PeriodicalId":286255,"journal":{"name":"Proceedings of 22nd Annual Conference on Local Computer Networks","volume":"98 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1997-11-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124899467","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}
Stephen Dempsey, Eric Fryland, B. Hazzard, D. Cyganski
{"title":"Performance of asynchronous, variable bit rate communications over ATM: a comparison with FDDI","authors":"Stephen Dempsey, Eric Fryland, B. Hazzard, D. Cyganski","doi":"10.1109/LCN.1997.630895","DOIUrl":"https://doi.org/10.1109/LCN.1997.630895","url":null,"abstract":"Asynchronous transfer mode (ATM) technology performance is evaluated for Class C (variable bit rate, asynchronous) data transfer, as would be typically found when migrating legacy applications to an ATM environment. Of particular interest are the end-to-end latencies obtainable using ATM networks to transfer time critical data. Latencies obtained using classical IP over ATM and raw ATM using the Fore ATM API are compared to performance of traditional TCP/IP on equivalent FDDI networks. It is shown that at OC-3, in its simplest configuration of back to back nodes, classical IP over ATM latencies are greater than those obtained using FDDI, particularly at small message sizes. However, the results show that IP over ATM via ATM switches can exhibit better performance than FDDI switches or routers, due to the optimization of the ATM switch for fixed size cells. Thus, these benchmarks confirm that ATM provides a good foundation for building high performance IP internetworks. A discussion of trade-offs associated with using FDDI versus ATM for mission critical, real time data transfer applications is also included.","PeriodicalId":286255,"journal":{"name":"Proceedings of 22nd Annual Conference on Local Computer Networks","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1997-11-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132371541","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":"Practical experiences with a transport layer extension for end-to-end bandwidth regulation","authors":"M. Frank, P. Martini","doi":"10.1109/LCN.1997.631003","DOIUrl":"https://doi.org/10.1109/LCN.1997.631003","url":null,"abstract":"The paper presents an extension of the transport layer to control the bandwidth used by data flows in heterogeneous networks in case of network congestion. The regulation mechanism is operating on an end to end basis. It does not depend on a negotiation of quality of service (QoS) parameters prior to the data transmission. Instead it uses a relative QoS concept based on a classification of data flow requirements specified by the application. The paper describes the concept of the mechanism for Regulation Of Bandwidth in Intra-Networks (ROBIN) and presents first measurement results with a prototype implementation of ROBIN.","PeriodicalId":286255,"journal":{"name":"Proceedings of 22nd Annual Conference on Local Computer Networks","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1997-11-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124346405","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":"Next hop resolution using classical IP over ATM","authors":"Chan Park, H. Choi, Jin-Oh Kim, Jong Hyup Lee","doi":"10.1109/LCN.1997.630936","DOIUrl":"https://doi.org/10.1109/LCN.1997.630936","url":null,"abstract":"In principle, more than one routers are intervened between different IP subnets. IETF RFC1577 \"Classical IP and ARP over ATM\", which is specified to provide IP services on ATM network, also requires that the router be used between different LISs (Logical IP subnet). However, the intervention of the router is not always an effective solution on ATM network. If there is a direct virtual channel connection between two endpoints on ATM network, they can exchange their information directly without the help of routers. Actually, some groups of IETF and ATM Forum are looking on such tasks. As the results, NHRP (Next Hop Resolution Protocol) or MPOA (Multi-Protocol Over ATM) are being drafted. However, since those protocols are too heavy and complicate, it is not easy to implement. In this paper, we propose a simple efficient solution for inter-LIS communication. Our solution is exactly compatible with RFC1577. We describe how RFC1577 can be used to provide inter-LIS communications and introduce our prototype systems and test-bed network.","PeriodicalId":286255,"journal":{"name":"Proceedings of 22nd Annual Conference on Local Computer Networks","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1997-11-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129085012","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":"Reducing the effects of large propagation delays on high speed IEEE 802.3 CSMA/CD networks using collision truncation","authors":"M. Molle, B. Yeger","doi":"10.1109/LCN.1997.631001","DOIUrl":"https://doi.org/10.1109/LCN.1997.631001","url":null,"abstract":"A half duplex repeater is the cheapest method for connecting multiple hosts to an IEEE 802.3 Ethernet LAN. However, if we increase the data rate from 10 Mb/s Ethernet to 100 Mb/s Fast Ethernet, shared access via CSMA/CD becomes less efficient because of the resulting increase in size of the collision fragments. For example, in a typical star wired single repeater network with a diameter of 200 meters, upgrading from 10BASE-T to 100BASE-T increases the round trip delay from about 100 bit times to almost 500 bit times. Moreover, a further upgrade to 1000 Mb/s Gigabit Ethernet would increase the round trip delay to about 4000 bit times. We introduce a simple change to the handling of incoming signals at the repeater ports known as collision truncation, and show that it reduces the average duration of a collision by more than 50% for networks with large round trip delays. For the standard BEB Ethernet protocol operating at moderate load, collision truncation reduces the mean end to end network delay by more than 25% for 100 Mb/s Fast Ethernet and by more than 50% for 1000 Mb/s Gigabit Ethernet. For BLAM, collision truncation increases the maximum throughput by more than 10%, and reduces the mean end to end delay substantially under high load. Collision truncation requires no changes to the host network adapters, and its use is completely transparent to the hosts. The only behavioral change that is visible to the attached hosts is the illusion that the network diameter appears to have been reduced. The relative cost of adding collision truncation to a repeater is very small compared to upgrading to a frame level device, such as a bridge.","PeriodicalId":286255,"journal":{"name":"Proceedings of 22nd Annual Conference on Local Computer Networks","volume":"34 25","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1997-11-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"113941832","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 analysis of ATM switches with multistage multipath packet switching interconnection networks","authors":"A. Tentov","doi":"10.1109/LCN.1997.630896","DOIUrl":"https://doi.org/10.1109/LCN.1997.630896","url":null,"abstract":"Because of their ability of nonblocking and fault tolerance, multistage-multipath networks provide useful characteristics for ATM switches and large-scale parallel computers. In this paper an analytical model for the analysis of ATM switches based on multistage-multipath packet switching interconnection networks with finite buffering capacity at the output of switching elements is presented. The proposed model is general in that it analyzes ATM switches under uniform and nonuniform traffic. First, a general model of synchronous buffered switching element, using output buffering, under an assumption of finite buffer size for a very general class of traffic patterns, is presented. It is assumed that the subsequent stages of the network are nearly independent, and a model is extended for the entire network under this assumption. The analytical results obtained with the proposed model are then compared with the results obtained for single path networks, and it is shown that the model is general enough for the class of multipath networks.","PeriodicalId":286255,"journal":{"name":"Proceedings of 22nd Annual Conference on Local Computer Networks","volume":"60 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123711731","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}