This paper addresses the problem of transcoding proxy placement for coordinated en-route Web caching for tree networks. We propose a model for this problem by considering all the nodes among the network in a coordinated way and formulate this problem as an optimization problem. We implement our dynamic programming-based algorithm and evaluate our model on different performance metrics through extensive simulation experiments. The implementation results show that our model outperforms the placement model for linear topology.
{"title":"Proxy placement in coordinated en-route transcoding caching for tree networks","authors":"Keqiu Li, Hong Shen","doi":"10.1109/ICPADS.2004.31","DOIUrl":"https://doi.org/10.1109/ICPADS.2004.31","url":null,"abstract":"This paper addresses the problem of transcoding proxy placement for coordinated en-route Web caching for tree networks. We propose a model for this problem by considering all the nodes among the network in a coordinated way and formulate this problem as an optimization problem. We implement our dynamic programming-based algorithm and evaluate our model on different performance metrics through extensive simulation experiments. The implementation results show that our model outperforms the placement model for linear topology.","PeriodicalId":198404,"journal":{"name":"7th International Symposium on Parallel Architectures, Algorithms and Networks, 2004. Proceedings.","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2004-07-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124099843","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.1300460
Heng Chang, W. Jia, Ling Zhang
Server replication is an approach often used to improve service access efficiency and availability for a large number of clients. This paper adopts a simple service model and investigates a set of efficient algorithms for server selection in an anycast group under the condition of imprecise network delay. The algorithms use ticket-based probing approach to search the path with short delay and probe the server load at the same time and try to optimize the server and path delay at the same time. The simulation results demonstrate that our algorithms are efficient in terms of server response time for sever selection compared with several other server selection algorithms.
{"title":"Distributed server selection with imprecise state for replicated server group","authors":"Heng Chang, W. Jia, Ling Zhang","doi":"10.1109/ISPAN.2004.1300460","DOIUrl":"https://doi.org/10.1109/ISPAN.2004.1300460","url":null,"abstract":"Server replication is an approach often used to improve service access efficiency and availability for a large number of clients. This paper adopts a simple service model and investigates a set of efficient algorithms for server selection in an anycast group under the condition of imprecise network delay. The algorithms use ticket-based probing approach to search the path with short delay and probe the server load at the same time and try to optimize the server and path delay at the same time. The simulation results demonstrate that our algorithms are efficient in terms of server response time for sever selection compared with several other server selection algorithms.","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":"116659159","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.1300509
Tayuan Huang, Kuei-Hung You
Following results of Bernasconi, Codenotti, and Van-derKam on a characterization of bent functions, feasible parameters and corresponding eigenvalues of the associated Cayley graphs of bent functions are given; in particular, all of those graphs with at most 280 vertices are included.
{"title":"Strongly regular graphs associated with bent functions","authors":"Tayuan Huang, Kuei-Hung You","doi":"10.1109/ISPAN.2004.1300509","DOIUrl":"https://doi.org/10.1109/ISPAN.2004.1300509","url":null,"abstract":"Following results of Bernasconi, Codenotti, and Van-derKam on a characterization of bent functions, feasible parameters and corresponding eigenvalues of the associated Cayley graphs of bent functions are given; in particular, all of those graphs with at most 280 vertices are included.","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":"127080832","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.1300550
Hsien-Da Huang, Jorng-Tzong Horng, Yi-Ming Sun, A. Tsou, Shir-Ly Huang
Recently, biological databases and analytical methods have become available for analyzing gene expression and transcriptional regulatory sequences. However, users must make the complicated analyses to query the data in various databases, and to analyze the gene upstreams using various predictive tools. Beyond methods for predicting transcriptional regulatory sites, new automated and integrated methods for analyzing gene upstream sequences on a higher level are urgently required. We present an integrated system to predict transcriptional regulatory sites and detect co-occurrence of these regulatory sites after a set of genes are input. The system comprises a biological data warehousing system, pattern discovery programs, pattern occurrence association detectors and user interfaces. User profiles and history pages enable users to trace the sequence analyses for transcriptional regulatory sites.
{"title":"Identifying transcriptional regulatory sites in the human genome using an integrated computation","authors":"Hsien-Da Huang, Jorng-Tzong Horng, Yi-Ming Sun, A. Tsou, Shir-Ly Huang","doi":"10.1109/ISPAN.2004.1300550","DOIUrl":"https://doi.org/10.1109/ISPAN.2004.1300550","url":null,"abstract":"Recently, biological databases and analytical methods have become available for analyzing gene expression and transcriptional regulatory sequences. However, users must make the complicated analyses to query the data in various databases, and to analyze the gene upstreams using various predictive tools. Beyond methods for predicting transcriptional regulatory sites, new automated and integrated methods for analyzing gene upstream sequences on a higher level are urgently required. We present an integrated system to predict transcriptional regulatory sites and detect co-occurrence of these regulatory sites after a set of genes are input. The system comprises a biological data warehousing system, pattern discovery programs, pattern occurrence association detectors and user interfaces. User profiles and history pages enable users to trace the sequence analyses for transcriptional regulatory sites.","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":"124933009","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.1300475
Toru Araki
We study the problem of adaptive fault diagnosis for multiprocessor systems modeled by cubic Hamiltonian graphs. Each node in a system is either faulty or fault-free, and the aim of fault diagnosis is to identify correctly faulty/fault-free status of all nodes. In order to achieve it, each node tests their neighbors and output the results of tests. If the test node is fault-free, it always outputs correct test results, but if the test node is faulty, the result of the test cannot be trusted. We give a sufficient condition for a cubic Hamiltonian graph to be adoptively diagnosed in 3 testing rounds, provided that each node participates in at most one test of each round. It is the optimal number of testing rounds. The class of these graphs that satisfy this condition contains several important networks.
{"title":"Optimal adaptive fault diagnosis of cubic Hamiltonian graphs","authors":"Toru Araki","doi":"10.1109/ISPAN.2004.1300475","DOIUrl":"https://doi.org/10.1109/ISPAN.2004.1300475","url":null,"abstract":"We study the problem of adaptive fault diagnosis for multiprocessor systems modeled by cubic Hamiltonian graphs. Each node in a system is either faulty or fault-free, and the aim of fault diagnosis is to identify correctly faulty/fault-free status of all nodes. In order to achieve it, each node tests their neighbors and output the results of tests. If the test node is fault-free, it always outputs correct test results, but if the test node is faulty, the result of the test cannot be trusted. We give a sufficient condition for a cubic Hamiltonian graph to be adoptively diagnosed in 3 testing rounds, provided that each node participates in at most one test of each round. It is the optimal number of testing rounds. The class of these graphs that satisfy this condition contains several important networks.","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":"114146466","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.1300451
Bin Xiao, Jiannong Cao, Qingfeng Zhuge, Z. Shao, E. Sha
The shortest path tree (SPT) construction is a critical issue to the high performance routing in an interior network using link state protocols, such as open shortest path first (OSPF) and IS-IS. In this paper, we propose a new efficient algorithm for dynamic SPT update to avoid the disadvantages (e.g. redundant computation) caused by static SPT update algorithms. The new algorithm is based on the understanding of the update procedure to reduce redundancy. Only significant elements that contribute to the construction of new SPT from the old one are focused on. The efficiency of our algorithm is improved because it only pay attention to the edges really count for the update process. The running time for the proposed algorithm is maximum reduced, which is shown through experimental results. Furthermore, our algorithm can be easily generalized to solve the SPT updating problem in a graph with negative weight edges and applied to the scenario of multiple edge weight changes.
{"title":"Dynamic update of shortest path tree in OSPF","authors":"Bin Xiao, Jiannong Cao, Qingfeng Zhuge, Z. Shao, E. Sha","doi":"10.1109/ISPAN.2004.1300451","DOIUrl":"https://doi.org/10.1109/ISPAN.2004.1300451","url":null,"abstract":"The shortest path tree (SPT) construction is a critical issue to the high performance routing in an interior network using link state protocols, such as open shortest path first (OSPF) and IS-IS. In this paper, we propose a new efficient algorithm for dynamic SPT update to avoid the disadvantages (e.g. redundant computation) caused by static SPT update algorithms. The new algorithm is based on the understanding of the update procedure to reduce redundancy. Only significant elements that contribute to the construction of new SPT from the old one are focused on. The efficiency of our algorithm is improved because it only pay attention to the edges really count for the update process. The running time for the proposed algorithm is maximum reduced, which is shown through experimental results. Furthermore, our algorithm can be easily generalized to solve the SPT updating problem in a graph with negative weight edges and applied to the scenario of multiple edge weight changes.","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":"116612709","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.1300518
T. Le, J. Rejeb
PC-cluster is becoming more and more popular in many scientific and engineering applications, but not in electronic design areas. One of the reasons that parallel simulations have not been popularized is due to the high cost of frequent communications of small messages. Several simulation techniques have been aggressively studied and developed in the past ten years. These studies mostly focused on parallel VHDL simulation. In this paper, we show the effects of PC-cluster communication latencies on the performance of parallel discrete event simulation. We performed the experiments with two equivalent 8-node PC-cluster systems, one with regular Ethernet cards and one with Myrinet network cards. In order to study the effects of communication costs on the overall performance of parallel simulation algorithms, our study concentrates on fundamental techniques of discrete parallel event simulation scheme. The simulation processes are synchronized by the time warp mechanism and the problem domain is partitioned for best parallel performance. The speedup results show that although current PC-cluster technology is ready for parallel logic simulator, even for high-demanding communication applications, new algorithms that can avoid or minimize the computational rolling-back must be developed in order to catch up the rapid advancement of microprocessor technologies.
{"title":"Performance of parallel logic event simulation on PC-cluster","authors":"T. Le, J. Rejeb","doi":"10.1109/ISPAN.2004.1300518","DOIUrl":"https://doi.org/10.1109/ISPAN.2004.1300518","url":null,"abstract":"PC-cluster is becoming more and more popular in many scientific and engineering applications, but not in electronic design areas. One of the reasons that parallel simulations have not been popularized is due to the high cost of frequent communications of small messages. Several simulation techniques have been aggressively studied and developed in the past ten years. These studies mostly focused on parallel VHDL simulation. In this paper, we show the effects of PC-cluster communication latencies on the performance of parallel discrete event simulation. We performed the experiments with two equivalent 8-node PC-cluster systems, one with regular Ethernet cards and one with Myrinet network cards. In order to study the effects of communication costs on the overall performance of parallel simulation algorithms, our study concentrates on fundamental techniques of discrete parallel event simulation scheme. The simulation processes are synchronized by the time warp mechanism and the problem domain is partitioned for best parallel performance. The speedup results show that although current PC-cluster technology is ready for parallel logic simulator, even for high-demanding communication applications, new algorithms that can avoid or minimize the computational rolling-back must be developed in order to catch up the rapid advancement of microprocessor technologies.","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":"130542792","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.1300525
W. Liang
Multicast routing is a fundamental problem in any telecommunication network. We address the multicast issue in a WDM optical network without wavelength conversion capability. To realize a multicast request in such network, it is required to establish multiple light multicast trees (MLMT) sometimes due to the fact that the requested network resources are being occupied by other routing traffic and therefore it is impossible to establish a single light multicast tree for the request. In this paper we first propose a multiple light multicast tree model. We then show the MLMT is NP-hard, and devise an approximation algorithm for it which takes 0((kn)/sup 1//spl epsi//|D|/sup 2//spl epsi// + kn + km) time and delivers an approximation solution within 0(|D|/sup /spl epsi//) times of the optimal, where n, m, and k are the numbers of nodes, links, and wavelengths in the network, D is the set of destination nodes and e is constant, 0 < e /spl les/ 1. We finally extend the problem further with the end-to-end path delay is bounded by an integer /spl Delta/, and we call this latter problem as the multiple delay-constrained light multicast tree problem (MDCLMT), for which we propose two approximation algorithms with the performance ratios of |D|. One of the proposed algorithms takes 0(km|D|/spl Delta/ + |D|/sup 2/m/spl Delta/) time and the path delay is strictly met; and another takes O(kmn//spl epsi/ + |D|n/sup 2/) time and the path delay is no more than (1 + /spl epsi/)/spl Delta/, where /spl epsi/ is constant with 0 < /spl epsi/ /spl les/ 1.
{"title":"Constructing multiple light multicast trees in WDM optical networks","authors":"W. Liang","doi":"10.1109/ISPAN.2004.1300525","DOIUrl":"https://doi.org/10.1109/ISPAN.2004.1300525","url":null,"abstract":"Multicast routing is a fundamental problem in any telecommunication network. We address the multicast issue in a WDM optical network without wavelength conversion capability. To realize a multicast request in such network, it is required to establish multiple light multicast trees (MLMT) sometimes due to the fact that the requested network resources are being occupied by other routing traffic and therefore it is impossible to establish a single light multicast tree for the request. In this paper we first propose a multiple light multicast tree model. We then show the MLMT is NP-hard, and devise an approximation algorithm for it which takes 0((kn)/sup 1//spl epsi//|D|/sup 2//spl epsi// + kn + km) time and delivers an approximation solution within 0(|D|/sup /spl epsi//) times of the optimal, where n, m, and k are the numbers of nodes, links, and wavelengths in the network, D is the set of destination nodes and e is constant, 0 < e /spl les/ 1. We finally extend the problem further with the end-to-end path delay is bounded by an integer /spl Delta/, and we call this latter problem as the multiple delay-constrained light multicast tree problem (MDCLMT), for which we propose two approximation algorithms with the performance ratios of |D|. One of the proposed algorithms takes 0(km|D|/spl Delta/ + |D|/sup 2/m/spl Delta/) time and the path delay is strictly met; and another takes O(kmn//spl epsi/ + |D|n/sup 2/) time and the path delay is no more than (1 + /spl epsi/)/spl Delta/, where /spl epsi/ is constant with 0 < /spl epsi/ /spl les/ 1.","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":"134099871","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.1300543
Qin Zhang, Hai Jin, Chuanjiang Yi, Liping Pang
This paper presents a large-scale dynamic self-immune security architecture. In this architecture, a network is modeled as a hierarchy of administrators and hosts. We use a tree-like hierarchical model to guarantee security, scalability and availability of the system. We adopt a simple SSL-based authentication protocol to avoid unauthorized access to administrators, a group management mechanism for trust model, and two fault-tolerant schemes to address single point of failure of administrators.
{"title":"Tree-like hierarchical model for distributed micro-security system","authors":"Qin Zhang, Hai Jin, Chuanjiang Yi, Liping Pang","doi":"10.1109/ISPAN.2004.1300543","DOIUrl":"https://doi.org/10.1109/ISPAN.2004.1300543","url":null,"abstract":"This paper presents a large-scale dynamic self-immune security architecture. In this architecture, a network is modeled as a hierarchy of administrators and hosts. We use a tree-like hierarchical model to guarantee security, scalability and availability of the system. We adopt a simple SSL-based authentication protocol to avoid unauthorized access to administrators, a group management mechanism for trust model, and two fault-tolerant schemes to address single point of failure of administrators.","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":"131535041","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.1300479
Qiang-Sheng Hua, Zhi-gang Chen, F. Lau
For the parallel tasks represented by the directed acyclic graph (DAG), if it is linearly clustered, the ordering of the execution time of the tasks in each cluster is based on their arrows in the DAG. But for nonlinearly clustering, the ordering of the independent tasks in each cluster is not easily decided. Improper ordering of these independent tasks will greatly increase the scheduling length of the DAG. We discuss the shortcomings of current scheduling algorithms and the reason behind poor performance, and then propose some new node information to be extracted which is used by a new independent tasks scheduling algorithm based on the maximized parallelism degree (MPD). Experimental results show that the MPD algorithm can yield better performance than the previous algorithms.
{"title":"A new method for independent task scheduling in nonlinearly DAG clustering","authors":"Qiang-Sheng Hua, Zhi-gang Chen, F. Lau","doi":"10.1109/ISPAN.2004.1300479","DOIUrl":"https://doi.org/10.1109/ISPAN.2004.1300479","url":null,"abstract":"For the parallel tasks represented by the directed acyclic graph (DAG), if it is linearly clustered, the ordering of the execution time of the tasks in each cluster is based on their arrows in the DAG. But for nonlinearly clustering, the ordering of the independent tasks in each cluster is not easily decided. Improper ordering of these independent tasks will greatly increase the scheduling length of the DAG. We discuss the shortcomings of current scheduling algorithms and the reason behind poor performance, and then propose some new node information to be extracted which is used by a new independent tasks scheduling algorithm based on the maximized parallelism degree (MPD). Experimental results show that the MPD algorithm can yield better performance than the previous algorithms.","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":"133083659","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
扫码关注我们
求助内容：
应助结果提醒方式：