发布求助
文献互助 智能选刊 最新文献

The IEEE Conference on Local Computer Networks 30th Anniversary (LCN'05)l最新文献

筛选
英文 中文
Designing and deploying a rural ad-hoc community mesh network testbed 设计和部署农村自组织社区网状网络测试平台
The IEEE Conference on Local Computer Networks 30th Anniversary (LCN'05)l Pub Date : 2005-11-15 DOI: 10.1109/LCN.2005.51
Wayne Allen, A. Martin, Anand Rangarajan
{"title":"Designing and deploying a rural ad-hoc community mesh network testbed","authors":"Wayne Allen, A. Martin, Anand Rangarajan","doi":"10.1109/LCN.2005.51","DOIUrl":"https://doi.org/10.1109/LCN.2005.51","url":null,"abstract":"Rural communities suffer from a lack of infrastructure for inexpensive high-speed access to the Internet. One approach to providing high-speed access in these environments is to share a small number of more expensive high-speed connections across the community. A wireless mesh network can provide a low-cost backbone to enable this sharing. Existing solutions to building community mesh networks use proprietary technology or typically require rooftop or other outdoor antenna deployment. We examine the feasibility of constructing a community mesh network in a rural neighborhood at Dartmouth College using off-the-shelf hardware and software components and without using an outdoor antenna. We identify several challenges to construction of such networks including network density, hardware limitations, and US electrical code. In this paper, we outline some of the key challenges we faced during our deployment and suggest solutions","PeriodicalId":368269,"journal":{"name":"The IEEE Conference on Local Computer Networks 30th Anniversary (LCN'05)l","volume":"146 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-11-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115372646","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}
引用次数: 26
Fault Tolerant Active Rings for Structured Peer-to-Peer Overlays 结构化点对点覆盖的容错主动环
The IEEE Conference on Local Computer Networks 30th Anniversary (LCN'05)l Pub Date : 2005-11-15 DOI: 10.1109/LCN.2005.69
J. Risson, Ken Robinson, T. Moors
{"title":"Fault Tolerant Active Rings for Structured Peer-to-Peer Overlays","authors":"J. Risson, Ken Robinson, T. Moors","doi":"10.1109/LCN.2005.69","DOIUrl":"https://doi.org/10.1109/LCN.2005.69","url":null,"abstract":"Algorithms by which peers join and leave structured overlay networks can be classified as passive or active. Passive topology maintenance relies on periodic background repair of neighbor pointers. When a node passively leaves the overlay, subsequent lookups may fail silently. Active maintenance has been proven only for fault-free networks. We develop an active topology maintenance algorithm for practical, fault-prone networks. Unlike prior work, it a) maintains ring continuity during normal topology changes and b) guarantees consistency and progress in the presence of faults. The latter property is inherited by novel extension of the Paxos commit algorithm. The topology maintenance algorithm is formally developed using the B method and its event-driven extensions for dynamic systems. Messaging and storage overheads are quantified","PeriodicalId":368269,"journal":{"name":"The IEEE Conference on Local Computer Networks 30th Anniversary (LCN'05)l","volume":"79 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-11-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132557677","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}
引用次数: 19
ERP-DDRR: an efficient and robust scheduler for providing proportional delay differentiation in terabit networks ERP-DDRR:在太比特网络中提供比例延迟区分的高效鲁棒调度程序
The IEEE Conference on Local Computer Networks 30th Anniversary (LCN'05)l Pub Date : 2005-11-15 DOI: 10.1109/LCN.2005.64
Chin-Chi Wu, H. Wu, Ding-Jyh Tsaur, Woei Lin
{"title":"ERP-DDRR: an efficient and robust scheduler for providing proportional delay differentiation in terabit networks","authors":"Chin-Chi Wu, H. Wu, Ding-Jyh Tsaur, Woei Lin","doi":"10.1109/LCN.2005.64","DOIUrl":"https://doi.org/10.1109/LCN.2005.64","url":null,"abstract":"In recent years, many research efforts focus on relative differentiated service due to the increasing requirements on quality of service for time-sensitive applications. Most of the prior research relies on time stamping arriving packets or periodically monitoring the arrival traffic to arrange the service rate or priority for each class of packets. In this paper, we propose a new efficient and robust packet scheduling scheme, called ERP-DDRR. The ERP-DDRR scheduler not only can provide proportional delay differentiation under various traffic load conditions with very small overhead but also can be implemented in terabit networks. In addition, we propose a pipelining approach to further improve the performance of the ERP-DDRR scheduler. Simulation results show that the ERP-DDRR scheduler provides excellent short-term and long-term performance. The ERP-DDRR scheduler is an excellent alternative solution for future high-speed networks","PeriodicalId":368269,"journal":{"name":"The IEEE Conference on Local Computer Networks 30th Anniversary (LCN'05)l","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-11-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127735167","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}
引用次数: 1
Efficient Group Key Management Protocol with One-Way Key Derivation 具有单向密钥派生的高效组密钥管理协议
The IEEE Conference on Local Computer Networks 30th Anniversary (LCN'05)l Pub Date : 2005-11-15 DOI: 10.1109/LCN.2005.61
J. Lin, F. Lai, Hung-Chang Lee
{"title":"Efficient Group Key Management Protocol with One-Way Key Derivation","authors":"J. Lin, F. Lai, Hung-Chang Lee","doi":"10.1109/LCN.2005.61","DOIUrl":"https://doi.org/10.1109/LCN.2005.61","url":null,"abstract":"The growth of the Internet inspires lots of new network applications, and many of them are based on group communication models. Key trees are ideal for a group of users to efficiently and securely share a common secret key, the group key, which can encrypt transmitted data, or other session keys that protect group communication. An efficient group key management protocol is proposed for centralized dynamic groups, and one-way key derivation is integrated with key trees to reduce the communication overhead of rekeying operations. The server does not have to send new keys to those members who can derive the keys by themselves, and the total number of encrypted keys transmitted per rekeying operation becomes fewer. It is shown that the technique can be applied to both synchronous and asynchronous rekeying operations. The proposed protocol outperforms the other group key management protocols from our analysis and simulation, and is suitable for practical systems","PeriodicalId":368269,"journal":{"name":"The IEEE Conference on Local Computer Networks 30th Anniversary (LCN'05)l","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-11-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126458773","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}
引用次数: 51
Analysis of IEEE 802.11 in Radio over Fiber Home Networks IEEE 802.11在光纤家庭无线网络中的应用分析
The IEEE Conference on Local Computer Networks 30th Anniversary (LCN'05)l Pub Date : 2005-11-15 DOI: 10.1109/LCN.2005.29
B. Dang, I. Niemegeers
{"title":"Analysis of IEEE 802.11 in Radio over Fiber Home Networks","authors":"B. Dang, I. Niemegeers","doi":"10.1109/LCN.2005.29","DOIUrl":"https://doi.org/10.1109/LCN.2005.29","url":null,"abstract":"Radio over fiber (RoF) techniques have been developed to combine the mobility of wireless technologies and the huge bandwidth offered by optical fibers. In this paper, we present the concept of a hybrid radio-fiber system using IEEE 802.11 specifications as a solution for future broadband in-house networks. An analysis on the feasibility of applying RoF techniques to the IEEE 802.11's medium access control (MAC) protocol is presented. To substantiate our discussion, simulations of the hybrid system have been carried out. The results show that the throughput of a 802.11 cell extended with an optical distribution network does not decrease drastically when the propagation delay increases","PeriodicalId":368269,"journal":{"name":"The IEEE Conference on Local Computer Networks 30th Anniversary (LCN'05)l","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-11-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125449511","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}
引用次数: 45
The time-controlled clustering algorithm for optimized data dissemination in wireless sensor network 无线传感器网络中优化数据传播的时间控制聚类算法
The IEEE Conference on Local Computer Networks 30th Anniversary (LCN'05)l Pub Date : 2005-11-15 DOI: 10.1109/LCN.2005.130
S. Selvadurai, S. Sinnappan
{"title":"The time-controlled clustering algorithm for optimized data dissemination in wireless sensor network","authors":"S. Selvadurai, S. Sinnappan","doi":"10.1109/LCN.2005.130","DOIUrl":"https://doi.org/10.1109/LCN.2005.130","url":null,"abstract":"As the communication task is a significant power consumer, there are many attempts to improve energy efficiency. Node clustering, to reduce direct transmission to the base station, is one such attempt to control data dissemination. Here, we derived the optimal number of clusters for TCCA clustering algorithm based on a realistic energy model using results in stochastic geometry","PeriodicalId":368269,"journal":{"name":"The IEEE Conference on Local Computer Networks 30th Anniversary (LCN'05)l","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-11-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122259557","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}
引用次数: 13
Automated traffic classification and application identification using machine learning 使用机器学习的自动流量分类和应用程序识别
The IEEE Conference on Local Computer Networks 30th Anniversary (LCN'05)l Pub Date : 2005-11-15 DOI: 10.1109/LCN.2005.35
S. Zander, Thuy T. T. Nguyen, G. Armitage
{"title":"Automated traffic classification and application identification using machine learning","authors":"S. Zander, Thuy T. T. Nguyen, G. Armitage","doi":"10.1109/LCN.2005.35","DOIUrl":"https://doi.org/10.1109/LCN.2005.35","url":null,"abstract":"The dynamic classification and identification of network applications responsible for network traffic flows offers substantial benefits to a number of key areas in IP network engineering, management and surveillance. Currently such classifications rely on selected packet header fields (e.g. port numbers) or application layer protocol decoding. These methods have a number of shortfalls e.g. many applications can use unpredictable port numbers and protocol decoding requires a high amount of computing resources or is simply infeasible in case protocols are unknown or encrypted. We propose a novel method for traffic classification and application identification using an unsupervised machine learning technique. Flows are automatically classified based on statistical flow characteristics. We evaluate the efficiency of our approach using data from several traffic traces collected at different locations of the Internet. We use feature selection to find an optimal feature set and determine the influence of different features","PeriodicalId":368269,"journal":{"name":"The IEEE Conference on Local Computer Networks 30th Anniversary (LCN'05)l","volume":"52 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-11-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133302551","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}
引用次数: 564
DRKH: A Power Efficient Encryption Protocol forWireless Devices DRKH:无线设备的节能加密协议
The IEEE Conference on Local Computer Networks 30th Anniversary (LCN'05)l Pub Date : 2005-11-15 DOI: 10.1108/17427370780000162
Ahmad M. Kholaif, M. Fayek, H. S. Eissa, H. Baraka
{"title":"DRKH: A Power Efficient Encryption Protocol forWireless Devices","authors":"Ahmad M. Kholaif, M. Fayek, H. S. Eissa, H. Baraka","doi":"10.1108/17427370780000162","DOIUrl":"https://doi.org/10.1108/17427370780000162","url":null,"abstract":"In this paper, we present dynamic rekeying with key hopping (DRKH) encryption protocol that uses RC4 encryption technique to ensure a strong security level with the advantage of low execution cost compared to other IEEE 802.11 security schemes. Low computational complexity makes DRKH suitable for solar- and battery-powered handheld devices such as nodes in Solar ESS (extended service set) and wireless sensor networks. Our design goal is to eventually integrate DRKH with different emerging wireless technologies. However, in this paper, we focus on the integration of DRKH with 802.11 standard since it is the most widely deployed wireless technology. The results and analysis show that DRKH overcomes all the security threats with wired equivalent privacy (WEP) protocol while consuming a much lower power than WEP, Wi-Fi Protected Access (WPA) 1.0 and WPA 2.0","PeriodicalId":368269,"journal":{"name":"The IEEE Conference on Local Computer Networks 30th Anniversary (LCN'05)l","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-11-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130584648","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}
引用次数: 1
Peers-assisted dynamic content distribution networks 对等辅助的动态内容分发网络
The IEEE Conference on Local Computer Networks 30th Anniversary (LCN'05)l Pub Date : 2005-11-15 DOI: 10.1109/LCN.2005.102
Minh Tran, Wallapak Tavanapong
{"title":"Peers-assisted dynamic content distribution networks","authors":"Minh Tran, Wallapak Tavanapong","doi":"10.1109/LCN.2005.102","DOIUrl":"https://doi.org/10.1109/LCN.2005.102","url":null,"abstract":"Content distribution networks (CDNs) have been proposed to primarily distribute Web and some limited streaming audio/video content over the Internet. Current CDNs consist of fixed content nodes placed at strategic locations on the Internet to improve the service latency and to reduce server and network load. Although the approach of delivering content with a fixed CDN has enjoyed some successes, it is often difficult to upgrade and extend a CDN to serve more users due to a very high deployment cost. In this paper, we propose that a CDN be agile while delivering content. We make the case for a dynamic CDN architecture in which a CDN leverages local peers to deliver the CDN's content to local users. We define a formal problem for using peers to increase the capacity of a CDN and we propose an algorithm to help a CDN to dynamically recruit local peers to be part of the CDN. The CDN and the recruited local peers cooperate to serve content to other local users. Our performance evaluation shows promising results with the new dynamic CDN architecture. Our simple CDN growing strategies dramatically improve the average service latency in streaming video content","PeriodicalId":368269,"journal":{"name":"The IEEE Conference on Local Computer Networks 30th Anniversary (LCN'05)l","volume":"141 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-11-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121533672","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}
引用次数: 13
Resource Allocation for High-Speed Uplink Wireless Channels with no Reservation Guarantees 无预留保证的高速上行无线信道资源分配
The IEEE Conference on Local Computer Networks 30th Anniversary (LCN'05)l Pub Date : 2005-11-15 DOI: 10.1109/LCN.2005.116
H. Papadakis, P. Koutsakis
{"title":"Resource Allocation for High-Speed Uplink Wireless Channels with no Reservation Guarantees","authors":"H. Papadakis, P. Koutsakis","doi":"10.1109/LCN.2005.116","DOIUrl":"https://doi.org/10.1109/LCN.2005.116","url":null,"abstract":"A new scheme, combining medium access control (MAC) with traffic policing for next generation wireless networks, is proposed in this work, in order to provide a flexible solution for the integration of multimedia traffic over noisy high capacity links. The most attractive features of our scheme are: a) its flexibility, which allows it to adapt easily to wireless channel of various capacities, and b) its ability to efficiently integrate the different types of traffic, which have diverse and contradictory quality of service (QoS) requirements, without dedicating a fixed portion of its bandwidth to requests by the voice, data and video terminals. Our scheme achieves high aggregate channel throughput in all cases of traffic load, while preserving the quality of service (QoS) requirements of each traffic type. The scheme is also shown to outperform, both conceptually and in terms of channel throughput, three efficient MAC protocols of the literature","PeriodicalId":368269,"journal":{"name":"The IEEE Conference on Local Computer Networks 30th Anniversary (LCN'05)l","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-11-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124361956","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}
引用次数: 0
首页 上一页 下一页 尾页
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整，为了账户安全，请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们：info@booksci.cn Book学术提供免费学术资源搜索服务，方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号：604180095
Book学术官方微信
小红书