{"title":"Intrusion detection technology research based high-speed network","authors":"Bo Song, Ming Ye, Jie Li","doi":"10.1109/PDCAT.2003.1236289","DOIUrl":"https://doi.org/10.1109/PDCAT.2003.1236289","url":null,"abstract":"Most existing distributed intrusion detection systems (DIDS) take a master/slave or principal/subordinate structure, where a master or principal station plays important role in intrusion detection. We present a framework of peer-to-peer distributed network intrusion detection system (P2P DNIDS) based on the experience gained in a project sponsored by 30/sup th/ Research Institute of Administration of Information Industry. In a P2P DNIDS all the IDS stations or subsystems have same detection capability and perform similar functions and in case of single subsystem failure other subsystem can take over its responsibility and makes the whole system more robust and flexible. With the increase in the network truck speed from M bps to G bps, intrusion detection systems have to face the packet leaking problem, in which part of the incoming packets are unchecked and have to let them bypass the detection routine for inadequate checking strategy or processing speed. We handle this problem by introducing various techniques and tactics such as load balancing, increasing checking coverage, and better matching algorithms.","PeriodicalId":145111,"journal":{"name":"Proceedings of the Fourth International Conference on Parallel and Distributed Computing, Applications and Technologies","volume":"92 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-10-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125195960","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":"Study on parallel approach in H.26L video encoder","authors":"Qiang Peng, Yulin Zhao","doi":"10.1109/PDCAT.2003.1236426","DOIUrl":"https://doi.org/10.1109/PDCAT.2003.1236426","url":null,"abstract":"H.26L is an emerging video encoding standard proposed by ITU, which goal is for video communication and multicast in low bit rate conditions. We give detailed analysis and performance tests for the parallelism of the H.26L video encoder test model long-term (TML8.0). Based on these tests, several parallel schedule strategies are discussed in different aspects, and the optimal one is selected and implemented by using MPI. At last, experiment results on Dawning-2000 MPP machines with different processors are given. The analysis and simulation results show that the H.26L has a good parallel performance and scalability on slice layer, and parallel computing can greatly speed up the processing of H.26L encoder. The experiment methods and results can be applied to many parallel systems for H.26L video processing.","PeriodicalId":145111,"journal":{"name":"Proceedings of the Fourth International Conference on Parallel and Distributed Computing, Applications and Technologies","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-10-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133043787","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":"Apply nonlinear projections to deform 3D worlds","authors":"Y. Yang, M. Beheshti, J.X. Chen","doi":"10.1109/PDCAT.2003.1236420","DOIUrl":"https://doi.org/10.1109/PDCAT.2003.1236420","url":null,"abstract":"Traditional computer graphics rendering engines are usually designed to carry out linear planar projections. Little work has been done with nonlinear 3D view deformation. It still remains largely unexplored in 3D environments. We present new methods to carry out nonlinear projections and 3D view deformation. We extend 2D deformation techniques into 3D space. We also developed an experimental system that allows us to navigate 3D world with various deformed views. The approaches described here open up possible applications and opportunities in conceptual design, computer games, and scientific visualization.","PeriodicalId":145111,"journal":{"name":"Proceedings of the Fourth International Conference on Parallel and Distributed Computing, Applications and Technologies","volume":"13 4","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-10-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132758386","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}
Yueqiu Jiang, Yongbing Liu, Yingyou Wen, Guang-xing Wang
{"title":"A clustering algorithm applied to the satellite networks management","authors":"Yueqiu Jiang, Yongbing Liu, Yingyou Wen, Guang-xing Wang","doi":"10.1109/PDCAT.2003.1236331","DOIUrl":"https://doi.org/10.1109/PDCAT.2003.1236331","url":null,"abstract":"As a new type network, the properties of satellite networks are unique comparing with other computer networks and make traditional network management into trouble. Recently, the network management on satellite networks has been on the initial stage and more accurate assumption is not defined. A new clustering algorithm based on graph with the token mechanism and node weights applied to hierarchical satellite networks management is proposed. The unidirectional links and independence of space satellite clustering were considered specially. The algorithm suggests a new idea to the satellite networks management.","PeriodicalId":145111,"journal":{"name":"Proceedings of the Fourth International Conference on Parallel and Distributed Computing, Applications and Technologies","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-10-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127824888","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":"Web mining for electronic business application","authors":"Jian-guo Liu, Zheng-hong Huang, Wei-Ping Wu","doi":"10.1109/PDCAT.2003.1236436","DOIUrl":"https://doi.org/10.1109/PDCAT.2003.1236436","url":null,"abstract":"Electronic business is generating massive amount of data on customer purchases, browsing patterns, usage times and preferences at an increasing rate. Web mining techniques can be applied on all the data being collected for obtaining useful information. We attempt to present issues associated with Web mining for electronic business.","PeriodicalId":145111,"journal":{"name":"Proceedings of the Fourth International Conference on Parallel and Distributed Computing, Applications and Technologies","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-10-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115804766","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":"Mobile agent-based security model for distributed system","authors":"Zhang Jun-yan, Li Yi-chao, Min Fan, Yang Guo-wei","doi":"10.1109/PDCAT.2003.1236286","DOIUrl":"https://doi.org/10.1109/PDCAT.2003.1236286","url":null,"abstract":"Mobile computers and devices may operate in a variety of environments with different security schemes. We present a mobile agent-based security model, which supports flexible and specific security measures required by mobile computers and devices in distributed systems. We give a full description of mobile agent and its migration modes. After discussing possible security threats, our model is explained in detail and security analysis is also given.","PeriodicalId":145111,"journal":{"name":"Proceedings of the Fourth International Conference on Parallel and Distributed Computing, Applications and Technologies","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-10-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115066456","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. Reaz, M.T. Islam, M. Sulaiman, M.A.M. Ali, H. Sarwar, S. Rafique
{"title":"FPGA realization of multipurpose FIR filter","authors":"M. Reaz, M.T. Islam, M. Sulaiman, M.A.M. Ali, H. Sarwar, S. Rafique","doi":"10.1109/PDCAT.2003.1236448","DOIUrl":"https://doi.org/10.1109/PDCAT.2003.1236448","url":null,"abstract":"A multipurpose FIR filter has been designed and realized by field programmable gate arrays (FPGA) for real-time filtering applications. The design can accomplish an arbitrary filter frequency response and variable filter order up to 127. The coefficients are computed through the Hamming windowing technique. The model is capable of performing filtering operations, like lowpass, highpass, bandpass and bandstop based on selection that is embedded into the design. The filter is set to 8-bit signed data processing. Linear constant coefficient difference equation (LCCDE) has been used to filter the input data in time domain. The design is coded with VHDL to cope with the parallelism of digital hardware. Simulation, compilation and synthesis have been done to verify the validity of the design outputs. To test the correctness of the design the observed output is compared with the calculated output results from MATLAB implementation that confirms the effectiveness of the design.","PeriodicalId":145111,"journal":{"name":"Proceedings of the Fourth International Conference on Parallel and Distributed Computing, Applications and Technologies","volume":"94 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-10-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117205080","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":"Cascaded optical delay line architectures in the performance of optical MIN","authors":"Boran Gazi, Zabih Ghassemlooy, G. Swift","doi":"10.1109/PDCAT.2003.1236305","DOIUrl":"https://doi.org/10.1109/PDCAT.2003.1236305","url":null,"abstract":"Internally buffered multistage interconnection network (MIN) architectures have been widely used in parallel computer systems and large switching fabrics. Migration from electrical domain to optical domain has raised the necessity of developing node architectures with optical buffers. Cascaded optical delay line(COD) emulates output buffering in a 2/spl times/2 switching element. Two versions of COD are track changer (TC) and twin track changer (TTC). These approaches can be used as a buffered switching element in a Banyan like MIN. We investigate and compare these approaches by using simulation methods. Different performance metrics, such as throughput-delay ratio, packet loss rate have been used under uniform and nonuniform traffic models. Results show that TC-chain node Banyan network offer an improved throughput-delay ratio performance under both traffic models.","PeriodicalId":145111,"journal":{"name":"Proceedings of the Fourth International Conference on Parallel and Distributed Computing, Applications and Technologies","volume":"27 S1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-10-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120853732","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":"Fault-tolerant cycle embedding in dual-cube with node faulty","authors":"Yamin Li, S. Peng, Wanming Chu","doi":"10.1109/PDCAT.2003.1236261","DOIUrl":"https://doi.org/10.1109/PDCAT.2003.1236261","url":null,"abstract":"A low-degree dual-cube was proposed as an alternative to the hypercubes. A dual-cube DC(m) has m+1 links per node where m is the degree of a cluster (m-cube) and one more link is used for connecting to a node in another cluster. There are 2/sup m+1/ clusters and hence the total number of nodes is 2/sup 2m+1/ in a DC(m). By using Gray code, we show that a DC(m) is (m-1)-link Hamiltonian and there exists a faulty-free cycle containing at least 2/sup 2m+1/-2f nodes with f/spl les/m-1 faulty nodes.","PeriodicalId":145111,"journal":{"name":"Proceedings of the Fourth International Conference on Parallel and Distributed Computing, Applications and Technologies","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-10-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129543859","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":"The parallel algorithm of 2-D discrete wavelet transform","authors":"Dake He, Wenfang Zhang","doi":"10.1109/PDCAT.2003.1236403","DOIUrl":"https://doi.org/10.1109/PDCAT.2003.1236403","url":null,"abstract":"We discuss a new parallel algorithm of 2-D discrete wavelet transform (DWT) using MPI/spl I.bar/Scatterv and MPI/spl I.bar/Gatherv (MPI: Message Passing Interface). Here the 2-D sequential Daubechies discrete wavelet transform program is first decomposed into several 1-D transforms, and then the parallel conversion is made on them. This parallel program has already been successfully implemented on the dawning parallel computer system, and experimental results show that high performance and pretty flexibility can be achieved.","PeriodicalId":145111,"journal":{"name":"Proceedings of the Fourth International Conference on Parallel and Distributed Computing, Applications and Technologies","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-10-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127040592","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}