2012 IEEE 26th International Conference on Advanced Information Networking and Applications最新文献

筛选
英文 中文
PC-based Router Virtualization with Hardware Support 基于pc的路由器虚拟化和硬件支持
M. S. Rathore, M. Hidell, Peter Sjödin
{"title":"PC-based Router Virtualization with Hardware Support","authors":"M. S. Rathore, M. Hidell, Peter Sjödin","doi":"10.1109/AINA.2012.96","DOIUrl":"https://doi.org/10.1109/AINA.2012.96","url":null,"abstract":"In this paper we focus on how to use open source Linux software in combination with PC hardware to build high speed virtual routers. Router virtualization means that multiple virtual router instances will run in parallel on the same hardware. To enable this, virtual components are combined in the router's data plane. This can result in performance penalties. Furthermore, an overloaded virtual router can affect the performance of other virtual routers running in parallel. Achieving high performance and strong performance isolation in a virtualized environment is challenging. We investigate how hardware can help to achieve these goals in the Linux Namespaces environment. We propose a forwarding architecture for virtual routers based on multi-core hardware where virtual routers can run in parallel on different CPU cores. This reduces resource contention among virtual routers and results in improved performance and isolation. To enable this architecture, we find that hardware based I/O virtualization support is essential. We demonstrate this by making a comparison with a software based I/O virtualization approach. We also show that hardware assisted virtual routers can achieve better aggregate throughput than a non-virtualized router on a multi-core platform.","PeriodicalId":139239,"journal":{"name":"2012 IEEE 26th International Conference on Advanced Information Networking and Applications","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-03-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117199409","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
An Algorithm for Jammer Localization in Wireless Sensor Networks 无线传感器网络中干扰器定位算法研究
Tianzhen Cheng, Ping Li, Sencun Zhu
{"title":"An Algorithm for Jammer Localization in Wireless Sensor Networks","authors":"Tianzhen Cheng, Ping Li, Sencun Zhu","doi":"10.1109/AINA.2012.11","DOIUrl":"https://doi.org/10.1109/AINA.2012.11","url":null,"abstract":"In wireless sensor networks (WSNs), jamming attacks have become a great concern recently. Finding the location of a jamming device is important so as to take security actions against the jammer and restore the network communication. In this paper, we take a comprehensive study on the jammer localization problem, and propose a simple while effective algorithm called Double Circle Localization (DCL). DCL is based on minimum bounding circle (MBC) and maximum inscribed circle (MIC). We implement and evaluate DCL under different conditions, including different node densities, jammer's transmission powers and antenna orientations, and compare it with three existing jammer localization algorithms through both simulation and experiments. Our evaluation results have demonstrated that, compared with all other approaches, DCL achieves the best accuracy in jammer localization.","PeriodicalId":139239,"journal":{"name":"2012 IEEE 26th International Conference on Advanced Information Networking and Applications","volume":"40 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-03-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116380591","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}
引用次数: 41
Temporary Call-Back Telephone Number Service 临时回拨电话号码服务
Ming-Feng Chang, Chi-Hua Chen
{"title":"Temporary Call-Back Telephone Number Service","authors":"Ming-Feng Chang, Chi-Hua Chen","doi":"10.1109/AINA.2012.65","DOIUrl":"https://doi.org/10.1109/AINA.2012.65","url":null,"abstract":"Conventional temporary telephone number (TTN) service provides a secondary telephone number to a service subscriber. The subscribers can protect privacy by sharing their TTNs without revealing their private numbers. However, TTN service is rarely provided because it requires a large amount of temporary telephone numbers. In this paper, we present a restricted form of TTN service - temporary call-back telephone number (TCN) service -- to reduce the amount of telephone numbers needed. A TCN is assigned only for the communications between a subscriber and the correspondent parties specified by the subscriber. Other users, except for the specified correspondent parties, cannot reach the subscriber through the assigned TCN. A TCN assignment can be specified by a telephone number mapping record that consists of a subscriber's number, a TCN, and a correspondent party's number. A TCN can be assigned to more than one subscriber, as long as the subscribers' specified correspondent parties are different. Analytic models using Markov chains have been developed to show that the TCN service significantly reduces the amount of temporary numbers required. The TCN service can be implemented using the Intelligent Network (IN) service architecture as a value-added service. TCN Subscribers can initiate calls to and receive calls from the specified correspondent parties without revealing their private telephone numbers. However, the TCN service is not a replacement of the conventional TTN service because only the specified correspondent parties can reach the subscriber by the assigned TCN.","PeriodicalId":139239,"journal":{"name":"2012 IEEE 26th International Conference on Advanced Information Networking and Applications","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-03-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123479983","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
Semantic Uplift of Monitoring Data to Select Policies to Manage Home Area Networks 监测数据的语义提升,以选择策略来管理家庭局域网
Annie Ibrahim Rana, B. Jennings
{"title":"Semantic Uplift of Monitoring Data to Select Policies to Manage Home Area Networks","authors":"Annie Ibrahim Rana, B. Jennings","doi":"10.1109/AINA.2012.139","DOIUrl":"https://doi.org/10.1109/AINA.2012.139","url":null,"abstract":"Tools and process for management of network infrastructure typically assume that network administrators are technically literate, with a willingness to devote significant time to ensuring that devices are correctly configured to behave as desired. Whilst this is largely the case for service provider and enterprise networks, it is typically not the case for home area network users. The growing complexity and heterogeneity of home area networks mean that management and configuration tasks are becoming increasingly complex. In this paper we outline an approach for the semantic uplift of monitoring data from a home area network router and the selection of appropriate policies drive the (re-)configuration of the router to provide desired behaviour in response to the monitored events. We outline the use of an ontology-based semantic model to conceptualize monitoring data and select the policies to apply. The major contributions of this paper are the algorithms developed for semantic uplift and policy selection. The approach is explained and evaluated via two example scenarios that have been realized on a home area network test-bed.","PeriodicalId":139239,"journal":{"name":"2012 IEEE 26th International Conference on Advanced Information Networking and Applications","volume":"80 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-03-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124600772","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}
引用次数: 10
Realizing Global Synchronizations for Locally-Connected Two-Dimensional Rectangle Cellular Arrays 局部连接二维矩形元胞阵列的全局同步实现
H. Umeo
{"title":"Realizing Global Synchronizations for Locally-Connected Two-Dimensional Rectangle Cellular Arrays","authors":"H. Umeo","doi":"10.1109/AINA.2012.39","DOIUrl":"https://doi.org/10.1109/AINA.2012.39","url":null,"abstract":"Synchronization of large-scale networks is an important and fundamental computing primitive in parallel and distributed systems. The synchronization in cellular automata has been known as firing squad synchronization problem (FSSP) since its development. The FSSP has been studied extensively for more than fifty years, and a rich variety of synchronization algorithms have been proposed so far. In the present paper, we give a survey on recent developments in FSSP algorithms for two-dimensional rectangle cellular automata. Several state-efficient new implementations of synchronization algorithms are also given.","PeriodicalId":139239,"journal":{"name":"2012 IEEE 26th International Conference on Advanced Information Networking and Applications","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-03-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128509279","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
Intrusion-Tolerant Shared Memory through a P2P Overlay Segmentation 基于P2P覆盖分割的容错共享内存
D. Böger, J. Fraga, E. Alchieri, Michelle S. Wangham
{"title":"Intrusion-Tolerant Shared Memory through a P2P Overlay Segmentation","authors":"D. Böger, J. Fraga, E. Alchieri, Michelle S. Wangham","doi":"10.1109/AINA.2012.104","DOIUrl":"https://doi.org/10.1109/AINA.2012.104","url":null,"abstract":"This paper describes our experience in developing an infrastructure which allows building intrusion-tolerant shared memory for large-scale systems. The infrastructure makes use of a P2P overlay and of the concept of State Machine Replication (SMR). Segmentation is introduced on the overlay key space to allow the use of algorithms for SMR. In this paper we describe the proposed infrastructure in its stratification and corresponding algorithms. An analysis about the algorithms and their costs is also presented.","PeriodicalId":139239,"journal":{"name":"2012 IEEE 26th International Conference on Advanced Information Networking and Applications","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-03-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130109174","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
Utilization-based Congestion Control: Improvement of Friendliness with TCP over Wireless Links 基于利用率的拥塞控制:改进无线链路上TCP的友好性
S. Utsumi, S. Zabir
{"title":"Utilization-based Congestion Control: Improvement of Friendliness with TCP over Wireless Links","authors":"S. Utsumi, S. Zabir","doi":"10.1109/AINA.2012.44","DOIUrl":"https://doi.org/10.1109/AINA.2012.44","url":null,"abstract":"Conventional congestion control mechanisms like TCP New Reno fail to react appropriately to packet losses caused by error over the wireless link. Various modifications to loss based congestion control schemes have so far been proposed to overcome the corresponding performance degradation. In addition, the comparatively newer family of delay based congestion control mechanisms like Caia-Hamilton Delay (CHD), offer effective solutions for wireless link loss. However, all these approaches aim at improving the performance of the target connection without considering the overall network condition. As such, the other connections' performances suffer severely. Furthermore, for delay based schemes, it is not possible to determine the most accurate value of the queuing threshold intuitively. In this paper, we propose a new end-to-end congestion control mechanism that we name as Utilization-based Congestion Control (UCC) in order to overcome the above issues. UCC provides a solution based on the utilization at the bottleneck link. It is free from critical parameters like queuing threshold and is friendly to other flows over wireless links when deployed together. Simulation results show that (i) UCC can yield a performance improvement of 250% or more compared to conventional loss-based schemes over wireless links and (ii) it is friendly to conventional loss-based congestion controls over wireless links.","PeriodicalId":139239,"journal":{"name":"2012 IEEE 26th International Conference on Advanced Information Networking and Applications","volume":"107 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-03-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132004858","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
Greening the Internet Using Multi-frequency Scaling Scheme 利用多频标度方案绿化互联网
Wei Meng, Yi Wang, Chengchen Hu, Keqiang He, Jun Li, B. Liu
{"title":"Greening the Internet Using Multi-frequency Scaling Scheme","authors":"Wei Meng, Yi Wang, Chengchen Hu, Keqiang He, Jun Li, B. Liu","doi":"10.1109/AINA.2012.119","DOIUrl":"https://doi.org/10.1109/AINA.2012.119","url":null,"abstract":"In this paper, we have designed a Multi-Frequency Scaling scheme for energy conservation of network devices, especially routers and switches. The frequency of components in a network device is scaled dynamically according to the real time workload. A Markov model is developed for performance analysis of this mechanism. We implement a prototype of this scheme in the data path of a general IPv4 router based on a real hardware platform - NetFPGA. Experimental results show excellent energy savings at the cost of a tolerable latency, under various ranges of traffic loads. Our work indicates the feasibility and possibility of deploying this mechanism into real network devices for energy saving.","PeriodicalId":139239,"journal":{"name":"2012 IEEE 26th International Conference on Advanced Information Networking and Applications","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-03-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132023142","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
The Design Principle of the Robust Communication System under the Great Disaster Environment 巨灾环境下鲁棒通信系统的设计原则
S. Noguchi
{"title":"The Design Principle of the Robust Communication System under the Great Disaster Environment","authors":"S. Noguchi","doi":"10.1109/AINA.2012.27","DOIUrl":"https://doi.org/10.1109/AINA.2012.27","url":null,"abstract":"East japan great disaster tell us the many unfavorable points of the present communication system. Learning from these facts, the design principle of the robust communication system is proposed utilizing the logical structure of the network.","PeriodicalId":139239,"journal":{"name":"2012 IEEE 26th International Conference on Advanced Information Networking and Applications","volume":"59 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-03-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126643169","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
Compositional Logic for Proof of Correctness of Proposed UDT Security Mechanisms 用于证明所提议的UDT安全机制正确性的组合逻辑
D. Bernardo, D. Hoang
{"title":"Compositional Logic for Proof of Correctness of Proposed UDT Security Mechanisms","authors":"D. Bernardo, D. Hoang","doi":"10.1109/AINA.2012.45","DOIUrl":"https://doi.org/10.1109/AINA.2012.45","url":null,"abstract":"We present an approach to analyze the applicability and secrecy properties of the selected security mechanisms when implemented with UDT. This approach extends applicability refinement methodology with symbolic model in UDT implementations. In our approach, we carry out a formal proof of correctness, therefore, determining applicability, using formal composition logic. This approach is modular, comprising a separate proof of each protocol section and providing insight into the network environment in which each section can be reliably employed. Moreover, the proof holds for a variety of failure recovery strategies and other implementation and configuration options. We derive our technique from the protocol composite logic on TLS and Kerberos in the literature. We, maintain, however, the novelty of our work for UDT specifically our newly developed mechanisms such as UDT-AO, UDT-DTLS, UDT-Kerberos(GSS-API) specifically for UDT.","PeriodicalId":139239,"journal":{"name":"2012 IEEE 26th International Conference on Advanced Information Networking and Applications","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-03-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126723912","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
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学术官方微信
小红书