{"title":"Faster link-state IGP convergence and improved network scalability and stability","authors":"G. Choudhury, A. Maunder, Vera D. Sapozhnikova","doi":"10.1109/LCN.2001.990780","DOIUrl":"https://doi.org/10.1109/LCN.2001.990780","url":null,"abstract":"It is desirable to have fast detection of failures followed by fast restoration and recovery in data networks (IP, ATM, frame relay, etc.) using link-state interior gateway protocols (IGP). This requires faster hello exchanges (unless one relies on link level detection which is not always possible), fast flooding, and more frequent shortest-path-first calculations. However, through analysis and simulation we show that this compromises the scalability and stability of the network. This is mainly because hello packets received at a router are indistinguishable from other packets and may experience long queueing delays during a sudden burst of many LSA (link-state advertisement) updates and cause the associated link to be declared down. At a later instant the link would recover. Both the failure and recovery generate fresh LSA, in effect developing a feedback loop to sustain the LSA storm. We suggest that hello and potentially some other IGP packets, such as acknowledgments, be marked explicitly so that they may be distinguished and queued separately from other IGP and data packets at the line rate and provided prioritized treatment. This allows significant reduction in IGP convergence time while maintaining network stability.","PeriodicalId":213526,"journal":{"name":"Proceedings LCN 2001. 26th Annual IEEE Conference on Local Computer Networks","volume":"520 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-11-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123047142","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}
S. Baatz, P. Martini, Christoph Scholz, M. Frank, Carmen Kühl
{"title":"Adaptive scatternet support for Bluetooth using sniff mode","authors":"S. Baatz, P. Martini, Christoph Scholz, M. Frank, Carmen Kühl","doi":"10.1109/LCN.2001.990776","DOIUrl":"https://doi.org/10.1109/LCN.2001.990776","url":null,"abstract":"Future applications of Bluetooth are likely to include ad-hoc networking. Therefore, it is desirable to interconnect multiple Bluetooth piconets to form a scatternet. Up to now, there is no extensive proposal for scatternet support available. We present and analyze an adaptive scheme for scatternet scheduling that is based on the sniff mode and thus does not require substantial modification of the current Bluetooth specification. The suitability of our approach is shown by first simulation results.","PeriodicalId":213526,"journal":{"name":"Proceedings LCN 2001. 26th Annual IEEE Conference on Local Computer Networks","volume":"36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-11-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123792253","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":"Application-level survivable software: rFTP proof-of-concept","authors":"M. Grzywa, Ajit Dharmik, W. Yurcik, L. Brumbaugh","doi":"10.1109/LCN.2001.990788","DOIUrl":"https://doi.org/10.1109/LCN.2001.990788","url":null,"abstract":"Application-level survivability, the ability to reconfigure an application to transparently maintain services when part of a system becomes unavailable, is the most flexible and comprehensive approach to supporting mission fulfillment since it can provide assurance over all lower layers within a networked system. We have developed Resumable FTP, an application based on RFC 959, which has the ability to resume the download of a file after the download has been interrupted by users or by lower layers (loss of connection). We present the design and experimental use of rFTP and conclude with future directions for work in application-layer survivability.","PeriodicalId":213526,"journal":{"name":"Proceedings LCN 2001. 26th Annual IEEE Conference on Local Computer Networks","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-11-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125407501","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 the temporal characteristics of video traffic","authors":"Tamás Borsos","doi":"10.1109/LCN.2001.990829","DOIUrl":"https://doi.org/10.1109/LCN.2001.990829","url":null,"abstract":"It is widely accepted that the video frame size process is long range dependent (LRD), which has been indicated by a number of statistical tests. This approach suggests the use of LRD traffic models for traffic engineering, which in many cases leads to subexponential queue tails in the network buffers. Basically, there are two concepts that are considered as the origin of LRD in video modeling: self-similarity and heavy tailed level durations. In this paper we argue for a new approach, where the frame size sequence is described by three processes representing three explicit time scales, all of them having a physical meaning. We demonstrate that this concept serves as an explanation for the outcome of the LRD tests. The properties that are attributed to long range dependence in fact seem to be the result of non-stationarity of the large time scale process. We also show that the high frequency component is short range dependent, thus questioning the presence of long range dependence in video traffic.","PeriodicalId":213526,"journal":{"name":"Proceedings LCN 2001. 26th Annual IEEE Conference on Local Computer Networks","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-11-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126938265","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":"Bluetooth based wireless Internet applications for indoor hotspots: experience of a successful experiment during CeBIT 2001","authors":"R. Kraemer, P. Schwander","doi":"10.1109/LCN.2001.990831","DOIUrl":"https://doi.org/10.1109/LCN.2001.990831","url":null,"abstract":"Wireless Internet access based on wireless LAN or Bluetooth networks will become popular within the next years. New services will be offered that especially make use of location and personal profile to filter Internet access. Moreover \"push\" services will allow the unsolicited event based information transfer depending on user configurations. We have introduced such services \"The Mobile Fairguide\" during CeBIT 2001 in a Bluetooth network that covered a full hall of 25000 m/sup 2/ with 130 base-stations. The content was generated from the official CeBIT database. We were able to show that Bluetooth is a usable technology for such applications especially if PDA are used as terminal devices. Moreover we tested our architecture in a real live scenario especially with respect to scalability and mobility. The additional services like guiding, alarming and broadcasting were offered and appreciated by the visitor. The remaining problems resulting from missing protocols and faults in the base-band implementation of the selected chip-set have been fixed in the meantime.","PeriodicalId":213526,"journal":{"name":"Proceedings LCN 2001. 26th Annual IEEE Conference on Local Computer Networks","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-11-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129530536","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":"Internet-integrated building control: leaving the lab-robust, scalable and secure","authors":"T. Pfeifer, A. Micklei, H. Hartenthaler","doi":"10.1109/LCN.2001.990800","DOIUrl":"https://doi.org/10.1109/LCN.2001.990800","url":null,"abstract":"An infranet is a sub-computer network controlling infrastructure devices, for example, low-bandwidth sensor/actuator networks. Based on an analysis of heterogeneous systems for interconnecting distributed infrastructural devices and experience of a research prototype, the paper describes a production-level implementation of an integrating architecture for accessing various infranets via intranets and the Internet as well as telecommunication networks. Its modularity allows the rapid deployment of new application scenarios.","PeriodicalId":213526,"journal":{"name":"Proceedings LCN 2001. 26th Annual IEEE Conference on Local Computer Networks","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-11-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123391166","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}
R. Leung, Jilei Liu, Edmond Poon, A. L. Chan, Baochun Li
{"title":"MP-DSR: a QoS-aware multi-path dynamic source routing protocol for wireless ad-hoc networks","authors":"R. Leung, Jilei Liu, Edmond Poon, A. L. Chan, Baochun Li","doi":"10.1109/LCN.2001.990778","DOIUrl":"https://doi.org/10.1109/LCN.2001.990778","url":null,"abstract":"Routing in wireless ad-hoc networks has received significant attention in the literature due to the fact that the dynamic behavior of these networks poses many technical challenges on the design of an effective routing scheme. Though on-demand routing approaches have been shown to perform well, they generally lack the support for quality-of-service (QoS) with respect to data transmission. In order to select a subset of end-to-end paths to provide increased stability and reliability of routes, a new QoS metric, end-to-end reliability, is defined and emphasized. We present a distributed multi-path dynamic source routing protocol (MP-DSR)for wireless ad-hoc networks to improve QoS support with respect to end-to-end reliability. Our protocol forwards outgoing packets along multiple paths that are subject to a particular end-to-end reliability requirement. A simulation study is performed to demonstrate the effectiveness of our proposed protocol, particularly the fact that MP-DSR achieves a higher rate of successful packet delivery than existing best-effort ad-hoc routing protocols, such as the dynamic source routing (DSR).","PeriodicalId":213526,"journal":{"name":"Proceedings LCN 2001. 26th Annual IEEE Conference on Local Computer Networks","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-11-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124227162","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":"Improving the dependability of wireless networks using design techniques","authors":"U. Varshney, A. D. Malloy","doi":"10.1109/LCN.2001.990777","DOIUrl":"https://doi.org/10.1109/LCN.2001.990777","url":null,"abstract":"Network dependability is an important issue for service providers, vendors, and users. Although some work has been done in wireline networks for improving reliability, availability, and survivability aspects of network dependability, very little work has been done to do the same for wireless networks. As wireless networks are more likely to have dependability problems, we believe that some work is necessary to address the dependability issues in wireless networks. We propose an integrated approach using design changes and fault-tolerance to improve the dependability of wireless networks. More specifically, we present several architectures to improve the dependability of wireless networks, a simulation model for evaluating one or more of these architectures, and detailed performance results. The results show that significant improvements are possible in the wireless dependability attributes of the current and emerging wireless networks. We have also obtained results for fault-tolerant architectures of varying size, showing substantial improvements in both network availability and survivability attributes.","PeriodicalId":213526,"journal":{"name":"Proceedings LCN 2001. 26th Annual IEEE Conference on Local Computer Networks","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-11-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124312894","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":"Dynamic reconfiguration of wavelength-routed WDM networks","authors":"I. Alfouzan, A. Jayasumana","doi":"10.1109/LCN.2001.990825","DOIUrl":"https://doi.org/10.1109/LCN.2001.990825","url":null,"abstract":"The problem of reconfiguring wavelength-routed optical networks when the traffic demand changes is considered. When reconfiguring the wavelength assignment according to the traffic demand, it is important to reduce the number of receivers that need to be retuned. Furthermore, after the reconfiguration, the load needs to be balanced among the wavelengths. The tradeoff here is between the number of retunings and the degree of network load balance. After tracking real traffic demand to see the effect of traffic changes on the network load balance, an algorithm has been developed for wavelength reconfiguration, so that the demand on the most loaded channel is reduced by exchanging one node with the least loaded channel. The most and least loaded channel balance (MLLCB) algorithm provides very good results in terms of the required number of retunings and the load balance. Comparison of MLLCB algorithm with GLPT algorithm shows a very significant improvement in performance.","PeriodicalId":213526,"journal":{"name":"Proceedings LCN 2001. 26th Annual IEEE Conference on Local Computer Networks","volume":"42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-11-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114441699","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":"Achieving scalable cluster system analysis and management with a gossip-based network service","authors":"D. E. Collins, A. George, R. A. Quander","doi":"10.1109/LCN.2001.990767","DOIUrl":"https://doi.org/10.1109/LCN.2001.990767","url":null,"abstract":"Clusters of workstations are increasingly used for applications requiring high levels of both performance and reliability. Certain fundamental services are highly desirable to achieve these twin goals of network-based cluster system analysis and management. Among these services is the ability to detect network and node failures and the capability to efficiently determine computer and network load levels. Furthermore, the ability to allow for the distribution of administrative directives is also integral to the goal of cluster management. This paper presents a scalable approach to providing these vital support capabilities for distributed computing integrated into a cluster management system. Previous approaches to cluster management have suffered from problems of scalability and the inability to properly support heterogeneous systems in a non-proprietary fashion. This cluster management system employs gossip techniques to address the problem of scalability in network-based system management. The results of two case studies show that the cluster management system is scalable and has little adverse impact on the performance of sequential and parallel applications running on the managed system.","PeriodicalId":213526,"journal":{"name":"Proceedings LCN 2001. 26th Annual IEEE Conference on Local Computer Networks","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-11-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123217114","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}