{"title":"Voila/spl grave/: delivering messages across partitioned ad-hoc networks","authors":"R. Shah, N. Hutchinson, W. Evans","doi":"10.1109/LCN.2004.135","DOIUrl":"https://doi.org/10.1109/LCN.2004.135","url":null,"abstract":"Many routing protocols have been developed to establish and maintain routes in mobile ad-hoc networks (MANETs). They try to address the unique challenges that MANETs present over traditional wired networks. Some of these challenges are: use of unreliable wireless medium for communication; frequent change in topology; lack of a central authority to arbitrate communication in the network. These protocols find a route to a destination, if such a route exists. However in the wireless medium, links are susceptible to frequent failures which can cause partitions in the network. Current routing protocols use a passive delivery approach for packets destined to a host in another partition. Packets destined to a disconnected host are dropped after some route repair attempts. The paper presents a novel protocol, Voila/spl grave/, that delivers messages across disconnected hosts. Voila/spl grave/ uses nodes moving between the source and destination partitions to act as carriers of messages. It uses a novel carrier select algorithm to select carrier nodes in the source partition.","PeriodicalId":366183,"journal":{"name":"29th Annual IEEE International Conference on Local Computer Networks","volume":"107 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-11-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131618971","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}
David Bueno, Adam Leko, C. Conger, I. Troxel, A. George
{"title":"Simulative analysis of the RapidIO embedded interconnect architecture for real-time, network-intensive applications","authors":"David Bueno, Adam Leko, C. Conger, I. Troxel, A. George","doi":"10.1109/LCN.2004.116","DOIUrl":"https://doi.org/10.1109/LCN.2004.116","url":null,"abstract":"RapidIO is an emerging standard for switched interconnection of processors and boards in embedded systems. We use discrete-event simulation to evaluate and prototype RapidIO-based systems with respect to their performance in an environment targeted towards space-based radar applications. This application class makes an ideal test case for a RapidIO feasibility study due to high system throughput requirements and real-time processing constraints. Our results show that a baseline RapidIO system is well suited to space-based radar, providing significant improvements over typical bus-based architectures. Our results also show that extensions to the RapidIO protocol such as cut-through routing and transmitter-controlled flow-control would provide minimal performance improvements for the applications under study.","PeriodicalId":366183,"journal":{"name":"29th Annual IEEE International Conference on Local Computer Networks","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-11-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132178394","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. Burda, Manfred Folgmann, Klaus Kolodziejczyk-Strunck
{"title":"Scalable one chip design for a multiplex tap with timestamping [QoS validation applications]","authors":"R. Burda, Manfred Folgmann, Klaus Kolodziejczyk-Strunck","doi":"10.1109/LCN.2004.106","DOIUrl":"https://doi.org/10.1109/LCN.2004.106","url":null,"abstract":"Precise tracking of delay, delay jitter and packet loss is one of the key issues in validating quality of service (QoS) goals in practice. As VoIP is deployed, low cost solutions are needed to enable a good coverage of hot spots even in the networks of medium sized or small enterprises. This work reports on the development and integration of an appropriate capturing tool in a one chip core.","PeriodicalId":366183,"journal":{"name":"29th Annual IEEE International Conference on Local Computer Networks","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-11-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132295194","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. Muknahallipatna, T. Brothers, N. Mandagere, P. Patil, J. Hamann
{"title":"The effect of end to end latency in a distributed storage area network on Microsoft Exchange Server 2003 performance - Part I","authors":"S. Muknahallipatna, T. Brothers, N. Mandagere, P. Patil, J. Hamann","doi":"10.1109/LCN.2004.124","DOIUrl":"https://doi.org/10.1109/LCN.2004.124","url":null,"abstract":"The ever increasing demand for fast and reliable data storage has caused dramatic changes in the storage model. The direct attached storage (DAS) model is being replaced by storage area networks (SANs). SANs provide the capability to distribute the storage across multiple servers leading to decentralized and externalized storage. Recently, the accessibility of SANs to small companies has been improved by using existing IP networks to distribute storage over long geographical distances, leading to the distributed storage area network (DSAN). Although DSANs have provided additional capabilities to SANs, they have created a new set of problems for enterprise class applications, like Microsoft Exchange Server 2003, with increasing end to end latency (ETEL), due to large physical cable lengths. We present an attempt to analyze the effect of ETEL in DSAN on the performance of Microsoft Exchange Server 2003 by monitoring the Exchange behavior using LoadSim 2003 benchmark.","PeriodicalId":366183,"journal":{"name":"29th Annual IEEE International Conference on Local Computer Networks","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-11-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127796692","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":"SELAR: scalable energy-efficient location aided routing protocol for wireless sensor networks","authors":"G. Lukachan, M. Labrador","doi":"10.1109/LCN.2004.111","DOIUrl":"https://doi.org/10.1109/LCN.2004.111","url":null,"abstract":"Wireless sensor networks (WSN) consist of thousands of tiny and low cost nodes with very limited energy, computing power and communication capabilities. We consider these issues in the design of a simple, scalable, energy-efficient location aided routing (SELAR) protocol for WSN. In SELAR, location and energy information of neighboring nodes together with the location information of the sink node are used to perform the routing function. Through simulations, we show that SELAR performs considerably better than flooding in terms of network lifetime, energy distribution, and amount of data delivered.","PeriodicalId":366183,"journal":{"name":"29th Annual IEEE International Conference on Local Computer Networks","volume":"126 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-11-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114585362","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}
A. Jacobs, J. Wernicke, S. Oral, B. Gordon, Alan D. George
{"title":"Experimental characterization of QoS in commercial Ethernet switches for statistically bounded latency in aircraft networks","authors":"A. Jacobs, J. Wernicke, S. Oral, B. Gordon, Alan D. George","doi":"10.1109/LCN.2004.56","DOIUrl":"https://doi.org/10.1109/LCN.2004.56","url":null,"abstract":"Aircraft networks are used to service mission-critical avionics systems as well as cabin systems such as in-flight entertainment. These networks require that the switches used offer line-rate switching as well as bounded latency and jitter. Gigabit Ethernet offers an interesting replacement to traditional proprietary networks because of its high performance and low cost. We develop a framework for analyzing the abilities of Gigabit Ethernet switches to provide probabilistic guarantees for reliably low latency using quality of service (QoS) controls. From the perspective of control capabilities, management complexity, and implementation success we compare the strengths and weaknesses of three modern Ethernet switches. These switches exhibit a broad range of configuration options and are representative of the different levels of QoS implementation available today. We use the performance metrics of latency, jitter, and packet loss to characterize the success of a service policy. The results from a variety of network, load, and traffic scenarios are presented in terms of these metrics. Through the results, we are able to gain insight into the individual switch implementations of QoS.","PeriodicalId":366183,"journal":{"name":"29th Annual IEEE International Conference on Local Computer Networks","volume":"222 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-11-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122086363","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-demand node-disjoint multipath routing in wireless ad hoc networks","authors":"Xuefei Li, L. Cuthbert","doi":"10.1109/LCN.2004.90","DOIUrl":"https://doi.org/10.1109/LCN.2004.90","url":null,"abstract":"An on-demand node-disjoint multipath routing protocol is proposed to overcome the shortcomings of on-demand unipath routing protocols like AODV and DSR. The protocol has two novel aspects compared to the other on-demand multipath protocols: it reduces routing overhead dramatically and achieves multiple node-disjoint routing paths. Simulation results show that the proposed protocol achieves lower data delay and control overhead as well as higher packet delivery ratio.","PeriodicalId":366183,"journal":{"name":"29th Annual IEEE International Conference on Local Computer Networks","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-11-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124826101","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":"SIM-KM: scalable infrastructure for multicast key management","authors":"R. Mukherjee, J. Atwood","doi":"10.1109/LCN.2004.114","DOIUrl":"https://doi.org/10.1109/LCN.2004.114","url":null,"abstract":"Multicasting has not been adopted by service providers, even for such \"obvious\" applications as distribution of entertainment. For the successful deployment of such services, a security infrastructures must be developed and deployed to provide access control. We present a scalable infrastructure for multicast key management (SIM-KM). SIM-KM is a complete secure key management scheme using proxy encryptions. It is a robust, highly scalable and efficient key management and distribution scheme combining the advantages of subgroup based and key hierarchy based group key management schemes. It provides support for recovery from compromises and employs dynamic batching techniques for optimum performance.","PeriodicalId":366183,"journal":{"name":"29th Annual IEEE International Conference on Local Computer Networks","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-11-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128528810","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 partial-range-aware localization algorithm for ad-hoc wireless sensor networks","authors":"Xiaoli Li, Hongchi Shi, Yi Shang","doi":"10.1109/LCN.2004.8","DOIUrl":"https://doi.org/10.1109/LCN.2004.8","url":null,"abstract":"Current wireless sensor network localization algorithms are categorized either as range-free or range-aware algorithms based on whether they use the range (i.e., distance) information. Although wireless sensor systems usually have available received signal strength (RSS) readings, this useful information has not been effectively used in the existing localization algorithms. The existing range-free algorithms do not use this information, and the range-aware algorithms require sophisticated range techniques to estimate ranges. In this paper, we introduce and develop a partial-range-aware localization scheme utilizing RSS readings. The scheme can be implemented in a distributed way and can be used in any hop-based range-free algorithms to improve their localization accuracy. Through extensive simulation, the results show that the partial-range-aware algorithm can improve the localization accuracy by reducing position errors up to 50% of the previous range-free localization results.","PeriodicalId":366183,"journal":{"name":"29th Annual IEEE International Conference on Local Computer Networks","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-11-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128541886","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":"Snow monitoring with sensor networks","authors":"T. Henderson, E. Grant, K. Luthy, Jahdai Cintron","doi":"10.1109/LCN.2004.117","DOIUrl":"https://doi.org/10.1109/LCN.2004.117","url":null,"abstract":"We are engaged in the construction of a smart sensor network to monitor snow conditions and help determine avalanche probability in back country ski areas in the Wasatch mountains. These sensor networks will be comprised of devices having the ability to communicate, compute and sense the environment temperature, light intensity, pressure, and other properties. We have developed several distributed algorithms for such networks and demonstrated them in simulation and small-scale experiments. Our goal is to build and test a 50-100 node network through fall 2004, and to deploy it for experimental study this coming winter.","PeriodicalId":366183,"journal":{"name":"29th Annual IEEE International Conference on Local Computer Networks","volume":"95 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-11-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131730708","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}