{"title":"Application for Autonomous Decentralized Multi Layer Cache System to Web Application Firewall","authors":"Hironao Takahashi, H. F. Ahmad, K. Mori","doi":"10.1109/ISADS.2011.20","DOIUrl":"https://doi.org/10.1109/ISADS.2011.20","url":null,"abstract":"Web service demand is heterogeneous and it is expanding day by day. Malicious web attacks particularly at application layer, are also increasing significantly. It is estimated eighty percent (80%) malicious attacks are web application layer attacks such as Cross Site Scripting and SQL injection. Such attacks have affected financial organizations, government institutes, hospitals and enterprise companies and so on. It is required to detect such attacks instantly to maintain the safe operations. Existing Web Application Firewalls (WAF) aim at protection of web application attacks using Black and White list based approach. Black list based WAFs operate at security operation center (SOC) to protect known attacks and it is easy to maintain same black list by other WAF nodes. However, white list independent signature from each Web service and it is generated by each web site policy. When the event of WAF fails, other WAF doesn't have same level of White list at that time. Black list is common type of signature and it can be keep the assurance by multiple WAF nodes or proxy node but White list is individual type of signature and can't maintain assurance by same policy of node. Therefore, to maintain high detection rate, dynamic adaptability of White list is required. It also requires online property and timeliness response. To solve these issues, an integrated Autonomous Decentralized Multi Layer Cache (ADMLC) system with Web Application Firewall is proposed. Evaluation shows that proposed architecture detection rate is much better than other traditional WAF based systems.","PeriodicalId":221833,"journal":{"name":"2011 Tenth International Symposium on Autonomous Decentralized Systems","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-03-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123944008","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}
{"title":"Distribution of Jobs Based on Communication Time and Cost in Service Oriented Distributed Computing","authors":"H. Mcheick, Farzad Amirjavid","doi":"10.1109/ISADS.2011.107","DOIUrl":"https://doi.org/10.1109/ISADS.2011.107","url":null,"abstract":"Computation time and communication cost increase continuously when the requests for services increase. To keep systems offering a good level of computation, we need to deal with these two parameters in distributed systems. Service oriented computing can be used to participate and divide jobs between computers in a network to improve computing speed. This article introduces a service-oriented approach, which shows a simultaneous improvement for main service's elapsed time. We discuss the importance of division of jobs in distributed computing and deal with important aspects of SOA, which are used and implemented in our research. A communication and formal model are given. Finally, a case study, which contains three different approaches following the same goal, is presented. Then, elapsed times by each approach is compared and conclusions are discussed.","PeriodicalId":221833,"journal":{"name":"2011 Tenth International Symposium on Autonomous Decentralized Systems","volume":"66 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-03-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115013481","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}
{"title":"MASPOT: A Mobile Agent System for Sun SPOT","authors":"Ramon Lopes, Flávio Assis, C. Montez","doi":"10.1109/ISADS.2011.10","DOIUrl":"https://doi.org/10.1109/ISADS.2011.10","url":null,"abstract":"Mobile agents have been proposed as a means to address two important issues in the design of Wireless Sensor Networks (WSN): the need for reprogramming the network and decreasing energy expenditure. However, few mobile agent systems have been developed for WSN so far. In this paper we describe MASPOT, a mobile agent system for Sun SPOT, a WSN platform developed by Sun Microsystems. MASPOT provides a solution to the issues above and extends the range of Sun SPOT applications. To the best of our knowledge, MASPOT is the only Java-based mobile agent system for WSN that currently supports code migration. We describe the system and present the results of an experiment to evaluate the amount of energy spent during agent migration. It showed that migration spends around 0.03% of the nodes battery energy. Additionally, MASPOT uses only around 1.5% of the available flash memory of Sun SPOT nodes.","PeriodicalId":221833,"journal":{"name":"2011 Tenth International Symposium on Autonomous Decentralized Systems","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-03-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115114094","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}
M. Haque, Fan Wei, Yukihiro Fukunaga, T. Gouda, Xiaodong Lu, K. Mori
{"title":"Autonomous Request Based Community Construction Technology for Wireless Sensor Networks to Achieve High Expandability","authors":"M. Haque, Fan Wei, Yukihiro Fukunaga, T. Gouda, Xiaodong Lu, K. Mori","doi":"10.1109/ISADS.2011.44","DOIUrl":"https://doi.org/10.1109/ISADS.2011.44","url":null,"abstract":"In most of the indoor factory monitoring system sensor relocations and reorganizations are necessary with reorganization of production lines and/or starting of new production lines. These relocations and/or additions sometime make congestion in some area of the network and difficult to achieve online expansion. As a result, in the dynamic changing environment the online expansion is a challenging problem for the indoor factory sensor network. A two-tier autonomous decentralized architecture has been proposed for the environment. The first layer consists of sensors and the second layer consists of routers. In the architecture routers make community (a group of nodes mutually cooperate for a common goal is a community) that shares information to achieve a specific goal. A resource deficit router makes a community which we call as request based community to utilize some resources of resource available routers. To utilize the resources the community members share information. After sharing information a resource deficit router switches load to resource available router by connecting and disconnecting sensors. The goal of this paper is to introduce the request based community construction technology in wireless sensor network that shares information by the routers of the community to achieve high expandability. We show the effectiveness of our proposed technology using simulation.","PeriodicalId":221833,"journal":{"name":"2011 Tenth International Symposium on Autonomous Decentralized Systems","volume":"70 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-03-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115668264","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}
Titichaya Thanamitsomboon, Riyako Sakamoto, Xiaodong Lu, K. Mori
{"title":"Autonomous Surrounding Community Construction Technology for Assurance in Disaster Support System","authors":"Titichaya Thanamitsomboon, Riyako Sakamoto, Xiaodong Lu, K. Mori","doi":"10.1109/ISADS.2011.41","DOIUrl":"https://doi.org/10.1109/ISADS.2011.41","url":null,"abstract":"Nowadays, a large-scale information system is advanced. The effective disaster support system, providing precious information to aware and support the emergency situation when disaster occurs, is expected. In centralized management system, when disaster occurs, some points of failure in the system could stop the entire system from working properly. Thus autonomous decentralized community system has been adopted to solve this problem. Based on autonomous decentralized system, the online property can be achieved. However, there are some specific requirements in this application. Firstly, different support operations are needed in each area. Secondly, the damaged area cannot inform others in order to start forming the community itself. Therefore, this paper proposes Autonomous Surrounding Community Construction Technology (ASCoCT), in which multi-level support area is defined. Moreover, multi-surrounding nodes around the damaged area simultaneously start forming small communities, and finally integrate all into one community like a donut shape covering the damaged area. With the coordination among members in the community, the precious information is quickly shared and the appropriate rescue operations can immediately decide. As a result, timeliness and accuracy can be achieved.","PeriodicalId":221833,"journal":{"name":"2011 Tenth International Symposium on Autonomous Decentralized Systems","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-03-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128655389","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}
{"title":"A Performance Study of GPSR and GRMax with Grid and Randomly Distributed Nodes in Wireless Sensor Networks","authors":"Kouakou Jean Marc Attoungble, K. Okada","doi":"10.1109/ISADS.2011.105","DOIUrl":"https://doi.org/10.1109/ISADS.2011.105","url":null,"abstract":"In this paper, we study the performance of the Greedy Perimeter Stateless Routing (GPSR) [1] and the Greedy Routing for Maximum Lifetime (GRMax)[2] which is our proposal, in wireless sensor networks in random topology and grid topology wireless sensor network. We decide to compare the performance of GPSR and GRMax in different topology of networks using the same simulation environment. Evaluation and comparison of GPSR and GRMax is done through OPNET. Results show that GRMax performs better than GPSR with respect to packets delivery fraction, number of dropped packets and network lifetime. With the introduction of VIP nodes, GRMax avoid early network partition in networks with randomly distributed nodes and in networks with grid distribution nodes. Moreover, with the criteria used to choose the next hop node in GRMax, battery power resources are used efficiently. GRMax performs better than GPSR because with its algorithm, from the source to the destination GRMax uses a path close to the straight line.","PeriodicalId":221833,"journal":{"name":"2011 Tenth International Symposium on Autonomous Decentralized Systems","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-03-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129308412","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}
{"title":"Proposing Software Transactional Memory for Embedded Systems","authors":"Y. Nakamoto, Yusuke Tamura, Shimpei Yamada","doi":"10.1109/ISADS.2011.53","DOIUrl":"https://doi.org/10.1109/ISADS.2011.53","url":null,"abstract":"Processors have become multi-core, and transactional memory has been getting attention as a new concurrency control and coordination mechanism for shared data in this type of processor. Transactional memory is a memory management technology based on transactions used in the field of databases. An atomic action provided by transactional memory is a very effective programming abstraction not only for concurrency process control but also for system recovery. However, the previous research on transactional memory in an embedded system requires dedicated processor with hardware-assistance, not a generic middle-range or lower processor, mostly for concurrency control. In order to deploy transactional memory into embedded systems more widely, for a generic middle-range or lower processor without hardware-assistance we developed a transactional memory system for embedded systems from sensor and controller nodes to consumer electronics (STEM). Moreover the purposes of STEM are not only for shared data access control but also for partial recovery of the system. We designed and implemented an STEM prototype, and we demonstrate that the design and implementation is effective in practical usage.","PeriodicalId":221833,"journal":{"name":"2011 Tenth International Symposium on Autonomous Decentralized Systems","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-03-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129279762","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}
{"title":"Distributed Saddle-Point Computation for Lifetime Maximization in Mobile Sensor Networks","authors":"Shengwei Yu, C. S. G. Lee","doi":"10.1109/ISADS.2011.13","DOIUrl":"https://doi.org/10.1109/ISADS.2011.13","url":null,"abstract":"This paper studies mobility strategies to control positions of mobile robots in a mobile sensor network in order to maximize lifetime of the network. With communication and mobility energy costs modeled, the problem is formulated into a nonlinear non-convex optimization problem, then reformulated into a convex optimization problem. The separable property of the system is then exploited by Lagrangian duality, and the solution is obtained by distributed saddle-point computations. Computer simulations showed that the proposed distributed algorithm can quickly converge to the optimal solution, and it also justifies the use of mobility for energy efficiency by showing its significant improvement to the network lifetime and relatively low cost in mobility. Furthermore, the proposed energy optimization framework can accommodate different mobile sensor network models.","PeriodicalId":221833,"journal":{"name":"2011 Tenth International Symposium on Autonomous Decentralized Systems","volume":"134 6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-03-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131058583","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}
{"title":"Minimizing Restart Time for Fast Rejuvenation and Availability Enhancement","authors":"S. S. Jha, Adrian Krdu, M. Malek","doi":"10.1109/ISADS.2011.89","DOIUrl":"https://doi.org/10.1109/ISADS.2011.89","url":null,"abstract":"An overview of a generic restart procedure of a computer system -- be it a personal computer, a server or a big parallel machine -- is presented. The objective of this paper is to analyze the restart procedures and propose techniques to reduce the time taken to restart the system, hence providing higher availability and ultimately assurance. Experiments, data and evaluation are provided to support the achieved results.","PeriodicalId":221833,"journal":{"name":"2011 Tenth International Symposium on Autonomous Decentralized Systems","volume":"571 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-03-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116273188","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}
{"title":"Assurance Technology of System Tests Based on Operators' Aspects","authors":"M. Matsumoto","doi":"10.1109/ISADS.2011.97","DOIUrl":"https://doi.org/10.1109/ISADS.2011.97","url":null,"abstract":"As systems have been integrated into networks, they are required to operate in an environment that includes heterogeneous demands and modes. The heterogeneous requirements have to be met and the heterogeneous modes have to coexist under an evolving situation. Then a system management and maintenance cost are significantly increased in comparison with system construction. Change, such as integration, combination, or renewal, to a large scale and complex system has great influence on the operators of systems. However, evaluation based on the operators’ aspects has not yet been carried out. The conventional system evaluation is based on the user’s viewpoint of how to measure the effect of not providing service while a system is stopped. The abovementioned requirement could not be met. Therefore, based on the process of tests of a system’s change, processing a test on a running system (on-line test) will lead to reduction of the effect on the operators. From the operator's viewpoint, on-line test technologies and the assurance evaluation technologies are proposed. By reducing the effect on the operators through introducing proper on-line tests by using this evaluation technology, smooth changes of systems are enabled and improvement of assurance is achieved.","PeriodicalId":221833,"journal":{"name":"2011 Tenth International Symposium on Autonomous Decentralized Systems","volume":"454 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-03-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125788450","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}