DisCaRia is a distributed case-based reasoning system used for fault resolution. This system features peer-to-peer and case-based reasoning approaches that provide the capability of exploring various fault data sources and exploiting fault solving knowledge from these distributed sources. This paper focuses on the prototype implementation and the performance evaluation of DisCaRia. The prototype system has been deployed on a distributed computing and storage testbed called EmanicsLab. This paper describes the results obtained from experiments performed on various software bug datasets.
{"title":"Evaluation of the Distributed Case-Based Reasoning System on a Distributed Computing Platform","authors":"Ha Manh Tran, J. Schönwälder","doi":"10.1109/WAINA.2011.31","DOIUrl":"https://doi.org/10.1109/WAINA.2011.31","url":null,"abstract":"DisCaRia is a distributed case-based reasoning system used for fault resolution. This system features peer-to-peer and case-based reasoning approaches that provide the capability of exploring various fault data sources and exploiting fault solving knowledge from these distributed sources. This paper focuses on the prototype implementation and the performance evaluation of DisCaRia. The prototype system has been deployed on a distributed computing and storage testbed called EmanicsLab. This paper describes the results obtained from experiments performed on various software bug datasets.","PeriodicalId":355789,"journal":{"name":"2011 IEEE Workshops of International Conference on Advanced Information Networking and Applications","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-03-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131809173","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}
The K-Means is a well known clustering algorithm that has been successfully applied to a wide variety of problems. However, its application has usually been restricted to small datasets. Mahout is a cloud computing approach to K-Means that runs on a Hadoop system. Both Mahout and Hadoop are free and open source. Due to their inexpensive and scalable characteristics, these platforms can be a promising technology to solve data intensive problems which were not trivial in the past. In this work we studied the performance of Mahout using a large data set. The tests were running on Amazon EC2 instances and allowed to compare the gain in runtime when running on a multi node cluster. This paper presents some results of ongoing research.
{"title":"K-means Clustering in the Cloud -- A Mahout Test","authors":"R. Esteves, Rui Pais, Chunming Rong","doi":"10.1109/WAINA.2011.136","DOIUrl":"https://doi.org/10.1109/WAINA.2011.136","url":null,"abstract":"The K-Means is a well known clustering algorithm that has been successfully applied to a wide variety of problems. However, its application has usually been restricted to small datasets. Mahout is a cloud computing approach to K-Means that runs on a Hadoop system. Both Mahout and Hadoop are free and open source. Due to their inexpensive and scalable characteristics, these platforms can be a promising technology to solve data intensive problems which were not trivial in the past. In this work we studied the performance of Mahout using a large data set. The tests were running on Amazon EC2 instances and allowed to compare the gain in runtime when running on a multi node cluster. This paper presents some results of ongoing research.","PeriodicalId":355789,"journal":{"name":"2011 IEEE Workshops of International Conference on Advanced Information Networking and Applications","volume":"78 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-03-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131841827","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}
In-home networking is becoming a reality. New multimedia applications envisaged for in-home networks require data rates of hundreds of Mbps. In order to provision these applications, wireless networks should provide the user with high speed transmission using short-range Gbps wireless technology. With its unlicensed 5 GHz of spectrum, 60 GHz is envisaged for indoor broadband wireless networks. However, handoff in 60 GHz network occurs with a high rate due to the smaller cell size while using 60 GHz. Thus, the resources in such network vary frequently. So providing QoS guarantees in this network is more difficult than in traditional wireless networks. In this paper, we propose the handoff scheme using movement prediction. The prediction model is based on Hidden Markov Model. The simulation results show that the proposed scheme performs well compared to the two schemes in literature in terms of the call dropping probability and the call blocking probability.
{"title":"A Handoff Scheme Using Movement Prediction in Radio over Fiber Indoor Network at 60 GHz","authors":"V. Bien, R. V. Prasad, I. Niemegeers","doi":"10.1109/WAINA.2011.131","DOIUrl":"https://doi.org/10.1109/WAINA.2011.131","url":null,"abstract":"In-home networking is becoming a reality. New multimedia applications envisaged for in-home networks require data rates of hundreds of Mbps. In order to provision these applications, wireless networks should provide the user with high speed transmission using short-range Gbps wireless technology. With its unlicensed 5 GHz of spectrum, 60 GHz is envisaged for indoor broadband wireless networks. However, handoff in 60 GHz network occurs with a high rate due to the smaller cell size while using 60 GHz. Thus, the resources in such network vary frequently. So providing QoS guarantees in this network is more difficult than in traditional wireless networks. In this paper, we propose the handoff scheme using movement prediction. The prediction model is based on Hidden Markov Model. The simulation results show that the proposed scheme performs well compared to the two schemes in literature in terms of the call dropping probability and the call blocking probability.","PeriodicalId":355789,"journal":{"name":"2011 IEEE Workshops of International Conference on Advanced Information Networking and Applications","volume":"64 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-03-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115687512","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}
A grid-enabled programming toolkit called GridCuda is proposed in this paper. This programming toolkit provides a platform for users to write programs with the CUDA API, and exploit GPGPU resources available in computational grids to execute their programs. Whenever the CUDA functions in user programs are invoked, they will be transparently redirected to remote GPGPUs for execution by means of remote procedure calls. This programming toolkit also supports multithreaded programming so that the work of a CUDA program can be distributed over multiple GPGPUs for parallel execution.
{"title":"GridCuda: A Grid-Enabled CUDA Programming Toolkit","authors":"Tyng-Yeu Liang, Yu-Wei Chang","doi":"10.1109/WAINA.2011.82","DOIUrl":"https://doi.org/10.1109/WAINA.2011.82","url":null,"abstract":"A grid-enabled programming toolkit called GridCuda is proposed in this paper. This programming toolkit provides a platform for users to write programs with the CUDA API, and exploit GPGPU resources available in computational grids to execute their programs. Whenever the CUDA functions in user programs are invoked, they will be transparently redirected to remote GPGPUs for execution by means of remote procedure calls. This programming toolkit also supports multithreaded programming so that the work of a CUDA program can be distributed over multiple GPGPUs for parallel execution.","PeriodicalId":355789,"journal":{"name":"2011 IEEE Workshops of International Conference on Advanced Information Networking and Applications","volume":"293 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-03-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115087397","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}
JXTA is a set of open protocols that enable the creation and deployment of peer-to-peer (P2P) networks, allowing the execution of services in a distributed manner. Being a generic P2P middleware, it has slowly evolved in order to appeal a broad set of different applications. Part of this evolution includes providing basic security capabilities in its protocols in order to achieve some degree of message privacy and authentication. However, under some contexts, more advanced security requirements should be met, such as anonymity. In this work, we propose how to adapt JXTA messaging so that services may be anonymously accessed, by taking advantage of JXTA's idiosyncracies and capabilities, in a manner that is completely invisible to the existing protocols.
{"title":"An Anonymity Layer for JXTA Services","authors":"J. Arnedo-Moreno, Marc Domingo-Prieto","doi":"10.1109/WAINA.2011.9","DOIUrl":"https://doi.org/10.1109/WAINA.2011.9","url":null,"abstract":"JXTA is a set of open protocols that enable the creation and deployment of peer-to-peer (P2P) networks, allowing the execution of services in a distributed manner. Being a generic P2P middleware, it has slowly evolved in order to appeal a broad set of different applications. Part of this evolution includes providing basic security capabilities in its protocols in order to achieve some degree of message privacy and authentication. However, under some contexts, more advanced security requirements should be met, such as anonymity. In this work, we propose how to adapt JXTA messaging so that services may be anonymously accessed, by taking advantage of JXTA's idiosyncracies and capabilities, in a manner that is completely invisible to the existing protocols.","PeriodicalId":355789,"journal":{"name":"2011 IEEE Workshops of International Conference on Advanced Information Networking and Applications","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-03-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123543083","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}
An adaptive Genetic Algorithm is presented to select optimal web service composite plan from a lot of composite plans on the basis of global Quality-of-Service (QoS) constraints. In this Genetic Algorithm, a population diversity measurement and an adaptive crossover strategy are proposed to further improve the efficiency and convergence of Genetic Algorithm. The probability value of the crossover operation can be set according to the combination of population diversity and individual fitness. The algorithm can get more excellent composite service plan because it accords with the characteristic of web service selection very well. Some simulation results on web service selection with global QoS constraints have shown that the adaptive Genetic Algorithm can gain quickly better composition service plan that satisfies the global QoS requirements.
{"title":"Adaptive Genetic Algorithm for QoS-aware Service Selection","authors":"Chengwen Zhang","doi":"10.1109/WAINA.2011.43","DOIUrl":"https://doi.org/10.1109/WAINA.2011.43","url":null,"abstract":"An adaptive Genetic Algorithm is presented to select optimal web service composite plan from a lot of composite plans on the basis of global Quality-of-Service (QoS) constraints. In this Genetic Algorithm, a population diversity measurement and an adaptive crossover strategy are proposed to further improve the efficiency and convergence of Genetic Algorithm. The probability value of the crossover operation can be set according to the combination of population diversity and individual fitness. The algorithm can get more excellent composite service plan because it accords with the characteristic of web service selection very well. Some simulation results on web service selection with global QoS constraints have shown that the adaptive Genetic Algorithm can gain quickly better composition service plan that satisfies the global QoS requirements.","PeriodicalId":355789,"journal":{"name":"2011 IEEE Workshops of International Conference on Advanced Information Networking and Applications","volume":"39 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-03-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128300294","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, Ye Huang, P. Kuonen, N. Antonopoulos
During the past few years much effort has been put into developing interoperable grid models suitable of defining a decentralized control setting. Such environments may define new rules and actions to internal Virtual Organisation (VO) members and therefore posing new challenges towards to an extended cooperation model of grids. Particularly, VO members' knowledge may be expressed in the form of intelligent agents thus providing a more autonomous solution of communicating members. Herein we present a mobile agent middleware for Grid interoperable infrastructures. Facing the enlarging scale of Grid, the proposed middleware aims to extend the knowledge of a specific neighbouring of Grid members (VO) in relation to the addresses and the physical resources of known and unknown nodes which may join the Grid VO. The internal data are structured in a rational sequence and stored within a public profile of each member called metadata snapshot profile. The middleware is designed by employing the Java Agent Development (JADE) framework in which mobile agents are travelling throughout the domain and by collecting and updating internal data they extend the size of the VO. The interoperable standard is achieved by using the Critical Friends Community (CFC) model, as the mean to fulfil the inter-cooperation model.
在过去的几年中，人们在开发适合于定义分散控制设置的可互操作网格模型方面做了大量的工作。这样的环境可能会对内部虚拟组织(VO)成员定义新的规则和行动，从而对网格的扩展合作模式提出新的挑战。特别是，VO成员的知识可以以智能代理的形式表达，从而提供了一种更自主的成员通信解决方案。本文提出了一种面向网格互操作基础设施的移动代理中间件。面对网格规模的不断扩大，所提出的中间件旨在扩展网格成员的特定邻居(VO)与可能加入网格VO的已知和未知节点的地址和物理资源相关的知识。内部数据按合理的顺序结构化，并存储在每个成员的公共配置文件中，称为元数据快照配置文件。中间件是通过使用Java Agent Development (JADE)框架来设计的，在这个框架中，移动代理在整个域中移动，通过收集和更新内部数据，它们扩展了VO的大小。该互操作标准采用关键朋友社区(Critical Friends Community, CFC)模型作为实现互合作模型的手段来实现。
{"title":"A JADE Middleware for Grid Inter-cooperated Infrastructures","authors":"Stelios Sotiriadis, N. Bessis, Ye Huang, P. Kuonen, N. Antonopoulos","doi":"10.1109/WAINA.2011.133","DOIUrl":"https://doi.org/10.1109/WAINA.2011.133","url":null,"abstract":"During the past few years much effort has been put into developing interoperable grid models suitable of defining a decentralized control setting. Such environments may define new rules and actions to internal Virtual Organisation (VO) members and therefore posing new challenges towards to an extended cooperation model of grids. Particularly, VO members' knowledge may be expressed in the form of intelligent agents thus providing a more autonomous solution of communicating members. Herein we present a mobile agent middleware for Grid interoperable infrastructures. Facing the enlarging scale of Grid, the proposed middleware aims to extend the knowledge of a specific neighbouring of Grid members (VO) in relation to the addresses and the physical resources of known and unknown nodes which may join the Grid VO. The internal data are structured in a rational sequence and stored within a public profile of each member called metadata snapshot profile. The middleware is designed by employing the Java Agent Development (JADE) framework in which mobile agents are travelling throughout the domain and by collecting and updating internal data they extend the size of the VO. The interoperable standard is achieved by using the Critical Friends Community (CFC) model, as the mean to fulfil the inter-cooperation model.","PeriodicalId":355789,"journal":{"name":"2011 IEEE Workshops of International Conference on Advanced Information Networking and Applications","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-03-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128746330","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}
Security measures taken in isolation and without reference to a concrete and relevant assessment and evaluation of actual risks are doomed to be inefficient. At best they do not address the real issues facing an organization and simply waste resources, at worst they provide management with inappropriate comfort over the level of security management that is in place. This paper reviews the key points of some relevant international standards, discusses the links between effective risk management and optimized security measures, and provides a case study illustrating the benefits to be obtained from a structured and integrated approach.
{"title":"Optimizing Security Efficiency through Effective Risk Management","authors":"S. Ghernaouti-Helie, I. Tashi, David Simms","doi":"10.1109/WAINA.2011.93","DOIUrl":"https://doi.org/10.1109/WAINA.2011.93","url":null,"abstract":"Security measures taken in isolation and without reference to a concrete and relevant assessment and evaluation of actual risks are doomed to be inefficient. At best they do not address the real issues facing an organization and simply waste resources, at worst they provide management with inappropriate comfort over the level of security management that is in place. This paper reviews the key points of some relevant international standards, discusses the links between effective risk management and optimized security measures, and provides a case study illustrating the benefits to be obtained from a structured and integrated approach.","PeriodicalId":355789,"journal":{"name":"2011 IEEE Workshops of International Conference on Advanced Information Networking and Applications","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-03-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130030590","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}
Service delivery and customer satisfaction are strongly related items for a correct commercial management platform. Technical aspects targeting this issue relate to QoS parameters that can be handled by the platform, at least partially. Subjective psychological issues and human cognitive aspects are typically unconsidered aspects and they directly determine the Quality of Experience (QoE). These factors finally have to be considered as key input for a successful business operation between a customer and a company. In our work, a multi-disciplinary approach is taken to propose a QoE interaction model based on the theoretical results from various fields including pyschology, cognitive sciences, sociology, service ecosystem and information technology. In this paper a QoE evaluator is described for assessing the service delivery in a distributed and integrated environment on per user and per service basis.
{"title":"QoE Aware Service Delivery in Distributed Environment","authors":"K. Laghari, N. Crespi, B. Molina, C. Palau","doi":"10.1109/WAINA.2011.58","DOIUrl":"https://doi.org/10.1109/WAINA.2011.58","url":null,"abstract":"Service delivery and customer satisfaction are strongly related items for a correct commercial management platform. Technical aspects targeting this issue relate to QoS parameters that can be handled by the platform, at least partially. Subjective psychological issues and human cognitive aspects are typically unconsidered aspects and they directly determine the Quality of Experience (QoE). These factors finally have to be considered as key input for a successful business operation between a customer and a company. In our work, a multi-disciplinary approach is taken to propose a QoE interaction model based on the theoretical results from various fields including pyschology, cognitive sciences, sociology, service ecosystem and information technology. In this paper a QoE evaluator is described for assessing the service delivery in a distributed and integrated environment on per user and per service basis.","PeriodicalId":355789,"journal":{"name":"2011 IEEE Workshops of International Conference on Advanced Information Networking and Applications","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-03-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129102729","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}
Key management is an important area of research in Wireless Sensor Networks (WSN), because resource constraints make security protocols difficult to be implemented. Key predistribution, which involves preloading keys in sensor nodes, has been considered as the best solution when sensor nodes are battery powered and have to work unattended. We propose a deterministic key predistribution scheme in WSN, in which sensor nodes are deployed randomly. This scheme relies on affine planes for key predistribution. Our scheme offers a better security to node compromise, than other deterministic predistribution schemes. Our scheme has the same storage requirements as other predistribution schemes for large networks of thousands of nodes. We also show that our scheme performs better than non deterministic schemes when communication overheads are considered.
{"title":"Key Distribution in Wireless Sensor Networks Using Finite Affine Plane","authors":"Samiran Bag, S. Ruj","doi":"10.1109/WAINA.2011.39","DOIUrl":"https://doi.org/10.1109/WAINA.2011.39","url":null,"abstract":"Key management is an important area of research in Wireless Sensor Networks (WSN), because resource constraints make security protocols difficult to be implemented. Key predistribution, which involves preloading keys in sensor nodes, has been considered as the best solution when sensor nodes are battery powered and have to work unattended. We propose a deterministic key predistribution scheme in WSN, in which sensor nodes are deployed randomly. This scheme relies on affine planes for key predistribution. Our scheme offers a better security to node compromise, than other deterministic predistribution schemes. Our scheme has the same storage requirements as other predistribution schemes for large networks of thousands of nodes. We also show that our scheme performs better than non deterministic schemes when communication overheads are considered.","PeriodicalId":355789,"journal":{"name":"2011 IEEE Workshops of International Conference on Advanced Information Networking and Applications","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-03-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133000471","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}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：