{"title":"Layer Partitioned Search Tree for Packet Classification","authors":"Yeim-Kuan Chang, Chao-Yen Chien","doi":"10.1109/AINA.2012.122","DOIUrl":"https://doi.org/10.1109/AINA.2012.122","url":null,"abstract":"Packet classification is an important building block of the Internet routers for many network applications. In this paper, we propose a scheme called Layer Partitioned Search Tree (LPST) to solve multi-field packet classification problem. LPST improves the traditional decision tree based schemes (e.g. Hyper Cuts and EffiCuts) by reconstructing the leaf nodes of the decision tree as an approximately balanced search tree. The rules may be stored not only in the buckets of leaf nodes but also in the internal nodes of LPST. Thus, searches on LPST may be completed immediately without searching all the buckets on the path to some leaf node if the packet already matches an internal node. The experimental results show that LPST requires less memory storage even if LPST categorizes the rules by two fields to reduce rule duplication rather than five fields in EffiCuts. Besides, in terms of number of memory accesses, LPST is better than Hyper Cuts and EffiCuts.","PeriodicalId":139239,"journal":{"name":"2012 IEEE 26th International Conference on Advanced Information Networking and Applications","volume":"74 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":"127371945","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}
{"title":"PSense: Reducing Energy Consumption in Public Sensing Systems","authors":"P. Baier, Frank Dürr, K. Rothermel","doi":"10.1109/AINA.2012.33","DOIUrl":"https://doi.org/10.1109/AINA.2012.33","url":null,"abstract":"Utilizing peoples' mobile devices for gathering sensor data has attracted a lot of attention within the last few years. As a result, a great variety of systems for sensing environmental phenomena like temperature or noise have been proposed. However, most of these systems do not take into account that mobile devices have only limited energy resources. For instance, an often assumed prerequisite is that mobile devices are always aware of their position. Given the fact that a position fix is a very energy consuming operation, continuous positioning would quickly drain a device's battery. Since the owners of the mobile devices will not tolerate a significant reduction of the devices' battery lifetime, such an approach is not suitable. To address this issue we present PSense, a flexible system for efficiently gathering sensor data with mobile devices. By avoiding unnecessary position fixes, PSense reduces the energy consumption of mobile devices by up to 70% compared to existing mobile sensing approaches. This is achieved by introducing an adaptive positioning mechanism and by utilizing energy efficient short-range communication to exchange position related information.","PeriodicalId":139239,"journal":{"name":"2012 IEEE 26th International Conference on Advanced Information Networking and Applications","volume":"11 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":"116417387","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}
Stelios Sotiriadis, N. Bessis, F. Xhafa, N. Antonopoulos
{"title":"From Meta-computing to Interoperable Infrastructures: A Review of Meta-schedulers for HPC, Grid and Cloud","authors":"Stelios Sotiriadis, N. Bessis, F. Xhafa, N. Antonopoulos","doi":"10.1109/AINA.2012.15","DOIUrl":"https://doi.org/10.1109/AINA.2012.15","url":null,"abstract":"Over the last decades, the cooperation amongst different resources that belong to various environments has been arisen as one of the most important research topic. This is mainly because of the different requirements, in terms of jobs' preferences that have been posed by different resource providers as the most efficient way to coordinate large scale settings like grids and clouds. However, the commonality of the complexity of the architectures (e.g. in heterogeneity issues) and the targets that each paradigm aims to achieve (e.g. flexibility) remains the same. This is to efficiently orchestrate resources and user demands in a distributed computing fashion by bridging the gap among local and remote participants. At a first glance, this is directly related with the scheduling concept, which is one of the most important issues for designing a cooperative resource management system, especially in large scale settings. In addition, the term meta-computing, hence meta-scheduling, offers additional functionalities in the area of interoperable resource management because of its great proficiency to handle sudden variations and dynamic situations in user demands by bridging the gap among local and remote participants. This work presents a review on scheduling in high performance, grid and cloud computing infrastructures. We conclude by analysing most important characteristics towards inter-cooperated infrastructures.","PeriodicalId":139239,"journal":{"name":"2012 IEEE 26th International Conference on Advanced Information Networking and Applications","volume":"6 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":"129937281","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}
{"title":"A Semantic Framework for the Management of Enriched Provenance Logs","authors":"Mohamed Amin Sakka, Bruno Defude, Jorge Tellez","doi":"10.1109/AINA.2012.9","DOIUrl":"https://doi.org/10.1109/AINA.2012.9","url":null,"abstract":"Provenance is a key metadata for assessing electronic documents trustworthiness. It gives an indicator on the reliability and the quality of the document content. Most of the applications exchanging and processing documents on the web or in clouds become provenance aware and provides heterogeneous, decentralized and not interoperable provenance data. Most of provenance management systems are either dedicated to a specific application (workflow, database) or a specific data type. Those systems were not conceived to support provenance over distributed and open sources. Hence, collecting and querying provenance from heterogeneous sources is always a challenging task. This work presents a new provenance management framework based on semantic web technologies. It allows to import provenance sources, to enrich them semantically to obtain high level representation of provenance. It supports semantic correlation between different provenance sources and allows the use of a high level semantic query language.","PeriodicalId":139239,"journal":{"name":"2012 IEEE 26th International Conference on Advanced Information Networking and Applications","volume":"56 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":"128233210","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}
{"title":"Zero Scanning Time for 802.11 Networks by Using Media Independent Information Server (MIIS)","authors":"Muhammad Qasim Khan, S. Andresen","doi":"10.1109/AINA.2012.100","DOIUrl":"https://doi.org/10.1109/AINA.2012.100","url":null,"abstract":"Handover efficiency in wireless and mobile communication networks is an important factor in providing QoS guarantees for real time applications. The 802.11 standard requires a Mobile Node (MN) to scan all the possible channels (11 in the US) to discover available Access Points (AP's) during a handover. In a given 802.11 cell several channels are expected to be empty. Due to a full scan the MN ends up wasting precious time scanning empty channels. This results in a high handover delay. This handover delay can be simply reduced by making the MN aware of the channel configuration of its future Point of Attachment (PoA). In this paper we propose that when an MN concludes that a handover is imminent, it should inquire the Media Independent Information Server (MIIS) of the Media Independent Information Handover (MIH), for channel configuration information of the future access point rather than scan for this information by itself. The query for this information should contain the current GPS coordinates of the MN. The MIIS first locates the MN on a virtual map with the help of the GPS coordinates and then returns the precise channel configuration information of the future AP to the MN. The MN stores this information locally and uses it to scan just one channel or to skip the scanning completely and associate directly with an access point during a handover. We define a new parameter NET_CHANNEL_CONFIG which is passed in the query by the MN to the MIIS, so that the MIIS knows which information is being requested by the MN. We also define an MIH Information Element Container IE_CONTAINER_802.11_CHINFO which is used by the MIIS to return the requested channel configuration information of the PoA to the MN. The communication overhead for our scheme is just one message exchange with the MIIS as part of the handover preparation phase. Simulation results shows that our scheme Intelligent-Scan One, that scans just one channel, results in a 93% improvement over standard 802.11 scanning. Our second scheme Intelligent-Scan None avoids channel scanning completely and results in a 99% improvement over standard 802.11 scanning delays.","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":"128668018","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}
{"title":"Evaluating Quality of Health Information Sources","authors":"L. Weitzel, P. Quaresma, J. Oliveira","doi":"10.1109/AINA.2012.41","DOIUrl":"https://doi.org/10.1109/AINA.2012.41","url":null,"abstract":"The Web is an important source for people who are seeking healthcare information. Users, who search for health information online, do so without professional guidance. A major problem faced is the possibility that poor information has detrimental effects on health. In this sense, the main goal of this work is to provide a framework that evaluates health web page designed especially for common users, those that may lack sufficient knowledge to validate health content. In order to achieve this goal, we proposed a new methodology to calculate a Trust rank based on reputation and a set of quality indicators. The proposed methodology has shown effective to evaluate the quality of health information sources.","PeriodicalId":139239,"journal":{"name":"2012 IEEE 26th International Conference on Advanced Information Networking and Applications","volume":"12 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":"121507836","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}
{"title":"Three-Dimensional Location-Based IPv6 Addressing for Wireless Sensor Networks in Smart Grid","authors":"Chih-Yung Cheng, Chi-Cheng Chuang, R.-I. Chang","doi":"10.1109/AINA.2012.42","DOIUrl":"https://doi.org/10.1109/AINA.2012.42","url":null,"abstract":"Smart grid is one of the most important applications of the Internet of Things (IoT) for environmental sustainability and energy efficiency issues in recent years. IP-based wireless sensor networks (IP-WSNs) are considered as one of the promising wireless communication technologies applied in smart grid for providing pervasive communications and control capabilities at low cost as well as connecting metering devices with wired area network (WAN) infrastructures seamlessly without a requirement for deploying proxies. In addition, the IPv6 Internet has become an inevitable trend for all-IP communication because of its large address space and others advantages over IPv4. One of the main challenges for connecting WSNs and IPv6 Internet is IPv6 address configuration since nodes with unique address are a prerequisite for reliability and end to end communication. Hence, an IPv6 address configuration scheme called MPIPA is proposed in this paper. MPIPA utilizes three-dimensional locations coordinates to assign each node a unique spatial IPv6 address based on grouping methods and scan-line scheme. Besides, Assignment Success Rate (ASR) is used in this paper to evaluate the probability that assigns unique IP address to nodes successfully. The simulation results show that MPIPA enables over 8, 000 nodes to be assigned IP address successfully when ASR is still nearly 90%.","PeriodicalId":139239,"journal":{"name":"2012 IEEE 26th International Conference on Advanced Information Networking and Applications","volume":"25 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":"124526486","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}
{"title":"On Co-scheduling of Periodic Update and Application Transactions with Fixed Priority Assignment for Real-Time Monitoring","authors":"Jiantao Wang, K. Lam, Song Han, S. Son, A. Mok","doi":"10.1109/AINA.2012.70","DOIUrl":"https://doi.org/10.1109/AINA.2012.70","url":null,"abstract":"In a real-time database system for detection of critical events,On co-scheduling of periodic update and application transactions with fixed priority assignment for real-time monitoring meeting the deadlines of the application transactions and maintaining the quality of the real-time data objects are two critical issues in ensuring the effectiveness of performing the real-time monitoring tasks. Unfortunately, these two goals conflict with each other and are difficult to be achieved at the same time. To address this update and application transaction co-scheduling problem, in this paper, we propose a fixed priority scheduling algorithm called Periodic Co-Scheduling (PCS). PCS uses periodic update transactions to maintain the temporal validity of real-time data objects. It judiciously decides the priority order among all the update and application transactions so that the constructed co-schedule can satisfy the deadline constraints of all the application transactions while maximizing the qualities of the real-time data objects. The effectiveness of the PCS algorithm is validated through our extensive simulation experiments.","PeriodicalId":139239,"journal":{"name":"2012 IEEE 26th International Conference on Advanced Information Networking and Applications","volume":"148 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":"133625035","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}
M. Zivkovic, J. Bosman, H. V. D. Berg, R. Mei, H. B. Meeuwissen, R. N. Queija
{"title":"Run-time Revenue Maximization for Composite Web Services with Response Time Commitments","authors":"M. Zivkovic, J. Bosman, H. V. D. Berg, R. Mei, H. B. Meeuwissen, R. N. Queija","doi":"10.1109/AINA.2012.25","DOIUrl":"https://doi.org/10.1109/AINA.2012.25","url":null,"abstract":"We investigate dynamic decision mechanisms for composite web services maximizing the expected revenue for the providers of composite services. A composite web service is represented by a (sequential) workflow, and for each task within this workflow, a number of service alternatives may be available. These alternatives offer the same functionality at different price-quality levels. After executing a sub-service, it is decided which alternative of the next sub-service in the workflow is invoked. The decisions optimizing expected revenue are based on observed response times, costs and response-time characteristics of the alternatives as well as end-to-end response-time objectives and corresponding rewards and penalties. We propose an approach, based on dynamic programming, to determine the optimal, dynamic selection policy. Extensive numerical examples show significant potential gain in expected revenues using the dynamic approach compared to other, non-dynamic approaches.","PeriodicalId":139239,"journal":{"name":"2012 IEEE 26th International Conference on Advanced Information Networking and Applications","volume":"78 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":"134608735","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}
{"title":"Mining Network Traffic Efficiently to Detect Stepping-Stone Intrusion","authors":"Yingjie Sheng, Yongzhong Zhang, Jianhua Yang","doi":"10.1109/AINA.2012.16","DOIUrl":"https://doi.org/10.1109/AINA.2012.16","url":null,"abstract":"More and more intruders are used to using stepping-stone to launch the attacks on their interested targets because exploiting stepping-stones can hide them deeply and make them feel safe. Clustering-Partitioning approach was proposed to detect stepping-stone intrusion and resist intruders' evasion. The biggest issue of this approach is that it mines network traffic in a very inefficient way. Double the mining dataset size quadruples the running time of Clustering-Partitioning approach. In this paper, we propose a new approach CDA to generate mining dataset and reduce its size. The analysis in this paper show that applying CDA can save the running time of Clustering-Partitioning and make stepping-stone intrusion detection more efficient.","PeriodicalId":139239,"journal":{"name":"2012 IEEE 26th International Conference on Advanced Information Networking and Applications","volume":"17 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":"117007455","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}