Inspired by rule-based access control models, this paper proposes a universal policy model and an access protection framework to secure dataspace. The key components and processes for this framework, policy organization, policy indexing and two resource searching strategies with access decision-making, are illustrated and experimented to harmonize the contradiction between security and efficiency.
{"title":"Secure Dataspace with Access Policies","authors":"Lei Jin, Yawei Zhang, Xiaojun Ye","doi":"10.1109/ISPA.2008.28","DOIUrl":"https://doi.org/10.1109/ISPA.2008.28","url":null,"abstract":"Inspired by rule-based access control models, this paper proposes a universal policy model and an access protection framework to secure dataspace. The key components and processes for this framework, policy organization, policy indexing and two resource searching strategies with access decision-making, are illustrated and experimented to harmonize the contradiction between security and efficiency.","PeriodicalId":345341,"journal":{"name":"2008 IEEE International Symposium on Parallel and Distributed Processing with Applications","volume":"64 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124519619","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}
S. L. Mirtaheri, Ehsan Mousavi Khaneghah, M. Sharifi, M. A. Azgomi
Parallel programming and distributed programming are two solutions for scientific applications to provide high performance and fast response time in parallel systems and distributed systems. Parallel and distributed systems must provide inter process communication (IPC) mechanisms like message passing mechanism as underlying platforms to enable communication between local and especially geographically dispersed and physically distributed processes. Communication overhead is the major problem in these systems and there are a lot of efforts to develop more efficient message passing mechanisms or to improve the network communication speed. This paper provides hard evidence that an efficient implementation of message passing mechanism on multi-computers reduces the execution time of a molecular dynamics code. A well-known program for macromolecular dynamics and mechanics called CHARMm is executed on a networked cluster. The performance of CHARMm is measured with two distributed implementations of message passing, namely a kernel-level implementation called DIPC2006 and a renowned library level implementation called MPI. It is shown that the performance of CHARMm on a DIPC2006 configured cluster is by far better than its performance on an optimized MPI configured similar cluster. Even ignoring the favorable points of kernel-level implementations, like safety, privilege, reliability, and primitiveness, the insight is twofold. Scientists are nowadays faced with more computational complexity and look for more efficient systems and mechanisms. Efficient distributed IPC mechanisms have direct effect on running scientistspsila simulations faster, and computer engineers may try harder to develop more efficient distributed implementations of IPC.
{"title":"The Influence of Efficient Message Passing Mechanisms on High Performance Distributed Scientific Computing","authors":"S. L. Mirtaheri, Ehsan Mousavi Khaneghah, M. Sharifi, M. A. Azgomi","doi":"10.1109/ISPA.2008.131","DOIUrl":"https://doi.org/10.1109/ISPA.2008.131","url":null,"abstract":"Parallel programming and distributed programming are two solutions for scientific applications to provide high performance and fast response time in parallel systems and distributed systems. Parallel and distributed systems must provide inter process communication (IPC) mechanisms like message passing mechanism as underlying platforms to enable communication between local and especially geographically dispersed and physically distributed processes. Communication overhead is the major problem in these systems and there are a lot of efforts to develop more efficient message passing mechanisms or to improve the network communication speed. This paper provides hard evidence that an efficient implementation of message passing mechanism on multi-computers reduces the execution time of a molecular dynamics code. A well-known program for macromolecular dynamics and mechanics called CHARMm is executed on a networked cluster. The performance of CHARMm is measured with two distributed implementations of message passing, namely a kernel-level implementation called DIPC2006 and a renowned library level implementation called MPI. It is shown that the performance of CHARMm on a DIPC2006 configured cluster is by far better than its performance on an optimized MPI configured similar cluster. Even ignoring the favorable points of kernel-level implementations, like safety, privilege, reliability, and primitiveness, the insight is twofold. Scientists are nowadays faced with more computational complexity and look for more efficient systems and mechanisms. Efficient distributed IPC mechanisms have direct effect on running scientistspsila simulations faster, and computer engineers may try harder to develop more efficient distributed implementations of IPC.","PeriodicalId":345341,"journal":{"name":"2008 IEEE International Symposium on Parallel and Distributed Processing with Applications","volume":"102 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115795602","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}
Ahmad Jabas, R. M. Garimella, Ramachandram Sirandas
A wireless ad hoc network (MANET) is a collection of autonomous nodes or terminals that communicate with each other by forming a multihop radio network and maintaining connectivity in a decentralized manner. MANET is characterized by a rapidly changed topology. As a result packets select different multi-hops paths to reach their destinations. Even though packets are somehow independent from each other, there are still some hidden relations (patterns) among them. These relations may be utilized to give useful information to different MANET protocols. In this work, association rules technique is applied in time domain to obtain these hidden relations.
{"title":"MANET Mining: Mining Temporal Association Rules","authors":"Ahmad Jabas, R. M. Garimella, Ramachandram Sirandas","doi":"10.1109/ISPA.2008.66","DOIUrl":"https://doi.org/10.1109/ISPA.2008.66","url":null,"abstract":"A wireless ad hoc network (MANET) is a collection of autonomous nodes or terminals that communicate with each other by forming a multihop radio network and maintaining connectivity in a decentralized manner. MANET is characterized by a rapidly changed topology. As a result packets select different multi-hops paths to reach their destinations. Even though packets are somehow independent from each other, there are still some hidden relations (patterns) among them. These relations may be utilized to give useful information to different MANET protocols. In this work, association rules technique is applied in time domain to obtain these hidden relations.","PeriodicalId":345341,"journal":{"name":"2008 IEEE International Symposium on Parallel and Distributed Processing with Applications","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129434460","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}
As the cornerstone of effective patient-physician relationships in the traditional healthcare infrastructures, trust faces new opportunities and challenges in the ubiquitous healthcare. Ubiquitous healthcare enables the agents acquire more information on trust evaluation through effectively resource sharing. Yet ubiquitous healthcare also lays the agents in a more dynamic and uncertainty environment for the trust evaluations. This paper contributes to develop a distributed trust management for the ubiquitous healthcare. Our trust management infrastructure is responsible for evaluating the trust value and assigning access rights based on the trust value. Based on each agent's confidence of its personal experience on other agents, three naive Bayes classifier based algorithms are introduced for the trust evaluation: the robust experience algorithm, the weak experience algorithm and the no experience algorithm. The simulation results show the feasibility and effectiveness of our trust management in the ubiquitous healthcare.
{"title":"Trust Management for Ubiquitous Healthcare","authors":"Weiwei Yuan, D. Guan, Sungyoung Lee","doi":"10.1109/ISPA.2008.117","DOIUrl":"https://doi.org/10.1109/ISPA.2008.117","url":null,"abstract":"As the cornerstone of effective patient-physician relationships in the traditional healthcare infrastructures, trust faces new opportunities and challenges in the ubiquitous healthcare. Ubiquitous healthcare enables the agents acquire more information on trust evaluation through effectively resource sharing. Yet ubiquitous healthcare also lays the agents in a more dynamic and uncertainty environment for the trust evaluations. This paper contributes to develop a distributed trust management for the ubiquitous healthcare. Our trust management infrastructure is responsible for evaluating the trust value and assigning access rights based on the trust value. Based on each agent's confidence of its personal experience on other agents, three naive Bayes classifier based algorithms are introduced for the trust evaluation: the robust experience algorithm, the weak experience algorithm and the no experience algorithm. The simulation results show the feasibility and effectiveness of our trust management in the ubiquitous healthcare.","PeriodicalId":345341,"journal":{"name":"2008 IEEE International Symposium on Parallel and Distributed Processing with Applications","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133378936","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}
Most workflow management systems nowadays are based on centralized client/server architecture. Under this architecture, the response time of request might increase unacceptably when the number of users who login to the system increase quickly and a large amount of requests are sent to the centralized server within a short time period. Parallel server architecture could help to resolve the performance bottleneck of a single server. However, a static parallel architecture with a fixed number of servers is not efficient at resource utilization because the numbers of users and their requests usually change time by time, especially for big and fast changes. This paper presents an effective architecture of dynamic resource-provisioning and then the implementation for a parallel workflow management system. There are a series of experiments conducted and the results indicate that it is an effective approach to handling the time-varying workloads in real world WfMS.
{"title":"Dynamic Provisioning of a Parallel Workflow Management System","authors":"Ching-Hong Tsai, Kuo-Chan Huang, Feng-Jian Wang","doi":"10.1109/ISPA.2008.116","DOIUrl":"https://doi.org/10.1109/ISPA.2008.116","url":null,"abstract":"Most workflow management systems nowadays are based on centralized client/server architecture. Under this architecture, the response time of request might increase unacceptably when the number of users who login to the system increase quickly and a large amount of requests are sent to the centralized server within a short time period. Parallel server architecture could help to resolve the performance bottleneck of a single server. However, a static parallel architecture with a fixed number of servers is not efficient at resource utilization because the numbers of users and their requests usually change time by time, especially for big and fast changes. This paper presents an effective architecture of dynamic resource-provisioning and then the implementation for a parallel workflow management system. There are a series of experiments conducted and the results indicate that it is an effective approach to handling the time-varying workloads in real world WfMS.","PeriodicalId":345341,"journal":{"name":"2008 IEEE International Symposium on Parallel and Distributed Processing with Applications","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131391824","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 this work, we study the behaviour of different resource scheduling strategies when doing job orchestration in grid environments. We empirically demonstrate that scheduling strategies based on reinforcement learning are a good choice to improve the overall performance of grid applications and resource utilization.
{"title":"RL-Based Scheduling Strategies in Actual Grid Environments","authors":"B. F. Costa, I. Dutra, M. Mattoso","doi":"10.1109/ISPA.2008.119","DOIUrl":"https://doi.org/10.1109/ISPA.2008.119","url":null,"abstract":"In this work, we study the behaviour of different resource scheduling strategies when doing job orchestration in grid environments. We empirically demonstrate that scheduling strategies based on reinforcement learning are a good choice to improve the overall performance of grid applications and resource utilization.","PeriodicalId":345341,"journal":{"name":"2008 IEEE International Symposium on Parallel and Distributed Processing with Applications","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131749124","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 incident response is a major activity to guarantee the protection of information systems. We develop in this paper a methodology for automatically determining responses to security incidents based on a new category of cognitive maps, referred to as incident response probabilistic cognitive map. The main issue addressed in this paper is the development of a methodology using mathematical tools for reasoning about the constructed cognitive map to identify the attack, to reduce its complexity, and to search for the decision responding to the detected attack. The main features have been highlighted showing the complexity of the incident response team role.
{"title":"Incident Response Probabilistic Cognitive Maps","authors":"J. Krichène, N. Boudriga","doi":"10.1109/ISPA.2008.33","DOIUrl":"https://doi.org/10.1109/ISPA.2008.33","url":null,"abstract":"Security incident response is a major activity to guarantee the protection of information systems. We develop in this paper a methodology for automatically determining responses to security incidents based on a new category of cognitive maps, referred to as incident response probabilistic cognitive map. The main issue addressed in this paper is the development of a methodology using mathematical tools for reasoning about the constructed cognitive map to identify the attack, to reduce its complexity, and to search for the decision responding to the detected attack. The main features have been highlighted showing the complexity of the incident response team role.","PeriodicalId":345341,"journal":{"name":"2008 IEEE International Symposium on Parallel and Distributed Processing with Applications","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131243062","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}
Evaluation of distributed join queries often deals with an increasing data volume and low bandwidth in large scale environments. Several techniques were proposed to improve join performances. In this paper, we propose to use a new form of signatures, the algebraic signatures. We prove that these signatures combined to semi-join based join technique are very useful for reducing the communication cost in a distributed environment and focus in the semi-join based join operation. Semi-join based join is one of the most used techniques to decrease the communication cost on distributed architectures. We demonstrate that algebraic signatures are very useful to reduce significantly the amount of the data transfer between sites. Also, we have not any data decoding step in the site receiving these data. The performance study of our technique shows the reduction of the communication costs in the semi-join based join operation. Our technique can be deployed in large scale peer to peer or grid environments especially in a network with low bandwidth and strong latency.
{"title":"Performance Improving of Semi-join Based Join Operation through Algebraic Signatures","authors":"R. Mokadem, A. Hameurlain, F. Morvan","doi":"10.1109/ISPA.2008.84","DOIUrl":"https://doi.org/10.1109/ISPA.2008.84","url":null,"abstract":"Evaluation of distributed join queries often deals with an increasing data volume and low bandwidth in large scale environments. Several techniques were proposed to improve join performances. In this paper, we propose to use a new form of signatures, the algebraic signatures. We prove that these signatures combined to semi-join based join technique are very useful for reducing the communication cost in a distributed environment and focus in the semi-join based join operation. Semi-join based join is one of the most used techniques to decrease the communication cost on distributed architectures. We demonstrate that algebraic signatures are very useful to reduce significantly the amount of the data transfer between sites. Also, we have not any data decoding step in the site receiving these data. The performance study of our technique shows the reduction of the communication costs in the semi-join based join operation. Our technique can be deployed in large scale peer to peer or grid environments especially in a network with low bandwidth and strong latency.","PeriodicalId":345341,"journal":{"name":"2008 IEEE International Symposium on Parallel and Distributed Processing with Applications","volume":"66 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121382304","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}
This paper proposes a novel node localization algorithm that collaborates with street maps to estimate the locations of mobile nodes. It uses simple motion equations for moving objects in two dimensions to estimate the location of nodes, and then verifies the estimated location using street maps. This localization algorithm reduces the number of periodic beacons propagated into the network and reduces the latency or the time delay to update location information. Performance assessment was tested by simulation using MATLAB. This algorithm can be used in routing for wireless mobile and personal area networks that use geographical routing.
{"title":"Use of Street Maps to Aid Node Localization in Mobile Wireless Networks","authors":"M. Al-Hattab, J. Agbinya","doi":"10.1109/ISPA.2008.49","DOIUrl":"https://doi.org/10.1109/ISPA.2008.49","url":null,"abstract":"This paper proposes a novel node localization algorithm that collaborates with street maps to estimate the locations of mobile nodes. It uses simple motion equations for moving objects in two dimensions to estimate the location of nodes, and then verifies the estimated location using street maps. This localization algorithm reduces the number of periodic beacons propagated into the network and reduces the latency or the time delay to update location information. Performance assessment was tested by simulation using MATLAB. This algorithm can be used in routing for wireless mobile and personal area networks that use geographical routing.","PeriodicalId":345341,"journal":{"name":"2008 IEEE International Symposium on Parallel and Distributed Processing with Applications","volume":"110 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116176956","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}
E. P. Freitas, A. Binotto, C. Pereira, A. Stork, Tony Larsson
Sensor networks are being applied in several emerging sophisticated applications due to the use of powerful and high-quality sensor nodes, such as radars and visible light cameras. However, these nodes need additional features to optimally benefit from heterogeneous modern computing platforms. Therefore, reconfigurable computing is a potential paradigm for those scenarios as it can provide flexibility to explore the computational resources on that kind of high performance computing system. This paper presents a reconfigurable sensor node allocation support, based on application requirements, provided by a middleware focused on heterogeneous sensor networks. In order to address this concern, an aspect-orientation paradigm and intelligent agents approach is proposed followed by an UAV case study.
{"title":"Dynamic Reconfigurable Task Schedule Support towards a Reflective Middleware for Sensor Network","authors":"E. P. Freitas, A. Binotto, C. Pereira, A. Stork, Tony Larsson","doi":"10.1109/ISPA.2008.70","DOIUrl":"https://doi.org/10.1109/ISPA.2008.70","url":null,"abstract":"Sensor networks are being applied in several emerging sophisticated applications due to the use of powerful and high-quality sensor nodes, such as radars and visible light cameras. However, these nodes need additional features to optimally benefit from heterogeneous modern computing platforms. Therefore, reconfigurable computing is a potential paradigm for those scenarios as it can provide flexibility to explore the computational resources on that kind of high performance computing system. This paper presents a reconfigurable sensor node allocation support, based on application requirements, provided by a middleware focused on heterogeneous sensor networks. In order to address this concern, an aspect-orientation paradigm and intelligent agents approach is proposed followed by an UAV case study.","PeriodicalId":345341,"journal":{"name":"2008 IEEE International Symposium on Parallel and Distributed Processing with Applications","volume":"71 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116400141","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
扫码关注我们
求助内容：
应助结果提醒方式：