Pub Date : 2004-05-10DOI: 10.1109/ISPAN.2004.1300466
Bin Xiao, Jiannong Cao, Qingfeng Zhuge, Yi He, E. Sha
Mobile servers are established to provide services for mobile nodes in an anticipated area. If the distribution of mobile nodes can be foreseen, the location of mobile servers becomes critical to the QoS of wireless systems. Under resource and topology constraints, it is very difficult to figure out a solution, or unable to cover all given mobile nodes within limited number of mobile servers. In this paper, we study the issue of the partial covering problem such that part of mobile nodes to be covered. Several approximation algorithms are proposed to cover the maximum number of elements. For real time systems, such as the battlefield communication system, the proposed algorithms with polynomial-time complexity can be efficiently applied. The algorithm complexity analysis illustrates the improvement made by our algorithms. The experimental results show that the performance of our algorithms is much better than other existing 3-approximation algorithm for the robust k-center problem.
{"title":"Approximation algorithms design for disk partial covering problem","authors":"Bin Xiao, Jiannong Cao, Qingfeng Zhuge, Yi He, E. Sha","doi":"10.1109/ISPAN.2004.1300466","DOIUrl":"https://doi.org/10.1109/ISPAN.2004.1300466","url":null,"abstract":"Mobile servers are established to provide services for mobile nodes in an anticipated area. If the distribution of mobile nodes can be foreseen, the location of mobile servers becomes critical to the QoS of wireless systems. Under resource and topology constraints, it is very difficult to figure out a solution, or unable to cover all given mobile nodes within limited number of mobile servers. In this paper, we study the issue of the partial covering problem such that part of mobile nodes to be covered. Several approximation algorithms are proposed to cover the maximum number of elements. For real time systems, such as the battlefield communication system, the proposed algorithms with polynomial-time complexity can be efficiently applied. The algorithm complexity analysis illustrates the improvement made by our algorithms. The experimental results show that the performance of our algorithms is much better than other existing 3-approximation algorithm for the robust k-center problem.","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":"125637225","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.1300528
Hui Tian, Hong Shen
Mobile agents have been successfully developed/or collecting and processing network management information in the Internet, telecommunications network and other type of networks. Topological information of a network is important to the network administrator and users. Mobile agent based topology discovery algorithms are proposed for both Internet and multicast networks in this paper. Statistical models are built for analyzing the behavior of the mobile agents performing topology discovery task. The dwell time distribution at a host, life span distribution of a mobile agent, inter-report time distribution of a mobile agent and reports inter-arrival time distribution at the management station are analyzed. These analytical results show great significance to describe the behavior of the mobile agents performing the given task. A clear insight is given into the performance of mobile agents based topology discovery algorithms and modelling the mobile agents with given task.
{"title":"Mobile agents based topology discovery algorithms and modelling","authors":"Hui Tian, Hong Shen","doi":"10.1109/ISPAN.2004.1300528","DOIUrl":"https://doi.org/10.1109/ISPAN.2004.1300528","url":null,"abstract":"Mobile agents have been successfully developed/or collecting and processing network management information in the Internet, telecommunications network and other type of networks. Topological information of a network is important to the network administrator and users. Mobile agent based topology discovery algorithms are proposed for both Internet and multicast networks in this paper. Statistical models are built for analyzing the behavior of the mobile agents performing topology discovery task. The dwell time distribution at a host, life span distribution of a mobile agent, inter-report time distribution of a mobile agent and reports inter-arrival time distribution at the management station are analyzed. These analytical results show great significance to describe the behavior of the mobile agents performing the given task. A clear insight is given into the performance of mobile agents based topology discovery algorithms and modelling the mobile agents with given task.","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":"129620209","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.1300484
Liangbin Wang, G. Zhu
The higher-degree relation widely exits in the real world but is not being supported by the current semantic Web. It needs to be converted into multiple binary relationships in the semantic Web. However, the semantics of a higher-degree relation is not always the same as those of multiple binary relationships. Even if a higher-degree relation can be represented by multiple binary relations, the former often provides a more "natural" representation of the real world. Wand and Weber introduced the ontology defined by Bunge into information modeling that is referred to as BWW ontologies. By using a mutual attribute rather than multiple binary relations to represent a higher-degree relation directly, BWW ontologies avoid the problem of inappropriate presentation of higher-degree relations. This paper presents an XML schema for BWW ontologies to support the semantic Web.
{"title":"Developing an XML schema of BWW ontologies for semantic Web","authors":"Liangbin Wang, G. Zhu","doi":"10.1109/ISPAN.2004.1300484","DOIUrl":"https://doi.org/10.1109/ISPAN.2004.1300484","url":null,"abstract":"The higher-degree relation widely exits in the real world but is not being supported by the current semantic Web. It needs to be converted into multiple binary relationships in the semantic Web. However, the semantics of a higher-degree relation is not always the same as those of multiple binary relationships. Even if a higher-degree relation can be represented by multiple binary relations, the former often provides a more \"natural\" representation of the real world. Wand and Weber introduced the ontology defined by Bunge into information modeling that is referred to as BWW ontologies. By using a mutual attribute rather than multiple binary relations to represent a higher-degree relation directly, BWW ontologies avoid the problem of inappropriate presentation of higher-degree relations. This paper presents an XML schema for BWW ontologies to support the semantic Web.","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":"122708082","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.1300464
Fan Dian, Tang Zhizhong
A new algorithm of parallel sorting by exact splitting suitable for MIMD multiprocessors is presented in the paper. The algorithm locates the splitter accurately using a flexible locating splitter algorithm. The time complexity and communication cost is pretty good compared with other con-generic algorithms, and could even be better in particular situations benefitting from the flexibility of its locating splitter algorithm. In addition, experimental results of the algorithm under an MPI environment on LANs are given and compared with those of the PSRS algorithm. According to the theoretical analysis and experimental results, the algorithm is preferable due to its virtues of high efficiency, scalability, low communication cost and good load balancing.
{"title":"Parallel sorting by exact splitting","authors":"Fan Dian, Tang Zhizhong","doi":"10.1109/ISPAN.2004.1300464","DOIUrl":"https://doi.org/10.1109/ISPAN.2004.1300464","url":null,"abstract":"A new algorithm of parallel sorting by exact splitting suitable for MIMD multiprocessors is presented in the paper. The algorithm locates the splitter accurately using a flexible locating splitter algorithm. The time complexity and communication cost is pretty good compared with other con-generic algorithms, and could even be better in particular situations benefitting from the flexibility of its locating splitter algorithm. In addition, experimental results of the algorithm under an MPI environment on LANs are given and compared with those of the PSRS algorithm. According to the theoretical analysis and experimental results, the algorithm is preferable due to its virtues of high efficiency, scalability, low communication cost and good load balancing.","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":"131389758","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.1300494
Hui Tian, Hong Shen
The use of multicast traffic as measurement probes is efficient and effective to infer network-internal characteristics. We propose a new statistical approach to infer network internal link loss performance from end-to-end measurements. Incorporating with the procedure of topology inference, we present an inference algorithm that can infer loss rates of individual links in the network when it infers the network topology. It is proved that the loss rate inferred by our approach is consistent with the real loss rate as the number of probe packets tends to infinity. The approach is also extended to general trees case for loss performance inference. Loss rate-based scheme on topology inference is built in view of correct convergence to the true topology for general trees.
{"title":"Multicast-based inference of network-internal loss","authors":"Hui Tian, Hong Shen","doi":"10.1109/ISPAN.2004.1300494","DOIUrl":"https://doi.org/10.1109/ISPAN.2004.1300494","url":null,"abstract":"The use of multicast traffic as measurement probes is efficient and effective to infer network-internal characteristics. We propose a new statistical approach to infer network internal link loss performance from end-to-end measurements. Incorporating with the procedure of topology inference, we present an inference algorithm that can infer loss rates of individual links in the network when it infers the network topology. It is proved that the loss rate inferred by our approach is consistent with the real loss rate as the number of probe packets tends to infinity. The approach is also extended to general trees case for loss performance inference. Loss rate-based scheme on topology inference is built in view of correct convergence to the true topology for general trees.","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":"123916398","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.1300493
Xing Fan, M. Jonsson, Hoai Hoang Bengtsson
This paper presents a solution for efficient many-to-many communication over switched Ethernet. The performance of using an ordinary switch and an intelligent switch is compared, and the results of the analysis based on 100 Mbit/s fast Ethernet show that an intelligent switch used to handle many-to-many communication can give better performance (shorter latency and higher utilization) than an ordinary switch. We also extend the network to serve many-to-many traffic with real-time demands by adding a thin software layer to the intelligent Ethernet switch and the end-nodes. Earliest deadline first (EDF) scheduling is used.
{"title":"Efficient many-to-many real-time communication using an intelligent Ethernet switch","authors":"Xing Fan, M. Jonsson, Hoai Hoang Bengtsson","doi":"10.1109/ISPAN.2004.1300493","DOIUrl":"https://doi.org/10.1109/ISPAN.2004.1300493","url":null,"abstract":"This paper presents a solution for efficient many-to-many communication over switched Ethernet. The performance of using an ordinary switch and an intelligent switch is compared, and the results of the analysis based on 100 Mbit/s fast Ethernet show that an intelligent switch used to handle many-to-many communication can give better performance (shorter latency and higher utilization) than an ordinary switch. We also extend the network to serve many-to-many traffic with real-time demands by adding a thin software layer to the intelligent Ethernet switch and the end-nodes. Earliest deadline first (EDF) scheduling is used.","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":"123286804","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.1300513
Jatuporn Pliancharoen, Punyapat Chofabunthit, S. Noppanakeepong
The increased demand of wireless mobile communications in circuit switching, and the finite resource lead to resource expansion corresponding to the demand of subscribers. This research proposed the alternative routing to optimize the traffic channel in case of mobile subscriber who is roaming in the international network. From the conventional routing of GSM network traffic channel must always return to their HPLMN for interrogation, consequently to the inefficiency routing and waste of traffic channel between the foreign network and Home-PLMN, we are assuming the alternative routing to setup direct connection to the terminating exchange, wherever the subscriber is roaming - in a foreign network or in their home network. The proposed method could implement in addition from the existing GSM network, and the relative performances for each scenario are investigated.
{"title":"Optimum traffic channel in GSM network by using alternative call routing (international roaming analytic)","authors":"Jatuporn Pliancharoen, Punyapat Chofabunthit, S. Noppanakeepong","doi":"10.1109/ISPAN.2004.1300513","DOIUrl":"https://doi.org/10.1109/ISPAN.2004.1300513","url":null,"abstract":"The increased demand of wireless mobile communications in circuit switching, and the finite resource lead to resource expansion corresponding to the demand of subscribers. This research proposed the alternative routing to optimize the traffic channel in case of mobile subscriber who is roaming in the international network. From the conventional routing of GSM network traffic channel must always return to their HPLMN for interrogation, consequently to the inefficiency routing and waste of traffic channel between the foreign network and Home-PLMN, we are assuming the alternative routing to setup direct connection to the terminating exchange, wherever the subscriber is roaming - in a foreign network or in their home network. The proposed method could implement in addition from the existing GSM network, and the relative performances for each scenario are investigated.","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":"123287354","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.1300447
J. JáJá
Summary form only given. We consider the problem of querying large scale multidimensional time series data to discover events of interest, test and validate hypotheses, or to associate temporal patterns with specific events. This type of data currently dominates most other types of available data, and will very likely become even more prevalent in the future given the current trends in collecting time series of business, scientific, demographic, and simulation data. The ability to explore such collections interactively, even at a coarse level, will be critical in discovering the information and knowledge embedded in such collections. We develop indexing techniques and search algorithms to efficiently handle temporal range value querying of multidimensional time series data. Our indexing uses linear space data structures that enable the handling of queries in I/O time that is essentially the same as that of handling a single time slice, assuming the availability of a logarithmic number of processors as a function of the temporal window. A data structure with provably almost optimal asymptotic bounds is also presented for the case when the number of multidimensional objects is relatively small. These techniques improve significantly over standard techniques for either serial or parallel processing, and are evaluated by extensive experimental results that confirm their superior performance.
{"title":"Strategies for exploring large scale data","authors":"J. JáJá","doi":"10.1109/ISPAN.2004.1300447","DOIUrl":"https://doi.org/10.1109/ISPAN.2004.1300447","url":null,"abstract":"Summary form only given. We consider the problem of querying large scale multidimensional time series data to discover events of interest, test and validate hypotheses, or to associate temporal patterns with specific events. This type of data currently dominates most other types of available data, and will very likely become even more prevalent in the future given the current trends in collecting time series of business, scientific, demographic, and simulation data. The ability to explore such collections interactively, even at a coarse level, will be critical in discovering the information and knowledge embedded in such collections. We develop indexing techniques and search algorithms to efficiently handle temporal range value querying of multidimensional time series data. Our indexing uses linear space data structures that enable the handling of queries in I/O time that is essentially the same as that of handling a single time slice, assuming the availability of a logarithmic number of processors as a function of the temporal window. A data structure with provably almost optimal asymptotic bounds is also presented for the case when the number of multidimensional objects is relatively small. These techniques improve significantly over standard techniques for either serial or parallel processing, and are evaluated by extensive experimental results that confirm their superior performance.","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":"130163156","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.1300449
K. McCurley, A. Tomkins
The World Wide Web presents an interesting opportunity for data mining and knowledge discovery, and this area is growing rapidly as both a research topic and a business activity. In this survey we describe some of the problems that are addressed, and elements of the WebFountain infrastructure that we have built for addressing them. Our focus here is on describing some of the lessons learned and some broad research areas that are involved.
{"title":"Mining and knowledge discovery from the Web","authors":"K. McCurley, A. Tomkins","doi":"10.1109/ISPAN.2004.1300449","DOIUrl":"https://doi.org/10.1109/ISPAN.2004.1300449","url":null,"abstract":"The World Wide Web presents an interesting opportunity for data mining and knowledge discovery, and this area is growing rapidly as both a research topic and a business activity. In this survey we describe some of the problems that are addressed, and elements of the WebFountain infrastructure that we have built for addressing them. Our focus here is on describing some of the lessons learned and some broad research areas that are involved.","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":"126041906","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. The computational analysis of biological sequences is a kind of computation driven science. Cause the biology data growing quickly and these databases are heterogeneous. We can use the grid system sharing and integrating the heterogeneous biology database. As we know, bioinformatics tools can speed up analysis the large-scale sequence data, especially about sequence alignment. The FASTA is a tool for aligning multiple protein or nucleotide sequences. FASTA which we used is a distributed and parallel version. The software uses a message-passing library called MPl (Message Passing Interface) and runs on distributed workstation clusters as well as on traditional parallel computers. A grid computing environment is proposed and constructed on multiple Linux PC clusters by using Globus Toolkit (GT) and SUN Grid Engine (SGE). The experimental results and performances of the bioinformatics tool using on grid system are also presented in this paper.
{"title":"Construct a grid computing environment for bioinformatics","authors":"Yu-Lun Kuo, Chao-Tung Yang, Chuan-Lin Lai, Tsai-Ming Tseng","doi":"10.1109/ISPAN.2004.1300502","DOIUrl":"https://doi.org/10.1109/ISPAN.2004.1300502","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. The computational analysis of biological sequences is a kind of computation driven science. Cause the biology data growing quickly and these databases are heterogeneous. We can use the grid system sharing and integrating the heterogeneous biology database. As we know, bioinformatics tools can speed up analysis the large-scale sequence data, especially about sequence alignment. The FASTA is a tool for aligning multiple protein or nucleotide sequences. FASTA which we used is a distributed and parallel version. The software uses a message-passing library called MPl (Message Passing Interface) and runs on distributed workstation clusters as well as on traditional parallel computers. A grid computing environment is proposed and constructed on multiple Linux PC clusters by using Globus Toolkit (GT) and SUN Grid Engine (SGE). The experimental results and performances of the bioinformatics tool using on grid system are also presented in this paper.","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":"127092046","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
扫码关注我们
求助内容：
应助结果提醒方式：