Pub Date : 2002-08-15DOI: 10.1109/ISPAN.2002.1004254
S. Sahni, Kun Suk Kim, Haibin Lu
We review the data structures that have been proposed for one-dimensional packet classification. Our review is limited to data structures for the case when ties among the rules that match an incoming packet are broken by selecting the matching rule that is most specific. For the case when the rule filters are destination-address prefixes or are nonintersecting ranges, this tie breaker corresponds to longest-prefix or shortest-range matching, respectively. When the rule filters are arbitrary ranges, this tie breaker resolves the tie only when the rule set is conflict free. Data structures for both static and dynamic rule tables are discussed.
{"title":"Data structures for one-dimensional packet classification using most-specific-rule matching","authors":"S. Sahni, Kun Suk Kim, Haibin Lu","doi":"10.1109/ISPAN.2002.1004254","DOIUrl":"https://doi.org/10.1109/ISPAN.2002.1004254","url":null,"abstract":"We review the data structures that have been proposed for one-dimensional packet classification. Our review is limited to data structures for the case when ties among the rules that match an incoming packet are broken by selecting the matching rule that is most specific. For the case when the rule filters are destination-address prefixes or are nonintersecting ranges, this tie breaker corresponds to longest-prefix or shortest-range matching, respectively. When the rule filters are arbitrary ranges, this tie breaker resolves the tie only when the rule set is conflict free. Data structures for both static and dynamic rule tables are discussed.","PeriodicalId":255069,"journal":{"name":"Proceedings International Symposium on Parallel Architectures, Algorithms and Networks. I-SPAN'02","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-08-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130830722","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 : 2002-08-07DOI: 10.1109/ISPAN.2002.1004296
A. Jouraku, M. Koibuchi, H. Amano, Akira Funahashi
In order to solve traffic unbalancing caused by up*/down* routing for irregular networks, a 2D direction is introduced into a spanning tree, and novel routing algorithms based on a 2D turn model are proposed. The proposed algorithms improve traffic balancing by carefully selecting prohibited turns for deadlock-freedom. Simulation results demonstrate that the proposed algorithms improve both the performance and the stability of the networks.
{"title":"Routing algorithms based on 2D turn model for irregular networks","authors":"A. Jouraku, M. Koibuchi, H. Amano, Akira Funahashi","doi":"10.1109/ISPAN.2002.1004296","DOIUrl":"https://doi.org/10.1109/ISPAN.2002.1004296","url":null,"abstract":"In order to solve traffic unbalancing caused by up*/down* routing for irregular networks, a 2D direction is introduced into a spanning tree, and novel routing algorithms based on a 2D turn model are proposed. The proposed algorithms improve traffic balancing by carefully selecting prohibited turns for deadlock-freedom. Simulation results demonstrate that the proposed algorithms improve both the performance and the stability of the networks.","PeriodicalId":255069,"journal":{"name":"Proceedings International Symposium on Parallel Architectures, Algorithms and Networks. I-SPAN'02","volume":"130 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-08-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129750354","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 : 2002-08-07DOI: 10.1109/ISPAN.2002.1004274
Lenwood S. Heath
Networks of biological components are common in the life sciences. The annotation of such networks with experimental data and biological knowledge gives rise to a rich, though generally incomplete, semantics of a real biological phenomenon. One tool for investigating such networks is microarray technology, a modern window into patterns of gene expression in cells. Current bioinformatics work on gene expression data address mechanisms underlying successful responses to drought stress in plants, which naturally leads to problems involving biological networks. Some biological context precedes a discussion of these problems.
{"title":"Networks in bioinformatics","authors":"Lenwood S. Heath","doi":"10.1109/ISPAN.2002.1004274","DOIUrl":"https://doi.org/10.1109/ISPAN.2002.1004274","url":null,"abstract":"Networks of biological components are common in the life sciences. The annotation of such networks with experimental data and biological knowledge gives rise to a rich, though generally incomplete, semantics of a real biological phenomenon. One tool for investigating such networks is microarray technology, a modern window into patterns of gene expression in cells. Current bioinformatics work on gene expression data address mechanisms underlying successful responses to drought stress in plants, which naturally leads to problems involving biological networks. Some biological context precedes a discussion of these problems.","PeriodicalId":255069,"journal":{"name":"Proceedings International Symposium on Parallel Architectures, Algorithms and Networks. I-SPAN'02","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-08-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128758339","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 : 2002-08-07DOI: 10.1109/ISPAN.2002.1004289
P. Tang, P. Yew
Induction variable analysis is an important part of the symbolic analysis in parallelizing compilers. Induction variables can be formed by FOR or DO loops within procedures or loops of recursive procedure calls. This paper presents an algorithm to find induction variables in formal parameters of procedures caused by recursive procedure calls. The compile-time knowledge of induction variables in formal parameters is essential to summarize array sections to be used for data dependency testing and parallelization.
{"title":"Interprocedural induction variable analysis","authors":"P. Tang, P. Yew","doi":"10.1109/ISPAN.2002.1004289","DOIUrl":"https://doi.org/10.1109/ISPAN.2002.1004289","url":null,"abstract":"Induction variable analysis is an important part of the symbolic analysis in parallelizing compilers. Induction variables can be formed by FOR or DO loops within procedures or loops of recursive procedure calls. This paper presents an algorithm to find induction variables in formal parameters of procedures caused by recursive procedure calls. The compile-time knowledge of induction variables in formal parameters is essential to summarize array sections to be used for data dependency testing and parallelization.","PeriodicalId":255069,"journal":{"name":"Proceedings International Symposium on Parallel Architectures, Algorithms and Networks. I-SPAN'02","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-08-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120898718","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 : 2002-08-07DOI: 10.1109/ISPAN.2002.1004264
V. Li, W. Liao
Advances in information technologies have made it possible to have Personal Information Service, i.e., personalized multimedia information available anywhere, anytime. Such ubiquitous access requires that a portion of the underlying network infrastructure be wireless. Therefore, a number of challenges associated with operating a wireless multimedia network must be overcome. In this paper we have. identified these challenges and some solutions.
{"title":"Wireless multimedia networks","authors":"V. Li, W. Liao","doi":"10.1109/ISPAN.2002.1004264","DOIUrl":"https://doi.org/10.1109/ISPAN.2002.1004264","url":null,"abstract":"Advances in information technologies have made it possible to have Personal Information Service, i.e., personalized multimedia information available anywhere, anytime. Such ubiquitous access requires that a portion of the underlying network infrastructure be wireless. Therefore, a number of challenges associated with operating a wireless multimedia network must be overcome. In this paper we have. identified these challenges and some solutions.","PeriodicalId":255069,"journal":{"name":"Proceedings International Symposium on Parallel Architectures, Algorithms and Networks. I-SPAN'02","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-08-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121848027","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 : 2002-08-07DOI: 10.1109/ISPAN.2002.1004269
A. Harwood, Hong Shen
Since it is widely accepted that self-organization is difficult to achieve using constructive or centrally run algorithms, a random hierarchy is proposed that intrinsically facilitates self-organization. The random hierarchy consists of each node in the network independently choosing a rank at random such that a mean 2(/spl Delta/-1)/spl Delta//sup i-1/ nodes have rank i, where /spl Delta/ is a network wide hierarchy parameter. Each node of rank i chooses the nearest node of rank i-1 as its leader which forms the hierarchy. The mean and variance of the relevant properties is derived, for example it is shown that each leader has a mean A followers. Simulations were used to demonstrate the effectiveness of the proposed hierarchy and a "bare-bones" set of procedures where provided that may be used to implement the hierarchy over a network of autonomous nodes in a robust way.
{"title":"Random hierarchies that facilitate self-organization","authors":"A. Harwood, Hong Shen","doi":"10.1109/ISPAN.2002.1004269","DOIUrl":"https://doi.org/10.1109/ISPAN.2002.1004269","url":null,"abstract":"Since it is widely accepted that self-organization is difficult to achieve using constructive or centrally run algorithms, a random hierarchy is proposed that intrinsically facilitates self-organization. The random hierarchy consists of each node in the network independently choosing a rank at random such that a mean 2(/spl Delta/-1)/spl Delta//sup i-1/ nodes have rank i, where /spl Delta/ is a network wide hierarchy parameter. Each node of rank i chooses the nearest node of rank i-1 as its leader which forms the hierarchy. The mean and variance of the relevant properties is derived, for example it is shown that each leader has a mean A followers. Simulations were used to demonstrate the effectiveness of the proposed hierarchy and a \"bare-bones\" set of procedures where provided that may be used to implement the hierarchy over a network of autonomous nodes in a robust way.","PeriodicalId":255069,"journal":{"name":"Proceedings International Symposium on Parallel Architectures, Algorithms and Networks. I-SPAN'02","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-08-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128363789","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 : 2002-08-07DOI: 10.1109/ISPAN.2002.1004285
D. W. Bass, I. H. Sudborough
The links of the hypercube Q/sub n/ can be partitioned into multiple link-disjoint spanning subnetworks, or factors. Each of these factors could simulate Q/sub n/. We therefore identify k-factorizations, or partitions of the links of Q/sub n/ into factors of degree k, where (1) the factorization exists for all values of n such that n mod k=0, (2) k is as small as possible, (3) the n/k factors have a similar structure, (4) the factors have as small a diameter as possible, and (5) the factors host Q/sub n/ with as small a dilation as possible. In this paper, we give an (n/2)-factorization of Q/sub n/, where n is even, generated by variations on reduced and thin hypercubes. The two factors are isomorphic, and both of the factors have diameter n+2. The diameter is an improvement over the best result known. Both of the factors also host Q/sub n/ with /spl Theta/(1) dilation.
{"title":"Symmetric k-factorizations of hypercubes with factors of small diameter","authors":"D. W. Bass, I. H. Sudborough","doi":"10.1109/ISPAN.2002.1004285","DOIUrl":"https://doi.org/10.1109/ISPAN.2002.1004285","url":null,"abstract":"The links of the hypercube Q/sub n/ can be partitioned into multiple link-disjoint spanning subnetworks, or factors. Each of these factors could simulate Q/sub n/. We therefore identify k-factorizations, or partitions of the links of Q/sub n/ into factors of degree k, where (1) the factorization exists for all values of n such that n mod k=0, (2) k is as small as possible, (3) the n/k factors have a similar structure, (4) the factors have as small a diameter as possible, and (5) the factors host Q/sub n/ with as small a dilation as possible. In this paper, we give an (n/2)-factorization of Q/sub n/, where n is even, generated by variations on reduced and thin hypercubes. The two factors are isomorphic, and both of the factors have diameter n+2. The diameter is an improvement over the best result known. Both of the factors also host Q/sub n/ with /spl Theta/(1) dilation.","PeriodicalId":255069,"journal":{"name":"Proceedings International Symposium on Parallel Architectures, Algorithms and Networks. I-SPAN'02","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-08-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129813239","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 : 2002-08-07DOI: 10.1109/ISPAN.2002.1004255
Min-Te Sun, Chung-Kuo Chang, T. Lai
The emerging Bluetooth standard is considered to be the most promising technology to construct ad-hoc networks. It contains specifications of how to build a piconet but left out details of how to automatically construct a scatternet from the piconets. Existing solutions only discussed the scatternet formation issue without considering the ease of routing in such a scatternet. We present algorithms to embed b-trees into a scatternet which enables such a network to become self-routing. It requires only a fixed-size message header and no routing table at each node regardless of the size of the scatternet. These properties make our solution scalable to deal with networks of large sizes. Our solutions are of distributed control and asynchronous. We prove that our algorithm preserves the b-tree property when devices join or leave the scatternet and when one scatternet is merged with another.
{"title":"A self-routing topology for Bluetooth scatternets","authors":"Min-Te Sun, Chung-Kuo Chang, T. Lai","doi":"10.1109/ISPAN.2002.1004255","DOIUrl":"https://doi.org/10.1109/ISPAN.2002.1004255","url":null,"abstract":"The emerging Bluetooth standard is considered to be the most promising technology to construct ad-hoc networks. It contains specifications of how to build a piconet but left out details of how to automatically construct a scatternet from the piconets. Existing solutions only discussed the scatternet formation issue without considering the ease of routing in such a scatternet. We present algorithms to embed b-trees into a scatternet which enables such a network to become self-routing. It requires only a fixed-size message header and no routing table at each node regardless of the size of the scatternet. These properties make our solution scalable to deal with networks of large sizes. Our solutions are of distributed control and asynchronous. We prove that our algorithm preserves the b-tree property when devices join or leave the scatternet and when one scatternet is merged with another.","PeriodicalId":255069,"journal":{"name":"Proceedings International Symposium on Parallel Architectures, Algorithms and Networks. I-SPAN'02","volume":"83 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-08-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130719762","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 : 2002-08-07DOI: 10.1109/ISPAN.2002.1004270
Allan K. Y. Wong, May T. W. Ip, T. Dillon
In this paper the M/sup 3/RT (Micro Mean Message Roundtrip Time) IEPM (Internet end-to-end performance measurement) tool is proposed for supporting agent/object mobility in mobile-agent-based real-time applications. If an agent finds that the service roundtrip time (RTT) is too long, then it may try to cut it down by migrating to another idle node. Since migration is an expensive activity, the agent should decide correctly before making the move. One way of achieving sound decision making is to measure the mean RTT of the channel and to ensure that the RTT up-trend is not a transient phenomenon. The M/sup 3/RT works on past history accumulated since the commencement of the channel operation. It never has computation overflow because of it integral nature. In the M/sup 3/RT development process the corresponding time/stochastic Petri net model was built for exhaustive verification. The aim is to ensure that convergence stability exists under all conditions. The input waveforms used in the simulations mimic the dynamic reality of a sizeable network such as the Internet. Preliminary and limited validation tests in a controlled environment indicate that the M/sup 3/RT works equally well as its macro predecessor, namely, the stable M/sup 2/RT (Mean Message Roundtrip Time) package.
{"title":"M/sup 3/RT: an Internet end-to-end performance measurement approach for real-time applications with mobile agents","authors":"Allan K. Y. Wong, May T. W. Ip, T. Dillon","doi":"10.1109/ISPAN.2002.1004270","DOIUrl":"https://doi.org/10.1109/ISPAN.2002.1004270","url":null,"abstract":"In this paper the M/sup 3/RT (Micro Mean Message Roundtrip Time) IEPM (Internet end-to-end performance measurement) tool is proposed for supporting agent/object mobility in mobile-agent-based real-time applications. If an agent finds that the service roundtrip time (RTT) is too long, then it may try to cut it down by migrating to another idle node. Since migration is an expensive activity, the agent should decide correctly before making the move. One way of achieving sound decision making is to measure the mean RTT of the channel and to ensure that the RTT up-trend is not a transient phenomenon. The M/sup 3/RT works on past history accumulated since the commencement of the channel operation. It never has computation overflow because of it integral nature. In the M/sup 3/RT development process the corresponding time/stochastic Petri net model was built for exhaustive verification. The aim is to ensure that convergence stability exists under all conditions. The input waveforms used in the simulations mimic the dynamic reality of a sizeable network such as the Internet. Preliminary and limited validation tests in a controlled environment indicate that the M/sup 3/RT works equally well as its macro predecessor, namely, the stable M/sup 2/RT (Mean Message Roundtrip Time) package.","PeriodicalId":255069,"journal":{"name":"Proceedings International Symposium on Parallel Architectures, Algorithms and Networks. I-SPAN'02","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-08-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129314663","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 : 2002-08-07DOI: 10.1109/ISPAN.2002.1004305
W. Bein, L. Larmore, S. Latifi, I. H. Sudborough
Block sorting is used in connection with optical character recognition (OCR). Recent work has focused on finding good strategies which work in practice. We show that optimizing block sorting is NP-hard. Along with this result, we give new non-trivial lower bounds. These bounds can be computed efficiently. We define the concept of local property algorithms and show that several previously published block sorting algorithms fall into this class.
{"title":"Block sorting is hard","authors":"W. Bein, L. Larmore, S. Latifi, I. H. Sudborough","doi":"10.1109/ISPAN.2002.1004305","DOIUrl":"https://doi.org/10.1109/ISPAN.2002.1004305","url":null,"abstract":"Block sorting is used in connection with optical character recognition (OCR). Recent work has focused on finding good strategies which work in practice. We show that optimizing block sorting is NP-hard. Along with this result, we give new non-trivial lower bounds. These bounds can be computed efficiently. We define the concept of local property algorithms and show that several previously published block sorting algorithms fall into this class.","PeriodicalId":255069,"journal":{"name":"Proceedings International Symposium on Parallel Architectures, Algorithms and Networks. I-SPAN'02","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-08-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121850417","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
扫码关注我们
求助内容：
应助结果提醒方式：