S. Singh, V. L. Do, K. W. James, K. Yun, R. Cruz, Manish Amde
{"title":"QoS enabled broadband access through optical rings","authors":"S. Singh, V. L. Do, K. W. James, K. Yun, R. Cruz, Manish Amde","doi":"10.1109/LCN.2004.100","DOIUrl":"https://doi.org/10.1109/LCN.2004.100","url":null,"abstract":"We describe an optical ring media access architecture, a media access (MAC) protocol, and a test bed implementation. The optical ring media access architecture is designed to facilitate high-speed broadband access for small business, residential, and mobile users. In our scheme, users can access a wide area network (WAN), such as the Internet, through a media access node (assumed to be a short distance away from the user). The transmission of data from the access node to the destination is done via an optical ring to a central office residing on the ring and from the central office via WAN to the destination, which may be hosted by a media access node on another optical ring. The MAC protocol is based on the earliest deadline first (EDF) scheduling to provide quality of service (QoS) for traffic flows on the ring. The test bed implementation consists of four media access nodes connected by an optical ring. Each node is implemented as a board which consists of an FPGA, an SRAM chip, optical interface modules, etc. Finally, we describe bandwidth and latency measurements showing differentiated performance for prioritized flows.","PeriodicalId":366183,"journal":{"name":"29th Annual IEEE International Conference on Local Computer Networks","volume":"55 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":"115445569","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":"Real-time synchronized vision sensors over Ethernet","authors":"D. Schuurman, D. Capson","doi":"10.1109/LCN.2004.103","DOIUrl":"https://doi.org/10.1109/LCN.2004.103","url":null,"abstract":"A network of real-time vision sensors is described using 100baseT Ethernet. Each vision sensor comprises a camera connected to a dedicated computer to form a \"vision node\". Each vision node is capable of capturing and processing images and communicating the results over the network to a master computer in real-time. Deterministic and timely operation using standard Ethernet is accomplished using three basic techniques: suppressing superfluous packets; using the UDP transport protocol; and using an application layer protocol based on master/slave round-robin polling. Deterministic communications also enable the acquisition times of the cameras to be synchronized over the Ethernet network. By synchronizing the vision nodes to interleave their capture times, network contention is avoided and the effective video sample rate is increased. An analysis is also performed to determine the maximum number of vision nodes that can be supported using this technique over 100baseT Ethernet.","PeriodicalId":366183,"journal":{"name":"29th Annual IEEE International Conference on Local Computer Networks","volume":"21 3","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-11-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"113978356","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":"Automatic specialization of protocol stacks in operating system kernels","authors":"S. Bhatia, C. Consel, A. L. Meur, C. Pu","doi":"10.1109/LCN.2004.28","DOIUrl":"https://doi.org/10.1109/LCN.2004.28","url":null,"abstract":"Fast and optimized protocol stacks play a major role in the performance of network services. This role is especially important in embedded class systems, where performance metrics such as data throughput tend to be limited by the CPU. It is common on such systems to have protocol stacks that are optimized by hand for better performance and smaller code footprint. We propose a strategy to automate this process. Our approach uses program specialization, and enables applications using the network to request specialized code based on the current usage scenario. The specialized code is generated dynamically and loaded in the kernel to be used by the application. We have successfully applied our approach to the TCP/IP implementation in the Linux kernel and used the optimized protocol stack in existing applications. These applications were minimally modified to request the specialization of code based on the current usage context, and to use the specialized code generated instead of its generic version. Specialization can be performed locally, or deferred to a remote specialization server using a novel mechanism. Experiments conducted on three platforms show that the specialized code runs about 25% faster and its size reduces by up to 20 times. The throughput of the protocol stack improves by up to 21%.","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":"126110614","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":"Extracting attack knowledge using principal-subordinate consequence tagging case grammar and alerts semantic networks","authors":"W. Yan, E. Hou, N. Ansari","doi":"10.1109/LCN.2004.57","DOIUrl":"https://doi.org/10.1109/LCN.2004.57","url":null,"abstract":"The increasing use of intrusion detection systems and a relatively high false alarm rate can lead to a huge volume of alerts. This makes it very difficult for security administrators to analyze and detect network attacks. Our solution for this problem is to make the alerts machine understandable. We propose a novel way to convert the raw alerts into machine understandable uniform streams, correlate the streams, and extract the attack scenario knowledge. The modified case grammar principal-subordinate consequence tagging case grammar and the 2-atom alert semantic network are used to generate the attack scenario classes. Alert mutual information is also applied to calculate the alert semantic context window size. Based on the alert context, the attack scenario instances are extracted and the attack scenario descriptions are forwarded to the security administrator.","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":"131282093","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":"Sensor/actuator networks supporting agents for distributed energy management","authors":"K. Taylor, J. Ward, V. Gerasimov, G. James","doi":"10.1109/LCN.2004.113","DOIUrl":"https://doi.org/10.1109/LCN.2004.113","url":null,"abstract":"We have demonstrated the use of low-cost sensing devices for intelligent control of typical commercial energy loads: cool rooms for keeping produce fresh and heating, ventilation, and air-conditioning (HVAC) systems for buildings. We provide the sensing devices - Berkeley Motes and X10 sensing and switching equipment - with a presence on the Internet to permit sophisticated applications to access their data and control their electrical loads. The ad hoc sensor network is connected to the mobile phone network through a light-weight gateway for long-haul communications. Local control provides failsafe default behaviour in the absence of remote control or when communication is lost. We propose to use this network to deploy agent-based software to manage distributed energy resources, including local generation plants as well as loads. Our aim is to provide new ways for small-to-medium enterprises, energy retailers, and energy network businesses to obtain commercial benefits in a deregulated energy market.","PeriodicalId":366183,"journal":{"name":"29th Annual IEEE International Conference on Local Computer Networks","volume":"42 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":"127098092","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 thermal-dissipation-based approach for balancing data load in distributed hash tables","authors":"S. Rieche, L. Petrak, Klaus Wehrle","doi":"10.1109/LCN.2004.10","DOIUrl":"https://doi.org/10.1109/LCN.2004.10","url":null,"abstract":"A major objective of peer-to-peer (P2P) systems is the management of large amounts of data distributed across many systems. Distributed hash tables (DHT) are designed for highly scalable, self-organizing, and efficient distribution and lookup of data, whereby data is stored globally persistent. The range of values of the corresponding hash function is partitioned and each interval is assigned to a node of the DHT. Because the assignment of data to nodes is based on hash functions, one assumes that the respective data load is distributed evenly across all participating nodes. However most DHT show difficulties with load balancing as we demonstrate in this paper. As a solution for this problem, we present a new and very simple approach for balancing stored data between peers in a fashion analogous to the dissipation of heat energy in materials. We compare this algorithm with other approaches for load balancing and present results based on simulations and a prototype implementation. This new algorithm improves the distribution of load in DHT without requiring major changes of the DHT themselves. In addition, we show that the fault tolerance of peer-to-peer systems is increased by the proposed algorithm.","PeriodicalId":366183,"journal":{"name":"29th Annual IEEE International Conference on Local Computer Networks","volume":"14 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":"126794295","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":"Alternative multiple spanning tree protocol (AMSTP) for optical Ethernet backbones","authors":"Grazielle Ibanez, A. García, A. Azcorra","doi":"10.1109/LCN.2004.15","DOIUrl":"https://doi.org/10.1109/LCN.2004.15","url":null,"abstract":"The availability and affordable cost of Gigabit and 10 Gigabit Ethernet switches has impacted the deployment of metropolitan area networks (MAN) and campus networks. This paper presents a new protocol, the alternative multiple spanning tree protocol (AMSTP), that uses multiple source based spanning trees for backbones using Ethernet switches. It provides minimum paths and more efficient usage of optical backbone infrastructure than currently proposed protocols such as resilient packet ring and rapid spanning tree. The protocol exhibits features similar to MAC routing protocols like Link State Over MAC (LSOM) such as optimum path and effective infrastructure usage, without requiring MAC routing due to the use of the spanning tree protocol paradigm. AMSTP is not restricted to specific topologies such as ring or tree, but performs efficiently in arbitrary topologies. Among the application areas are optical backbones of campus and MANs.","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":"126588422","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":"SDAR: a secure distributed anonymous routing protocol for wireless and mobile ad hoc networks","authors":"A. Boukerche, K. El-Khatib, Li Xu, L. Korba","doi":"10.1109/LCN.2004.109","DOIUrl":"https://doi.org/10.1109/LCN.2004.109","url":null,"abstract":"Providing security and privacy in mobile ad hoc networks has been a major issue over the last few years. Most research work has so far focused on providing security for routing and data content, but nothing has been done in regard to providing privacy and anonymity over these networks. We propose a novel distributed routing protocol which guarantees security, anonymity and high reliability of the established route in a hostile environment, such as an ad hoc wireless network, by encrypting the routing packet header and abstaining from using unreliable intermediate nodes. The major objective of our protocol is to allow trustworthy intermediate nodes to participate in the path construction protocol without jeopardizing the anonymity of the communicating nodes. We describe our protocol, SDAR (secure distributed anonymous routing), and provide its proof of correctness.","PeriodicalId":366183,"journal":{"name":"29th Annual IEEE International Conference on Local Computer Networks","volume":"70 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":"115816426","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":"Estimating coverage holes and enhancing coverage in mixed sensor networks","authors":"Aniruddha Ghosh","doi":"10.1109/LCN.2004.53","DOIUrl":"https://doi.org/10.1109/LCN.2004.53","url":null,"abstract":"Area coverage is one of the most fundamental problems in ad hoc wireless sensor networks because it directly relates to optimization of resources in a sensing field. Maximizing the coverage area while maintaining a lower cost of deployment has always been a challenge, especially when the monitoring region is unknown and possibly hazardous. In this paper, we present a method to deterministically estimate the exact amount of coverage holes under random deployment using Voronoi diagrams and use the static nodes to collaborate and estimate the number of additional mobile nodes needed to be deployed and relocated to optimal positions to maximize coverage. We follow a two-step deployment process in a mixed sensor network and we argue by simulation and analysis that our collaborative coverage enhancing algorithm (COVEN) can achieve a tradeoff between the cost of deployment and percentage of area covered.","PeriodicalId":366183,"journal":{"name":"29th Annual IEEE International Conference on Local Computer Networks","volume":"61 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":"132722935","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":"Using area-based presentations and metrics for localization systems in wireless LANs","authors":"E. Elnahrawy, Xiaoyan Li, R. Martin","doi":"10.1109/LCN.2004.132","DOIUrl":"https://doi.org/10.1109/LCN.2004.132","url":null,"abstract":"We show the utility of WLAN localization using areas and volumes as the fundamental localization unit. We demonstrate that area-based algorithms have a critical advantage over point-based approaches because they are better able to describe localization uncertainty, which is a common theme across WLAN based localization systems. Next, we present two novel area-based algorithms. To evaluate area-based approaches, we introduce several new localization performance metrics. We then evaluate the two algorithms using our metrics with data collected from our local WLAN. Finally, we compare our area-based algorithms against traditional point-based approaches. We find that using areas improves the ability of the localization system to give users meaningful alternatives in the face of position uncertainty.","PeriodicalId":366183,"journal":{"name":"29th Annual IEEE International Conference on Local Computer Networks","volume":"3 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":"134324738","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}