Xiangping Chen, Gang Huang, Franck Chauvel, Yanchun Sun, Hong Mei
With the increasing maturity of model-driven tools and methods, new model-based analysis methods are developed to support specific stakeholder concerns during software lifecycle. This multiplication of models and their related analysis tools calls for solution addressing the integration of MOF-based analysis methods. Current research works on integration of analysis methods have already addressed the extraction of the needed input data as well as the control and the integration of the tools supporting the analysis execution. However, little attention has been paid to the integration of analysis results back into initial model. We propose a MOF-based framework enabling the integration of analysis results that a) defines a meta-model capturing the integration requirements, b) provides a MOF meta-model extension mechanism with support for upward compatibility; and c) automatically generates a model transformation for model integration. We illustrate the use of our framework by integrating a reliability analysis methods and a fault tolerant reconfiguration method on the ABC/ADL Software Architecture. We applied the resulting analysis composition onto the ECPerf JEE system.
{"title":"A framework for the integration of MOF-compliant analysis methods","authors":"Xiangping Chen, Gang Huang, Franck Chauvel, Yanchun Sun, Hong Mei","doi":"10.1145/2020723.2020724","DOIUrl":"https://doi.org/10.1145/2020723.2020724","url":null,"abstract":"With the increasing maturity of model-driven tools and methods, new model-based analysis methods are developed to support specific stakeholder concerns during software lifecycle. This multiplication of models and their related analysis tools calls for solution addressing the integration of MOF-based analysis methods. Current research works on integration of analysis methods have already addressed the extraction of the needed input data as well as the control and the integration of the tools supporting the analysis execution. However, little attention has been paid to the integration of analysis results back into initial model. We propose a MOF-based framework enabling the integration of analysis results that a) defines a meta-model capturing the integration requirements, b) provides a MOF meta-model extension mechanism with support for upward compatibility; and c) automatically generates a model transformation for model integration. We illustrate the use of our framework by integrating a reliability analysis methods and a fault tolerant reconfiguration method on the ABC/ADL Software Architecture. We applied the resulting analysis composition onto the ECPerf JEE system.","PeriodicalId":20631,"journal":{"name":"Proceedings of the 8th Asia-Pacific Symposium on Internetware","volume":"14 1","pages":"1"},"PeriodicalIF":0.0,"publicationDate":"2010-11-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"84334810","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}
Researches on Internetware have gained daily expanding attentions and interests. Internetware intends to be a framework of Web-based software development. This paper we model an Agent oriented Internetware Framework. Four principles are followed when the modeling approach is developed. They are the autonomy principle, the abstract principle, the explicitness principle and the competence principle. For conducting the Agent-oriented Internetware computing, three types of agents are needed based on these principles. They are the capability providing agents, the task planning agents and the task request agents. Different types of agents have different responsibilities in the computing framework. Base on the framework, we define the assignment problem in the collaboration of the autonomous Internetware entities, and show that its complexity is NP-complete. Then we model it as a Kripke structure with normative systems on it. This, which will help us to discuss some absorbing issues like the robustness or applying power indices on it in the future, builds the bridge between our work and researches on normative systems, games, mechanisms, etc. An approach based on negotiation is given to solve the problem.
{"title":"Modeling in agent oriented internetware framework","authors":"Liwei Zheng, Jian Tang, Zhi Jin","doi":"10.1145/2020723.2020730","DOIUrl":"https://doi.org/10.1145/2020723.2020730","url":null,"abstract":"Researches on Internetware have gained daily expanding attentions and interests. Internetware intends to be a framework of Web-based software development. This paper we model an Agent oriented Internetware Framework. Four principles are followed when the modeling approach is developed. They are the autonomy principle, the abstract principle, the explicitness principle and the competence principle. For conducting the Agent-oriented Internetware computing, three types of agents are needed based on these principles. They are the capability providing agents, the task planning agents and the task request agents. Different types of agents have different responsibilities in the computing framework. Base on the framework, we define the assignment problem in the collaboration of the autonomous Internetware entities, and show that its complexity is NP-complete. Then we model it as a Kripke structure with normative systems on it. This, which will help us to discuss some absorbing issues like the robustness or applying power indices on it in the future, builds the bridge between our work and researches on normative systems, games, mechanisms, etc. An approach based on negotiation is given to solve the problem.","PeriodicalId":20631,"journal":{"name":"Proceedings of the 8th Asia-Pacific Symposium on Internetware","volume":"59 1","pages":"7"},"PeriodicalIF":0.0,"publicationDate":"2010-11-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"82629697","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}
Bo Wang, Haiyan Zhao, Wei Zhang, Zhi Jin, Hong Mei
In the software development, most stakeholders cannot clearly and objectively express their needs for the envisioned software systems. In this paper, we propose a problem-driven collaborative requirements elicitation approach, with the purpose of helping identify and extract the requirements of the Internetwares (a complex and new software paradigm). The basic idea of our approach is that the requirements of the software systems should be stated by stakeholders in an objective way (i.e. problem-identifying-solving way). That is, first identify the problems existed in the as-is problem domain, and then find the solutions to the problems. The solutions to the problems are the requirements of the envisioned software systems. To this end, we propose the structure of problems and a collaborative process for achieving the solutions.
{"title":"A problem-driven collaborative approach to eliciting requirements of internetwares","authors":"Bo Wang, Haiyan Zhao, Wei Zhang, Zhi Jin, Hong Mei","doi":"10.1145/2020723.2020745","DOIUrl":"https://doi.org/10.1145/2020723.2020745","url":null,"abstract":"In the software development, most stakeholders cannot clearly and objectively express their needs for the envisioned software systems. In this paper, we propose a problem-driven collaborative requirements elicitation approach, with the purpose of helping identify and extract the requirements of the Internetwares (a complex and new software paradigm). The basic idea of our approach is that the requirements of the software systems should be stated by stakeholders in an objective way (i.e. problem-identifying-solving way). That is, first identify the problems existed in the as-is problem domain, and then find the solutions to the problems. The solutions to the problems are the requirements of the envisioned software systems. To this end, we propose the structure of problems and a collaborative process for achieving the solutions.","PeriodicalId":20631,"journal":{"name":"Proceedings of the 8th Asia-Pacific Symposium on Internetware","volume":"41 2 1","pages":"22"},"PeriodicalIF":0.0,"publicationDate":"2010-11-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"82850407","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}
Since Wireless Sensor Networks (WSNs) are increasingly used in many industrial and civilian application areas, the correctness of their low level protocol such as the Flooding Time Synchronization Protocol (FTSP) is critical. However ensuring such correctness is difficult because of the complexity of the runtime environment. Model checking is an effective method for this problem, since it is a formal verification approach which has an advantage in exploring all behaviors of the system and discovering subtle errors. In this paper, we present a novel timed automaton model for FTSP. The main insight of our method is that by using timed automata, we can introduce the transmission delay and node failures that exist in real WSNs into our model and check whether FTSP is robust to node failures under a more realistic environment. We generate the timed automata models of FTSP and verify them by the model checking tool UPPAAL. Our evaluation result depicts an error of FTSP when the algorithm runs in the scenario that two root nodes fail continuously.
{"title":"Analyzing the robustness of FTSP with timed automata","authors":"Lin Tan, Lei Bu, Jianhua Zhao, Linzhang Wang","doi":"10.1145/2020723.2020744","DOIUrl":"https://doi.org/10.1145/2020723.2020744","url":null,"abstract":"Since Wireless Sensor Networks (WSNs) are increasingly used in many industrial and civilian application areas, the correctness of their low level protocol such as the Flooding Time Synchronization Protocol (FTSP) is critical. However ensuring such correctness is difficult because of the complexity of the runtime environment. Model checking is an effective method for this problem, since it is a formal verification approach which has an advantage in exploring all behaviors of the system and discovering subtle errors. In this paper, we present a novel timed automaton model for FTSP. The main insight of our method is that by using timed automata, we can introduce the transmission delay and node failures that exist in real WSNs into our model and check whether FTSP is robust to node failures under a more realistic environment. We generate the timed automata models of FTSP and verify them by the model checking tool UPPAAL. Our evaluation result depicts an error of FTSP when the algorithm runs in the scenario that two root nodes fail continuously.","PeriodicalId":20631,"journal":{"name":"Proceedings of the 8th Asia-Pacific Symposium on Internetware","volume":"12 1","pages":"21"},"PeriodicalIF":0.0,"publicationDate":"2010-11-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"81688026","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}
Hyunjin Kong, Seungtak Oh, Moonseong Kim, Hyunseung Choo
Mobile Access Gateways and Local Mobility Anchors exchange mobility related signaling messages on behalf of Mobile Nodes (MNs) to support mobility in Proxy Mobile IPv6 (PMIPv6) networks. Thus, MNs maintain their connections whilst roaming network domains without the need of a mobility protocol stack. However, with the large number of MNs in a PMIPv6 domain, the loads on the network entities grow. In particular, LMA has higher probability of reaching a severe load level, since LMA handles every packet that all the MNs in the domain send and receive. Thus, this paper proposes a load balancing scheme for LMAs in PMIPv6 networks where more than one LMA exist in the domain. The proposed scheme distributes loads of LMAs evenly, therefore enhances the overall efficiency of the network. Simulation shows the proposed scheme effectively balances the loads of LMA and reduces total packet loss rate by 3%.
{"title":"Load balancing of local mobility anchors in proxy mobile IPv6 networks","authors":"Hyunjin Kong, Seungtak Oh, Moonseong Kim, Hyunseung Choo","doi":"10.1145/2020723.2020739","DOIUrl":"https://doi.org/10.1145/2020723.2020739","url":null,"abstract":"Mobile Access Gateways and Local Mobility Anchors exchange mobility related signaling messages on behalf of Mobile Nodes (MNs) to support mobility in Proxy Mobile IPv6 (PMIPv6) networks. Thus, MNs maintain their connections whilst roaming network domains without the need of a mobility protocol stack. However, with the large number of MNs in a PMIPv6 domain, the loads on the network entities grow. In particular, LMA has higher probability of reaching a severe load level, since LMA handles every packet that all the MNs in the domain send and receive. Thus, this paper proposes a load balancing scheme for LMAs in PMIPv6 networks where more than one LMA exist in the domain. The proposed scheme distributes loads of LMAs evenly, therefore enhances the overall efficiency of the network. Simulation shows the proposed scheme effectively balances the loads of LMA and reduces total packet loss rate by 3%.","PeriodicalId":20631,"journal":{"name":"Proceedings of the 8th Asia-Pacific Symposium on Internetware","volume":"45 1","pages":"16"},"PeriodicalIF":0.0,"publicationDate":"2010-11-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"85862621","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}
Mashup tools allow end users graphically build complex mashups using pipes to connect web data sources into a data flow. Because end users are of poor technical expertise, the designed data flows may be inefficient. This paper targets on enhancing the performance of mashups via automatically refactoring the structure of its data flows. First a set of operational semantics features are selected for annotating the operators in data flows and refactoring rules are defined to generate all candidate semantics equivalent data flows. Then a heuristic algorithm is described for accurately searching the data flow of minimal execution time by constructing a partially ordered set of data flows based on their cost estimation. This approach is applicable to general mashup data flows without knowing complete operational semantics of their operators and the efficiency improvement is demonstrated by experiments.
{"title":"A new approach to performance optimization of mashups via data flow refactoring","authors":"Jie Liu, Jun Wei, Dan Ye, Tao Huang","doi":"10.1145/2020723.2020729","DOIUrl":"https://doi.org/10.1145/2020723.2020729","url":null,"abstract":"Mashup tools allow end users graphically build complex mashups using pipes to connect web data sources into a data flow. Because end users are of poor technical expertise, the designed data flows may be inefficient. This paper targets on enhancing the performance of mashups via automatically refactoring the structure of its data flows. First a set of operational semantics features are selected for annotating the operators in data flows and refactoring rules are defined to generate all candidate semantics equivalent data flows. Then a heuristic algorithm is described for accurately searching the data flow of minimal execution time by constructing a partially ordered set of data flows based on their cost estimation. This approach is applicable to general mashup data flows without knowing complete operational semantics of their operators and the efficiency improvement is demonstrated by experiments.","PeriodicalId":20631,"journal":{"name":"Proceedings of the 8th Asia-Pacific Symposium on Internetware","volume":"125 1","pages":"6"},"PeriodicalIF":0.0,"publicationDate":"2010-11-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"89175879","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}
Ting Wang, Yuanjie Si, Xiao Xuan, Xinyu Wang, Xiaohu Yang, Shanping Li, Aleksander J. Kavs
Non-functional requirements (NFRs) are often regarded as the key success factor in building high quality software. However, most of the requirements elicitation methods are centered on discovering functional requirements only. This paper presents a novel NFRs elicitation approach aiming at empowering requirements analysts with a knowledge repository that aids to the process of capturing precise NFRs during elicitation interviews. The knowledge repository is composed of two layers: the upper layer of feature models and the lower layer of the QoS ontology. The case study of the stock trading domain illustrates the relationships and cooperations of the two layers.
{"title":"A QoS ontology cooperated with feature models for non-functional requirements elicitation","authors":"Ting Wang, Yuanjie Si, Xiao Xuan, Xinyu Wang, Xiaohu Yang, Shanping Li, Aleksander J. Kavs","doi":"10.1145/2020723.2020740","DOIUrl":"https://doi.org/10.1145/2020723.2020740","url":null,"abstract":"Non-functional requirements (NFRs) are often regarded as the key success factor in building high quality software. However, most of the requirements elicitation methods are centered on discovering functional requirements only. This paper presents a novel NFRs elicitation approach aiming at empowering requirements analysts with a knowledge repository that aids to the process of capturing precise NFRs during elicitation interviews. The knowledge repository is composed of two layers: the upper layer of feature models and the lower layer of the QoS ontology. The case study of the stock trading domain illustrates the relationships and cooperations of the two layers.","PeriodicalId":20631,"journal":{"name":"Proceedings of the 8th Asia-Pacific Symposium on Internetware","volume":"5 1","pages":"17"},"PeriodicalIF":0.0,"publicationDate":"2010-11-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"87875240","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}
Software Systems running in the Internet are facing an ever-changing environment, which requires constant monitoring and adaptation facilities to be in place, so that user's needs and system requirements are satisfied on-demand. This paper summarizes our general observation and understanding to how user and system goals can drive the adaptation mechanisms of individual software service modules, implemented as internetware components. In particular, a theoretical typology of different levels of adaptation capability is proposed. Their correspondence with the key characteristics of internetware is analyzed. A common architecture to support the run-time adaptation of internetware is also suggested in company with a development method.
{"title":"Goal-driven adaptation of internetware","authors":"Yunsong Jian, Lin Liu, Jianmin Wang, E. Yu","doi":"10.1145/2020723.2020733","DOIUrl":"https://doi.org/10.1145/2020723.2020733","url":null,"abstract":"Software Systems running in the Internet are facing an ever-changing environment, which requires constant monitoring and adaptation facilities to be in place, so that user's needs and system requirements are satisfied on-demand. This paper summarizes our general observation and understanding to how user and system goals can drive the adaptation mechanisms of individual software service modules, implemented as internetware components. In particular, a theoretical typology of different levels of adaptation capability is proposed. Their correspondence with the key characteristics of internetware is analyzed. A common architecture to support the run-time adaptation of internetware is also suggested in company with a development method.","PeriodicalId":20631,"journal":{"name":"Proceedings of the 8th Asia-Pacific Symposium on Internetware","volume":"100 1","pages":"10"},"PeriodicalIF":0.0,"publicationDate":"2010-11-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"82413736","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 open, dynamic and uncertain internet platform requires software systems running on it should be able to probe the changes of their running environments and adapt themselves accordingly. The Internetware paradigm and the environment driven application model open a promising way to cope with these requirements. A uniform middleware for environmental context information handling is essential to achieve the environment driven application model. In this paper, we argue that mobile agent technology is competent for building such a middleware and propose the Probe system, implemented based on mobile agent technology, with respects to the environment driven application model. The Probe system provides a uniform, hierarchical, and dynamic configurable platform for environmental context information collection, dissemination and processing for Internetware applications.
{"title":"Probe: a system for context collection, dissemination and processing","authors":"Jun Ma, Xianping Tao","doi":"10.1145/2020723.2020737","DOIUrl":"https://doi.org/10.1145/2020723.2020737","url":null,"abstract":"The open, dynamic and uncertain internet platform requires software systems running on it should be able to probe the changes of their running environments and adapt themselves accordingly. The Internetware paradigm and the environment driven application model open a promising way to cope with these requirements. A uniform middleware for environmental context information handling is essential to achieve the environment driven application model. In this paper, we argue that mobile agent technology is competent for building such a middleware and propose the Probe system, implemented based on mobile agent technology, with respects to the environment driven application model. The Probe system provides a uniform, hierarchical, and dynamic configurable platform for environmental context information collection, dissemination and processing for Internetware applications.","PeriodicalId":20631,"journal":{"name":"Proceedings of the 8th Asia-Pacific Symposium on Internetware","volume":"5 1","pages":"14"},"PeriodicalIF":0.0,"publicationDate":"2010-11-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"82497810","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}
Recent pervasive systems are designed to be context-aware so that they are able to adapt to continual changes of their environments. Rule-based adaptation, which is commonly adopted by these applications, introduces new challenges in software design and verification. Recent research results have identified some faulty or unwanted adaptations caused by factors such as asynchronous context updating, and missing or faulty context reading. In addition, adaptation rules based on simple event models and propositional logic are not expressive enough to address these factors and to satisfy users' expectation in the design. We tackle these challenges at design stage by introducing sequential event patterns in adaptation rules to eliminate faulty and unwanted adaptations with features provided in the event pattern query language. We illustrate our approach using the recent published examples of adaptive applications, and show that it is promising on designing more reliable context-aware adaptive applications.
{"title":"Sequential event pattern based context-aware adaptation","authors":"Chushu Gao, Jun Wei, Chang Xu, S. Cheung","doi":"10.1145/2020723.2020726","DOIUrl":"https://doi.org/10.1145/2020723.2020726","url":null,"abstract":"Recent pervasive systems are designed to be context-aware so that they are able to adapt to continual changes of their environments. Rule-based adaptation, which is commonly adopted by these applications, introduces new challenges in software design and verification. Recent research results have identified some faulty or unwanted adaptations caused by factors such as asynchronous context updating, and missing or faulty context reading. In addition, adaptation rules based on simple event models and propositional logic are not expressive enough to address these factors and to satisfy users' expectation in the design. We tackle these challenges at design stage by introducing sequential event patterns in adaptation rules to eliminate faulty and unwanted adaptations with features provided in the event pattern query language. We illustrate our approach using the recent published examples of adaptive applications, and show that it is promising on designing more reliable context-aware adaptive applications.","PeriodicalId":20631,"journal":{"name":"Proceedings of the 8th Asia-Pacific Symposium on Internetware","volume":"18 1","pages":"3"},"PeriodicalIF":0.0,"publicationDate":"2010-11-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"74932685","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
扫码关注我们
求助内容：
应助结果提醒方式：