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

39th Annual IEEE Conference on Local Computer Networks最新文献

筛选
英文 中文
Evaluation of a hybrid multi-channel MAC protocol for periodic and burst traffic 针对周期性和突发业务的混合多通道MAC协议的评估
39th Annual IEEE Conference on Local Computer Networks Pub Date : 2014-10-16 DOI: 10.1109/LCN.2014.6925815
Rana Diab, G. Chalhoub, M. Misson
{"title":"Evaluation of a hybrid multi-channel MAC protocol for periodic and burst traffic","authors":"Rana Diab, G. Chalhoub, M. Misson","doi":"10.1109/LCN.2014.6925815","DOIUrl":"https://doi.org/10.1109/LCN.2014.6925815","url":null,"abstract":"The use of multiple channels in wireless sensor networks helps avoid interference and increases the overall network throughput. In addition, introducing multi-interface nodes further helps in increasing the packet delivery rate for those specific nodes. In this paper, we propose a channel allocation method that takes into consideration the existence of multi-interface nodes in a multi-hop wireless sensor network. It is based on HMC-MAC, a hybrid MAC protocol that uses CSMA/CA, for data exchange, TDMA sequencing nodes activity and FDMA for allowing simultaneous collision free exchange. We evaluated our method using NS2 simulator and results show that our MAC protocol improves the overall network performance compared to other protocols with periodic high data rate traffic and burst traffic.","PeriodicalId":143262,"journal":{"name":"39th Annual IEEE Conference on Local Computer Networks","volume":"197 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-10-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131921241","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}
引用次数: 3
Content peering in content centric networks 内容中心网络中的内容对等
39th Annual IEEE Conference on Local Computer Networks Pub Date : 2014-10-16 DOI: 10.1109/LCN.2014.6925751
Jason Min Wang, Xiangming Dai, B. Bensaou
{"title":"Content peering in content centric networks","authors":"Jason Min Wang, Xiangming Dai, B. Bensaou","doi":"10.1109/LCN.2014.6925751","DOIUrl":"https://doi.org/10.1109/LCN.2014.6925751","url":null,"abstract":"The settlement-free peering relationships play a vital role in today's Internet, notably in helping ISPs cope with the dramatic increase in traffic load caused by the recent surge in the demand for videos and user generated content. Because of the added caching capability of CCN, peering in CCN can be expanded to encompass not only content that is permanently stored in the ISP's network, but also content that is temporarily cached at CCN routers in the ISP's network. Intuitively, this content-level peering is likely to benefit the networks involved in the peering relationship; however, this comes at a non-trivial cost. In this paper, we try to answer the question of whether the additional overhead and complexity to extend content-level peering is justifiable in view of the benefits it brings. To this end, we formulate the content-level peering problem as an optimization problem to study its maximum potential benefit. We conduct extensive numerical experiments to evaluate the potential peering benefit under realistic AS-level peering graphs, using realistic video traffic. The experimental results show that the interconnectivity of the peering graph significantly affects the maximum benefit of content-level peering. Compared to local greedy caching, cooperative caching can bring higher peering benefits; yet it is sensitive to parameters like the peering link bandwidth and the AS-level cache size.","PeriodicalId":143262,"journal":{"name":"39th Annual IEEE Conference on Local Computer Networks","volume":"198 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-10-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134402395","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}
引用次数: 5
Data collection from wireless sensor networks using a hybrid mobile agent-based approach 使用基于混合移动代理的方法从无线传感器网络收集数据
39th Annual IEEE Conference on Local Computer Networks Pub Date : 2014-10-16 DOI: 10.1109/LCN.2014.6925783
T. Paul, Kevin G. Stanley
{"title":"Data collection from wireless sensor networks using a hybrid mobile agent-based approach","authors":"T. Paul, Kevin G. Stanley","doi":"10.1109/LCN.2014.6925783","DOIUrl":"https://doi.org/10.1109/LCN.2014.6925783","url":null,"abstract":"Lack of foresight into the potential future uses of long-term deployments, and limited resources of wireless sensor networks preclude placing all codes on the nodes at run time. Software mobile agents ease this problem by carrying encapsulated code for specific measurement, aggregation and data processing actions. Agent itinerary schemes usually pose agent routing as a variant of the classic Travelling Salesman Problem. This leads to significant inefficiencies because built-up data inflate the agent. We propose a hybrid technique, harnessing the nature of wireless transmission, mobile agent features, and data aggregation, to provide the efficiency of traditional response path optimization techniques in mobile agent itineraries. Simulations demonstrate that the algorithm outperforms traditional mobile agent scheduling approaches in wireless sensor networks.","PeriodicalId":143262,"journal":{"name":"39th Annual IEEE Conference on Local Computer Networks","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-10-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133434973","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}
引用次数: 11
WaP: Indoor localization and tracking using WiFi-Assisted Particle filter WaP:室内定位和跟踪使用wifi辅助粒子滤波
39th Annual IEEE Conference on Local Computer Networks Pub Date : 2014-10-16 DOI: 10.1109/LCN.2014.6925774
Feng Hong, Yongtuo Zhang, Zhao Zhang, Meiyu Wei, Yuan Feng, Zhongwen Guo
{"title":"WaP: Indoor localization and tracking using WiFi-Assisted Particle filter","authors":"Feng Hong, Yongtuo Zhang, Zhao Zhang, Meiyu Wei, Yuan Feng, Zhongwen Guo","doi":"10.1109/LCN.2014.6925774","DOIUrl":"https://doi.org/10.1109/LCN.2014.6925774","url":null,"abstract":"High accurate indoor localization and tracking of smart phones is critical to pervasive applications. Most radio-based solutions either exploit some error prone power-distance models or require some labor-intensive process of site survey to construct RSS fingerprint database. This study offers a new perspective to exploit RSS readings by their contrast relationship rather than absolute values, leading to three observations and functions called turn verifying, room distinguishing and entrance discovering. On this basis, we design WaP (WiFi-Assisted Particle filter), an indoor localization and tracking system exploiting particle filters to combine dead reckoning, RSS-based analyzing and knowledge of floor plan together. All the prerequisites of WaP are the floor plan and the coarse locations on which room the APs reside. WaP prototype is realized on off-the-shelf smartphones with limited particle number typically 400, and validated in a college building covering 1362m2. Experiment results show that WaP can achieve average localization error of 0.71m for 100 trajectories by 8 pedestrians.","PeriodicalId":143262,"journal":{"name":"39th Annual IEEE Conference on Local Computer Networks","volume":"49 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-10-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123563390","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
CQRD: A switch-based approach to flow interference in Data Center Networks CQRD:一种基于交换机的数据中心网络流干扰方法
39th Annual IEEE Conference on Local Computer Networks Pub Date : 2014-10-16 DOI: 10.1109/LCN.2014.6925762
Guo Chen, Dan Pei, Youjian Zhao
{"title":"CQRD: A switch-based approach to flow interference in Data Center Networks","authors":"Guo Chen, Dan Pei, Youjian Zhao","doi":"10.1109/LCN.2014.6925762","DOIUrl":"https://doi.org/10.1109/LCN.2014.6925762","url":null,"abstract":"Modern data centers need to satisfy stringent low-latency for real-time interactive applications (e.g. search, web retail). However, short delay-sensitive flows often have to wait a long time for memory and link resource occupied by a few of long bandwidth-greedy flows because they share the same switch output queue (OQ). To address the above flow interference problem, this paper advocates more fine-grained flow separation in the switches than traditional OQ. We propose CQRD, a simple and cost-effective queue management scheme for data center switches, through only minor changes to the buffering and scheduling scheme. No change to the transport layer or coordination among switches is required. Simulation results show that CQRD can reduce the FCT of short flows by 20-44% in a single switch and 8-30% in a multi-stage data center switch network, only at the cost of a minor goodput decrease of large of flows.","PeriodicalId":143262,"journal":{"name":"39th Annual IEEE Conference on Local Computer Networks","volume":"64 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-10-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125090119","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}
引用次数: 2
A seamless handover for WSN using LMS filter 利用LMS滤波器实现WSN的无缝切换
39th Annual IEEE Conference on Local Computer Networks Pub Date : 2014-10-16 DOI: 10.1109/LCN.2014.6925812
W. Dargie, Jianjun Wen
{"title":"A seamless handover for WSN using LMS filter","authors":"W. Dargie, Jianjun Wen","doi":"10.1109/LCN.2014.6925812","DOIUrl":"https://doi.org/10.1109/LCN.2014.6925812","url":null,"abstract":"We propose a MAC protocol that supports the mobility of nodes in wireless sensor networks. The protocol enables burst transmission and seamless handover to achieve high throughput and to reduce packet delivery latency and packet loss. An adaptive filter continuously evaluates the RSSI values of received acknowledgment packets and decides whether a mobile node should transfer a communication to a nearby relay node with a better link quality. The handover process itself takes place without breaking an existing link. This paper presents the design, implementation and evaluation of the MAC protocol.","PeriodicalId":143262,"journal":{"name":"39th Annual IEEE Conference on Local Computer Networks","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-10-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126229566","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}
引用次数: 24
Evaluating CoDel, PIE, and HRED AQM techniques with load transients 评估CoDel, PIE和HRED AQM技术与负载瞬态
39th Annual IEEE Conference on Local Computer Networks Pub Date : 2014-10-16 DOI: 10.1109/LCN.2014.6925768
I. Järvinen, M. Kojo
{"title":"Evaluating CoDel, PIE, and HRED AQM techniques with load transients","authors":"I. Järvinen, M. Kojo","doi":"10.1109/LCN.2014.6925768","DOIUrl":"https://doi.org/10.1109/LCN.2014.6925768","url":null,"abstract":"In the past, networks have been mainly optimized for good system throughput but recently achieving low delay has also gained notable traction. Active Queue Management (AQM) has long been recognized necessary for operating Internet routers with shorter standing queues but only limited deployment has occurred. The recent interest in AQM has resulted in new AQM proposals. In this paper we evaluate CoDel (Controlled Delay) and PIE (Proportional Integral controller Enhanced), both being new AQM proposals, and compare the performance against an aggressive RED (Random Early Detection) variant called HRED (Harsh RED). We focus on AQM behavior during load transients typically occurring at the network edge with the common traffic types of today such as Web transactions. We discover that CoDel auto-tuning does not scale well with the load. With the high-end delays experienced, HRED is better than PIE and CoDel when more than a few simultaneous flows share the bottleneck.","PeriodicalId":143262,"journal":{"name":"39th Annual IEEE Conference on Local Computer Networks","volume":"99 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-10-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130448974","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}
引用次数: 23
A TCP model for short-lived flows to validate initial spreading 用于验证初始传播的短期流的TCP模型
39th Annual IEEE Conference on Local Computer Networks Pub Date : 2014-10-16 DOI: 10.1109/LCN.2014.6925770
Renaud Sallantin, C. Baudoin, E. Chaput, F. Arnal, E. Dubois, A. Beylot
{"title":"A TCP model for short-lived flows to validate initial spreading","authors":"Renaud Sallantin, C. Baudoin, E. Chaput, F. Arnal, E. Dubois, A. Beylot","doi":"10.1109/LCN.2014.6925770","DOIUrl":"https://doi.org/10.1109/LCN.2014.6925770","url":null,"abstract":"With a vast majority of Internet connections shorter than 10 segments, designing a new fast start-up TCP mechanism is a major concern. While enlarging the Initial Window (IW) up to 10 segments is the fastest solution to deal with a short-lived connection in uncongested networks, numerous researchers are concerned about the impact of the large initial burst on congested networks.","PeriodicalId":143262,"journal":{"name":"39th Annual IEEE Conference on Local Computer Networks","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-10-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127247115","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}
引用次数: 3
Inbound interdomain traffic engineering with LISP 入站域间流量工程与LISP
39th Annual IEEE Conference on Local Computer Networks Pub Date : 2014-10-16 DOI: 10.1109/LCN.2014.6925816
Daniel Herrmann, Martin Turba, Arjan Kuijper, Immanuel Schweizer
{"title":"Inbound interdomain traffic engineering with LISP","authors":"Daniel Herrmann, Martin Turba, Arjan Kuijper, Immanuel Schweizer","doi":"10.1109/LCN.2014.6925816","DOIUrl":"https://doi.org/10.1109/LCN.2014.6925816","url":null,"abstract":"Stub autonomous systems usually utilize multiple links to single or multiple ISPs. Today, inbound traffic engineering is considered hard, as there is no direct way to influence routing decisions on remote systems with BGP. Current traffic engineering methods built on top of BGP are heuristic and time-consuming. The Locator/Identifier Separation Protocol (LISP) promises to change that. In this paper, we conduct the first comprehensive evaluation of LISP and its built-in traffic engineering methods on a real-world testbed. First, we compare LISP to plain BGP and BGP advertising more specific prefixes. This comparison shows that LISP allows effective load-balancing with an accuracy of approximately 5%, while being easier to configure than BGP and its variants. Further experiments show that these results are independent from the number of concurrent streams.","PeriodicalId":143262,"journal":{"name":"39th Annual IEEE Conference on Local Computer Networks","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-10-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114909136","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}
引用次数: 9
Performances of cryptographic accumulators 密码累加器的性能
39th Annual IEEE Conference on Local Computer Networks Pub Date : 2014-10-16 DOI: 10.1109/LCN.2014.6925793
Amrit Kumar, P. Lafourcade, C. Lauradoux
{"title":"Performances of cryptographic accumulators","authors":"Amrit Kumar, P. Lafourcade, C. Lauradoux","doi":"10.1109/LCN.2014.6925793","DOIUrl":"https://doi.org/10.1109/LCN.2014.6925793","url":null,"abstract":"Cryptographic accumulators are space/time efficient data structures used to verify if a value belongs to a set. They have found many applications in networking and distributed systems since their introduction by Benaloh and de Mare in 1993. Despite this popularity, there is currently no thorough performance evaluation of the different existing designs. Symmetric and asymmetric accumulators are used likewise without any particular argument to support either of the design. We aim to establish the speed of each design and their application's domains in terms of their size and the size of the values.","PeriodicalId":143262,"journal":{"name":"39th Annual IEEE Conference on Local Computer Networks","volume":"96 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-10-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128481183","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}
引用次数: 12
首页 上一页 下一页 尾页
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学术文献互助群
群 号：481959085
Book学术官方微信