{"title":"Efficient congestion avoidance mechanism","authors":"A. Sailer, S. Fdida","doi":"10.1109/LCN.2000.891034","DOIUrl":"https://doi.org/10.1109/LCN.2000.891034","url":null,"abstract":"Increasing uncontrolled best-effort traffic deteriorates the ability of TCP to control congestion and is a source of high drop rates. This paper proposes an efficient congestion avoidance mechanism (ECAM) suitable for uncontrolled unicast and multicast best-effort flows. ECAM relies on and enhances a previous congestion avoidance mechanism for non-reliable flows that we have proposed previously. The key reason to the generality of our mechanism is the decoupling of congestion control from reliability through the use of source quench-like congestion feedback to the senders. As one of the main causes for high packet loss rates in the Internet is the lack of early notification of network congestion, we use active queue management techniques that have been developed to cope with this problem. Hence, we originally adapt random early detection (RED) and early congestion notification (ECN) for UDP in order to allow the UDP flows to be adaptive to network dynamics. We demonstrate through simulation that ECAM significantly reduces packet loss, enhance UDP to fairly coexist with TCP flows and provides an efficient and simple solution to congestion avoidance.","PeriodicalId":369604,"journal":{"name":"Proceedings 25th Annual IEEE Conference on Local Computer Networks. LCN 2000","volume":"135 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-11-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124228379","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}
J. Harju, Y. Koucheryavy, J. Laine, Sampo Saaristo, K. Kilkki, J. Ruutu, H. Waris, Juha Forsten, J. Oinonen
{"title":"Performance measurements and analysis of TCP flows in a differentiated services WAN","authors":"J. Harju, Y. Koucheryavy, J. Laine, Sampo Saaristo, K. Kilkki, J. Ruutu, H. Waris, Juha Forsten, J. Oinonen","doi":"10.1109/LCN.2000.891060","DOIUrl":"https://doi.org/10.1109/LCN.2000.891060","url":null,"abstract":"This paper presents results from performance measurements carried out in a differentiated services WAN connecting three major cities in southern Finland. The target of the measurements was to collect precise information about the level of service experienced by a user transmitting files with FTP in a network that implements service differentiation by using drop precedence levels and separate classes for real time and non-real time traffic. Special attention was paid to the behaviour of competing TCP flows produced by users with different service level specifications. Background traffic from ISPs network was injected into our test network in order to create traffic profiles which are typical in a core network. The results show clearly that the SIMA model used for the implementation of the DS mechanisms in the network nodes can provide service differentiation in a useful and fair manner in traffic conditions varying from light load to severe overload.","PeriodicalId":369604,"journal":{"name":"Proceedings 25th Annual IEEE Conference on Local Computer Networks. LCN 2000","volume":"36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-11-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124806241","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 QoS routing algorithm based on ant algorithm","authors":"Zhang Subing, Liu Zemin","doi":"10.1109/LCN.2000.891102","DOIUrl":"https://doi.org/10.1109/LCN.2000.891102","url":null,"abstract":"The requirements of routing due to multimedia applications are discussed. In order to solve the QoS constrained routing effectively and efficiently, we construct a globally optimizing ant algorithm, which is based on the ability of ants to find the shortest path between their nest and the food source during their search for food. Simulation results show that the proposed approach can realize QoS routing effectively and efficiently.","PeriodicalId":369604,"journal":{"name":"Proceedings 25th Annual IEEE Conference on Local Computer Networks. LCN 2000","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-11-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122801180","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":"Adaptive approaches to enhance throughput of IEEE 802.11 wireless LAN with bursty channel","authors":"S. Ci, H. Sharif","doi":"10.1109/LCN.2000.891006","DOIUrl":"https://doi.org/10.1109/LCN.2000.891006","url":null,"abstract":"Two simple back-off based fragment adaptive algorithms for improving the throughput of IEEE 802.11 wireless LAN are proposed and studied. The simulation results show major improvement in channel throughput and reduction in system end-to-end delay. The results also indicate that proposed adaptive fragmentation algorithms perform the best when the channel is very noisy.","PeriodicalId":369604,"journal":{"name":"Proceedings 25th Annual IEEE Conference on Local Computer Networks. LCN 2000","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-11-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129376776","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":"Effect of genetic algorithm parameters on PCS network planning","authors":"Juan Li, Y. Guan, B. Soong","doi":"10.1109/LCN.2000.891074","DOIUrl":"https://doi.org/10.1109/LCN.2000.891074","url":null,"abstract":"A study on the effect of genetic parameters is carried out in order to find the optimum value of the parameters in genetic algorithms for solving personal communication service network planning problems. As for any genetic algorithm, one of the problems is its convergence behavior which is affected by many factors including the genetic parameters. The selection of these genetic parameters is generally quite ad hoc. However, we find in this study that proper parameter selection is critical because they significantly affect the convergence and optimality of the solution obtained.","PeriodicalId":369604,"journal":{"name":"Proceedings 25th Annual IEEE Conference on Local Computer Networks. LCN 2000","volume":"62 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-11-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130445721","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 architecture for seamless access to multicast content","authors":"P. Liefooghe, M. Goossens","doi":"10.1109/LCN.2000.891088","DOIUrl":"https://doi.org/10.1109/LCN.2000.891088","url":null,"abstract":"We describe an architecture, which allows transparent access to the multicast infrastructure even when not directly connected to it. In that context, we introduce the concepts dynamic tunnel server location and rare-based path characterization. We propose changes to the UMTP in order to allow dynamic tunnel server location through firewalls. We present dynamic congestion discovery with an associated tunnel hand-over mechanism. The features of a session directory application, which integrates the dynamic tunnel mechanism, is shown. The concept of \"channels\" for session announcements is introduced. Finally, we present a SAP/SDP proxy location and query mechanism.","PeriodicalId":369604,"journal":{"name":"Proceedings 25th Annual IEEE Conference on Local Computer Networks. LCN 2000","volume":"62 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-11-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128777726","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":"Location of mobiles stations in a wireless LAN","authors":"E. Llusca, T. Val, C. Normand, J. Mercier","doi":"10.1109/LCN.2000.891023","DOIUrl":"https://doi.org/10.1109/LCN.2000.891023","url":null,"abstract":"This paper presents a proposition of a location system for mobiles stations moving in an indoor environment. The location is made via two different mediums: infrared and ultrasound. An architecture of wireless LAN including radio medium dedicated to communication, infrared light and ultrasound for location is also presented.","PeriodicalId":369604,"journal":{"name":"Proceedings 25th Annual IEEE Conference on Local Computer Networks. LCN 2000","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-11-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125409761","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 impact of data compression on virtual private network transactions","authors":"J. P. McGregor, R. Lee","doi":"10.1109/LCN.2000.891091","DOIUrl":"https://doi.org/10.1109/LCN.2000.891091","url":null,"abstract":"Virtual private networks (VPNs) allow two or more parties to communicate securely over a public network. Using cryptographic algorithms and protocols, VPNs provide security services such as confidentiality, host authentication and data integrity. The computation required to provide adequate security, however, can significantly degrade the performance. We characterize the extent to which data compression can alleviate this performance problem in a VPN implemented with the IP Security Protocol (IPsec). We use a system model for IPsec transactions to derive an inequality that specifies the conditions required for data compression to improve performance. We generate performance results for many combinations of network types, data types, packet sizes, and encryption, authentication and compression algorithms. We find that compression usually improves the performance when using 10 Mbps or slower networks, but compression only improves the performance in systems with 100 Mbps or 1 Gbps networks when using computationally intensive encryption algorithms.","PeriodicalId":369604,"journal":{"name":"Proceedings 25th Annual IEEE Conference on Local Computer Networks. LCN 2000","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-11-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128182662","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}