{"title":"Intrusion Detection Combining Multiple Decision Trees by Fuzzy logic","authors":"Junfeng Tian, Yue Fu, Ying Xu, Jian-ling Wang","doi":"10.1109/PDCAT.2005.157","DOIUrl":"https://doi.org/10.1109/PDCAT.2005.157","url":null,"abstract":"In order to improve detection performance of data mining-based intrusion detection system, this paper presents a method of combining multiple decision trees based on fuzzy logic, especially the fuzzy integral. The main idea of this method is to divide a great large dataset into several sub-datasets, mine on sub-datasets separately to construct different sub-decision trees, detect TCP data by different sub-decision trees, and then nonlinearly combine the results from multiple sub-decision trees by fuzzy integral. The experiment results show that this technique is superior to individual decision trees for intrusion detection in terms of classification accuracy.","PeriodicalId":152233,"journal":{"name":"Sixth International Conference on Parallel and Distributed Computing Applications and Technologies (PDCAT'05)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-12-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128954638","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 Novel Security Model Based on Virtual Organization for Grid","authors":"Xiuying Wu, Geng Yang, Jiangang Shen, Quan Zhou","doi":"10.1109/PDCAT.2005.35","DOIUrl":"https://doi.org/10.1109/PDCAT.2005.35","url":null,"abstract":"Security is an important issue in research and appliance of grid computing. Grid security model is composed of a series of mechanism and strategy to solve various practical security problems. This paper presents a grid security model based on virtual organization referring to GSI (a security component in Globus). The model consists of a logical model and a physical model.","PeriodicalId":152233,"journal":{"name":"Sixth International Conference on Parallel and Distributed Computing Applications and Technologies (PDCAT'05)","volume":"52 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-12-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133156925","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":"Role Based Platform Independent Web Application Modeling","authors":"Chengwan He, Wenjie Tu, K. He","doi":"10.1109/PDCAT.2005.208","DOIUrl":"https://doi.org/10.1109/PDCAT.2005.208","url":null,"abstract":"Web application modeling and implementation method are related with middleware platform tightly, and its models usually can’t be reused on different platform. In order to reuse web application models, it is necessary to raise the level of abstraction of models, constructing middleware platform independent models. Roles are meant to capture observable behavioral aspects of objects. Role models describe the set of valid object collaboration tasks. This paper proposes a method for constructing platform independent models for Web applications. It consists of a stepwise process, a template role model and a mapping from role model to class model. The method can improve the reusability of models at different level of abstraction. The paper shows how the method works by a simple example","PeriodicalId":152233,"journal":{"name":"Sixth International Conference on Parallel and Distributed Computing Applications and Technologies (PDCAT'05)","volume":"350 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-12-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132273399","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}
Kanghee Lee, Zhefan Jiang, Sangok Kim, Sangwook Kim, Sunkyung Kim
{"title":"Access Control List Mediation System for Large-Scale Network","authors":"Kanghee Lee, Zhefan Jiang, Sangok Kim, Sangwook Kim, Sunkyung Kim","doi":"10.1109/PDCAT.2005.59","DOIUrl":"https://doi.org/10.1109/PDCAT.2005.59","url":null,"abstract":"Large-Scale network such as the Internet consist of a large number of sub-networks. Since each subnetwork has management privileges and policies individually, it is difficult to respond to harmful traffic such as warm viruses that affect entire networks. In this paper, we propose a high-level policy language and a middle-level data structure. They were named Triton language and Common Access Management Form (CAMF). It enables the administrator to authorize a policy effectively and rapidly. Large-scale networks have a number of administrators so that policy collision can occur. Access control list mediation system selects or adapts the most important policy among colliding policies through a policy importance valuation.","PeriodicalId":152233,"journal":{"name":"Sixth International Conference on Parallel and Distributed Computing Applications and Technologies (PDCAT'05)","volume":"43 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-12-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132629073","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 Case of Application-level Multicast for Real-time Video Delivery over Internet","authors":"Zhensheng Liu, Guiming He","doi":"10.1109/PDCAT.2005.2","DOIUrl":"https://doi.org/10.1109/PDCAT.2005.2","url":null,"abstract":"We propose the method of application level multicast for delivering real-time streaming video over Internet, and realized with a prototype of multiparty videoconference system-Metrino. Different from conventional wisdom to use simple source-specific trees or shared overlay, we constructed a bone share tree with key nodes, and added additional minor nodes to nearest node as source-specific tree when new endpoints joined in. The whole video streaming delivery graph constructed as a Sunflower Delivery Graph (SDG). SDG can keep some level of efficiency while avoiding the tree reorganization frequently. More over, Metrino is able to deal with difference scale of end users from several to hundreds due to its scalable architecture.","PeriodicalId":152233,"journal":{"name":"Sixth International Conference on Parallel and Distributed Computing Applications and Technologies (PDCAT'05)","volume":"43 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-12-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123183455","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 Distributed and Cooperative Target Localization Algorithm in Wireless Sensor Networks","authors":"Xing-Yu Pi, Hong-Yi Yu","doi":"10.1109/PDCAT.2005.7","DOIUrl":"https://doi.org/10.1109/PDCAT.2005.7","url":null,"abstract":"Wireless sensor networks (WSNs) are important for a number of strategic applications. Target localization is an important task in WSNs. In this paper, a distributed and cooperative target localization algorithm in wireless distributed sensor network system is presented. Based on the signal energy decay model, the distances between the target and sensors are obtained, and then a distributed and simplified localization algorithm is used to locate the target. Extensive simulation results show that this new approach is accurate and robust. Besides, it can reduce the complexity of the processing. Therefore, it is a feasible and attractive localization method for the wireless sensor network system.","PeriodicalId":152233,"journal":{"name":"Sixth International Conference on Parallel and Distributed Computing Applications and Technologies (PDCAT'05)","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-12-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131898286","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 New Network Management Framework Design and Application Realization","authors":"Jinghua Li, Guang-hui Xu","doi":"10.1109/PDCAT.2005.26","DOIUrl":"https://doi.org/10.1109/PDCAT.2005.26","url":null,"abstract":"Conventional network management framework can’t keep up pace with network development. A domain partitioned network management framework based-on mobile agent technology is proposed after analyzing the limitation of existing conventional centralized and distributed network fault management model in this paper. Then as an application example of the proposed network management framework, a hierarchical network event correlation system is introduced and network event correlation specific process including local vertical correlation and global horizontal correlation is described. Mobile agent deployment policy and itinerary policy in event correlation system we plan to realize are also listed out. At last the experiments on the fault management model and future works are addressed.","PeriodicalId":152233,"journal":{"name":"Sixth International Conference on Parallel and Distributed Computing Applications and Technologies (PDCAT'05)","volume":"52 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-12-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133835628","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 Scheduling Method for Divisible Workload Problem in Grid Environments","authors":"Nguyen The Loc, S. Elnaffar, T. Katayama, T. Ho","doi":"10.1109/PDCAT.2005.46","DOIUrl":"https://doi.org/10.1109/PDCAT.2005.46","url":null,"abstract":"Scheduling divisible workloads in distributed systems has been one of the interesting research problems over the last few years. Most of the scheduling algorithms previously introduced are based on the master-worker model. However, the majority of these algorithms assume that workers are dedicated machines, which is a wrong assumption in distributed environments such as Grids. In this work, we propose a dynamic scheduling methodology that takes into account the three prominent aspects of Grids: heterogeneity, dynamicity, and uncertainty. Our contribution is threefold. First, we present an analytical model for processing local and Grid tasks at each non-dedicated worker. Second, we present a simple prediction method to forecast the available CPU capacity and bandwidth at each worker. Third, we introduce a dynamic, multi-round scheduling algorithm.","PeriodicalId":152233,"journal":{"name":"Sixth International Conference on Parallel and Distributed Computing Applications and Technologies (PDCAT'05)","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-12-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115433558","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":"Energy Adaptive Cluster-Head Selection for Wireless Sensor Networks","authors":"Ying Liang, Haibin Yu","doi":"10.1109/PDCAT.2005.134","DOIUrl":"https://doi.org/10.1109/PDCAT.2005.134","url":null,"abstract":"A wireless network consisting of a large number of small sensors with limited battery power can be an effective tool for gathering data in a variety of environments. Clustering sensors into groups, so that sensors communicate information only to cluster-heads and then the cluster-heads communicate the aggregated information to the base station, may save energy. In this paper, we propose an optimal energyadaptive clustering algorithm which is motivated from the LEACH protocol presented in [4]. We optimize LEACH’s random cluster-head selection algorithm to ensure the balanced energy depletion over the whole network thus prolongs the network lifetime. Simulation results show that our algorithm outperforms LEACH by about 20% to 35% when 1%, 50%, 100% of nodes die for different network sizes and topologies.","PeriodicalId":152233,"journal":{"name":"Sixth International Conference on Parallel and Distributed Computing Applications and Technologies (PDCAT'05)","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-12-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115720837","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":"An On-line Integrated Routing Algorithm in IP/MPLS over WDM Networks","authors":"Yang Su, Zhanqi Xu, Zengji Liu","doi":"10.1109/PDCAT.2005.88","DOIUrl":"https://doi.org/10.1109/PDCAT.2005.88","url":null,"abstract":"This paper proposes a dynamic routing optimal model in IP/MPLS over WDM networks. A corresponding on-line integrated routing algorithm minimizing the cost of total lightpaths (MCTLP) is designed accordingly. MCTLP optimizes the network resource utilization by integrally assigning bandwidth allocations on both IP layer and wavelength links usage on WDM layer. The performance comparison of MCTLP with two representative routing algorithms used in IP/MPLS over WDM networks via simulation shows that MCTLP can use less links on IP layer and WDM layer to carry IP traffic flows, resulting in accepting more connection requests and reducing the traffic blocking probability efficiently.","PeriodicalId":152233,"journal":{"name":"Sixth International Conference on Parallel and Distributed Computing Applications and Technologies (PDCAT'05)","volume":"196 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-12-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123545198","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}