{"title":"Implementation of a bandwidth broker for dynamic end-to-end resource reservation in outsourced virtual private networks","authors":"I. Khalil, T. Braun","doi":"10.1109/LCN.2000.891092","DOIUrl":"https://doi.org/10.1109/LCN.2000.891092","url":null,"abstract":"As today's network infrastructure continues to grow and Differentiated Services IP backbones are now available to provide various levels of quality of service (QoS) to VPN traffic, the ability to manage increasing network complexity is considered as a crucial factor for QoS enabled VPN solutions. There is growing trend by corporate customers to outsource such complicated management services to Internet service providers (ISP) not only to avoid the for economic reasons. We present methods to provide end-to-end capacity allocation to VPN connections in a single ISP domain and show the implementation of a bandwidth broker managing the outsourced VPNs for corporate customers that have service level agreements (SLAs) with their ISPs. We also present practical configuration examples of commercial routers for enabling QoS enabled VPN tunnels and show how the bandwidth broker can dynamically establish tunnels when users send connection requests from the WWW interface.","PeriodicalId":369604,"journal":{"name":"Proceedings 25th Annual IEEE Conference on Local Computer Networks. LCN 2000","volume":"199 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":"115718308","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}
Y. Tobe, Y. Tamura, A. Molano, Sourav Ghosh, H. Tokuda
{"title":"Achieving moderate fairness for UDP flows by path-status classification","authors":"Y. Tobe, Y. Tamura, A. Molano, Sourav Ghosh, H. Tokuda","doi":"10.1109/LCN.2000.891037","DOIUrl":"https://doi.org/10.1109/LCN.2000.891037","url":null,"abstract":"We propose a scheme of rate control for continuous UDP flow with moderate fairness. First, per-packet relative one-way trip time (ROTT) of a UDP stream at a receiver on the Internet is investigated extensively, and it is found that spikes with successive plots, which we call spike-trains, often appear on a time-ROTT graph. Also, congestion-related losses are found to be strongly correlated only to the spike-trains and the path status is effectively identified by such spike-trains. Based on these observations, a rate control with moderate fairness using the path-status, PAth-STatus-based RAte control (PASTRA), is presented. The effectiveness of PASTRA in achieving moderate fairness for UDP streams on the Internet is demonstrated.","PeriodicalId":369604,"journal":{"name":"Proceedings 25th Annual IEEE Conference on Local Computer Networks. LCN 2000","volume":"20 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":"125966134","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":"Proportional packet loss differentiation and buffer management for differentiated services in the Internet","authors":"M. Markaki, M. Saltouros, I. Venieris","doi":"10.1109/LCN.2000.891061","DOIUrl":"https://doi.org/10.1109/LCN.2000.891061","url":null,"abstract":"The design of a buffer management algorithm, with controllable quality-of-service (QoS) commitments in terms of packet loss, is addressed for IP routers in a differentiated services architecture. The objectives of the proposed policy are to utilize the buffer space efficiently to coordinate with the class-based queuing (CBQ) scheduling algorithm adopted by the IP routers, and mainly to be able to adjust the quality spacing between the different QoS traffic classes. Using OPNET Modeler 6.0.L as a simulation platform, the proposed scheme is compared along with conventional buffer management policies, such as complete partitioning (CP), push-out (PO) and push-out with threshold (POT). Numerical results demonstrate the controllable relative differentiation between classes achieved by the proposed scheme.","PeriodicalId":369604,"journal":{"name":"Proceedings 25th Annual IEEE Conference on Local Computer Networks. LCN 2000","volume":"10 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":"123999949","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 traffic grooming scheme for single-hub SONET/WDM rings","authors":"Xiangyang Li, Liwu Liu, P. Wan, O. Frieder","doi":"10.1109/LCN.2000.891100","DOIUrl":"https://doi.org/10.1109/LCN.2000.891100","url":null,"abstract":"In SONET/WDM networks, one fiber supports multiple wavelengths and each wavelength supports several low rate tributary streams. Traffic grooming is then defined as properly using the SONET add/drop multiplexer (ADM) to electronically multiplex and demultiplex required tributary traffic patterns with minimal resource cost (wavelengths and ADMs). This paper studies the traffic grooming problem in single hub SONET/WDM networks and extends existing results. We analyze the real deployments, generalize their results, and study the practical special cases. We prove that BLSR/2 would never be more expensive than UPSR under any traffic pattern. We present the exact minimum costs of uniform traffic in both UPSR and BLSR/2. We also give approximation algorithms for optimal grooming of non-uniform traffic after showing that this problem is NP-complete. Finally, we consider how to select the line speeds if there are two different line speeds available.","PeriodicalId":369604,"journal":{"name":"Proceedings 25th Annual IEEE Conference on Local Computer Networks. LCN 2000","volume":"96 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":"124606905","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":"Intra-domain bandwidth management in differentiated services network","authors":"S. Jha, Mahbub Hassan, P. Nanda, Nadeem Ahmed","doi":"10.1109/LCN.2000.891064","DOIUrl":"https://doi.org/10.1109/LCN.2000.891064","url":null,"abstract":"In absence of any link layer traffic controls or priority-queuing mechanism in LAN infrastructure (such as shared media LAN), the subnet bandwidth management based approach of managing bandwidth is limited to only the total amount of traffic load imposed by RSVP associated flows. In such cases no mechanism is available to separate RSVP flows from best effort traffic. This brings the usefulness of the subnet bandwidth manager into question. This uses a combination of integrated services of a specific link layer model based on RSVP and an IP rate-control approach for best effort traffic to manage intra-domain traffic in a differentiated services network.","PeriodicalId":369604,"journal":{"name":"Proceedings 25th Annual IEEE Conference on Local Computer Networks. LCN 2000","volume":"31 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":"124540049","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}
Sejun Song, Jiandong Huang, P. Kappler, R. Freimark, T. Kozlik
{"title":"Fault-tolerant Ethernet middleware for IP-based process control networks","authors":"Sejun Song, Jiandong Huang, P. Kappler, R. Freimark, T. Kozlik","doi":"10.1109/LCN.2000.891017","DOIUrl":"https://doi.org/10.1109/LCN.2000.891017","url":null,"abstract":"We present an efficient middleware-based fault-tolerant Ethernet (FTE) developed for process control networks. Our approach is unique and practical in the sense that it requires no change to commercial off-the-shelf hardware (switch, hub, Ethernet physical link, and network interface card) and software (commercial Ethernet NIC card driver and standard protocol such as TCP/IP) yet it is transparent to IP-based applications. The FTE performs failure detection and recovery for handling multiple points of network faults and supports communications with non-FTE-capable devices. Our experimentation shows that FTE performs efficiently, achieving less than 1-ms end-to-end swap time and less than 2-sec failover time, regardless of the concurrent application and system loads. In this paper, we describe the FTE architecture, the challenging technical issues addressed, our performance evaluation results, and the lessons learned in design and development of such an open-network-based fault-tolerant network.","PeriodicalId":369604,"journal":{"name":"Proceedings 25th Annual IEEE Conference on Local Computer Networks. LCN 2000","volume":"83 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":"124118284","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 software virtual private networks (VPN)","authors":"C.J.C. Pena, Joseph B. Evans","doi":"10.1109/LCN.2000.891094","DOIUrl":"https://doi.org/10.1109/LCN.2000.891094","url":null,"abstract":"Virtual private networks implemented in software provide an economic and accessible alternative to hardware VPN solutions. Software VPNs may have a significant impact on performance, producing high CPU usage and limiting network throughput. This paper presents the performance measurements of several VPN programs. The results over a 100 Mb/s Ethernet link show that the transference speed can degrade in more than 65% while the CPU usage can reach 97%, when strong encryption is enabled. Compression implemented at the user level adds an additional CPU overhead that has a negative effect on the performance. The results over a low speed serial link show that the CPU usage is not significantly affected by the VPN. Furthermore, compression can be enabled without overhead, increasing the network throughput when the data is compressible.","PeriodicalId":369604,"journal":{"name":"Proceedings 25th Annual IEEE Conference on Local Computer Networks. LCN 2000","volume":"195 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":"131827944","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":"Assignment of multicast switches in optical networks","authors":"Maher Ali","doi":"10.1109/LCN.2000.891071","DOIUrl":"https://doi.org/10.1109/LCN.2000.891071","url":null,"abstract":"This paper addresses the optimal placement of multicast nodes in all-optical networks. An approximate analytical model for the blocking probability in multicast networks is developed. The blocking model is used to guide two heuristics for the placement problem. The two heuristics are: (1) the famous warehouse allocation heuristic (ADD) and (2) simulated annealing.","PeriodicalId":369604,"journal":{"name":"Proceedings 25th Annual IEEE Conference on Local Computer Networks. LCN 2000","volume":"42 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":"127650072","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":"Indoor location technique for 2G and 3G cellular/PCS networks","authors":"D. Shyy, B. Rohani","doi":"10.1109/LCN.2000.891038","DOIUrl":"https://doi.org/10.1109/LCN.2000.891038","url":null,"abstract":"Although many outdoor location techniques have been proposed, there is no cost-effective indoor location technique. This paper presents a practical indoor location technique applicable to all 2G and 3G cellular/PCS indoor systems. Two typical indoor cellular/PCS architectures are considered. Recommendation for how to deploy the indoor location system with respect to each architecture is given. Simulation has been performed to validate the proposed concept. Also discussed is how to design a cost-effective indoor base station considering location service as one of the critical requirements.","PeriodicalId":369604,"journal":{"name":"Proceedings 25th Annual IEEE Conference on Local Computer Networks. LCN 2000","volume":"26 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":"130520174","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":"Simple reliable multicast for parallel processing in extended LANs","authors":"J. Mulik, P. Conrad, Yuan Shi","doi":"10.1109/LCN.2000.891080","DOIUrl":"https://doi.org/10.1109/LCN.2000.891080","url":null,"abstract":"A typical problem for a parallel processing system involves broadcasting large amounts of data from a master to several worker programs. This paper describes a reliable-multicast method to reduce the communication costs of this distribution. Our solution relies on a tuple-space mechanism as implemented in the Synergy system. We present results showing that even a simple implementation of reliable multicast can dramatically improve performance.","PeriodicalId":369604,"journal":{"name":"Proceedings 25th Annual IEEE Conference on Local Computer Networks. LCN 2000","volume":"23 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":"114874460","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}