{"title":"Real-time performance analysis for linear token passing bus networks","authors":"Z. Qiang, Luo Zhiqiang, Xiong Huagang, L. Qiao","doi":"10.1109/LCN.2000.891026","DOIUrl":"https://doi.org/10.1109/LCN.2000.891026","url":null,"abstract":"This paper provides a study of the use of linear token passing bus (LTPB) networks to support real-time communication in mission-critical systems. According to the exact network timing property, an optimal bandwidth allocation scheme (OLA) for LTPB networks and a real-time performance analysis method based on WCAU (worst available utilization) are proposed. Formal proof that OLA has a better performance than any other scheme is given. Finally examples are presented to demonstrate the correctness of the conclusion.","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":"124037885","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 comparative survey of synchronization algorithms for continuous media in network environments","authors":"Y. Ishibashi, S. Tasaka","doi":"10.1109/LCN.2000.891066","DOIUrl":"https://doi.org/10.1109/LCN.2000.891066","url":null,"abstract":"This paper makes a survey of algorithms proposed for continuous media synchronization in network environments. We classify media synchronization control techniques used in the algorithms into four categories: basic control, preventive control, reactive control and common control. We also pick four representatives from among the media synchronization algorithms and give outlines of them in order to explain how the techniques are employed in each algorithm. Furthermore, we make a comparison among 38 algorithms in terms of factors such as clocks, advance information on network delay bounds and synchronization control techniques, which determine the design of each algorithm.","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":"130074208","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":"Algorithms for the minimal cutsets enumeration of networks by graph search and branch addition","authors":"Heejong Suh, Carl K. Chang","doi":"10.1109/LCN.2000.891015","DOIUrl":"https://doi.org/10.1109/LCN.2000.891015","url":null,"abstract":"This paper presents effective algorithms for enumerating the minimal cutsets of networks. After a graph is modeled after a network, first, by a graph method the spanning tree of the graph and binary tree whose event is complement to it are evaluated. The sub-vertex set represented by the binary tree is referenced, and an algorithm which evaluates the minimal cutsets is proposed. This algorithm requires a space memorizing a topology of the graph, and has a time complexity which is proportional to a number of the edges of the graph and the binary tree. Second, by adding the branch, an algorithm enumerating the cutsets, which separates the sub-vertex set and a disjoint vertex set of the graph, is proposed. This algorithm does not enumerate all the events which the vertex and edge set can have, and executes computation to only the number of minimal cutsets. The space needed is proportional to the square of the number of the vertexes, and time complexity is in the order of the number of cutsets. The reliability is computed from the events of cutset.","PeriodicalId":369604,"journal":{"name":"Proceedings 25th Annual IEEE Conference on Local Computer Networks. LCN 2000","volume":"24 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":"131868359","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":"Multi-cores uni-directional shared trees multicast routing protocol","authors":"Yulu Ma, Shiduan Cheng","doi":"10.1109/LCN.2000.891089","DOIUrl":"https://doi.org/10.1109/LCN.2000.891089","url":null,"abstract":"CBT and PIM-SM are two typical intradomain multicast routing protocols. However, CBT lacks an efficient member management mechanism such as admission control and authentication for senders of multicast group, and PIM-SM lacks robustness. This paper proposes a new one, which can effectively solve the both problems through admitting senders at multiple cores and transporting packets in a uni-direction. Furthermore, the protocol is easy to implement.","PeriodicalId":369604,"journal":{"name":"Proceedings 25th Annual IEEE Conference on Local Computer Networks. LCN 2000","volume":"225 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":"115821371","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":"Generalized autoregressive moving average modeling of the Bellcore data","authors":"Rajalakshmi Ramachandran, V. Bhethanabotla","doi":"10.1109/LCN.2000.891112","DOIUrl":"https://doi.org/10.1109/LCN.2000.891112","url":null,"abstract":"Generalized autoregressive moving average (GARMA) models are fitted to the Leland et al. (1994) Bellcore Ethernet trace data. We find the time series to have long memory. In addition, we find evidence for self-similarity, as was also found in earlier studies. Our GARMA analysis shows the time series m-aggregated at 0.01, 10, 100 and 1000 seconds to be non-stationary. However, the first differences of these series are found to be stationary by the same analysis, and are represented well by GARMA models. Unlike in earlier studies, our estimation methodology can be extended to forecast the time series. We present GARMA model forecasts for the first difference of the m-aggregated data at 100, and compare with ARIMA forecasts. The fitted GARMA(0,0) model forecast is very good and tracks both the level and pattern in the time series with a negligible 95% confidence interval of 0.02. The ARIMA(15,1,5) model can track neither the level nor the pattern, and has a 95% confidence interval of 0.86 (nearly the same magnitude of the time series data) for the same 1000 predicted points. The fitted GARMA(0,0) model utilizes 4 parameters versus 23 for the ARIMA(15,1,5) model. The autocorrelation and partial autocorrelation functions indicate a very large number of parameters for the ARIMA model. Based on the similarity of the spectra of the time series data m-aggregated at various levels, we can expect similar quality of forecasts for those series using the GARMA framework.","PeriodicalId":369604,"journal":{"name":"Proceedings 25th Annual IEEE Conference on Local Computer Networks. LCN 2000","volume":"29 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":"126770969","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 methodology for performance management of networks","authors":"Á. Drago, A. Garcia, M. Monteiro","doi":"10.1109/LCN.2000.891082","DOIUrl":"https://doi.org/10.1109/LCN.2000.891082","url":null,"abstract":"This paper proposes a proactive performance management methodology, based on performance analysis, capacity planning and discrete events simulation tools. The main objective is to provide a practical framework to aid the network operators and managers to keep up the network performance. A case study based on the application of proposed methodology for a large-scale enterprise network and its results are presented.","PeriodicalId":369604,"journal":{"name":"Proceedings 25th Annual IEEE Conference on Local Computer Networks. LCN 2000","volume":"334 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":"121246415","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}
Boon Peng Lee, R. Balan, L. Jacob, Winston K.G. Seah, A. Ananda
{"title":"TCP tunnels: avoiding congestion collapse","authors":"Boon Peng Lee, R. Balan, L. Jacob, Winston K.G. Seah, A. Ananda","doi":"10.1109/LCN.2000.891077","DOIUrl":"https://doi.org/10.1109/LCN.2000.891077","url":null,"abstract":"This paper examines the attributes of TCP tunnels which are TCP circuits that carry IP packets and benefit from the congestion control mechanism of TCP/IP. The deployment of TCP tunnels reduces the many flows situation on the Internet to that of a few flows. TCP tunnels eliminate unnecessary packet loss in the core routers of the congested backbones which waste precious bandwidth leading to congestion collapse due to unresponsive UDP flows. We also highlight that the use of TCP tunnels can, in principle, help prevent certain forms of congestion collapse described by Floyd & Fall (see IEEE/ACM Transactions on Networking, vol.7, no.4, p.458-72, 1999). Using a testbed often Intel PCs running the Linux operating system and traffic generators simulating user applications, we explore: the benefits which TCP tunnels confer upon its payload of user IP traffic; the impact on the congestion within network backbones, and the protection that tunnels offer with respect to the various competing classes of traffic in terms of bandwidth allocation and reduced retransmissions. The deployment of TCP tunnels on the Internet and the issues involved are also discussed and we conclude that with the RFC2309 recommendation of using random early drop (RED) as the default packet-drop policy in Internet routers, coupled with the implementation of a pure tunnel environment on backbone networks makes the deployment of TCP tunnels a feasible endeavour worthy of further investigation.","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":"127631524","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}
Sashi Lazar, S. B. Kodeswaran, Rekuram Varadharaj, D. Sidhu
{"title":"ATM network connection management using mobile agents","authors":"Sashi Lazar, S. B. Kodeswaran, Rekuram Varadharaj, D. Sidhu","doi":"10.1109/LCN.2000.891108","DOIUrl":"https://doi.org/10.1109/LCN.2000.891108","url":null,"abstract":"Configuration management is an integral part of the network management effort. ATM network configuration management must support the creation, modification, and termination of virtual path and channel connections, provide ILMI support for neighboring nodes, and support interface and buffer management for intermediate systems. Currently, permanent virtual circuits (PVCs) are established manually by creating a permanent virtual path link to form the desired connection. As ATM networks grow in size, configuration management must implement an intelligent approach for creating, re-configuring, and destroying permanent virtual circuits. This paper presents a mobile agent based connection management scheme for establishment and teardown of PVCs in an ATM network.","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":"134399087","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":"Mobile stations localization in a WLAN","authors":"F. Peyrard, C. Soutou, J. Mercier","doi":"10.1109/LCN.2000.891019","DOIUrl":"https://doi.org/10.1109/LCN.2000.891019","url":null,"abstract":"This paper proposes a localization protocol of mobile stations in a WLAN (wireless local area network). The originality of this protocol is made of two parts (i) we use an object-relational database and (ii) we use a semaphore channel devoted to localize mobile stations in access point coverage areas and in virtual coverage areas via near-to-near relays. The database manages the knowledge of the mobile stations related to the access points (roaming) and an historical record of the last moves of the mobile stations. This protocol was written in Java, we also used the JDBC (Java DataBase Connectivity) classes to interoperate with the database.","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":"133367174","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":"Hierarchical QoS routing in delay-bandwidth sensitive networks","authors":"K. Lui, K. Nahrstedt, Shigang Chen","doi":"10.1109/LCN.2000.891103","DOIUrl":"https://doi.org/10.1109/LCN.2000.891103","url":null,"abstract":"Large networks are often structured hierarchically by grouping nodes into different domains in order to deal with the scaling problem. In such networks, it is infeasible to maintain the detailed network information at every router. Therefore, the topology information of the domains are summarized before being broadcast. This process is called topology aggregation. Hierarchical routing protocols are then used to find a route among the domains. We study several basic problems associated with hierarchical QoS routing, including (1) how to make QoS-aware topology aggregation, (2) how to represent the aggregated network state, and (3) how to find an end-to-end route based on aggregated information. The novelty in this research is our new network QoS representation which is line segments on the delay-bandwidth plane. We also present a distributed routing mechanism that works with our representation. Our theoretical and simulation results show that the protocol achieves scalability and improved routing performance.","PeriodicalId":369604,"journal":{"name":"Proceedings 25th Annual IEEE Conference on Local Computer Networks. LCN 2000","volume":"16 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":"134058278","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}