Pub Date : 2004-05-10DOI: 10.1109/ISPAN.2004.1300474
Hong-Chun Hsu, Liang-Chih Chiang, Jimmy J. M. Tan, Lih-Hsing Hsu
In this paper, we consider the fault hamiltonicity and the fault Hamiltonian connectivity of the augmented cubes AQ/sub n/. Assume that F /spl sube/ V(AQ/sub n/) /spl cup/ E(AQ/sub n/) and n /spl ges/ 4. We prove that AQ/sub n/ - F is Hamiltonian if |F| /spl les/ 2n-3 and that AQ/sub n/ - F is Hamiltonian connected if |F| /spl les/ 2n - 4. Moreover, these bounds are tight.
{"title":"Ring embedding in faulty augmented cubes","authors":"Hong-Chun Hsu, Liang-Chih Chiang, Jimmy J. M. Tan, Lih-Hsing Hsu","doi":"10.1109/ISPAN.2004.1300474","DOIUrl":"https://doi.org/10.1109/ISPAN.2004.1300474","url":null,"abstract":"In this paper, we consider the fault hamiltonicity and the fault Hamiltonian connectivity of the augmented cubes AQ/sub n/. Assume that F /spl sube/ V(AQ/sub n/) /spl cup/ E(AQ/sub n/) and n /spl ges/ 4. We prove that AQ/sub n/ - F is Hamiltonian if |F| /spl les/ 2n-3 and that AQ/sub n/ - F is Hamiltonian connected if |F| /spl les/ 2n - 4. Moreover, these bounds are tight.","PeriodicalId":198404,"journal":{"name":"7th International Symposium on Parallel Architectures, Algorithms and Networks, 2004. Proceedings.","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-05-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134478509","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.1300529
Mohammad Mursalin Akon, D. Goswami, S. Jyoti
Swarm intelligence based algorithms for routing in telecommunication networks have gained considerable amount of attention in recent years. Swarm intelligence, demonstrated by natural biological swarms, exhibits numerous powerful features that are desirable in communication systems. Mobile agents having swarm intelligence similar to the real life ants have been employed to achieve a general, flexible and modular solution for routing in communication networks. In this paper, we propose mobile agents that are more advanced than those found in the previous literatures. Our proposal includes a new migration scheme for the ant-like mobile agents and a new routing table management scheme. Simulation results show that our proposed schemes can ultimately result in better load balancing and better performance within telecommunication networks.
{"title":"A new routing table update and ant migration scheme for ant based control in telecommunication networks","authors":"Mohammad Mursalin Akon, D. Goswami, S. Jyoti","doi":"10.1109/ISPAN.2004.1300529","DOIUrl":"https://doi.org/10.1109/ISPAN.2004.1300529","url":null,"abstract":"Swarm intelligence based algorithms for routing in telecommunication networks have gained considerable amount of attention in recent years. Swarm intelligence, demonstrated by natural biological swarms, exhibits numerous powerful features that are desirable in communication systems. Mobile agents having swarm intelligence similar to the real life ants have been employed to achieve a general, flexible and modular solution for routing in communication networks. In this paper, we propose mobile agents that are more advanced than those found in the previous literatures. Our proposal includes a new migration scheme for the ant-like mobile agents and a new routing table management scheme. Simulation results show that our proposed schemes can ultimately result in better load balancing and better performance within telecommunication networks.","PeriodicalId":198404,"journal":{"name":"7th International Symposium on Parallel Architectures, Algorithms and Networks, 2004. Proceedings.","volume":"59 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-05-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133615167","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.1300452
Zhang Li, W. Jia, Yan Wei, Li Xiao-ming
Anycast communication can be used to provide effective routing to server members in a replicated server group that is represented by an anycast address. This paper proposes a novel anycast routing protocol called anycast routing protocol based on multi-metrics (ARMM). ARMM protocol sets up the routing by taking hop number, data transmission delay, residual bandwidth, and server load as the server and path selection criteria. ARMM differs from other approaches as it uses values of bandwidth and delay on the direction from servers (anycast members) to clients, rather than the normal direction from clients to servers. So ARMM can select the best server/path with sufficient network resource (bandwidth, etc.) for server data transmission to clients. Simulation results demonstrated that our protocol performs better than those protocols using conventional client to server routing approach in case that the servers may require to transmit a large volume of flows to the clients.
{"title":"An efficient anycast routing protocol based on multi-metrics","authors":"Zhang Li, W. Jia, Yan Wei, Li Xiao-ming","doi":"10.1109/ISPAN.2004.1300452","DOIUrl":"https://doi.org/10.1109/ISPAN.2004.1300452","url":null,"abstract":"Anycast communication can be used to provide effective routing to server members in a replicated server group that is represented by an anycast address. This paper proposes a novel anycast routing protocol called anycast routing protocol based on multi-metrics (ARMM). ARMM protocol sets up the routing by taking hop number, data transmission delay, residual bandwidth, and server load as the server and path selection criteria. ARMM differs from other approaches as it uses values of bandwidth and delay on the direction from servers (anycast members) to clients, rather than the normal direction from clients to servers. So ARMM can select the best server/path with sufficient network resource (bandwidth, etc.) for server data transmission to clients. Simulation results demonstrated that our protocol performs better than those protocols using conventional client to server routing approach in case that the servers may require to transmit a large volume of flows to the clients.","PeriodicalId":198404,"journal":{"name":"7th International Symposium on Parallel Architectures, Algorithms and Networks, 2004. Proceedings.","volume":"43 17","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-05-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133370677","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.1300457
Qiaozhong Ke, D. Makrakis
Relay control ought to be performed when a direct communication link cannot be established between the source station and the target station. We propose in this paper how such function can be accomplished effectively in Wireless 1394 based networks. Simulation results yield the fact that the proposed scheme not only can optimize the data relay control from the perspectives of the premium (the lowest cost) relay path and relay station selection but also can improve the system's performance in terms of its higher packet delivery ratio and lower packet end-to-end delay in a shadowing prone home environment.
{"title":"Optimizing relay control in Wireless 1394 network","authors":"Qiaozhong Ke, D. Makrakis","doi":"10.1109/ISPAN.2004.1300457","DOIUrl":"https://doi.org/10.1109/ISPAN.2004.1300457","url":null,"abstract":"Relay control ought to be performed when a direct communication link cannot be established between the source station and the target station. We propose in this paper how such function can be accomplished effectively in Wireless 1394 based networks. Simulation results yield the fact that the proposed scheme not only can optimize the data relay control from the perspectives of the premium (the lowest cost) relay path and relay station selection but also can improve the system's performance in terms of its higher packet delivery ratio and lower packet end-to-end delay in a shadowing prone home environment.","PeriodicalId":198404,"journal":{"name":"7th International Symposium on Parallel Architectures, Algorithms and Networks, 2004. Proceedings.","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-05-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121481141","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.1300548
Han-Yu Chuang, Hongfang Liu, Fang-An Chen, Cheng-Yan Kao, D. Hsu
Microarray technology and experiment can produce thousands or tens of thousands of gene expression measurements in a single cellular mRNA sample. Selecting a list of informative differential genes from these measurement data has been the central problem for microarray analysis. Many methods to identify informative genes have been proposed in the past. However, due to the complexity of biological systems, each proposed method seems to perform nicely in a particular data set or specific experiment. It remains a great challenge to come up with a selection method for a wider spectrum of experiments and a broader variety of data sets. In this paper, we take the approach of method combination using data fusion and rank-score graph which have been used successfully in other application domains such as information retrieval, pattern recognition and tracking, and molecular similarity search. Our method combination is efficient and flexible and can be extended to become a general learning system for microarray gene expression analysis.
{"title":"Combination methods in microarray analysis","authors":"Han-Yu Chuang, Hongfang Liu, Fang-An Chen, Cheng-Yan Kao, D. Hsu","doi":"10.1109/ISPAN.2004.1300548","DOIUrl":"https://doi.org/10.1109/ISPAN.2004.1300548","url":null,"abstract":"Microarray technology and experiment can produce thousands or tens of thousands of gene expression measurements in a single cellular mRNA sample. Selecting a list of informative differential genes from these measurement data has been the central problem for microarray analysis. Many methods to identify informative genes have been proposed in the past. However, due to the complexity of biological systems, each proposed method seems to perform nicely in a particular data set or specific experiment. It remains a great challenge to come up with a selection method for a wider spectrum of experiments and a broader variety of data sets. In this paper, we take the approach of method combination using data fusion and rank-score graph which have been used successfully in other application domains such as information retrieval, pattern recognition and tracking, and molecular similarity search. Our method combination is efficient and flexible and can be extended to become a general learning system for microarray gene expression analysis.","PeriodicalId":198404,"journal":{"name":"7th International Symposium on Parallel Architectures, Algorithms and Networks, 2004. Proceedings.","volume":"96 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-05-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121637694","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.1300522
Debabrata Mondal, P. K. Jana
It is well known that 4 or 8-neighborhood property has an important role in many algorithms, for example, image processing, solving partial differential equation (PDE) etc. In this paper, we establish these properties on an OTIS-Mesh, an optoelectronic parallel computer. We show that these properties can be established in constant time with the help of a new indexing scheme called processor data index (PDI), proposed in this paper.
{"title":"Neighborhood property of OTIS-mesh optoelectronic computer","authors":"Debabrata Mondal, P. K. Jana","doi":"10.1109/ISPAN.2004.1300522","DOIUrl":"https://doi.org/10.1109/ISPAN.2004.1300522","url":null,"abstract":"It is well known that 4 or 8-neighborhood property has an important role in many algorithms, for example, image processing, solving partial differential equation (PDE) etc. In this paper, we establish these properties on an OTIS-Mesh, an optoelectronic parallel computer. We show that these properties can be established in constant time with the help of a new indexing scheme called processor data index (PDI), proposed in this paper.","PeriodicalId":198404,"journal":{"name":"7th International Symposium on Parallel Architectures, Algorithms and Networks, 2004. Proceedings.","volume":"121 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-05-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124173638","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.1300511
Michael Cho-Hoi Chek, Yu-Kwong Kwok
In contrast to traditional frequency hopping techniques, adaptive frequency hopping (AFH) is a low cost and low power solution to avoid interference dynamically. While each AFH algorithm proposed previously is shown to be efficient, a detailed performance analysis of various AFH mechanisms under realistic resource constraints is yet to be done. In particular, based on our performance study on Bluetooth systems presented in this paper, we have found that the AFH mechanism adopted by IEEE 802.15 task group 2 (TG2) is very sensitive to memory and power limitations. We then propose an interference source oriented adaptive frequency hopping (ISOAFH) approach based on a cross-layer design, in which the baseband layer of Bluetooth considers not only the instantaneous channels condition but also the physical layer transmission characteristics of potential interference sources in determining the hop sequence. In our simulations using detailed MATLAB Simulink modeling, we find that our proposed method is much more robust in that it is insensitive to memory and energy constraints. Indeed, our approach generally achieves a lower collision rate and higher ISM spectrum utilization.
{"title":"On adaptive frequency hopping to combat coexistence interference between Bluetooth and IEEE 802.11b with practical resource constraints","authors":"Michael Cho-Hoi Chek, Yu-Kwong Kwok","doi":"10.1109/ISPAN.2004.1300511","DOIUrl":"https://doi.org/10.1109/ISPAN.2004.1300511","url":null,"abstract":"In contrast to traditional frequency hopping techniques, adaptive frequency hopping (AFH) is a low cost and low power solution to avoid interference dynamically. While each AFH algorithm proposed previously is shown to be efficient, a detailed performance analysis of various AFH mechanisms under realistic resource constraints is yet to be done. In particular, based on our performance study on Bluetooth systems presented in this paper, we have found that the AFH mechanism adopted by IEEE 802.15 task group 2 (TG2) is very sensitive to memory and power limitations. We then propose an interference source oriented adaptive frequency hopping (ISOAFH) approach based on a cross-layer design, in which the baseband layer of Bluetooth considers not only the instantaneous channels condition but also the physical layer transmission characteristics of potential interference sources in determining the hop sequence. In our simulations using detailed MATLAB Simulink modeling, we find that our proposed method is much more robust in that it is insensitive to memory and energy constraints. Indeed, our approach generally achieves a lower collision rate and higher ISM spectrum utilization.","PeriodicalId":198404,"journal":{"name":"7th International Symposium on Parallel Architectures, Algorithms and Networks, 2004. Proceedings.","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-05-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121505600","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.1016/j.jpdc.2007.07.002
L. Higham, J. Kawash
{"title":"Implementing sequentially consistent programs on processor consistent platforms","authors":"L. Higham, J. Kawash","doi":"10.1016/j.jpdc.2007.07.002","DOIUrl":"https://doi.org/10.1016/j.jpdc.2007.07.002","url":null,"abstract":"","PeriodicalId":198404,"journal":{"name":"7th International Symposium on Parallel Architectures, Algorithms and Networks, 2004. Proceedings.","volume":"50 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-05-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120610310","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.1300537
D. Hsu, A. Palumbo
In this paper, we examine a method for the fusion of ranked data in the context of a Cayley graph. We investigate this Cayley graph model for optimization of fusion by rank combination. We outline a method of data fusion by combination of weighted rankings. Information systems are represented as nodes in a Cayley graph. Our goal is to determine a metric of diversity and performance in this graph in order to build a model for optimizing fusion by rank combination. We use the Kendall distance between nodes in the Cayley graph of the symmetric group S/sub n/ as a measure of performance. In doing so we demonstrate that in S/sub 6/ there is a quadratic relationship between the weights of the fusion of two information systems and the performance of the fusion in our abstract space. From such a relationship we propose a set of functions for extrapolating optimal fusion weights in the symmetric group S/sub n/.
{"title":"A study of data fusion in Cayley graphs G(s/sub n/,p/sub n/)","authors":"D. Hsu, A. Palumbo","doi":"10.1109/ISPAN.2004.1300537","DOIUrl":"https://doi.org/10.1109/ISPAN.2004.1300537","url":null,"abstract":"In this paper, we examine a method for the fusion of ranked data in the context of a Cayley graph. We investigate this Cayley graph model for optimization of fusion by rank combination. We outline a method of data fusion by combination of weighted rankings. Information systems are represented as nodes in a Cayley graph. Our goal is to determine a metric of diversity and performance in this graph in order to build a model for optimizing fusion by rank combination. We use the Kendall distance between nodes in the Cayley graph of the symmetric group S/sub n/ as a measure of performance. In doing so we demonstrate that in S/sub 6/ there is a quadratic relationship between the weights of the fusion of two information systems and the performance of the fusion in our abstract space. From such a relationship we propose a set of functions for extrapolating optimal fusion weights in the symmetric group S/sub n/.","PeriodicalId":198404,"journal":{"name":"7th International Symposium on Parallel Architectures, Algorithms and Networks, 2004. Proceedings.","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-05-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122456470","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.1300523
N. Mir, Chwei-King Mok
The design and evaluation of a parallel-plane interconnection network are presented in this paper. The proposed network can be used in data networks as well as in distributed computing systems. The proposed network is a cyclic, deflection-routing based, and hierarchical network and is constructed recursively using the Manhattan-type topology as the basic building block. This network exhibits substantial improvement in performance over its building block two-dimensional network on characteristics such as throughput and fault tolerance and still preserves the ease of implementation. The simulation and analysis in this paper show that the proposed network performs comparably to the hypercube at a much lower cost, even a larger network is used. Unlike other switching networks that use a higher node degree to maintain a small network diameter as the networks grow, the proposed parallel architecture network takes advantage of the expandability in its basic building blocks. This feature of the parallel-plane network offers a low network diameter, while it maintains a fixed and small node degree.
{"title":"Performance of a parallel-plane switching network","authors":"N. Mir, Chwei-King Mok","doi":"10.1109/ISPAN.2004.1300523","DOIUrl":"https://doi.org/10.1109/ISPAN.2004.1300523","url":null,"abstract":"The design and evaluation of a parallel-plane interconnection network are presented in this paper. The proposed network can be used in data networks as well as in distributed computing systems. The proposed network is a cyclic, deflection-routing based, and hierarchical network and is constructed recursively using the Manhattan-type topology as the basic building block. This network exhibits substantial improvement in performance over its building block two-dimensional network on characteristics such as throughput and fault tolerance and still preserves the ease of implementation. The simulation and analysis in this paper show that the proposed network performs comparably to the hypercube at a much lower cost, even a larger network is used. Unlike other switching networks that use a higher node degree to maintain a small network diameter as the networks grow, the proposed parallel architecture network takes advantage of the expandability in its basic building blocks. This feature of the parallel-plane network offers a low network diameter, while it maintains a fixed and small node degree.","PeriodicalId":198404,"journal":{"name":"7th International Symposium on Parallel Architectures, Algorithms and Networks, 2004. Proceedings.","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-05-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128290565","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
扫码关注我们
求助内容：
应助结果提醒方式：