2007 IFIP International Conference on Network and Parallel Computing Workshops (NPC 2007)最新文献

{"title":"Characterizing PPStream across Internet","authors":"Jinkang Jia, Chunxi Li, Changjia Chen","doi":"10.1109/NPC.2007.34","DOIUrl":"https://doi.org/10.1109/NPC.2007.34","url":null,"abstract":"Since the appearance of various P2P IPTV systems which timely broadcast live streaming to peers, they have attracted millions of users from all over the world. It is reported that the online audience have reached more than 1.2 million in peak time by the official website of PPStream, one of the most popular IPTV system in China. However, at the same time the popularity of these systems make the amounts of video traffic grow exponentially. In order to study the global playback performance, users ' behaviors and network characteristics as well, we developed our dedicated crawler of PPStream. Based on the measurements, we make some extensive performance evaluation on this commercially successful P2P IPTV system, and some characteristics on geographic clustering, connection stability, arrival/departure pattern, playback quality, sharing ratio and topology have been revealed. We think these findings can help other researchers model such streaming systems and system operators make further optimizations.","PeriodicalId":278518,"journal":{"name":"2007 IFIP International Conference on Network and Parallel Computing Workshops (NPC 2007)","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-09-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134608398","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":"Efficient Algorithms for On-line Analysis Processing On Compressed Data Warehouses","authors":"Jianzhong Li, Hong Gao","doi":"10.1109/NPC.2007.182","DOIUrl":"https://doi.org/10.1109/NPC.2007.182","url":null,"abstract":"Data compression is an effective technique to improve the performance of data warehouses. Aggregation and cube are important operations for on-line analytical processing (OLAP). It is a major challenge to develop efficient algorithms for aggregation and cube operations on compressed data warehouses. Many efficient algorithms to compute aggregation and cube for relational OLAP have been developed. Some work has been done on efficiently computing aggregation and cube for multidimensional data warehouses (MDWs) that store datasets in multidimensional arrays rather than in tables. However, to our knowledge, there is few to date in the literature describing aggregation algorithms on compressed data warehouses for multidimensional OLAP. The goal of this paper is to develop efficient algorithms to compute aggregation and cube on compressed MDWs,. For aggregation operations, four algorithms are proposed in this paper. These algorithms operate directly on compressed datasets, which are compressed by the mapping-complete compression methods, without the need to first decompress them. The algorithms have different performance behaviors as a function of the dataset parameters, sizes of outputs and main memory availability. The algorithms are described and the I/O and CPU cost functions are presented in this paper. A decision procedure to select the most efficient algorithm for a given aggregation request is also proposed. The analysis and experimental results show that the algorithms have better performance on sparse data than the previous aggregation algorithms. For cube operations, this paper presents a novel algorithm to compute cubes on compressed data warehouses. The proposed algorithm also operates directly on compressed datasets without the need of first decompressing them. The algorithm is applicable to a large class of mapping complete data compression methods. The complexity of the algorithm is analyzed in detail. The analytical and experimental results show that the algorithm is more efficient than all other existing cube algorithms. In addition, a heuristic algorithm to generate an optimal plan for computing cube on data warehouses is also proposed in the paper. In conclusion, direct manipulation of compressed data is an important tool for managing very large data warehouses. Aggregation and cube are just two (and important) such operation in this direction. Additional algorithms will be needed for OLAP on compressed multidimensional data OLAP on compressed multidimensional data warehouses. We are currently working on algorithms for other operations on compressed MDWs,. We are also working on algorithms for OLAP operations applicable to other kinds of compression methods other than mapping-complete compression methods.","PeriodicalId":278518,"journal":{"name":"2007 IFIP International Conference on Network and Parallel Computing Workshops (NPC 2007)","volume":"110 9-10","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-09-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134323023","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":"Detecting and Blocking Malicious Traffic Caused by IRC Protocol Based Botnets","authors":"Z. Chi, Zixiang Zhao","doi":"10.1109/NPC.2007.77","DOIUrl":"https://doi.org/10.1109/NPC.2007.77","url":null,"abstract":"One of the most potentially dangerous security problems for computer networks is the botnet. Since botnets based on the IRC (Internet chat relay) protocol are relatively new, not enough research has been done on them. In this paper, we propose a method to detect the botmaster by starting from the victim and working backwards through the routers. The malicious traffic is blocked during the process of detecting the botmaster router by router.","PeriodicalId":278518,"journal":{"name":"2007 IFIP International Conference on Network and Parallel Computing Workshops (NPC 2007)","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-09-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132983218","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":"Applying IoC and AOP to the Architecture of Reflective Middleware","authors":"Ke Ju, Jiang Bo","doi":"10.1109/NPC.2007.71","DOIUrl":"https://doi.org/10.1109/NPC.2007.71","url":null,"abstract":"The traditional middleware is unable inflexible and the auto-adaptability aspect to be satisfied. This paper has discussed a kind of Reflective Middleware architecture based on IoC and AOP, which uses JMX to implement the microkernel-bus to manage the component. By contrasting and analyzing several common containers, Spring framework is used in the design of architecture, because of providing IoC container and AOP framework, which makes the architecture have the better flexibility and auto-adaptability.","PeriodicalId":278518,"journal":{"name":"2007 IFIP International Conference on Network and Parallel Computing Workshops (NPC 2007)","volume":"55 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-09-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121816025","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":"Allocating Tasks in Multi-core Processor based Parallel System","authors":"Yi Liu, Xin Zhang, He-ping Li, D. Qian","doi":"10.1109/NPC.2007.26","DOIUrl":"https://doi.org/10.1109/NPC.2007.26","url":null,"abstract":"After a discussion of the task allocation problem in multi-core processor based parallel system, this paper gives the task allocation model, and proposes an iteration-based heuristic algorithm, which is composed of two rounds of operations, in which the processes are assigned to processing nodes in the first round and threads in process are assigned to processor cores in the second round respectively. Each round of operation partitions the task interaction graph by iterations with backtracking. Evaluation result shows that the algorithm can find near-optimal solutions in reasonable time, and behaves better than genetic algorithm when the number of threads increases, since it can find solutions in much less time than genetic algorithm.","PeriodicalId":278518,"journal":{"name":"2007 IFIP International Conference on Network and Parallel Computing Workshops (NPC 2007)","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-09-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129659407","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":"Integrated Site Security for Grid; an initiative to cover security beyond the Grid","authors":"B. Hoeft, U. Epting","doi":"10.1109/NPC.2007.169","DOIUrl":"https://doi.org/10.1109/NPC.2007.169","url":null,"abstract":"While many fields relevant to Grid security are already covered by existing working groups, their remit rarely goes beyond the scope of the Grid infrastructure itself. However, security issues pertaining to the internal setup of compute centres have at least as much impact on Grid security. Thus, the EU ISSeG project (Integrated Site Security for Grids) will briefly presented. To complement groups such as Operational Security Coordination Team and Joint Security Policy Group, the purpose of ISSeG is to provide a holistic approach to security for Grid computer centres, from strategic considerations to an implementation plan and its practical deployment. The generalised methodology of Integrated Site Security based on the knowledge gained during its implementation at several sites as well as through security audits will be discussed. Furthermore, the web-based ISSeG training material will be introduced. This aims to offer ISS recommendations and implementation guidance to other Grid installations in order to help avoid common pitfalls.","PeriodicalId":278518,"journal":{"name":"2007 IFIP International Conference on Network and Parallel Computing Workshops (NPC 2007)","volume":"42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-09-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121356213","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 Efficient Fine-grained Parallel Genetic Algorithm Based on GPU-Accelerated","authors":"Jian-Ming Li, Xiaojing Wang, Rong-Sheng He, Zhong-Xian Chi","doi":"10.1109/NPC.2007.108","DOIUrl":"https://doi.org/10.1109/NPC.2007.108","url":null,"abstract":"Fine-grained parallel genetic algorithm (FGPGA), though a popular and robust strategy for solving complicated optimization problems, is sometimes inconvenient to use as its population size is restricted by heavy data communication and the parallel computers are relatively difficult to use, manage, maintain and may not be accessible to most researchers. In this paper, we propose a FGPGA method based on GPU-acceleration, which maps parallel GA algorithm to texture-rendering on consumer-level graphics cards. The analytical results demonstrate that the proposed method increases the population size, speeds up its execution and provides ordinary users with a feasible FGPGA solution.","PeriodicalId":278518,"journal":{"name":"2007 IFIP International Conference on Network and Parallel Computing Workshops (NPC 2007)","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-09-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115575596","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":"PushFS: A Smart Push File Service Model for Ubiquitous Storage","authors":"Meijun Tao, Jianhua Yang, Zhaohui Wu","doi":"10.1109/NPC.2007.148","DOIUrl":"https://doi.org/10.1109/NPC.2007.148","url":null,"abstract":"The traditional file service is no longer sufficient for providing reliable and smart service to users as roaming in ubiquitous computing environments. In this paper, we propose a smart push file service model, called PushFS, which employs a push-oriented file service for ubiquitous storage. The design of PushFS introduces user-profiles to identify the environmental-context and file-semantics for retrieve, and hoards virtual directories and virtual files into lightweight working sets on-demand. We indicate that the dynamic metadata-aware file selection and organization capability increases efficiency of the file service and improves the tradeoff between proactivity and transparency. We then implement a prototype system to validate our model, which shows that PushFS is adequate to ubiquitous storage with high efficient and proactive file service.","PeriodicalId":278518,"journal":{"name":"2007 IFIP International Conference on Network and Parallel Computing Workshops (NPC 2007)","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-09-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132312091","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":"Similarity Measurement of Web Sessions by Sequence Alignment","authors":"Chaofeng Li, Yansheng Lu","doi":"10.1109/NPC.2007.66","DOIUrl":"https://doi.org/10.1109/NPC.2007.66","url":null,"abstract":"The task of clustering Web sessions is to group Web sessions based on similarity and consists of maximizing the intra-group similarity while minimizing the inter-group similarity. The first and foremost question needed to be considered in clustering Web sessions is how to measure the similarity between Web sessions. However, there are many shortcomings in traditional measurements. This paper analyses the shortcomings of traditional methods and introduces a new method to measure similarities between Web pages, which considers not only the URL but also the viewing time of the visited Web page. Then we propose a new method to measure the similarity of Web sessions using sequence alignment and the similarity of Web page access. Finally, we conclude this paper and propose the future research directions.","PeriodicalId":278518,"journal":{"name":"2007 IFIP International Conference on Network and Parallel Computing Workshops (NPC 2007)","volume":"102 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-09-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124394474","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":"Keyword Search on Relational Databases","authors":"Wei Wang, Xuemin Lin, Yi Luo","doi":"10.1109/NPC.2007.42","DOIUrl":"https://doi.org/10.1109/NPC.2007.42","url":null,"abstract":"Keyword search in relational database is a central topic in integrating database and information technologies. We briefly introduce the problem, analyze the challenges, and survey the existing work. We also highlight our research progress of the SPARK project that partially addresses the challenges. A few future research issues are also discussed.","PeriodicalId":278518,"journal":{"name":"2007 IFIP International Conference on Network and Parallel Computing Workshops (NPC 2007)","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-09-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114776601","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}