We aim at automating an integration process for component-based systems. Hence we describe a reference model where its first phase (qualification) is our current work. We intend to compare components data by semantic analysis, i.e. interoperability at a semantic level. Assessment is based on meta-data added to components: their context, assertions, and interface protocol. In a previous work we showed a component interface matching. In this paper we explain the assertions matching, that uses a technique based on abstract syntax trees, which detects similar pieces of code ('clones'). We aim to enhance the procedure by a semantic component treatment using ontologies. Thus the whole assessment procedure is highly improved both on efficacy and reliability.
{"title":"Dynamic component assessment on PvC environments","authors":"A. Flores, Macario Polo","doi":"10.1109/ISCC.2005.56","DOIUrl":"https://doi.org/10.1109/ISCC.2005.56","url":null,"abstract":"We aim at automating an integration process for component-based systems. Hence we describe a reference model where its first phase (qualification) is our current work. We intend to compare components data by semantic analysis, i.e. interoperability at a semantic level. Assessment is based on meta-data added to components: their context, assertions, and interface protocol. In a previous work we showed a component interface matching. In this paper we explain the assertions matching, that uses a technique based on abstract syntax trees, which detects similar pieces of code ('clones'). We aim to enhance the procedure by a semantic component treatment using ontologies. Thus the whole assessment procedure is highly improved both on efficacy and reliability.","PeriodicalId":315855,"journal":{"name":"10th IEEE Symposium on Computers and Communications (ISCC'05)","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130450708","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 novel analytical model based on Markov processes is developed to study the impact of interrupt overhead on operating system performance of network hosts such as PC-based routers, servers, and end hosts 'when subjected to Gigabit network traffic. Under heavy network traffic, the system performance will be negatively affected due to interrupt overhead caused by incoming traffic. In particular, excessive latency and significant degradation in system throughput can be experienced. Also, user applications may livelock as the CPU power is mostly consumed by interrupt handling and protocol processing. In this paper, we present an analytical model to evaluate system performance. The system performance is studied in terms of throughput, latency, stability condition, CPU utilizations of interrupt handling and protocol processing, and CPU availability for user applications. The analysis can be instrumental in choosing system design parameters offline, therefore allows capacity planning and system diagnosis. Analytical results are compared with the ideal limited buffer queueing system without interrupt overhead.
{"title":"An analytical model for evaluating interrupt-driven system performance of Gigabit Ethernet hosts with finite buffer","authors":"K. Salah","doi":"10.1109/ISCC.2005.21","DOIUrl":"https://doi.org/10.1109/ISCC.2005.21","url":null,"abstract":"A novel analytical model based on Markov processes is developed to study the impact of interrupt overhead on operating system performance of network hosts such as PC-based routers, servers, and end hosts 'when subjected to Gigabit network traffic. Under heavy network traffic, the system performance will be negatively affected due to interrupt overhead caused by incoming traffic. In particular, excessive latency and significant degradation in system throughput can be experienced. Also, user applications may livelock as the CPU power is mostly consumed by interrupt handling and protocol processing. In this paper, we present an analytical model to evaluate system performance. The system performance is studied in terms of throughput, latency, stability condition, CPU utilizations of interrupt handling and protocol processing, and CPU availability for user applications. The analysis can be instrumental in choosing system design parameters offline, therefore allows capacity planning and system diagnosis. Analytical results are compared with the ideal limited buffer queueing system without interrupt overhead.","PeriodicalId":315855,"journal":{"name":"10th IEEE Symposium on Computers and Communications (ISCC'05)","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126485607","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 presents a novel approach based on the monitoring of incoming HTTP requests to detect attacks against Web servers. The detection is accomplished through a Markovian model whose states and transitions between them are determined from the specification of the HTTP protocol while the probabilities of the symbols associated to the Markovian source are obtained during a training stage according to a set of attack-free requests for the target server. The experiments carried out show a high detection capability with low false positive rates at reasonable computation requirements.
{"title":"Detection of Web-based attacks through Markovian protocol parsing","authors":"J. Tapiador, P. García-Teodoro, J. D. Verdejo","doi":"10.1109/ISCC.2005.51","DOIUrl":"https://doi.org/10.1109/ISCC.2005.51","url":null,"abstract":"This paper presents a novel approach based on the monitoring of incoming HTTP requests to detect attacks against Web servers. The detection is accomplished through a Markovian model whose states and transitions between them are determined from the specification of the HTTP protocol while the probabilities of the symbols associated to the Markovian source are obtained during a training stage according to a set of attack-free requests for the target server. The experiments carried out show a high detection capability with low false positive rates at reasonable computation requirements.","PeriodicalId":315855,"journal":{"name":"10th IEEE Symposium on Computers and Communications (ISCC'05)","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121092340","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}
We design and evaluate ,the performance of a new unified mechanism for downlink scheduling and call admission control (CAC) of multimedia traffic in a high-capacity TDMA wireless channel. In our scheme, the base station interacts with the call admission controller and incorporates predictions on the channel condition in its decision making. Our results show that, with the use of the "intelligent" scheduler-admission controller mechanism, system performance is significantly enhanced compared to two other schemes without prediction on the channel condition.
{"title":"Scheduling and call admission control for burst-error wireless channels","authors":"P. Koutsakis","doi":"10.1109/ISCC.2005.136","DOIUrl":"https://doi.org/10.1109/ISCC.2005.136","url":null,"abstract":"We design and evaluate ,the performance of a new unified mechanism for downlink scheduling and call admission control (CAC) of multimedia traffic in a high-capacity TDMA wireless channel. In our scheme, the base station interacts with the call admission controller and incorporates predictions on the channel condition in its decision making. Our results show that, with the use of the \"intelligent\" scheduler-admission controller mechanism, system performance is significantly enhanced compared to two other schemes without prediction on the channel condition.","PeriodicalId":315855,"journal":{"name":"10th IEEE Symposium on Computers and Communications (ISCC'05)","volume":"47 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124487466","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 paper we present the design of Hydra, an experimental Linux platform for integrating various wireless environments. Currently, mobile devices are often equipped with many network interfaces, which may be of different access technologies, like wireless, cellular and wired. Applications have different requirements, which results in different network preferences. Also, the network preferences of some applications change over time and they would like to use multiple access technologies to satisfy their needs best. Hydra is an attempt to provide users control such that they may manage their own and available devices in a more flexible way than the existing networks are offering. With Hydra, there is a way for applications to provide the operating system, features of the environment they are interested in. Also, there is a mechanism that enables applications to track their environment. The biggest feature is the ability to integrate multiple wireless technologies.
{"title":"Hydra: a new approach for integrating various wireless environments","authors":"Karthik Ramachandra, H. Ali","doi":"10.1109/ISCC.2005.81","DOIUrl":"https://doi.org/10.1109/ISCC.2005.81","url":null,"abstract":"In this paper we present the design of Hydra, an experimental Linux platform for integrating various wireless environments. Currently, mobile devices are often equipped with many network interfaces, which may be of different access technologies, like wireless, cellular and wired. Applications have different requirements, which results in different network preferences. Also, the network preferences of some applications change over time and they would like to use multiple access technologies to satisfy their needs best. Hydra is an attempt to provide users control such that they may manage their own and available devices in a more flexible way than the existing networks are offering. With Hydra, there is a way for applications to provide the operating system, features of the environment they are interested in. Also, there is a mechanism that enables applications to track their environment. The biggest feature is the ability to integrate multiple wireless technologies.","PeriodicalId":315855,"journal":{"name":"10th IEEE Symposium on Computers and Communications (ISCC'05)","volume":"60 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123387217","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}
Tele-Lab "IT-security" Server is a new concept for practical security education. The Tele-lab server builds a virtual security laboratory using lightweight virtual machines and features a pure Web user interface. Thus, students can easily exercise security over the Internet. Running such a security laboratory on the Internet is difficult. Its infrastructure is subject to misuse and crash due to the nature of security tasks. The management of virtual machines is a crucial component which enables running the Tele-Lab server on the Internet. It effectively saves resources and improves security and reliability of the virtual laboratory. This paper briefly reviews the architecture of the Tele-Lab "IT-security" server, describes its virtual machine management in detail, and presents some experiential and experimental results.
{"title":"Virtual machine management for Tele-Lab \"IT-security\" server","authors":"Ji Hu, Dirk Cordel, C. Meinel","doi":"10.1109/ISCC.2005.153","DOIUrl":"https://doi.org/10.1109/ISCC.2005.153","url":null,"abstract":"Tele-Lab \"IT-security\" Server is a new concept for practical security education. The Tele-lab server builds a virtual security laboratory using lightweight virtual machines and features a pure Web user interface. Thus, students can easily exercise security over the Internet. Running such a security laboratory on the Internet is difficult. Its infrastructure is subject to misuse and crash due to the nature of security tasks. The management of virtual machines is a crucial component which enables running the Tele-Lab server on the Internet. It effectively saves resources and improves security and reliability of the virtual laboratory. This paper briefly reviews the architecture of the Tele-Lab \"IT-security\" server, describes its virtual machine management in detail, and presents some experiential and experimental results.","PeriodicalId":315855,"journal":{"name":"10th IEEE Symposium on Computers and Communications (ISCC'05)","volume":"92 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124150052","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}
To overcome scalability and control overhead problems existing in inter-domain multicast, DINloop (data-in-network loop) based multicast with MPLS is proposed. DINloop is a special logical path formed using MPLS label switched paths and it consists of multiple DIN nodes which are core routers that connect to each intra-domain. We use DINloop to manage inter-domain multicast group membership. Facilitated by the DINloop, multiple DIN nodes in the core network easily form a Steiner tree for multicast traffic. Furthermore, traffic for different multicast groups sharing the same path are aggregated through a label stack. Simulations demonstrate that DINloop-based multicast results in less message load needed to form the multicast structure. In addition, the routing table size in other core routers does not increase as the number of multicast group increases, and therefore routing scalability is improved. Finally, the inter-domain multicast delay in DINloop-based multicast is lower than that of a unidirectional tree.
{"title":"A DINloop-based inter-domain multicast using MPLS","authors":"Huaqun Guo, L. Ngoh, L. Wong","doi":"10.1109/ISCC.2005.8","DOIUrl":"https://doi.org/10.1109/ISCC.2005.8","url":null,"abstract":"To overcome scalability and control overhead problems existing in inter-domain multicast, DINloop (data-in-network loop) based multicast with MPLS is proposed. DINloop is a special logical path formed using MPLS label switched paths and it consists of multiple DIN nodes which are core routers that connect to each intra-domain. We use DINloop to manage inter-domain multicast group membership. Facilitated by the DINloop, multiple DIN nodes in the core network easily form a Steiner tree for multicast traffic. Furthermore, traffic for different multicast groups sharing the same path are aggregated through a label stack. Simulations demonstrate that DINloop-based multicast results in less message load needed to form the multicast structure. In addition, the routing table size in other core routers does not increase as the number of multicast group increases, and therefore routing scalability is improved. Finally, the inter-domain multicast delay in DINloop-based multicast is lower than that of a unidirectional tree.","PeriodicalId":315855,"journal":{"name":"10th IEEE Symposium on Computers and Communications (ISCC'05)","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115669742","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}
K. Banović, E. Abdel-Raheem, Mohammed A. S. Khalid
This paper proposes two new hybrid blind algorithms based on a new radius-adjusted approach for QAM signal constellations and presents a comprehensive survey of hybrid methods for blind adaptive equalization. The proposed hybrid blind algorithms define static circular regions around symbol points that correspond to a specific weighting factor and stepsize, which optimize the equalizer tap update based on the adaptation phase. Hybrid methods are discussed for the constant modulus algorithm (CMA), improved transfer to the decision-directed (DD) algorithm, and dual-mode hybrid algorithms. Comparisons are made between the proposed algorithms and related hybrid methods, and it is shown that the new algorithms lead to enhanced performance with minimal added complexity.
{"title":"Hybrid methods for blind adaptive equalization: new results and comparisons","authors":"K. Banović, E. Abdel-Raheem, Mohammed A. S. Khalid","doi":"10.1109/ISCC.2005.80","DOIUrl":"https://doi.org/10.1109/ISCC.2005.80","url":null,"abstract":"This paper proposes two new hybrid blind algorithms based on a new radius-adjusted approach for QAM signal constellations and presents a comprehensive survey of hybrid methods for blind adaptive equalization. The proposed hybrid blind algorithms define static circular regions around symbol points that correspond to a specific weighting factor and stepsize, which optimize the equalizer tap update based on the adaptation phase. Hybrid methods are discussed for the constant modulus algorithm (CMA), improved transfer to the decision-directed (DD) algorithm, and dual-mode hybrid algorithms. Comparisons are made between the proposed algorithms and related hybrid methods, and it is shown that the new algorithms lead to enhanced performance with minimal added complexity.","PeriodicalId":315855,"journal":{"name":"10th IEEE Symposium on Computers and Communications (ISCC'05)","volume":"384 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115900780","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}
MANET applications and services pose many interesting challenges due to their unique features. Specifically, security is getting a lot of attention in every aspect of MANETs due to their inherent vulnerability to attacks. Threats exist in every layer of the MANET stack, and different solutions have been adapted for each security problem. Another problem for MANETs is availability, and adding more resources does not necessarily make the system more available. Certificate authority (CA) is one of the most important entities in public key infrastructure (PKI) and needs to be designed carefully when adapted to MANETs. The main goal of our work is to provide a framework that addresses the issues of performance and security of CA in MANETs. Additionally, we would like to increase the availability of CA services, while lowering packet overhead of the network, without increasing the network vulnerability. In this paper, we present a framework suitable for exchanging PKI certificates in MANETs. By caching and exchanging certificates between clients collaboratively, we show that our system can meet the performance challenges of providing CA service without sacrificing system security. Using NS-2 Simulator, we have demonstrated the feasibility of the framework, quantitatively, compared to other related research that has addressed the same problem in MANETs environments.
{"title":"CACMAN: a framework for efficient and highly available CA services in MANETs","authors":"Laith A. Al-Sulaiman, H. Abdel-Wahab","doi":"10.1109/ISCC.2005.39","DOIUrl":"https://doi.org/10.1109/ISCC.2005.39","url":null,"abstract":"MANET applications and services pose many interesting challenges due to their unique features. Specifically, security is getting a lot of attention in every aspect of MANETs due to their inherent vulnerability to attacks. Threats exist in every layer of the MANET stack, and different solutions have been adapted for each security problem. Another problem for MANETs is availability, and adding more resources does not necessarily make the system more available. Certificate authority (CA) is one of the most important entities in public key infrastructure (PKI) and needs to be designed carefully when adapted to MANETs. The main goal of our work is to provide a framework that addresses the issues of performance and security of CA in MANETs. Additionally, we would like to increase the availability of CA services, while lowering packet overhead of the network, without increasing the network vulnerability. In this paper, we present a framework suitable for exchanging PKI certificates in MANETs. By caching and exchanging certificates between clients collaboratively, we show that our system can meet the performance challenges of providing CA service without sacrificing system security. Using NS-2 Simulator, we have demonstrated the feasibility of the framework, quantitatively, compared to other related research that has addressed the same problem in MANETs environments.","PeriodicalId":315855,"journal":{"name":"10th IEEE Symposium on Computers and Communications (ISCC'05)","volume":"40 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131513289","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}
F. J. Garrigós, J. Hinojosa, J. Martínez-Alajarín, G. Doménech
Genetic algorithms (GAs) have shown to be suitable for optimizing real value functions with a considerably large number of variables. Thus, we have applied GA to develop an equivalent-circuit or empirical model optimization technique of microwave devices. The result of the optimization provides accurate device modeling for geometric and material parameters chosen and therefore, models computationally very efficient with respect to any electromagnetic technique. This technique is illustrated for a tunable microwave phase shifter whose dispersion model has been optimized for a fixed structure.
{"title":"Empirical model optimization of microwave devices exploiting genetic algorithms","authors":"F. J. Garrigós, J. Hinojosa, J. Martínez-Alajarín, G. Doménech","doi":"10.1109/ISCC.2005.62","DOIUrl":"https://doi.org/10.1109/ISCC.2005.62","url":null,"abstract":"Genetic algorithms (GAs) have shown to be suitable for optimizing real value functions with a considerably large number of variables. Thus, we have applied GA to develop an equivalent-circuit or empirical model optimization technique of microwave devices. The result of the optimization provides accurate device modeling for geometric and material parameters chosen and therefore, models computationally very efficient with respect to any electromagnetic technique. This technique is illustrated for a tunable microwave phase shifter whose dispersion model has been optimized for a fixed structure.","PeriodicalId":315855,"journal":{"name":"10th IEEE Symposium on Computers and Communications (ISCC'05)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131097506","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
扫码关注我们
求助内容：
应助结果提醒方式：