Pub Date : 1998-12-14DOI: 10.1109/ICPADS.1998.741105
Wen-Tsuen Chen, Wen Lin, Shi Chen
To support multimedia traffic consisting of diverse traffic classes for mobile devices, a traffic management scheme should be developed to provide a seamless wireless ATM based communication system. We propose a novel traffic management scheme based on the Packet Reservation Multiple Access (PRMA) protocol to support QoS guarantee for downlink traffic. The proposed traffic management scheme involves cell scheduling, buffer management, traffic shaping, traffic control, and flow control. The simulation results reveal that the proposed scheme can guarantee QoS (cell delay and cell loss ratio) for both real time (CBR, VBR) and non real time (ABR) traffic in the wireless ATM networks, reduce the buffer size in the Base Station (BS), and enhance the utilization of wireless bandwidth.
{"title":"Traffic management for wireless ATM networks","authors":"Wen-Tsuen Chen, Wen Lin, Shi Chen","doi":"10.1109/ICPADS.1998.741105","DOIUrl":"https://doi.org/10.1109/ICPADS.1998.741105","url":null,"abstract":"To support multimedia traffic consisting of diverse traffic classes for mobile devices, a traffic management scheme should be developed to provide a seamless wireless ATM based communication system. We propose a novel traffic management scheme based on the Packet Reservation Multiple Access (PRMA) protocol to support QoS guarantee for downlink traffic. The proposed traffic management scheme involves cell scheduling, buffer management, traffic shaping, traffic control, and flow control. The simulation results reveal that the proposed scheme can guarantee QoS (cell delay and cell loss ratio) for both real time (CBR, VBR) and non real time (ABR) traffic in the wireless ATM networks, reduce the buffer size in the Base Station (BS), and enhance the utilization of wireless bandwidth.","PeriodicalId":226947,"journal":{"name":"Proceedings 1998 International Conference on Parallel and Distributed Systems (Cat. No.98TB100250)","volume":"36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-12-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129982589","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 : 1998-12-14DOI: 10.1109/ICPADS.1998.741104
L. Barolli, A. Koyama, Shiho Motegi, Shoichi Yokoyama
The Asynchronous Transfer Mode (ATM) has been standardized and widely accepted as a technique to support future B-ISDN networks. In ATM networks, traffic control design becomes an important challenge, because of the diverse services support and the need for efficient network resource engineering. Two important functions for traffic control in ATM networks are policing and routing. The goal of these two functions is to guarantee the required quality of service. So far, all studies have treated policing and routing in a separate way. The combination of policing and routing can guarantee a better quality of service and increase the network utilization. Traditional network control strategies are not well suited for high speed networks. Use of intelligent algorithms based on fuzzy logic, neural networks and genetic algorithms can prove to be efficient for traffic control in ATM networks. We propose an intelligent policing-routing mechanism based on fuzzy logic and genetic algorithms. Performance evaluation via simulations shows that the proposed mechanism performs better than conventional policing mechanisms and routing algorithms.
{"title":"An intelligent policing-routing mechanism based on fuzzy logic and genetic algorithms","authors":"L. Barolli, A. Koyama, Shiho Motegi, Shoichi Yokoyama","doi":"10.1109/ICPADS.1998.741104","DOIUrl":"https://doi.org/10.1109/ICPADS.1998.741104","url":null,"abstract":"The Asynchronous Transfer Mode (ATM) has been standardized and widely accepted as a technique to support future B-ISDN networks. In ATM networks, traffic control design becomes an important challenge, because of the diverse services support and the need for efficient network resource engineering. Two important functions for traffic control in ATM networks are policing and routing. The goal of these two functions is to guarantee the required quality of service. So far, all studies have treated policing and routing in a separate way. The combination of policing and routing can guarantee a better quality of service and increase the network utilization. Traditional network control strategies are not well suited for high speed networks. Use of intelligent algorithms based on fuzzy logic, neural networks and genetic algorithms can prove to be efficient for traffic control in ATM networks. We propose an intelligent policing-routing mechanism based on fuzzy logic and genetic algorithms. Performance evaluation via simulations shows that the proposed mechanism performs better than conventional policing mechanisms and routing algorithms.","PeriodicalId":226947,"journal":{"name":"Proceedings 1998 International Conference on Parallel and Distributed Systems (Cat. No.98TB100250)","volume":"71 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-12-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122251616","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 : 1998-12-14DOI: 10.1109/ICPADS.1998.741048
Yongjun Im, Yanghee Choi
We present a distributed multicast algorithm for constructing minimum cost multicast trees with delay constraints. The proposed algorithm, which provides multicasting and guaranteed end-to-end delay bound at the network layer, is also designed to find a reduced cost routing tree. The proposed algorithm requires limited network state information and the routing tree is computed through a single round of message exchanges between network nodes. We prove the algorithm's correctness by showing that it is always capable of constructing a delay constrained multicast tree, if one exists. The algorithm is verified by simulation, and it is shown that it exhibits superior performance compared to existing ones for the tree cost measure.
{"title":"A distributed multicast routing algorithm for delay-sensitive applications","authors":"Yongjun Im, Yanghee Choi","doi":"10.1109/ICPADS.1998.741048","DOIUrl":"https://doi.org/10.1109/ICPADS.1998.741048","url":null,"abstract":"We present a distributed multicast algorithm for constructing minimum cost multicast trees with delay constraints. The proposed algorithm, which provides multicasting and guaranteed end-to-end delay bound at the network layer, is also designed to find a reduced cost routing tree. The proposed algorithm requires limited network state information and the routing tree is computed through a single round of message exchanges between network nodes. We prove the algorithm's correctness by showing that it is always capable of constructing a delay constrained multicast tree, if one exists. The algorithm is verified by simulation, and it is shown that it exhibits superior performance compared to existing ones for the tree cost measure.","PeriodicalId":226947,"journal":{"name":"Proceedings 1998 International Conference on Parallel and Distributed Systems (Cat. No.98TB100250)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-12-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129492247","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 : 1998-12-14DOI: 10.1109/ICPADS.1998.741168
A. Koulouris, N. Koziris, T. Andronikos, G. Papakonstantinou, P. Tsanakas
We propose a fixed size one dimensional VLSI architecture for the parallel parsing of arbitrary context free (CF) grammars, based on Earley's algorithm. The algorithm is transformed into an equivalent double nested loop with loop carried dependencies. We first map the algorithm into a 1D array with unbounded number of cells. The time complexity of this architecture is O(n), which is optimal. We next propose the partitioning into a fixed number of off the shelf processing elements. Two alternative partitioning strategies are presented considering restrictions, not only in the number of the cells, but also in the inner structure of each cell. In the most restricted case, the proposed architecture has time complexity O(n/sup 3//p*k), where p is the number of available cells and the elements inside each cell are at most k.
{"title":"A parallel parsing VLSI architecture for arbitrary context free grammars","authors":"A. Koulouris, N. Koziris, T. Andronikos, G. Papakonstantinou, P. Tsanakas","doi":"10.1109/ICPADS.1998.741168","DOIUrl":"https://doi.org/10.1109/ICPADS.1998.741168","url":null,"abstract":"We propose a fixed size one dimensional VLSI architecture for the parallel parsing of arbitrary context free (CF) grammars, based on Earley's algorithm. The algorithm is transformed into an equivalent double nested loop with loop carried dependencies. We first map the algorithm into a 1D array with unbounded number of cells. The time complexity of this architecture is O(n), which is optimal. We next propose the partitioning into a fixed number of off the shelf processing elements. Two alternative partitioning strategies are presented considering restrictions, not only in the number of the cells, but also in the inner structure of each cell. In the most restricted case, the proposed architecture has time complexity O(n/sup 3//p*k), where p is the number of available cells and the elements inside each cell are at most k.","PeriodicalId":226947,"journal":{"name":"Proceedings 1998 International Conference on Parallel and Distributed Systems (Cat. No.98TB100250)","volume":"95 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-12-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122369249","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 : 1998-12-14DOI: 10.1109/ICPADS.1998.741170
Takashi Watanabe, A. Mori
When distributed object technology is used in a wide area network, an object may not be accessed efficiently, due to a large communication delay. For this problem, we have proposed a Replicated Object Relocation Protocol (RORP), where the replicated object is relocated to an intermediate site, considering the communication delay, the processing ability of the servers, the reference frequency of the objects, the time of object transmission, the domain and the limited number of replications. This paper overviews the protocol and discusses its performance through the implementation of a RORP prototype. We evaluate the client-oriented replication scheme by the amount of processing distributed to the clients, the intermediate sites and the servers. Then, the paper shows how RORP enables a reduction in the response time and the total network traffic, including control messages and object retrieval messages.
{"title":"Distributed object relocation protocol for wide area networks","authors":"Takashi Watanabe, A. Mori","doi":"10.1109/ICPADS.1998.741170","DOIUrl":"https://doi.org/10.1109/ICPADS.1998.741170","url":null,"abstract":"When distributed object technology is used in a wide area network, an object may not be accessed efficiently, due to a large communication delay. For this problem, we have proposed a Replicated Object Relocation Protocol (RORP), where the replicated object is relocated to an intermediate site, considering the communication delay, the processing ability of the servers, the reference frequency of the objects, the time of object transmission, the domain and the limited number of replications. This paper overviews the protocol and discusses its performance through the implementation of a RORP prototype. We evaluate the client-oriented replication scheme by the amount of processing distributed to the clients, the intermediate sites and the servers. Then, the paper shows how RORP enables a reduction in the response time and the total network traffic, including control messages and object retrieval messages.","PeriodicalId":226947,"journal":{"name":"Proceedings 1998 International Conference on Parallel and Distributed Systems (Cat. No.98TB100250)","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-12-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126177163","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 : 1998-12-14DOI: 10.1109/ICPADS.1998.741038
S. Tagashira, Fumitake Inada, K. Saisho, Akira Fukuda
The bandwidth problem between a mobile computer and an access point is pointed out, and a copy update mechanism, which can make the best use of the limited bandwidth, is proposed. If the bandwidth of a network is not sufficient, a mobile computer cannot announce all resources, and cannot update some copies on fixed computers. To satisfy client's requests with given bandwidth as much as possible, the proposed mechanism limits traffic of storage type resources in order to announce non-storage type resources prior to storage type resources. Traffic is controlled by limiting the number of concurrent update operations for announcing storage type resources. We implement the prototype and evaluate it. The results show that it can stably announce non-storage type resources.
{"title":"Design and implementation of a copy update mechanism on a mobile information announcement system","authors":"S. Tagashira, Fumitake Inada, K. Saisho, Akira Fukuda","doi":"10.1109/ICPADS.1998.741038","DOIUrl":"https://doi.org/10.1109/ICPADS.1998.741038","url":null,"abstract":"The bandwidth problem between a mobile computer and an access point is pointed out, and a copy update mechanism, which can make the best use of the limited bandwidth, is proposed. If the bandwidth of a network is not sufficient, a mobile computer cannot announce all resources, and cannot update some copies on fixed computers. To satisfy client's requests with given bandwidth as much as possible, the proposed mechanism limits traffic of storage type resources in order to announce non-storage type resources prior to storage type resources. Traffic is controlled by limiting the number of concurrent update operations for announcing storage type resources. We implement the prototype and evaluate it. The results show that it can stably announce non-storage type resources.","PeriodicalId":226947,"journal":{"name":"Proceedings 1998 International Conference on Parallel and Distributed Systems (Cat. No.98TB100250)","volume":"380 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-12-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115988953","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 : 1998-12-14DOI: 10.1109/ICPADS.1998.741030
Vilgot Claesson, S. Poledna, J. Söderberg
This paper presents a new conceptual model, the XBW-model. Distributed computing is becoming a cost effective way to implement safety critical control systems. To support the development of such systems the XBW conceptual model was developed. The model describes the time behavior and distribution properties of a system in such a way that static scheduling and systematic fault tolerance can be applied. The conceptual model also enables the definition of an appropriate fault model. This fault model along with the XBW-model allow efficient and systematic use of well known software based error detection methods. A distributed steer-by-wire control system is described, which is developed according to the model. The XBW-model is developed within in the European Brite-EuRam III project X-By-Wire.
{"title":"The XBW model for dependable real-time systems","authors":"Vilgot Claesson, S. Poledna, J. Söderberg","doi":"10.1109/ICPADS.1998.741030","DOIUrl":"https://doi.org/10.1109/ICPADS.1998.741030","url":null,"abstract":"This paper presents a new conceptual model, the XBW-model. Distributed computing is becoming a cost effective way to implement safety critical control systems. To support the development of such systems the XBW conceptual model was developed. The model describes the time behavior and distribution properties of a system in such a way that static scheduling and systematic fault tolerance can be applied. The conceptual model also enables the definition of an appropriate fault model. This fault model along with the XBW-model allow efficient and systematic use of well known software based error detection methods. A distributed steer-by-wire control system is described, which is developed according to the model. The XBW-model is developed within in the European Brite-EuRam III project X-By-Wire.","PeriodicalId":226947,"journal":{"name":"Proceedings 1998 International Conference on Parallel and Distributed Systems (Cat. No.98TB100250)","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-12-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114743787","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 : 1998-12-14DOI: 10.1109/ICPADS.1998.741169
Jang-sun Lee, Young-Kee Song
We propose user controllable I/O operations for scientific applications in parallel computing environments and explore the effects of them with some synthetic access patterns. The operations allow users to present numerous access patterns collectively with a minimum number of I/O requests. This enables systems to aggregate bandwidth of parallel disks, optimize disk head movements, and then increase I/O performance.
{"title":"User-controllable parallel I/O for scientific applications","authors":"Jang-sun Lee, Young-Kee Song","doi":"10.1109/ICPADS.1998.741169","DOIUrl":"https://doi.org/10.1109/ICPADS.1998.741169","url":null,"abstract":"We propose user controllable I/O operations for scientific applications in parallel computing environments and explore the effects of them with some synthetic access patterns. The operations allow users to present numerous access patterns collectively with a minimum number of I/O requests. This enables systems to aggregate bandwidth of parallel disks, optimize disk head movements, and then increase I/O performance.","PeriodicalId":226947,"journal":{"name":"Proceedings 1998 International Conference on Parallel and Distributed Systems (Cat. No.98TB100250)","volume":"39 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-12-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124438193","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 : 1998-12-14DOI: 10.1109/ICPADS.1998.741147
Ching-Hsien Hsu, Sheng-Wen Bai, Yeh-Ching Chung, Chu-Sing Yang
In many scientific applications, dynamic array redistribution is usually required to enhance the performance of an algorithm. We present a generalized basic cycle calculation (GBCC) method to efficiently perform a BLOCK-CYCLIC(s) over P processors to BLOCK-CYCLIC(t) over Q processors array redistribution. In the GBCC method, a processor first computes the source/destination processor/data sets of array elements in the first generalized basic cycle of the local array it owns. A generalized basic cycle is defined as lcm(sP,tQ)/(gcd(s,t)/spl times/P) in the source distribution and lcm(sP,tQ)/(gcd(s,t)/spl times/Q) in the destination distribution. From the source/destination processor/data sets of array elements in the first generalized basic cycle, we can construct packing/unpacking pattern tables. Based on the packing/unpacking pattern tables, a processor can pack/unpack array elements efficiently. To evaluate the performance of the GBCC method, we have implemented this method on an IBM SP2 parallel machine, along with the PITFALLS method and the ScaLAPACK method. The cost models for these three methods are also presented. The experimental results show that the GBCC method outperforms the PITFALLS method and the ScaLAPACK method for all test samples. A brief description of the extension of the GBCC method to multi dimensional array redistributions is also presented.
{"title":"A generalized basic cycle calculation method for efficient array redistribution","authors":"Ching-Hsien Hsu, Sheng-Wen Bai, Yeh-Ching Chung, Chu-Sing Yang","doi":"10.1109/ICPADS.1998.741147","DOIUrl":"https://doi.org/10.1109/ICPADS.1998.741147","url":null,"abstract":"In many scientific applications, dynamic array redistribution is usually required to enhance the performance of an algorithm. We present a generalized basic cycle calculation (GBCC) method to efficiently perform a BLOCK-CYCLIC(s) over P processors to BLOCK-CYCLIC(t) over Q processors array redistribution. In the GBCC method, a processor first computes the source/destination processor/data sets of array elements in the first generalized basic cycle of the local array it owns. A generalized basic cycle is defined as lcm(sP,tQ)/(gcd(s,t)/spl times/P) in the source distribution and lcm(sP,tQ)/(gcd(s,t)/spl times/Q) in the destination distribution. From the source/destination processor/data sets of array elements in the first generalized basic cycle, we can construct packing/unpacking pattern tables. Based on the packing/unpacking pattern tables, a processor can pack/unpack array elements efficiently. To evaluate the performance of the GBCC method, we have implemented this method on an IBM SP2 parallel machine, along with the PITFALLS method and the ScaLAPACK method. The cost models for these three methods are also presented. The experimental results show that the GBCC method outperforms the PITFALLS method and the ScaLAPACK method for all test samples. A brief description of the extension of the GBCC method to multi dimensional array redistributions is also presented.","PeriodicalId":226947,"journal":{"name":"Proceedings 1998 International Conference on Parallel and Distributed Systems (Cat. No.98TB100250)","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-12-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134373653","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 : 1998-12-14DOI: 10.1109/ICPADS.1998.741019
James B. Lim, A. Hurson
As technological advances are made in software and hardware, the feasibility of accessing information "anytime, anywhere" is becoming a reality. There are similarities involved in accessing information in a multidatabase environment and a mobile computing environment. We have discussed the characteristics of a wireless-mobile computing environment superimposed on a multidatabase system to realize a system capable of effectively accessing a large amount of data over a wireless medium. In order to limit the effects of the restrictions imposed by a mobile environment, data duplication is used at the mobile unit. The duplicated data at the mobile node provide additional availability in case of a weak connection or disconnection. In such an environment, it is important to retain the consistency between the data residing on fixed nodes and mobile nodes. Current research has concentrated on page- and file-based caching or replication schemes to address the availability and consistency issues in a mobile environment. In a mobile multidatabase environment, local autonomy restrictions prevent the use of a page- or file-based data duplication scheme. We propose a new data duplication scheme to address the limited bandwidth and local autonomy restrictions in such an environment. Queries and their associated data are cached at the mobile unit as a complete object. Consistency is maintained by using a parity-based invalidation scheme. Additionally, a simple prefetching scheme is used in conjunction with caching to further improve effectiveness of the proposed scheme.
{"title":"Data duplication and consistency in a mobile, multidatabase environment","authors":"James B. Lim, A. Hurson","doi":"10.1109/ICPADS.1998.741019","DOIUrl":"https://doi.org/10.1109/ICPADS.1998.741019","url":null,"abstract":"As technological advances are made in software and hardware, the feasibility of accessing information \"anytime, anywhere\" is becoming a reality. There are similarities involved in accessing information in a multidatabase environment and a mobile computing environment. We have discussed the characteristics of a wireless-mobile computing environment superimposed on a multidatabase system to realize a system capable of effectively accessing a large amount of data over a wireless medium. In order to limit the effects of the restrictions imposed by a mobile environment, data duplication is used at the mobile unit. The duplicated data at the mobile node provide additional availability in case of a weak connection or disconnection. In such an environment, it is important to retain the consistency between the data residing on fixed nodes and mobile nodes. Current research has concentrated on page- and file-based caching or replication schemes to address the availability and consistency issues in a mobile environment. In a mobile multidatabase environment, local autonomy restrictions prevent the use of a page- or file-based data duplication scheme. We propose a new data duplication scheme to address the limited bandwidth and local autonomy restrictions in such an environment. Queries and their associated data are cached at the mobile unit as a complete object. Consistency is maintained by using a parity-based invalidation scheme. Additionally, a simple prefetching scheme is used in conjunction with caching to further improve effectiveness of the proposed scheme.","PeriodicalId":226947,"journal":{"name":"Proceedings 1998 International Conference on Parallel and Distributed Systems (Cat. No.98TB100250)","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-12-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133083464","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
扫码关注我们
求助内容：
应助结果提醒方式：