{"title":"Nonlinear time-series model for VBR video traffic","authors":"J. L. Davis, K. Chandra, C. Thompson","doi":"10.1109/LCN.2000.891115","DOIUrl":"https://doi.org/10.1109/LCN.2000.891115","url":null,"abstract":"Variable bit rate (VBR) H.261 encoded video traffic is modeled by a nonlinear time series process. A threshold autoregressive (TAR) process is of particular interest. The TAR model is comprised of a set of autoregressive (AR) processes that are switched according to the amplitude of bit rates of the time series. The TAR model is shown to capture accurately the statistical characteristics of multiplexed video sources. The buffer occupancy in a first-in first-out (FIFO) deterministic service queue using sources modeled by a TAR is compared with Markov chain based processes and it is shown that a TAR model of lower complexity yields comparable results.","PeriodicalId":369604,"journal":{"name":"Proceedings 25th Annual IEEE Conference on Local Computer Networks. LCN 2000","volume":"175 6","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-11-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120893127","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":"Link-based performance monitoring of ATM networks","authors":"B. Thurm, H. Wiltfang","doi":"10.1109/LCN.2000.891106","DOIUrl":"https://doi.org/10.1109/LCN.2000.891106","url":null,"abstract":"The complexity of today's communication networks supporting a wide range of QoS parameters and providing almost \"unlimited\" bandwidth intensifies the importance of adequate management solutions. Especially for ATM with its inherent distribution aspect caused by the concept of virtual connections, the management and monitoring of the whole network-not only of single devices-is crucial for guaranteeing an efficient operation. In this context, the following paper presents an approach to link-based performance monitoring of ATM networks. Based on our functional management architecture and our ATM network monitor new monitoring functions which provide aggregated statistical data about throughput and error rate of the physical links of an ATM network are described. Existing management information bases (MIBs) are evaluated regarding their suitability for performance monitoring and a new MIB, the ATM-QOS-LINK-MIB, is introduced. Since it is planned to use these functions in the campus backbone of our university one part of the paper concerns several enhancements providing improved flexibility of the monitoring process necessary for ATM components manageable mainly through private MIBs.","PeriodicalId":369604,"journal":{"name":"Proceedings 25th Annual IEEE Conference on Local Computer Networks. LCN 2000","volume":"3 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":"115485482","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":"TCP performance analysis of a DMT-based ADSL system","authors":"Xiaoning He","doi":"10.1109/LCN.2000.891081","DOIUrl":"https://doi.org/10.1109/LCN.2000.891081","url":null,"abstract":"This paper examines the performance of TCP, the Internet data transport protocol, over a DMT-based ADSL system. Specifically, we attempt to develop a basic understanding, using analysis and simulation, of the properties of TCP over an ADSL system. The following key results are obtained. First, high error probability leads to significant throughput deterioration. Second, there is an optimal data rate which will maximize the TCP throughput under constraint energy. We conclude the paper by presenting the preliminary analytical and simulation results.","PeriodicalId":369604,"journal":{"name":"Proceedings 25th Annual IEEE Conference on Local Computer Networks. LCN 2000","volume":"79 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":"126775594","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}
Jonathan C. L. Liu, Lin Xia, D. Du, R. Tsang, A. Pavan
{"title":"Scheduling algorithms for a high-speed switch supporting real-time periodic traffic sources","authors":"Jonathan C. L. Liu, Lin Xia, D. Du, R. Tsang, A. Pavan","doi":"10.1109/LCN.2000.891116","DOIUrl":"https://doi.org/10.1109/LCN.2000.891116","url":null,"abstract":"The successful operation of mission critical systems requires a sophisticated control network which provides for the real-time delivery of data from a very large number of diverse sources such as sensors, audio/video surveillance, computational sources, etc., as well as remote monitoring and diagnosis sources. It is expected that many of the traffic sources will be in the form of periodic sources with real-time requirements. In this study, we propose fast scheduling algorithms for multiplexing periodic source flows with real-time delivery requirements. We assume a single switch environment with periodic source flows being supported over a constant bit rate (CBR) type circuit. We undertake a systematic study beginning from the simplest scenario where all traffic flows consist of data frames of the same size and with the same real-time delay requirement. In this case, we prove that the FCFS algorithm is optimal. We conclude with the most difficult case of examining CBR flows of variable bandwidth requirements and variable delay requirements. Algorithms and analysis are presented for all the cases. The simulation results show the substantial performance gains provided by the proposed algorithms.","PeriodicalId":369604,"journal":{"name":"Proceedings 25th Annual IEEE Conference on Local Computer Networks. LCN 2000","volume":"40 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":"126331869","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":"Quality of service using traffic engineering over MPLS: an analysis","authors":"Wei Sun, Praveen Bhaniramka, R. Jain","doi":"10.1109/LCN.2000.891035","DOIUrl":"https://doi.org/10.1109/LCN.2000.891035","url":null,"abstract":"We compare the service received by TCP and UDP flows when they share either a link or a Multiprotocol Label Switching (MPLS) traffic trunk. Since MPLS traffic trunks allow non-shortest path links also to be used, the total network throughput goes up with proper traffic engineering. We found that if UDP and TCP flows are mixed in a trunk, TCP flows receive a reduced service as the UDP flows increase their rates. Also, we found that in order to benefit from traffic engineering, MPLS trunks should be implemented end-to-end (first router to last router). If some part of the network is MPLS trunk-unaware, the benefits are reduced or eliminated.","PeriodicalId":369604,"journal":{"name":"Proceedings 25th Annual IEEE Conference on Local Computer Networks. LCN 2000","volume":"15 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":"126457931","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":"Provisioning multilayer restoration for convergence","authors":"J. Kroculick, C. Hood","doi":"10.1109/LCN.2000.891016","DOIUrl":"https://doi.org/10.1109/LCN.2000.891016","url":null,"abstract":"Applications that require mission critical service will traverse multiple networks, which implement different protocol suites. Each layer in a suite has a recovery scheme that can reroute connections at that layer. We show that the solution to the repair of a fault that affects multiple layers lies in the provisioning of restoration at each layer to cooperate. Without some coordination between restoration mechanisms, an outage duration would be lengthened as methods assigned to each layer interfere with each other or the network would be locked up in a deadlocked state that never converges to a new topology. A set of control policies can be specified to coordinate between restoration mechanisms in a network that spans multiple layers and regions. These control policies are expressed as rules, and are collectively denoted as the escalation strategy. The escalation strategy can be provisioned by a network manager and is implemented as a distributed coordination protocol between peer recovery agents in the nodes.","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":"130157599","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 key distribution in secure multicasting","authors":"Kuen-Pin Wu, S. Ruan, F. Lai, Chih-Kuang Tseng","doi":"10.1109/LCN.2000.891029","DOIUrl":"https://doi.org/10.1109/LCN.2000.891029","url":null,"abstract":"Multicasting has been widely utilized for delivering messages from one sender to multiple recipients. Nowadays in some applications such as pay per view or video-conferencing systems, the messages delivered via multicasting should be available to authorized recipients only. Therefore, secure multicasting becomes an important design issue in a distributed environment. To achieve secure multicasting, all authorized recipients form a group and share a group key; messages should be encrypted by the key before they are multicasted. For the sake of security, we need a new group key if someone joins/leaves the group. Consequently, our goal is aimed at finding a way to distribute the new key securely and efficiently. We propose a new solution to the problem; we distribute new keys through a special function called the secure filter. Compared with related work, our solution requires less system resources to change group members.","PeriodicalId":369604,"journal":{"name":"Proceedings 25th Annual IEEE Conference on Local Computer Networks. LCN 2000","volume":"41 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":"131028278","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":"Programmable resource control in global active IP networks","authors":"Hui Guo, T. Becker","doi":"10.1109/LCN.2000.891027","DOIUrl":"https://doi.org/10.1109/LCN.2000.891027","url":null,"abstract":"The paper presents a resource control framework for active IP networks. Generic router resource abstractions are discussed to supporting network programming by a wide variety of active network services. Dynamic partitioning is described as an adaptive bandwidth allocation scheme to provide safe resource access and efficient multiplexing. Policy in the form of code is use to enable customization by operators via the CORBA interface. The framework is a key module in an enhanced ORB, a middleware platform for active services, and can be dynamically installed as downloadable objects.","PeriodicalId":369604,"journal":{"name":"Proceedings 25th Annual IEEE Conference on Local Computer Networks. LCN 2000","volume":"213 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":"133133325","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":"High-speed calculation method of the Hurst parameter based on real traffic","authors":"Tatsuya Hagiwara, H. Doi, H. Tode, H. Ikeda","doi":"10.1109/LCN.2000.891113","DOIUrl":"https://doi.org/10.1109/LCN.2000.891113","url":null,"abstract":"Previous studies on traffic measurement analysis in the various networks have shown that packet traffic exhibits long range dependent properties called self-similarity. Some papers reported that self-similarity degrades the network performance, such as buffer overflow. Thus, we need new network control considering self-similar properties. Network control considering the self-similarity requires high speed calculation method of the Hurst parameter. However, such a method has not been proposed yet. In this paper, we propose high-speed calculation method of the Hurst parameter based on the variance-time plot method, and show its performance. Furthermore, we try to show the effectiveness of the network control with self-similarity.","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":"114429306","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}
Lin Xu, R. Tönjes, T. Paila, W. Hansmann, M. Frank, Markus Albrecht
{"title":"DRiVE-ing to the Internet: Dynamic Radio for IP services in Vehicular Environments","authors":"Lin Xu, R. Tönjes, T. Paila, W. Hansmann, M. Frank, Markus Albrecht","doi":"10.1109/LCN.2000.891040","DOIUrl":"https://doi.org/10.1109/LCN.2000.891040","url":null,"abstract":"The European Union funded DRiVE project (Dynamic Radio for IP Services in Vehicular Environments) aims at enabling spectrum-efficient high-quality wireless IP communication in a heterogeneous multi-radio environment to deliver in-vehicle multimedia services. Key issues are spectrum efficiency and dynamic spectrum allocation within different radio networks, the IPv6 based network infrastructure with inter-working of cellular and broadcast radio networks, as well as adaptive services for the vehicular environment with a high degree of mobility. The paper gives a general overview of the DRiVE project and focuses on the network architecture for IP over multi-radio access networks and traffic control aspects within the emerging \"DRiVE\" network.","PeriodicalId":369604,"journal":{"name":"Proceedings 25th Annual IEEE Conference on Local Computer Networks. LCN 2000","volume":"134 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":"116514295","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}