2016 IEEE 30th International Conference on Advanced Information Networking and Applications (AINA)最新文献

筛选
英文 中文
Energy-Aware Server Selection Algorithms in a Scalable Cluster 可扩展集群中的能量感知服务器选择算法
Hiroki Kataoka, A. Sawada, Dilawaer Duolikun, T. Enokido, M. Takizawa
{"title":"Energy-Aware Server Selection Algorithms in a Scalable Cluster","authors":"Hiroki Kataoka, A. Sawada, Dilawaer Duolikun, T. Enokido, M. Takizawa","doi":"10.1109/AINA.2016.154","DOIUrl":"https://doi.org/10.1109/AINA.2016.154","url":null,"abstract":"It is critical to reduce the electric energy consumed in information systems, especially server clusters. In this paper, we extend the multi-level power consumption (MLPC) model and the multi-level computation (MLC) model to a server with multiple CPUs. In this paper, we newly propose a totally energy-aware (TEA) algorithm to select a server for a process in a cluster. Here, servers in a cluster are first classified into subclusters. Each subcluster is characterized in terms of the electric power and computation rate. One server is randomly selected in each subcluster. Then, one server is selected so that the expected electric energy is minimum in the selected servers. We evaluate the TEA algorithm and show not only the total electric energy consumption of the servers but also the average execution time of processes are reduced in the TEA algorithm compared with other algorithms.","PeriodicalId":438655,"journal":{"name":"2016 IEEE 30th International Conference on Advanced Information Networking and Applications (AINA)","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-03-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127375694","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}
引用次数: 44
New Educational Equipments for Networking Study by Physical Visualizations and Physical Direct Manipurations 基于物理可视化和物理直接操作的网络化学习新教育设备
Kazuaki Yoshihara, Kenzi Watanabe, N. Iguchi
{"title":"New Educational Equipments for Networking Study by Physical Visualizations and Physical Direct Manipurations","authors":"Kazuaki Yoshihara, Kenzi Watanabe, N. Iguchi","doi":"10.1109/AINA.2016.91","DOIUrl":"https://doi.org/10.1109/AINA.2016.91","url":null,"abstract":"Studying networking technologies has become one of the most important subjects in the field of Technology of junior high schools and Information Study of senior high schools in Japan. To study these subjects, studying with practically and experimentally is strongly recommended by MEXT (Ministry of Education, Culture, Sports, Science and Technologies in Japan). However, there is little equipment for these studies. We have been developing new educational equipment for experimental studying of networking technologies based on concept of physical visualizations and physical direct manipulations. The equipment can visualize physically how network works using LED. Also the equipment provide physical direct manipulation using dials and buttons.","PeriodicalId":438655,"journal":{"name":"2016 IEEE 30th International Conference on Advanced Information Networking and Applications (AINA)","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-03-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130765727","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
Cluster-Head and Border-Node Based Cluster Routing Protocol for LR-WPAN 基于簇头和边界节点的LR-WPAN簇路由协议
Ying Huang, Hongli Ge, Jangsu Lee, Yuehua Dai, Dong Xu, Jin Zhang, Q. Gao, Shaoying Zhao
{"title":"Cluster-Head and Border-Node Based Cluster Routing Protocol for LR-WPAN","authors":"Ying Huang, Hongli Ge, Jangsu Lee, Yuehua Dai, Dong Xu, Jin Zhang, Q. Gao, Shaoying Zhao","doi":"10.1109/AINA.2016.31","DOIUrl":"https://doi.org/10.1109/AINA.2016.31","url":null,"abstract":"In the previous researches, a great number of routing protocols have been proposed in mobile ad-hoc networks (MANET). But it's hard to be adopted efficiently in low rate-wireless personal area network (LR-WPAN) because there are additional particular constraints of the packet size, bandwidth and so on. To improve the performance in this environment, we propose a Cluster-head and Border-node based Cluster Routing Protocol (CBCRP). CBCRP focuses on the environment that the intra-cluster is stable without frequent topology change. For the intra-cluster routing, we optimize the DSDV which is the proactive way to reduce the end-to-end delay maintaining the low cost of routing overhead. The intra-cluster route information is maintained in both of the cluster head and member nodes. For inter-cluster routing, we optimize the AODV which is the reactive way to reduce the flooding overhead maintaining the network performance. The source cluster-head, destination cluster-head and all the intermediate border nodes are in charge of the inter-cluster route discovery, while only border nodes are in charge of the inter-cluster data transmission. In the simulation result using NS-2, CBCRP shows better performance than the cluster based routing protocol (CBRP), about 21% lower end-to-end delay, 67% lower packet overhead and 60% lower packet loss rate at best case.","PeriodicalId":438655,"journal":{"name":"2016 IEEE 30th International Conference on Advanced Information Networking and Applications (AINA)","volume":"146 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-03-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116616339","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
A Web Interface for Satellite Scheduling Problems 卫星调度问题的Web接口
F. Xhafa, C. García, Admir Barolli, M. Takizawa
{"title":"A Web Interface for Satellite Scheduling Problems","authors":"F. Xhafa, C. García, Admir Barolli, M. Takizawa","doi":"10.1109/AINA.2016.21","DOIUrl":"https://doi.org/10.1109/AINA.2016.21","url":null,"abstract":"Mission planning plays an important role in satellite control systems, especially with increase of number of satellites and more complex missions to be planned. In a general setting, the satellite mission scheduling consists in allocating tasks such as observation, communication, etc. to resources (spacecrafts (SCs), satellites, ground stations). For instance, in ground station scheduling the aim is to compute an optimal planning of communications between satellites and operations teams of Ground Station (GS). Because the communication between SCs and GSs can be done during specific window times, this problem can also be seen as a window time scheduling problem. The required communication time is usually quite smaller than the window of visibility of SCs to GSs, however, clashes are produced, making the problem highly constrained. In this work we present a Web interface for solving satellite scheduling problems through various heuristic methods. The Web interface enables the users to remotely solve their problem instances through a selection of heuristic methods such as local search methods (Hill Climbing, Simulated Annealing and Tabu Search) and population-based methods (Genetic Algorithms and variants). The user can select to solve previously generated instances by the STK simulation toolkit or generate their own problem instances. The heuristic methods are easily configurable so that users can simulate a variety of scenarios, problem sizes, etc. The execution of the heuristics methods is done at a HPC Cluster infrastructure supporting efficient execution of various solvers. Additionally, the Web application allows users to keep track of their executions as well as to share problem instances with other users.","PeriodicalId":438655,"journal":{"name":"2016 IEEE 30th International Conference on Advanced Information Networking and Applications (AINA)","volume":"80 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-03-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116625854","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
Ant Colony Optimization Based Energy Management Controller for Smart Grid 基于蚁群优化的智能电网能量管理控制器
Sahar Rahim, Z. Iqbal, Nusrat Shaheen, Z. Khan, U. Qasim, S. A. Khan, N. Javaid
{"title":"Ant Colony Optimization Based Energy Management Controller for Smart Grid","authors":"Sahar Rahim, Z. Iqbal, Nusrat Shaheen, Z. Khan, U. Qasim, S. A. Khan, N. Javaid","doi":"10.1109/AINA.2016.163","DOIUrl":"https://doi.org/10.1109/AINA.2016.163","url":null,"abstract":"In this paper, we introduce a generic architecture for demand side management (DSM) and use combined model of time of use tariff and inclined block rates. The problem formulation is carried via multiple knapsack and its solution is obtained via ant colony optimization (ACO). Simulation results show that the designed model for energy management achieves our objectives, it is proven as a cost-effective solution to increase sustainability of smart grid. The ACO based energy management controller performs more efficiently than energy management controller without ACO based scheduling in terms of electricity bill reduction, peak to average ratio minimization and user comfort level maximization.","PeriodicalId":438655,"journal":{"name":"2016 IEEE 30th International Conference on Advanced Information Networking and Applications (AINA)","volume":"29 6 Suppl 19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-03-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131871819","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}
引用次数: 35
An Ontology Based Approach for Satisfying User Requests in Context Aware Settings 基于本体的上下文感知环境下满足用户请求的方法
Sujata Swain, R. Niyogi
{"title":"An Ontology Based Approach for Satisfying User Requests in Context Aware Settings","authors":"Sujata Swain, R. Niyogi","doi":"10.1109/AINA.2016.121","DOIUrl":"https://doi.org/10.1109/AINA.2016.121","url":null,"abstract":"In context aware settings, if one or more services are unavailable, it may be useful to look for a set of services whose combined effect would be functionally equivalent to a given request. We show that the notion of functional equivalence is quite useful in some real world scenarios. In this paper, we suggest a method to obtain a composed service whose effect is functionally equivalent to the given request. The algorithm has been implemented on some domains and the results are promising.","PeriodicalId":438655,"journal":{"name":"2016 IEEE 30th International Conference on Advanced Information Networking and Applications (AINA)","volume":"382 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-03-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133168522","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
OS and Application Identification by Installed Fonts 操作系统和应用程序识别安装字体
Takamichi Saito, Kazushi Takahashi, K. Yasuda, Takayuki Ishikawa, Ko Takasu, Tomotaka Yamada, Naoki Takei, Rio Hosoi
{"title":"OS and Application Identification by Installed Fonts","authors":"Takamichi Saito, Kazushi Takahashi, K. Yasuda, Takayuki Ishikawa, Ko Takasu, Tomotaka Yamada, Naoki Takei, Rio Hosoi","doi":"10.1109/AINA.2016.55","DOIUrl":"https://doi.org/10.1109/AINA.2016.55","url":null,"abstract":"Recently, some commercial websites collect browsing history and device information for use in services they provide. In this paper, we focused on font information that can be obtained via a web browser to determine what kind of software can be identified about a given device. According to existing research, it is possible to identify installed applications such as the Adobe Flash Player and Microsoft Office using such font information. Thus, we have examined the fonts installed by operating systems (OS) and applications. Our results show that font information on a device can be used to identify installed applications and OS type and version.","PeriodicalId":438655,"journal":{"name":"2016 IEEE 30th International Conference on Advanced Information Networking and Applications (AINA)","volume":"39 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-03-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133400174","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
Service Oriented Verification Integrated Fault Reasoning for SDNs 面向服务的验证sdn集成故障推理
Yongning Tang, Guang Cheng, Zhiwei Xu, F. Chen
{"title":"Service Oriented Verification Integrated Fault Reasoning for SDNs","authors":"Yongning Tang, Guang Cheng, Zhiwei Xu, F. Chen","doi":"10.1109/AINA.2016.54","DOIUrl":"https://doi.org/10.1109/AINA.2016.54","url":null,"abstract":"Fault localization is a core element in SDN network management. Many SDN fault reasoning and verification techniques assist operators focus on either analyzing the control plane configuration or checking the data plane network behavior. These solutions are limited in that they cannot correlate network symptoms between the control and the data planes, and are harder to generalize across protocols since they have to model complex configuration languages and dynamic protocol behavior. This paper proposes a new approach called Service Oriented Verification Integrated Reasoning (SOVIR) to tackle SDN fault reasoning. In the SOVIR system, a network user can request one or multiple network services via a high level Service Provisioning Language (SPL). SOVIR automatically parses each provisioned service and presents it as a logical Service View, which consists of a pair of logical end nodes, a service specification, and a list of required network functions (e.g., load balancer). After provisioned in an SDN network, SOVIR queries the controller about the network topology and flow rules from all SDN switches. Based on the flow rules and the configuration of end nodes and network function nodes, SOVIR maps the Service View to an Implementation View, in which all the logical components in the Service View are mapped to the actual system components along with the actual network topology. SOVIR uses an extended Symptom-Fault-Verification model to incorporate various verification techniques systematically into fault reasoning process to localize the faults in SDN. SOVIR has been evaluated in a simulation environment for its accuracy and efficiency. The evaluation shows that with SOVIR, both performance and accuracy of fault reasoning in the simulated SDN networks can be greatly improved by taking properly selected verification tools on specific network entities.","PeriodicalId":438655,"journal":{"name":"2016 IEEE 30th International Conference on Advanced Information Networking and Applications (AINA)","volume":" 15","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-03-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114053269","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
Straggler Detection in Parallel Computing Systems through Dynamic Threshold Calculation 基于动态阈值计算的并行计算系统中掉队者检测
Ouyang Xue, P. Garraghan, D. McKee, P. Townend, Jie Xu
{"title":"Straggler Detection in Parallel Computing Systems through Dynamic Threshold Calculation","authors":"Ouyang Xue, P. Garraghan, D. McKee, P. Townend, Jie Xu","doi":"10.1109/AINA.2016.84","DOIUrl":"https://doi.org/10.1109/AINA.2016.84","url":null,"abstract":"Cloud computing systems face the substantial challenge of the Long Tail problem: a small subset of straggling tasks significantly impede parallel jobs completion. This behavior results in longer service response times and degraded system utilization. Speculative execution, which create task replicas at runtime, is a typical method deployed in large-scale distributed systems to tolerate stragglers. This approach defines stragglers by specifying a static threshold value, which calculates the temporal difference between an individual task and the average task progression for a job. However, specifying static threshold debilitates speculation effectiveness as it fails to consider the intrinsic diversity of job timing constraints within modern day Cloud computing systems. Capturing such heterogeneity enables the ability to impose different levels of strictness for replica creation while achieving specified levels of QoS for different application types. Furthermore, a static threshold also fails to consider system environmental constraints in terms of replication overheads and optimal system resource usage. In this paper we present an algorithm for dynamically calculating a threshold value to identify task stragglers, considering key parameters including job QoS timing constraints, task execution characteristics, and optimal system resource utilization. We study and demonstrate the effectiveness of our algorithm through simulating a number of different operational scenarios based on real production cluster data against state-of-the-art solutions. Results demonstrate that our approach is capable of creating 58.62% less replicas under high resource utilization while reducing response time up to 17.86% for idle periods compared to a static threshold.","PeriodicalId":438655,"journal":{"name":"2016 IEEE 30th International Conference on Advanced Information Networking and Applications (AINA)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-03-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129276197","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}
引用次数: 31
Positional Estimation of Obstacles and Aircraft by Using ISDB-T Signal Delay 基于ISDB-T信号延迟的障碍物和飞行器位置估计
J. Honda, T. Otsuyama
{"title":"Positional Estimation of Obstacles and Aircraft by Using ISDB-T Signal Delay","authors":"J. Honda, T. Otsuyama","doi":"10.1109/AINA.2016.149","DOIUrl":"https://doi.org/10.1109/AINA.2016.149","url":null,"abstract":"This paper is concerned with positional estimation of obstacle and aircraft by using ISDB-T signal delays. Recently, Multi-Static Primary Surveillance Radar (MSPSR) has been expected to be used as primary surveillance radar alternative. MSPSR classified into passive bistatic radar uses not only conventional radar signal but also other communication signals. Among them, Digital Terrestrial Television Broadcasting (DTTB) is the most expected radio waves because it has high transmitted power. We have started the feasibility study of MSPSR using DTTB signal. Our system concept is to use original characteristics of DTTB. Since Japanese DTTB employs OFDM and guard interval, delayed signals caused by obstacles can be separated. In this paper, we discuss the positional estimation of obstacles and aircraft. This leads to the validation of the proposed method. Firstly, Japanese DTTB signal types of ISDB-T is introduced. Then, the principle of positional estimation is discussed. Positional estimation is started from detection of delayed signals, and positions are determined by bistatic ranging. Finally, delay profiles and bistatic ranging are shown in experimental results. Those results indicate that our proposed system concept would be useful for estimating obstacle and aircraft positions.","PeriodicalId":438655,"journal":{"name":"2016 IEEE 30th International Conference on Advanced Information Networking and Applications (AINA)","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-03-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116808386","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学术官方微信