2015 IEEE 40th Conference on Local Computer Networks (LCN)最新文献

筛选
英文 中文
Improving TCP performance in data center networks with Adaptive Complementary Coding 利用自适应互补编码提高数据中心网络中的TCP性能
2015 IEEE 40th Conference on Local Computer Networks (LCN) Pub Date : 2015-10-26 DOI: 10.1109/LCN.2015.7366323
Jiyan Sun, Yan Zhang, Ding Tang, Shuli Zhang, Zhen Xu, Jingguo Ge
{"title":"Improving TCP performance in data center networks with Adaptive Complementary Coding","authors":"Jiyan Sun, Yan Zhang, Ding Tang, Shuli Zhang, Zhen Xu, Jingguo Ge","doi":"10.1109/LCN.2015.7366323","DOIUrl":"https://doi.org/10.1109/LCN.2015.7366323","url":null,"abstract":"TCP suffers from low throughput and high latency because of its expensive timeout based loss recovery mechanism in data center networks (DCNs). In this paper, we propose TCP with Adaptive Complementary Coding (TCP-ACC) to effectively address these problems. Without revising existing TCP congestion control, we first design a light-weight complementary coding scheme to avoid TCP timeout which will result in higher throughput and lower latency. In our scheme, the redundancy setting is adaptive to the real-time packet loss rate. Then we introduce Lyapunov optimization framework to find the optimal number of redundant coding packets for TCP-ACC, and we also prove that TCP-ACC can reduce the flow timeout probability close to that of the optimal complementary coding solution. Extensive NS2 simulations show that, compared with other three solutions for TCP's problems in DCNs, TCP-ACC can reduce the flow completion time by 45% and improve the flow throughput by 40% on average.","PeriodicalId":308560,"journal":{"name":"2015 IEEE 40th Conference on Local Computer Networks (LCN)","volume":"122 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-10-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123092906","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
Using fake sinks and deceptive relays to boost base-station anonymity in Wireless Sensor Network 利用假接收器和欺骗中继提高无线传感器网络中基站的匿名性
2015 IEEE 40th Conference on Local Computer Networks (LCN) Pub Date : 2015-10-26 DOI: 10.1109/LCN.2015.7366289
Nikolaos Baroutis, M. Younis
{"title":"Using fake sinks and deceptive relays to boost base-station anonymity in Wireless Sensor Network","authors":"Nikolaos Baroutis, M. Younis","doi":"10.1109/LCN.2015.7366289","DOIUrl":"https://doi.org/10.1109/LCN.2015.7366289","url":null,"abstract":"In applications of wireless Sensor Networks (WSNs), the base-station (BS) acts as a sink for all data traffic. The continuous flow of packets toward the BS enables the adversary to analyze the traffic and uncover the BS position. In this paper we present a technique to counter such an attack by morphing the traffic pattern in the WSN. Our approach introduces multiple fake sinks and deceptive relays so that nodes other than the BS are implicated as the destination of all data traffic. Since the problem of the optimal fake sink's placement is NP-hard, we employ a heuristic to determine the most suitable fake sink count and placement for a network. Dynamic load-balancing trees are formed to identify relay nodes and adapt the topology to route packets to the faked (and real) sinks while extending the network lifetime. The simulation results confirm the effectiveness of the proposed technique.","PeriodicalId":308560,"journal":{"name":"2015 IEEE 40th Conference on Local Computer Networks (LCN)","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-10-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123422868","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}
引用次数: 18
An experimental study on inter-domain routing dynamics using IP-level path traces 基于ip级路径跟踪的域间路由动态实验研究
2015 IEEE 40th Conference on Local Computer Networks (LCN) Pub Date : 2015-10-26 DOI: 10.1109/LCN.2015.7366365
Nazim Ahmed, K. Saraç
{"title":"An experimental study on inter-domain routing dynamics using IP-level path traces","authors":"Nazim Ahmed, K. Saraç","doi":"10.1109/LCN.2015.7366365","DOIUrl":"https://doi.org/10.1109/LCN.2015.7366365","url":null,"abstract":"Commercial relationships between Autonomous Systems (ASes) regulate the inter-domain routing dynamics. Identifying these relationships and properly interpreting them can help understand inter-domain routing dynamics and explore routing anomalies where ASes are not following standard transit policies. Most studies in this domain use Border Gateway Protocol (BGP) data to study inter-domain routing dynamics. In this study, we use IP-level topology data to complement these studies. More specifically, we use traceroute tool to collect end-to-end path traces. Then, we map our data to an AS-level topology map. We do this mainly by using the existing BGP based topology maps and AS-level neighborhood data to come up with several new heuristics to identify false AS-level links and missing AS hops in our dataset. In addition, we infer relationships for those AS-level links in our IP-level data that do not appear in the existing BGP based topology maps. We evaluate the accuracy of our heuristics by comparing their findings to that of the existing state-of-the-art techniques. Finally, we use AS-level paths along with AS relationships dataset to infer potential inter-domain routing anomalies and classify them according to their suspected causes.","PeriodicalId":308560,"journal":{"name":"2015 IEEE 40th Conference on Local Computer Networks (LCN)","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-10-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114464510","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
RBCS: A resilient backbone construction scheme for hybrid Peer-To-Peer streaming RBCS:混合点对点流的弹性骨干结构方案
2015 IEEE 40th Conference on Local Computer Networks (LCN) Pub Date : 2015-10-26 DOI: 10.1109/LCN.2015.7366319
Giang T. Nguyen, Stefanie Roos, T. Strufe, Mathias Fischer
{"title":"RBCS: A resilient backbone construction scheme for hybrid Peer-To-Peer streaming","authors":"Giang T. Nguyen, Stefanie Roos, T. Strufe, Mathias Fischer","doi":"10.1109/LCN.2015.7366319","DOIUrl":"https://doi.org/10.1109/LCN.2015.7366319","url":null,"abstract":"Hybrid Peer-to-Peer streaming systems combine the advantages of an efficient push-based with a more resilient pull-based system to deliver video streams over the Internet. In this manner, hybrid systems offer low latency and an increased robustness to failures and node churn. However, current hybrid systems is vulnerable to misbehaving nodes and deliberate attacks. By taking central positions in the overlay, malicious nodes can perform extremely harmful Denial-of-Service (DoS) attacks. We propose RBCS, a novel backbone construction scheme, that is highly resilient against DoS attacks while maintaining fast content dissemination. RBCS incorporates stable peers into a manipulation-resistant multi-tree backbone overlay, which is resilient against both attacks and node churn. Additionally, RBCS securely identifies stable peers by using only local knowledge about the participation time of others. Extensive simulations indicate that RBCS outperforms the state-of-the-art in being more resilient against attacks at the price of a slightly increased overhead.","PeriodicalId":308560,"journal":{"name":"2015 IEEE 40th Conference on Local Computer Networks (LCN)","volume":"206 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-10-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114597361","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}
引用次数: 4
Measuring and modeling performance of WLAN communication for multistatic sonar applications 多声纳应用中无线局域网通信性能的测量和建模
2015 IEEE 40th Conference on Local Computer Networks (LCN) Pub Date : 2015-10-26 DOI: 10.1109/LCN.2015.7366333
Sascha Jopen, A. Schulz, Raphael Ernst
{"title":"Measuring and modeling performance of WLAN communication for multistatic sonar applications","authors":"Sascha Jopen, A. Schulz, Raphael Ernst","doi":"10.1109/LCN.2015.7366333","DOIUrl":"https://doi.org/10.1109/LCN.2015.7366333","url":null,"abstract":"It is known that the accumulated contact data of all stations of multistatic sonar arrays cannot be handled by traditional VHF links. While other technologies like satellite communication systems could handle the amount of data, these systems are usually too costly in terms of money, weight, or power consumption to be deployed on sonar buoys. Therefore, we installed commercial off-the-shelf WLAN with 4W boosters on a vessel and buoys and measured the achievable communication ranges and data rates during a sea trial. With our experiments we were able to reach ranges of 10km and beyond. Afterwards we derived functions and parameters from our measured data to help predicting the WLAN performance for similar scenarios.","PeriodicalId":308560,"journal":{"name":"2015 IEEE 40th Conference on Local Computer Networks (LCN)","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-10-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124200804","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
Incorporating multiple cluster models for network traffic classification 结合多聚类模型进行网络流量分类
2015 IEEE 40th Conference on Local Computer Networks (LCN) Pub Date : 2015-10-26 DOI: 10.1109/LCN.2015.7366302
Anil Kumar, Jinoh Kim, S. Suh, Ganho Choi
{"title":"Incorporating multiple cluster models for network traffic classification","authors":"Anil Kumar, Jinoh Kim, S. Suh, Ganho Choi","doi":"10.1109/LCN.2015.7366302","DOIUrl":"https://doi.org/10.1109/LCN.2015.7366302","url":null,"abstract":"Network traffic classification is one of the essential functions for local and ISP networks. With its importance, a substantial number of previous studies have explored various machine learning techniques with network flow statistics for accurate traffic classification, including the clustering-based approach. However, we obtained unacceptable results from previously proposed clustering-based techniques from our preliminary experiments. In particular, simply employing the entire flow attributes for clustering leads to unexpectedly poor accuracy (less than 70%). In this paper, we propose a new technique based on multiple trained cluster models to overcome this problem. The proposed technique utilizes multiple sets of attribute combinations in parallel for traffic classification, rather than simply merging the entire (or a subset of) attributes in a single model. Our technique also includes a selection step to reduce the results from the individual models into a single output as the final classification decision, and we explore a set of selection strategies. We present our experimental results and show that our technique significantly improves overall accuracy up to 95%.","PeriodicalId":308560,"journal":{"name":"2015 IEEE 40th Conference on Local Computer Networks (LCN)","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-10-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121511266","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}
引用次数: 7
Modelling the Pending Interest Table occupancy in CCN with interest timeout and retransmission 考虑兴趣超时和重传的CCN待处理兴趣表占用模型
2015 IEEE 40th Conference on Local Computer Networks (LCN) Pub Date : 2015-10-26 DOI: 10.1109/LCN.2015.7366281
Amuda James Abu, B. Bensaou
{"title":"Modelling the Pending Interest Table occupancy in CCN with interest timeout and retransmission","authors":"Amuda James Abu, B. Bensaou","doi":"10.1109/LCN.2015.7366281","DOIUrl":"https://doi.org/10.1109/LCN.2015.7366281","url":null,"abstract":"Recent studies have shown that the Pending Interest Table (PIT) in most Information-Centric Networking proposals can represent a bottleneck for the network performance. Newly arrived interest packets at the PIT are dropped if the PIT becomes full. In-network caching may fail to reduce the traffic load on the PIT if the cache dynamics is high as memory in routers is limited. How to manage the occupancy of the PIT in the presence of high traffic load remains an interesting but challenging problem. To this end, this paper presents an analytical model to estimate the PIT occupancy distribution via a continuous-time Markov chain model. In the model, we take into account caching, interest aggregation, interest timeouts and retransmission.We validate the model via simulation experiments to show the accuracy of our model. Our proposed model is useful in the design of traffic controllers for managing the PIT occupancy.","PeriodicalId":308560,"journal":{"name":"2015 IEEE 40th Conference on Local Computer Networks (LCN)","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-10-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134078415","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}
引用次数: 4
Growing a Web of Trust 建立信任网络
2015 IEEE 40th Conference on Local Computer Networks (LCN) Pub Date : 2015-10-26 DOI: 10.1109/LCN.2015.7366288
Benjamin Schiller, T. Strufe, Dirk Kohlweyer, J. Seedorf
{"title":"Growing a Web of Trust","authors":"Benjamin Schiller, T. Strufe, Dirk Kohlweyer, J. Seedorf","doi":"10.1109/LCN.2015.7366288","DOIUrl":"https://doi.org/10.1109/LCN.2015.7366288","url":null,"abstract":"Web of Trust (WoT) graphs represent trust relations between people. They are used for research and analysis in various domains. Real-world instances are only available in sizes of up to 55k vertices. This renders the analysis of larger systems based on realistic input graphs impossible. To close this gap, we develop a growth model to generate WoT graphs of arbitrary size. New edges are formed based on realistic assumptions about trust establishment. We analyze the growth of a real-world WoT and perform a parameter study of our model. We compare both with many existing models and show that ours is the only one that matches the properties of the real-world WoT.","PeriodicalId":308560,"journal":{"name":"2015 IEEE 40th Conference on Local Computer Networks (LCN)","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-10-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131846126","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
Performance analysis of probabilistic caching scheme using Markov chains 基于马尔可夫链的概率缓存方案性能分析
2015 IEEE 40th Conference on Local Computer Networks (LCN) Pub Date : 2015-10-26 DOI: 10.1109/LCN.2015.7366282
S. Tarnoi, Vorapong Suppakitpaisarn, W. Kumwilaisak, Yusheng Ji
{"title":"Performance analysis of probabilistic caching scheme using Markov chains","authors":"S. Tarnoi, Vorapong Suppakitpaisarn, W. Kumwilaisak, Yusheng Ji","doi":"10.1109/LCN.2015.7366282","DOIUrl":"https://doi.org/10.1109/LCN.2015.7366282","url":null,"abstract":"This paper presents a new analytical model to analyze the performance of a probabilistic caching scheme with various cache replacement policies in content-centric networks. The cache replacement policies include Random Replacement (RR), First In First Out (FIFO), and Least Recently Used (LRU). This analytical model is based on Markov chains under Independent Reference Model (IRM) and Zero Download Delay (ZDD) assumption. A closed-form expression of the stationary distribution of cache state is derived and is used to compute the hit rates of caching systems. Moreover, we use this model to establish several important properties of the probabilistic caching scheme as well as the guidelines on effectively using it. Results of computer simulations show that the proposed analytical solution can model the probabilistic caching scheme very accurately.","PeriodicalId":308560,"journal":{"name":"2015 IEEE 40th Conference on Local Computer Networks (LCN)","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-10-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117044116","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}
引用次数: 6
OrLiOn: Optimized Route Planning for the Localization of Indoor Nodes from Outdoor environment OrLiOn:室内节点从室外环境定位的优化路径规划
2015 IEEE 40th Conference on Local Computer Networks (LCN) Pub Date : 2015-10-26 DOI: 10.1109/LCN.2015.7366347
Alina Rubina, O. Artemenko, A. Mitschele-Thiel
{"title":"OrLiOn: Optimized Route Planning for the Localization of Indoor Nodes from Outdoor environment","authors":"Alina Rubina, O. Artemenko, A. Mitschele-Thiel","doi":"10.1109/LCN.2015.7366347","DOIUrl":"https://doi.org/10.1109/LCN.2015.7366347","url":null,"abstract":"The main focus of this work is on the exploration of static trajectories. A new Optimized Route Planning for the Localization of Indoor Nodes from Outdoor eNvironment (OrLiOn) is introduced. Three building-aware trajectories, specifically Extended-Hilbert, Triangle and Z-trajectory are derived with the help of the introduced algorithm. Further, these trajectories are simulated and analyzed in terms of the localization error and difficulty. The obtained results indicate the superiority of the Extended-Hilbert and Triangle trajectories in terms of localization accuracy, when compared to the Z-trajectory, Circle and Octagon trajectories.","PeriodicalId":308560,"journal":{"name":"2015 IEEE 40th Conference on Local Computer Networks (LCN)","volume":"49 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-10-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124040644","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
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学术官方微信
小红书