Pub Date : 2004-05-10DOI: 10.1109/ISPAN.2004.1300545
Zeng Bin, Hu Tao, Wang Wei, L. Tan
Quality of service in IP networks necessitates the use of performance management. As Internet continues to grow exponentially, a management system should be scalable in terms of network size, speed and number of customers subscribed to value-added services. This article proposes a flexible, scalable, self-adapting model for managing large-scale distributed network. In this model, Web services framework is used to build the software architecture and XML is used to build the data exchange interface. Policy-based hierarchical event-processing mechanism presented by this paper can efficiently balance the loads and improve the flexibility of the system. The prediction algorithm adopted by this model can predict the network performance more effectively and accurately.
{"title":"A model of scalable distributed network performance management","authors":"Zeng Bin, Hu Tao, Wang Wei, L. Tan","doi":"10.1109/ISPAN.2004.1300545","DOIUrl":"https://doi.org/10.1109/ISPAN.2004.1300545","url":null,"abstract":"Quality of service in IP networks necessitates the use of performance management. As Internet continues to grow exponentially, a management system should be scalable in terms of network size, speed and number of customers subscribed to value-added services. This article proposes a flexible, scalable, self-adapting model for managing large-scale distributed network. In this model, Web services framework is used to build the software architecture and XML is used to build the data exchange interface. Policy-based hierarchical event-processing mechanism presented by this paper can efficiently balance the loads and improve the flexibility of the system. The prediction algorithm adopted by this model can predict the network performance more effectively and accurately.","PeriodicalId":198404,"journal":{"name":"7th International Symposium on Parallel Architectures, Algorithms and Networks, 2004. Proceedings.","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2004-05-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121942597","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}
Pub Date : 2004-05-10DOI: 10.1109/ISPAN.2004.1300546
Kuang-Chi Chen
Family-based linkage tests are methods for detection of the genetic basis of a disease. For the case-parent triad data, it is known that tests of linkage interfere with the association parameter under recessive disease models. The purpose of the paper is to discuss the effects of nuisance parameters on the family-based linkage tests under general models. It is shown that the linkage tests do not only interfere with the association parameter, but also with the gene substitution effect in general models.
{"title":"Effects of nuisance parameters on the family-based linkage tests under general disease models","authors":"Kuang-Chi Chen","doi":"10.1109/ISPAN.2004.1300546","DOIUrl":"https://doi.org/10.1109/ISPAN.2004.1300546","url":null,"abstract":"Family-based linkage tests are methods for detection of the genetic basis of a disease. For the case-parent triad data, it is known that tests of linkage interfere with the association parameter under recessive disease models. The purpose of the paper is to discuss the effects of nuisance parameters on the family-based linkage tests under general models. It is shown that the linkage tests do not only interfere with the association parameter, but also with the gene substitution effect in general models.","PeriodicalId":198404,"journal":{"name":"7th International Symposium on Parallel Architectures, Algorithms and Networks, 2004. Proceedings.","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2004-05-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124046582","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}
Pub Date : 2004-05-10DOI: 10.1109/ISPAN.2004.1300506
Ming-Chun Tsai, H. Fu
Let the decay number, /spl zeta/(G) be the minimum number of components of a cotree of a connected graph G. Let /spl Omega/ be the collection of all 3-connected diameter 3 graphs. In this paper, we prove that if k is the minimum number such that q /spl ges/ 2p - k for each (p,q)-graph G /spl epsi/ /spl Omega/, and 1 is the minimum number such that /spl zeta/(H) /spl les/ l - 1 for each graph H /spl epsi/ /spl Omega/, then k=l. Furthermore, we prove that k /spl les/ 11 and we find a 3-connected, diameter 3 graph with q = 2p - 8. So we have that 8 /spl les/ k /spl les/ 11 and we conjecture that k = 8.
{"title":"Edge number of 3-connected diameter 3 graphs","authors":"Ming-Chun Tsai, H. Fu","doi":"10.1109/ISPAN.2004.1300506","DOIUrl":"https://doi.org/10.1109/ISPAN.2004.1300506","url":null,"abstract":"Let the decay number, /spl zeta/(G) be the minimum number of components of a cotree of a connected graph G. Let /spl Omega/ be the collection of all 3-connected diameter 3 graphs. In this paper, we prove that if k is the minimum number such that q /spl ges/ 2p - k for each (p,q)-graph G /spl epsi/ /spl Omega/, and 1 is the minimum number such that /spl zeta/(H) /spl les/ l - 1 for each graph H /spl epsi/ /spl Omega/, then k=l. Furthermore, we prove that k /spl les/ 11 and we find a 3-connected, diameter 3 graph with q = 2p - 8. So we have that 8 /spl les/ k /spl les/ 11 and we conjecture that k = 8.","PeriodicalId":198404,"journal":{"name":"7th International Symposium on Parallel Architectures, Algorithms and Networks, 2004. Proceedings.","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2004-05-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130163005","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}
Pub Date : 2004-05-10DOI: 10.1109/ISPAN.2004.1300542
H. Tian, Liusheng Huang, Zhi Zhou, Yonglong Luo
With the continuous flood of vulnerabilities of computers, vulnerability management is a very important task for administrators to keep systems as secure as possible. Facing numerous attackers armed with complicated, automated tools, current manual vulnerability management by administrators is so time-consuming, error-prone. Administrators also do need automated defensive tools. This paper proposes an open framework of automated vulnerability management that dramatically alleviates the burden of administrators and improves the security of systems. In this framework, we present three XML based markup languages, Common Vulnerability Markup Language (CVML), System Information Markup Language (SIML), Network System Markup Language (NSML) to express crucial information related to systems and vulnerabilities to facilitate automated exchange and processing. Host vulnerability managers (HVMs) running on the target host maintain the crucial system information in SIML, receive vulnerability advisories in CVML from various sources, decide what vulnerabilities exist, and try to fix vulnerabilities automatically if possible. Domain vulnerability managers (DVMs) are responsible for the vulnerability management in NSML of the local network. DVMs correlate reports from HVMs and scan for network-based vulnerabilities in this domain. We have implemented a prototype of the framework that shows the effectiveness and efficiency of our solution.
{"title":"Arm up administrators: automated vulnerability management","authors":"H. Tian, Liusheng Huang, Zhi Zhou, Yonglong Luo","doi":"10.1109/ISPAN.2004.1300542","DOIUrl":"https://doi.org/10.1109/ISPAN.2004.1300542","url":null,"abstract":"With the continuous flood of vulnerabilities of computers, vulnerability management is a very important task for administrators to keep systems as secure as possible. Facing numerous attackers armed with complicated, automated tools, current manual vulnerability management by administrators is so time-consuming, error-prone. Administrators also do need automated defensive tools. This paper proposes an open framework of automated vulnerability management that dramatically alleviates the burden of administrators and improves the security of systems. In this framework, we present three XML based markup languages, Common Vulnerability Markup Language (CVML), System Information Markup Language (SIML), Network System Markup Language (NSML) to express crucial information related to systems and vulnerabilities to facilitate automated exchange and processing. Host vulnerability managers (HVMs) running on the target host maintain the crucial system information in SIML, receive vulnerability advisories in CVML from various sources, decide what vulnerabilities exist, and try to fix vulnerabilities automatically if possible. Domain vulnerability managers (DVMs) are responsible for the vulnerability management in NSML of the local network. DVMs correlate reports from HVMs and scan for network-based vulnerabilities in this domain. We have implemented a prototype of the framework that shows the effectiveness and efficiency of our solution.","PeriodicalId":198404,"journal":{"name":"7th International Symposium on Parallel Architectures, Algorithms and Networks, 2004. Proceedings.","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2004-05-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130697877","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}
Pub Date : 2004-05-10DOI: 10.1109/ISPAN.2004.1300538
Yasuto Suzuki, K. Kaneko, M. Nakamori
In this paper, we propose an algorithm that solves the container problem in n-substring reversal graphs in polynomial order time of n. Its correctness is proved and estimates of time complexity and sum of path lengths are given. We also report the results of computer experiment conducted to measure the average performance of our algorithm.
{"title":"Container problem in substring reversal graphs","authors":"Yasuto Suzuki, K. Kaneko, M. Nakamori","doi":"10.1109/ISPAN.2004.1300538","DOIUrl":"https://doi.org/10.1109/ISPAN.2004.1300538","url":null,"abstract":"In this paper, we propose an algorithm that solves the container problem in n-substring reversal graphs in polynomial order time of n. Its correctness is proved and estimates of time complexity and sum of path lengths are given. We also report the results of computer experiment conducted to measure the average performance of our algorithm.","PeriodicalId":198404,"journal":{"name":"7th International Symposium on Parallel Architectures, Algorithms and Networks, 2004. Proceedings.","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2004-05-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132267064","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}
Pub Date : 2004-05-10DOI: 10.1109/ISPAN.2004.1300533
H. Yip, Yu-Kwong Kwok
Due to the proliferation of hand-held short-range communication devices, coexistence between Bluetooth and IEEE 802.11b has become a performance critical issue. In this study, we performed an actual implementation of a Linux based network access point (NAP), in which Bluetooth and IEEE 802.11b are colocated. Such a NAP is expected to be crucial in supporting "hot-spot" systems targeted to serve nomadic users carrying either a Bluetooth or a IEEE 802.11b device. Specifically, the goal of our study is to investigate the efficacy of a software based interference coordination approach. We consider five most commonly used scheduling algorithms in a Linux environment. Our extensive experimental results obtained in a real environment indicate that a hierarchical scheduling approach exhibits the best performance in terms of aggregate bandwidth achieved by Bluetooth and IEEE 802.11b.
{"title":"A performance study of packet scheduling algorithms for coordinating colocated Bluetooth and IEEE 802.11b in a Linux machine","authors":"H. Yip, Yu-Kwong Kwok","doi":"10.1109/ISPAN.2004.1300533","DOIUrl":"https://doi.org/10.1109/ISPAN.2004.1300533","url":null,"abstract":"Due to the proliferation of hand-held short-range communication devices, coexistence between Bluetooth and IEEE 802.11b has become a performance critical issue. In this study, we performed an actual implementation of a Linux based network access point (NAP), in which Bluetooth and IEEE 802.11b are colocated. Such a NAP is expected to be crucial in supporting \"hot-spot\" systems targeted to serve nomadic users carrying either a Bluetooth or a IEEE 802.11b device. Specifically, the goal of our study is to investigate the efficacy of a software based interference coordination approach. We consider five most commonly used scheduling algorithms in a Linux environment. Our extensive experimental results obtained in a real environment indicate that a hierarchical scheduling approach exhibits the best performance in terms of aggregate bandwidth achieved by Bluetooth and IEEE 802.11b.","PeriodicalId":198404,"journal":{"name":"7th International Symposium on Parallel Architectures, Algorithms and Networks, 2004. Proceedings.","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2004-05-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130246299","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}
Pub Date : 2004-05-10DOI: 10.1109/ISPAN.2004.1300490
C. Poon, Andy Kwok
In this paper, we study the 2D packet classification problem for a set of conflict-free filters in an IP network. We design a linear space data structure with O(min{logiu loglogn, /spl radic/lognloglogn}) query time where n is the number of filters in the router and w is the number of bits in an IP address. This is the first optimal space data structure with poly-logarithmic query time for this problem. Our technique can also be extended to solve the binary dispatching problem in object-oriented programming.
{"title":"Space optimal packet classification for 2D conflict-free filters","authors":"C. Poon, Andy Kwok","doi":"10.1109/ISPAN.2004.1300490","DOIUrl":"https://doi.org/10.1109/ISPAN.2004.1300490","url":null,"abstract":"In this paper, we study the 2D packet classification problem for a set of conflict-free filters in an IP network. We design a linear space data structure with O(min{logiu loglogn, /spl radic/lognloglogn}) query time where n is the number of filters in the router and w is the number of bits in an IP address. This is the first optimal space data structure with poly-logarithmic query time for this problem. Our technique can also be extended to solve the binary dispatching problem in object-oriented programming.","PeriodicalId":198404,"journal":{"name":"7th International Symposium on Parallel Architectures, Algorithms and Networks, 2004. Proceedings.","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2004-05-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131307084","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}
Pub Date : 2004-05-10DOI: 10.1109/ISPAN.2004.1300488
Sung Eun Bae, T. Takaoka
Given an array of positive and negative values, we consider the problem of K maximum sums. When an overlapping property needs to be observed, previous algorithms for the maximum sum are not directly applicable. We designed an O(K * n) algorithm for the K maximum subsequences problem. This was then modified to solve the K maximum subarrays problem in O(K * n/sup 3/) time. Finally, we present a VLSI K maximum subarrays algorithm with O(K * n) steps and a circuit size of O(n/sup 2/), which is cost-optimal in parallelisation of the sequential algorithm.
{"title":"Algorithms for the problem of K maximum sums and a VLSI algorithm for the K maximum subarrays problem","authors":"Sung Eun Bae, T. Takaoka","doi":"10.1109/ISPAN.2004.1300488","DOIUrl":"https://doi.org/10.1109/ISPAN.2004.1300488","url":null,"abstract":"Given an array of positive and negative values, we consider the problem of K maximum sums. When an overlapping property needs to be observed, previous algorithms for the maximum sum are not directly applicable. We designed an O(K * n) algorithm for the K maximum subsequences problem. This was then modified to solve the K maximum subarrays problem in O(K * n/sup 3/) time. Finally, we present a VLSI K maximum subarrays algorithm with O(K * n) steps and a circuit size of O(n/sup 2/), which is cost-optimal in parallelisation of the sequential algorithm.","PeriodicalId":198404,"journal":{"name":"7th International Symposium on Parallel Architectures, Algorithms and Networks, 2004. Proceedings.","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2004-05-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116545977","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}
Pub Date : 2004-05-10DOI: 10.1109/ISPAN.2004.1300515
Hau Yee Sit, E. K. Ho, H. Leong, R. Luk, Lai Kuen Ho
With the rapidly increasing reliance to distributed systems following the prosperity of low cost networking and the Internet, development of effective techniques for task distribution becomes one of the important issues in distributed computing. During the past few years, most of the load balancing algorithms in practical use employed migration policy with a fixed number of tasks in each step. This paper proposes a task transfer scheme with an adaptive number of tasks transferred between the participating servers for load balancing. The adaptation is achieved by a data mining technique, namely, clustering, via employing the distance-weighted nearest neighborhood algorithm. Experiment results show that our proposed algorithm yields the best performance when compared with several other common approaches.
{"title":"An adaptive clustering approach to dynamic load balancing","authors":"Hau Yee Sit, E. K. Ho, H. Leong, R. Luk, Lai Kuen Ho","doi":"10.1109/ISPAN.2004.1300515","DOIUrl":"https://doi.org/10.1109/ISPAN.2004.1300515","url":null,"abstract":"With the rapidly increasing reliance to distributed systems following the prosperity of low cost networking and the Internet, development of effective techniques for task distribution becomes one of the important issues in distributed computing. During the past few years, most of the load balancing algorithms in practical use employed migration policy with a fixed number of tasks in each step. This paper proposes a task transfer scheme with an adaptive number of tasks transferred between the participating servers for load balancing. The adaptation is achieved by a data mining technique, namely, clustering, via employing the distance-weighted nearest neighborhood algorithm. Experiment results show that our proposed algorithm yields the best performance when compared with several other common approaches.","PeriodicalId":198404,"journal":{"name":"7th International Symposium on Parallel Architectures, Algorithms and Networks, 2004. Proceedings.","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2004-05-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131399091","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}
Internet computing and grid technologies promise to change the way we tackle complex problems. They will enable large-scale aggregation and sharing of computational, data and other resources across institutional boundaries. And harnessing these new technologies effectively will transform scientific disciplines ranging from high-energy physics to the life sciences. In this paper, a grid computing environment is proposed and constructed on multiple PC clusters by using Globus Toolkit (GT) and SUN Grid Engine (SGE). The experimental results are also conducted by using the matrix multiplication to demonstrate the performance. On the other hand, the approaches to deal with scheduling and load balancing on multiple heterogeneous PC clusters computer system are not mature. Self-scheduling schemes which are suitable for parallel loops with independent iterations on heterogeneous cluster computer system have been designed in the past. However, these schemes, such as FSS, GSS and TSS, can not achieve load balancing in extremely heterogeneous environment. We propose a heuristic approach based upon a two-phase scheme to solve parallel regular loop scheduling problem on an extremely heterogeneous grid computing environment.
{"title":"A parallel loop self-scheduling on grid computing environments","authors":"Kuan-Wei Cheng, Chao-Tung Yang, Chuan-Lin Lai, Shun-Chyi Chang","doi":"10.1109/ISPAN.2004.1300514","DOIUrl":"https://doi.org/10.1109/ISPAN.2004.1300514","url":null,"abstract":"Internet computing and grid technologies promise to change the way we tackle complex problems. They will enable large-scale aggregation and sharing of computational, data and other resources across institutional boundaries. And harnessing these new technologies effectively will transform scientific disciplines ranging from high-energy physics to the life sciences. In this paper, a grid computing environment is proposed and constructed on multiple PC clusters by using Globus Toolkit (GT) and SUN Grid Engine (SGE). The experimental results are also conducted by using the matrix multiplication to demonstrate the performance. On the other hand, the approaches to deal with scheduling and load balancing on multiple heterogeneous PC clusters computer system are not mature. Self-scheduling schemes which are suitable for parallel loops with independent iterations on heterogeneous cluster computer system have been designed in the past. However, these schemes, such as FSS, GSS and TSS, can not achieve load balancing in extremely heterogeneous environment. We propose a heuristic approach based upon a two-phase scheme to solve parallel regular loop scheduling problem on an extremely heterogeneous grid computing environment.","PeriodicalId":198404,"journal":{"name":"7th International Symposium on Parallel Architectures, Algorithms and Networks, 2004. Proceedings.","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2004-05-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133902448","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
扫码关注我们
求助内容：
应助结果提醒方式：