Pub Date : 2008-04-01DOI: 10.1109/P2P.2009.5284500
M. Quinson
Distributed computing is a very broad and active research area comprising fields such as cluster computing, computational grids, desktop grids and peer-to-peer (P2P) systems. Unfortunately, it is often impossible to obtain theoretical or analytical results to compare the performance of algorithms targeting such systems. One possibility is to conduct large numbers of back-to-back experiments on real platforms. While this is possible on tightly-coupled platforms, it is infeasible on modern distributed platforms as experiments are labor-intensive and results typically not reproducible. Consequently, one must resort to simulations, which enable reproducible results and also make it possible to explore wide ranges of platform and application scenarios. In this paper we describe the SimGrid framework, a simulation-based framework for evaluating cluster, grid and P2P algorithms and heuristics. This paper focuses on SimGrid v3, which greatly improves on previous versions thanks to a novel and validated modular simulation engine that achieves higher simulation speed without hindering simulation accuracy. Also, two new user interfaces were added to broaden the targeted research community. After surveying existing tools and methodologies we describe the key features and benefits of SimGrid.
{"title":"SimGrid: A Generic Framework for Large-Scale Distributed Experiments","authors":"M. Quinson","doi":"10.1109/P2P.2009.5284500","DOIUrl":"https://doi.org/10.1109/P2P.2009.5284500","url":null,"abstract":"Distributed computing is a very broad and active research area comprising fields such as cluster computing, computational grids, desktop grids and peer-to-peer (P2P) systems. Unfortunately, it is often impossible to obtain theoretical or analytical results to compare the performance of algorithms targeting such systems. One possibility is to conduct large numbers of back-to-back experiments on real platforms. While this is possible on tightly-coupled platforms, it is infeasible on modern distributed platforms as experiments are labor-intensive and results typically not reproducible. Consequently, one must resort to simulations, which enable reproducible results and also make it possible to explore wide ranges of platform and application scenarios. In this paper we describe the SimGrid framework, a simulation-based framework for evaluating cluster, grid and P2P algorithms and heuristics. This paper focuses on SimGrid v3, which greatly improves on previous versions thanks to a novel and validated modular simulation engine that achieves higher simulation speed without hindering simulation accuracy. Also, two new user interfaces were added to broaden the targeted research community. After surveying existing tools and methodologies we describe the key features and benefits of SimGrid.","PeriodicalId":22356,"journal":{"name":"Tenth International Conference on Computer Modeling and Simulation (uksim 2008)","volume":"58 1","pages":"126-131"},"PeriodicalIF":0.0,"publicationDate":"2008-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"76314040","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 Distributed Intrusion Prediction and Prevention Systems (DIPPS) not only detects and prevents possible intrusions but also possesses the capability to predict possible intrusions in a distributed network. Based on the DIPS sensors, instead of merely preventing the attackers or blocking traffic, we propose a fuzzy logic based online risk assessment scheme. The key idea of DIPPS is to protect the network(s) linked to assets, which are considered to be very risky. To implement DIPPS we used a Distributed Intrusion Detection System (DIDS) with extended real time traffic surveillance and online risk assessment. To model and predict the next step of an attacker, we used a Hidden Markov Model (HMM) that captures the interaction between the attacker and the network. The interaction between various DIDS and integration of their output are achieved through a HMM. The novelty of this paper is the detailed development of Fuzzy Logic Controllers to estimate the various risk(s) that are dependent on several other variables based on the inputs from HMM modules and the DIDS agents. To develop the fuzzy risk expert system, if-then fuzzy rules were formulated based on interviews with security experts and network administrators. Preliminary results indicate that such a system is very practical for protecting assets which are prone to attacks or misuse, i.e. highly at risk.
{"title":"Fuzzy Online Risk Assessment for Distributed Intrusion Prediction and Prevention Systems","authors":"K. Haslum, A. Abraham, S. J. Knapskog","doi":"10.1109/UKSIM.2008.30","DOIUrl":"https://doi.org/10.1109/UKSIM.2008.30","url":null,"abstract":"A Distributed Intrusion Prediction and Prevention Systems (DIPPS) not only detects and prevents possible intrusions but also possesses the capability to predict possible intrusions in a distributed network. Based on the DIPS sensors, instead of merely preventing the attackers or blocking traffic, we propose a fuzzy logic based online risk assessment scheme. The key idea of DIPPS is to protect the network(s) linked to assets, which are considered to be very risky. To implement DIPPS we used a Distributed Intrusion Detection System (DIDS) with extended real time traffic surveillance and online risk assessment. To model and predict the next step of an attacker, we used a Hidden Markov Model (HMM) that captures the interaction between the attacker and the network. The interaction between various DIDS and integration of their output are achieved through a HMM. The novelty of this paper is the detailed development of Fuzzy Logic Controllers to estimate the various risk(s) that are dependent on several other variables based on the inputs from HMM modules and the DIDS agents. To develop the fuzzy risk expert system, if-then fuzzy rules were formulated based on interviews with security experts and network administrators. Preliminary results indicate that such a system is very practical for protecting assets which are prone to attacks or misuse, i.e. highly at risk.","PeriodicalId":22356,"journal":{"name":"Tenth International Conference on Computer Modeling and Simulation (uksim 2008)","volume":"1 1","pages":"216-223"},"PeriodicalIF":0.0,"publicationDate":"2008-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"81371927","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}
For the evaluation of wireless network protocols, simulation has established itself as a good compromise between cost and complexity, on the one hand, and accuracy of results, on the other hand. In order to assess and debug the simulated protocols, visualization both in the form of textual console messages and graphical representations can be of great help. In this paper, we present a network visualizer which was written for the wireless network simulator ShoX. Aside from nodes, links, movements and data packets, our visualizer allows to graphically display arbitrary node and link states in an intuitive and flexible way. As opposed to other visualization tools, it provides the possibility to change the way in which such inner states are displayed without running the simulation again. This can significantly improve the designer's productivity especially in complex network scenarios. Further, our visualizer allows to display textual debug messages together with the graphical animation in a synchronized form, thus combining the strengths of textual and graphical informations.
{"title":"Flexible Offline-Visualization for Mobile Wireless Networks","authors":"J. Lessmann, T. Heimfarth","doi":"10.1109/UKSIM.2008.33","DOIUrl":"https://doi.org/10.1109/UKSIM.2008.33","url":null,"abstract":"For the evaluation of wireless network protocols, simulation has established itself as a good compromise between cost and complexity, on the one hand, and accuracy of results, on the other hand. In order to assess and debug the simulated protocols, visualization both in the form of textual console messages and graphical representations can be of great help. In this paper, we present a network visualizer which was written for the wireless network simulator ShoX. Aside from nodes, links, movements and data packets, our visualizer allows to graphically display arbitrary node and link states in an intuitive and flexible way. As opposed to other visualization tools, it provides the possibility to change the way in which such inner states are displayed without running the simulation again. This can significantly improve the designer's productivity especially in complex network scenarios. Further, our visualizer allows to display textual debug messages together with the graphical animation in a synchronized form, thus combining the strengths of textual and graphical informations.","PeriodicalId":22356,"journal":{"name":"Tenth International Conference on Computer Modeling and Simulation (uksim 2008)","volume":"45 1","pages":"404-409"},"PeriodicalIF":0.0,"publicationDate":"2008-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"90461390","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 new approach to modeling the collective behaviour in terms of conditional multi-agent interplay is proposed in this paper. Within this approach, we explicitly model the situation where some agents’ action history (past behaviour) conditions subsequent actions of some other agents. Such a viewpoint of the multi-agent behaviour provides for the possibility to create and study useful models of collective behaviour, ultimately gaining a deeper understanding of the basic laws of the conditional interplay. The temporizing game as an example of modeling the collective behaviour within the sample coordination space, the cyberCromlech, demonstrates the approach.
{"title":"Concept of Multi-agent Conditional Interplay","authors":"A. Botchkaryov, Serhiy Kovela","doi":"10.1109/UKSIM.2008.125","DOIUrl":"https://doi.org/10.1109/UKSIM.2008.125","url":null,"abstract":"A new approach to modeling the collective behaviour in terms of conditional multi-agent interplay is proposed in this paper. Within this approach, we explicitly model the situation where some agents’ action history (past behaviour) conditions subsequent actions of some other agents. Such a viewpoint of the multi-agent behaviour provides for the possibility to create and study useful models of collective behaviour, ultimately gaining a deeper understanding of the basic laws of the conditional interplay. The temporizing game as an example of modeling the collective behaviour within the sample coordination space, the cyberCromlech, demonstrates the approach.","PeriodicalId":22356,"journal":{"name":"Tenth International Conference on Computer Modeling and Simulation (uksim 2008)","volume":"4 1","pages":"100-105"},"PeriodicalIF":0.0,"publicationDate":"2008-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"89208698","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 group decision model for the assessment of credit/loan applications by a team. As many new players enter the finance sector, offering new products and different forms of financing, it is important that credit applications are assessed from multiple angles including the marketing and risk management sides. While external organisations offer independent ratings and credit reports of potential applicants, lending firms need to take into account internal criteria in order to effectively allocate and grant credit to their customers. Individual products target specific customer profiles:in this paper we propose a tool to support the multicriteria assessment and classification of the applicants' profile aiming for a good match between the product and the customer. This will look at expanding the firm's customer base with a reduced risk of bad credit.
{"title":"A Decision Model for Group Assessment of Credit Applications","authors":"N. Karadimas, G. Rigopoulos, A. Orsoni","doi":"10.1109/UKSIM.2008.34","DOIUrl":"https://doi.org/10.1109/UKSIM.2008.34","url":null,"abstract":"This paper proposes a group decision model for the assessment of credit/loan applications by a team. As many new players enter the finance sector, offering new products and different forms of financing, it is important that credit applications are assessed from multiple angles including the marketing and risk management sides. While external organisations offer independent ratings and credit reports of potential applicants, lending firms need to take into account internal criteria in order to effectively allocate and grant credit to their customers. Individual products target specific customer profiles:in this paper we propose a tool to support the multicriteria assessment and classification of the applicants' profile aiming for a good match between the product and the customer. This will look at expanding the firm's customer base with a reduced risk of bad credit.","PeriodicalId":22356,"journal":{"name":"Tenth International Conference on Computer Modeling and Simulation (uksim 2008)","volume":"8 1","pages":"319-323"},"PeriodicalIF":0.0,"publicationDate":"2008-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"89541061","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}
Multimedia and real-time applications applied on the Internet require Quality of Service (QoS) routing algorithms; however, QoS routing is considered an NP-complete problem. This paper proposes an enhanced source based QoS routing algorithm that aims at reducing the complexity of route selection for services with multi QoS metrics. The algorithm uses the Analytic Hierarchy Process to find the best path between the service provider and the client that meets a list of constraints stored in a QoS profile; these constraints are specific for that particular service. Simulation results show that the algorithm finds a path with multiple metrics in scalable time; also the algorithm shows high ability to handle various types of multimedia and real-time applications
{"title":"Quality of Service Routing for Real-Time Applications Using the Analytical Hierarchy Process (Invited Paper)","authors":"A. Awajan, K. Al-Begain, Paula Thomas","doi":"10.1109/UKSIM.2008.98","DOIUrl":"https://doi.org/10.1109/UKSIM.2008.98","url":null,"abstract":"Multimedia and real-time applications applied on the Internet require Quality of Service (QoS) routing algorithms; however, QoS routing is considered an NP-complete problem. This paper proposes an enhanced source based QoS routing algorithm that aims at reducing the complexity of route selection for services with multi QoS metrics. The algorithm uses the Analytic Hierarchy Process to find the best path between the service provider and the client that meets a list of constraints stored in a QoS profile; these constraints are specific for that particular service. Simulation results show that the algorithm finds a path with multiple metrics in scalable time; also the algorithm shows high ability to handle various types of multimedia and real-time applications","PeriodicalId":22356,"journal":{"name":"Tenth International Conference on Computer Modeling and Simulation (uksim 2008)","volume":"134 1","pages":"70-75"},"PeriodicalIF":0.0,"publicationDate":"2008-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"86325705","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}
information systems developed at the author’s university. It examines key features of the systems, shows multiple ways of mobile content access and outlines future research potentials.
{"title":"Potentials and Defiances of Mobile Devices and Wireless Networks","authors":"J. Sieck","doi":"10.1109/UKSIM.2008.109","DOIUrl":"https://doi.org/10.1109/UKSIM.2008.109","url":null,"abstract":"information systems developed at the author’s university. It examines key features of the systems, shows multiple ways of mobile content access and outlines future research potentials.","PeriodicalId":22356,"journal":{"name":"Tenth International Conference on Computer Modeling and Simulation (uksim 2008)","volume":"5 1","pages":"1-6"},"PeriodicalIF":0.0,"publicationDate":"2008-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"89150689","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 new mathematical models for the prediction of chemical oxygen demand (COD) from different stages in full ECF bleaching sequences and discusses several important issues related to model development and interpretation. The effects of different process conditions, like pH, chemical charge, initial Kappa number, carryover, temperature etc., on the formation of COD from the different chlorine dioxide stages (Do, D1, D2) and extraction stages (E, EO, EP, EOP) were studied and corresponding models were developed for softwood and hardwood pulps. The models, based on results obtained from the extensive studies of the kinetics, stoichiometry, and effluent properties of the chlorine dioxide stages and extraction stages in the ECF bleaching of pulp, were tested for accuracy on a vast range of data both from literature and laboratory experiments. The kinetics, stoichiometry and effluent properties have not previously been considered together for optimization and would be of considerable use in bleach plant optimization as well as in process control of different stages. This study will also help in understanding the need for modifications of the conventional conditions in both the chlorine dioxide and the extraction stages to obtain the best mix between a low formation of COD and high bleaching efficiency.
{"title":"New Predictive Models for COD from All Stages in Full ECF Bleaching Sequences","authors":"Sandeep Jain, G. Mortha, C. Calais","doi":"10.1109/UKSIM.2008.8","DOIUrl":"https://doi.org/10.1109/UKSIM.2008.8","url":null,"abstract":"This paper proposes new mathematical models for the prediction of chemical oxygen demand (COD) from different stages in full ECF bleaching sequences and discusses several important issues related to model development and interpretation. The effects of different process conditions, like pH, chemical charge, initial Kappa number, carryover, temperature etc., on the formation of COD from the different chlorine dioxide stages (Do, D1, D2) and extraction stages (E, EO, EP, EOP) were studied and corresponding models were developed for softwood and hardwood pulps. The models, based on results obtained from the extensive studies of the kinetics, stoichiometry, and effluent properties of the chlorine dioxide stages and extraction stages in the ECF bleaching of pulp, were tested for accuracy on a vast range of data both from literature and laboratory experiments. The kinetics, stoichiometry and effluent properties have not previously been considered together for optimization and would be of considerable use in bleach plant optimization as well as in process control of different stages. This study will also help in understanding the need for modifications of the conventional conditions in both the chlorine dioxide and the extraction stages to obtain the best mix between a low formation of COD and high bleaching efficiency.","PeriodicalId":22356,"journal":{"name":"Tenth International Conference on Computer Modeling and Simulation (uksim 2008)","volume":"1 1","pages":"278-283"},"PeriodicalIF":0.0,"publicationDate":"2008-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"89158344","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. Teilans, A. Kleins, Uldis Sukovskis, Y. Merkuryev, Ivars Meirans
This paper is devoted to a meta-model based approach to UML systems modelling. The approach allows creating a system model by operating with artefacts from the problem domain, followed by generation of a UML model. The discussed approach is illustrated by generating UML models, using Use Case and Activity diagrams of the UML language.
{"title":"A Meta-Model Based Approach to UML Modelling","authors":"A. Teilans, A. Kleins, Uldis Sukovskis, Y. Merkuryev, Ivars Meirans","doi":"10.1109/UKSIM.2008.60","DOIUrl":"https://doi.org/10.1109/UKSIM.2008.60","url":null,"abstract":"This paper is devoted to a meta-model based approach to UML systems modelling. The approach allows creating a system model by operating with artefacts from the problem domain, followed by generation of a UML model. The discussed approach is illustrated by generating UML models, using Use Case and Activity diagrams of the UML language.","PeriodicalId":22356,"journal":{"name":"Tenth International Conference on Computer Modeling and Simulation (uksim 2008)","volume":"44 1","pages":"667-672"},"PeriodicalIF":0.0,"publicationDate":"2008-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"76033918","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}
Evolutionary multiobjective optimization (EMO) is one of the most active research areas in the field of evolutionary computation. Whereas EMO algorithms have been successfully used in various application tasks, it has also been reported that they do not work well on many-objective problems. In this paper, first we examine the behavior of the most well-known and frequently-used EMO algorithm on many-objective 0/1 knapsack problems. Next we briefly review recent proposals for the scalability improvement of EMO algorithms to many-objective problems. Then their effects on the search ability of EMO algorithms are examined. Experimental results show that the increase in the convergence of solutions to the Pareto front often leads to the decrease in their diversity. Based on this observation, we suggest future research directions in evolutionary many-objective optimization.
{"title":"Behavior of Evolutionary Many-Objective Optimization","authors":"H. Ishibuchi, Noritaka Tsukamoto, Y. Nojima","doi":"10.1109/UKSIM.2008.13","DOIUrl":"https://doi.org/10.1109/UKSIM.2008.13","url":null,"abstract":"Evolutionary multiobjective optimization (EMO) is one of the most active research areas in the field of evolutionary computation. Whereas EMO algorithms have been successfully used in various application tasks, it has also been reported that they do not work well on many-objective problems. In this paper, first we examine the behavior of the most well-known and frequently-used EMO algorithm on many-objective 0/1 knapsack problems. Next we briefly review recent proposals for the scalability improvement of EMO algorithms to many-objective problems. Then their effects on the search ability of EMO algorithms are examined. Experimental results show that the increase in the convergence of solutions to the Pareto front often leads to the decrease in their diversity. Based on this observation, we suggest future research directions in evolutionary many-objective optimization.","PeriodicalId":22356,"journal":{"name":"Tenth International Conference on Computer Modeling and Simulation (uksim 2008)","volume":"131 1","pages":"266-271"},"PeriodicalIF":0.0,"publicationDate":"2008-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"88351216","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
扫码关注我们
求助内容：
应助结果提醒方式：