Etsuko Yajimay Takahiro Haraz Masahiko Tsukamotoz Shojiro Nishioz. ysales Department, Tokyo Oce, FM Osaka Co., Ltd.
|
|
- Rhoda Miller
- 5 years ago
- Views:
Transcription
1 Scheduling and Caching Strategies for Correlated Data in Push-based Information Systems 3 Etsuko Yajimay Takahiro Haraz Masahiko Tsukamotoz Shojiro Nishioz ysales Department, Tokyo Oce, FM Osaka Co., Ltd. yajima@fmosaka.net zdept. of Information Systems Eng., Graduate School of Engineering, Osaka University fhara,tuka,nishiog@ise.eng.osaka-u.ac.jp ABSTRACT Recently, there has been increasing interest in information systems that deliver data using broadcast in both wired and wireless environments. The strategy in which a server repeatedly broadcasts data to clients can result in a larger throughput, and various methods have been studied to reduce the average response time to data requests in such systems. In this paper, we propose a strategy for scheduling the broadcast program which takes into account the correlation among data items. This strategy puts data items with strong correlation side by side in the broadcast program in order to reduce the average response time. We also propose a caching strategy which extends a conventional caching strategy so that it can take advantage of correlation among broadcast data items for greater eciency. Finally, we use simulation studies to evaluate the performance of our proposed strategies. Keywords: data broadcast, data correlation, scheduling strategy, caching strategy 1 INTRODUCTION Recently, there has been increasing interest in data delivery mechanisms in which a server repetitively broadcasts various data to clients using a broad bandwidth, called \pushbased" data delivery mechanisms. As shown in Figure 1, in a system that uses a \push-based" mechanism, each client can access a piece of data by waiting for its data broadcast period. In contrast, when conventional \pull-based" mechanisms are used, servers deliver data by separately responding to every request message sent by each client. One remarkable advantage of the \push-based" delivery mechanism is higher throughput for data access in distributed systems with a large number of clients, since the absence of commu- 3 This research was supported in part by Research for the Future Program of Japan Society for the Promotion of Science under the Project \Advanced Multimedia Content Processing" (Project No. JSPS-RFTF97P00501) and Grant-in-Aid for Scientic Research numbered from Japan Society for the Promotion of Science. Server Broadcast Data1 Data Stream Clients Figure 1: Information system based on message broadcast. nication contention among the clients requesting data means that they can eciently share the bandwidth[6, 8, 12, 18]. Information broadcast systems are good applications of \push-based" mechanisms. In these systems, the server's clients are typically portable computers, desktop computers, or electrical household appliances. The following are some scenarios in which information broadcast systems could be useful: In a shopping center, store directories could be broadcast, enabling customers with portable computers to view them to select which shops to enter. In a train station, up-to-date schedules could be broadcast. Passengers with portable computers could receive and store the information. At home, PCs could automatically receive digital data of various media (image, audio, text) through satellite communication, ground communication, or cable TV communication. The data could include news, online shopping, hit charts, commercial advertisements, sports, automatic software updates and video-on-demand. User-customizable machines would be capable of ltering the necessary information before storage. 5 4 Several strategies have been proposed to improve the performance of these information systems. These strategies are categorized into the following research elds:
2 1. Scheduling strategies at servers This research eld includes two notable research areas. One area concentrates on strategies to shorten the response time[1, 14, 16, 17, 22, 24, 25, 26, 29, 30]. If the global access probability diers for each data item, additional bandwidth should be allocated for data with a higher access probability. Hence, the broadcast period of the data becomes shorter, and therefore, the average response time is expected to be shorter. In relation to these strategies, a statistical estimation model of access frequencies in \push-based" systems has been proposed in [31]. The other area concentrates on strategies to save the power of mobile hosts[9, 19, 20, 21]. Since mobile hosts such as palmtop computers are not connected to a direct power source, power conservation is one of the most important issues in mobile computing environments. This research area aims to conserve the power of mobile hosts by indexing the broadcast program and hence reducing the monitoring time of broadcast data. 2. Caching strategies at clients This research eld aims to shorten the response by caching parts of the broadcast data at the client[1, 2, 15, 28]. 3. Combination of \push-based" and \pull-based" data delivery mechanisms Only data with high access probabilities from clients are broadcast, while the rest are transferred using a \pull-based" data delivery mechanism[5, 21]. This strategy shortens the broadcast periods for data with high access probabilities; therefore, its response time is expected to be shorter. Moreover, the response time is also expected to be shorter for data with low access probabilities since in a pure \push-based" strategy, their broadcast periods are very long. 4. Dissemination of Updates In an application such as a weather service, the information from a server often changes. In this case, updated information should be disseminated to clients at some periodic rate. Several strategies to disseminate information updates have been proposed [3, 5, 10, 13, 27]. Although correlation generally exists among broadcast data (e.g., clients request accesses to certain sets of data at the same time), these conventional strategies do not take it into account. When clients frequently access a set of correlated data, the scheduling and caching strategies which take the correlation into account can reduce the response time for data accesses. In this paper, we propose new scheduling and caching strategies which do just that. We then evaluate the performances of our proposed strategies. The following system environment is assumed: The system has a single server. Data is handled in clusters called data items. All data items are the same size. The server creates a broadcast program consisting of data items (ID: 1; 111;M). The program is repeatedly broadcast. Neither the data items nor the broadcast program is updated. All clients know the broadcast program precisely. This may be accomplished by broadcasting program information when the program is created. The access probabilities and the correlation of data items dier for each client, and each client knows its own access probabilities and the correlation. The remainder of the paper is organized as follows: In section 2, correlation among broadcast data items is described. New scheduling and caching strategies are proposed in section 3 and 4, respectively. Simulation results are shown in section 5. Finally, in section 6, we summarize this paper. 2 CORRELATION AMONG DATA ITEMS In a real environment, clients often access certain sets of data collectively. We dene the term \correlation" as the probability that the client sequentially accesses a certain set of data items. As the correlation increases, so does the probability that a particular set of data items will be accessed together. The correlation diers for each set of data items. A client may access a set of correlated data items in two ways. Firstly, the client submits multiple access requests at the same time. This includes the case where the intervals between successive requests are smaller enough than the broadcast period of one program cycle so that they can be ignored. For example, if a server broadcasts HTML les and images of various home pages separately as data items, a client often issues simultaneous requests for data items of an HTML le and image les that form a single page. Secondly, the client accesses a set of correlated data items by submitting access requests at some intervals. For example, if a server broadcasts various home pages as data items, a user (client) often refers to a certain page for a while and then refers to one of the pages linked from the rst page. Moreover, if binary les of various tools are broadcast, a user often uses a word processor for a while in order to produce a document and then uses a drawing tool in order to create some gures in the document. In this paper, we assume the rst way { i.e., the client submits multiple access requests at the same time. Moreover, for the purpose of simplicity, we assume that each client issues access requests for two correlated data items at the same time. In general, correlation among data items is complex so that a graph consisting of vertices representing individual data items and edges linking to correlated data items does not become a tree but a network topology. Thus, in order to reduce the response time to access sets of correlated data items, it seems wise to employ scheduling and caching strategies which consider this complex correlation. 3 SCHEDULING STRATEGIES FOR CORRELAT- ED DATA ITEMS In this section, rst we describe the conventional scheduling strategies. Then, we propose a new strategy that takes into account the correlation among data items. 3.1 Conventional Scheduling Strategies Generally, the probability that a data item will be accessed depends on the client. It has been reported that each client
3 M a D ij i j b W ab f Time Time Figure 2: A broadcast program. c d e a c e f b d Program issues data accesses to 20% of data items with 80% probability[1]. As for the access pattern of the global system, it is generally skewed. Thus, in the conventional scheduling strategies, the server frequently broadcasts data items with high access probabilities. In [1], it is mentioned that the broadcast order of data items does not inuence the average response time when the broadcast period of each item is properly chosen and remains unchanged in every broadcast cycle. An exception to this case occurs when the clients have caches and use prefetching-based caching strategies. However, in [1], the correlation among data items is not taken into account. Because it seems to be quite general that there is correlation among data items, scheduling strategies which take into account that correlation are expected to shorten the average response time for data accesses. 3.2 CBS (Correlation-Based Scheduling) Strategy In this subsection, we propose the CBS (Correlation-Based Scheduling) strategy, which takes into account the correlation among data items. For the purpose of simplicity, we assume that each data item is broadcast only once in a cycle of a program. In this case, the problem of scheduling a periodic broadcast program is equivalent to the problem of selecting a Hamiltonian circuit from a complete graph consisting of vertices representing each data item and ordering the data items along the circuit. Here, a Hamiltonian circuit means a circuit in which each vertex in the given graph appears exactly once. Let M denote the total number of data items that the server broadcasts in a program. Let L denote the time required to broadcast a single data item, and let D ij denote the number of data items that are broadcast between items i (j) and j (i) in a program (0 D ij M 0 2, and D ij = D ji) (see Figure 2). If a client does not have a cache, the average response time, avg ij, when a client requests two arbitrary items i and j at the same time is represented by the following equation: avg ij = Dij M 1fDij +(M 0 Dij 0 1)gL 2 + M 0 Dij 0 2 M + 2 M 1 (M )L 1f M 0 Dij (D ij +1)gL = L M fdij(m 0 Dij 0 2)g + L(M 2 +2M 0 2) 2M The rst term of the center member in equation (1) represents the average response time to data access requests which are issued after i is broadcast and before j is broadcast in the cycle of the program. Similarly, the second term (1) Figure 3: An example of executing the CBS strategy. represents the average response time to requests which are issued after j is broadcast and before i is broadcast in the next cycle, and the third term represents the average response time to access requests which are issued while item i or j is being broadcast. The right-hand side of equation (1) shows that avg ij is a function of D ij and that the rst term has to be minimized in order to minimize avg ij. IfD ij is either 0 or M 0 2, avg ij becomes minimum, since D ij takes an integer value from 0 to M 02. In both the case where D ij is 0 and the case where D ij is M 0 2, the items i and j are broadcast side by side in the program. However, as the number of data items which have the correlation with other items increases, it becomes very dicult to compose the optimal program by deciding which data items should be broadcast side by side, since the number of items which can be broadcast side by side is limited. Thus, we propose the following heuristic strategy, called CBS strategy, which composes a program by putting data items with stronger correlation side by side in the broadcast program. The CBS strategy: 1. A complete graph consisting of vertices representing all data items and edges is created such that an edge between items i and j is weighted W ij =10P ij. Here, P ij denotes the probability P that the clients request two items i and j at the same time { i.e., the correlation M between i and j ( j=i+1p M Pij =1,and Pij = i=1 P ji ). 2. A Hamiltonian circuit which gives the minimum total weight is selected. This is done by solving the traveling salesman problem (TSP) on the given graph. 3. Along the selected circuit, all items are put in a broadcast program. Figure 3 shows an example of composing a program using the CBS strategy. First, the graph shown in the left part of Figure 3 is created for the items represented by the letters a to f. Then, a Hamiltonian circuit which gives the minimum total weight is selected. By putting the data items in the same order as the circuit, a broadcast program can be composed as in the right part of the gure. Because the CBS strategy only considers the strength of correlation among data items which are put side by side, the program constructed by this strategy is not always optimal. Even so, the CBS strategy seems to greatly shorten the average response time.
4 Though the CBS strategy is much easier than the problem of composing the optimal program, the second step of this strategy is equal to the TSP. Ifthenumber of broadcast data items increases, the CBS strategy cannot be practically solved, since the TSP is an NP-complete problem. Algorithms which can solve the TSP heuristically and quickly have already been proposed and used in various elds of engineering[7, 11, 23]. Thus, we use a heuristic TSP algorithm when the number of broadcast data items is large. 4 CACHING STRATEGIES FOR CORRELATED DA- TA ITEMS Since both the correlation among data items and the data items' access probabilities depend on each client, the average response time of some clients may be very large because only the global access probabilities and correlation were taken into consideration. In this case, if the client has a cache, a suitable caching strategy for each client can improve its performance. In this section, rst, we describe the PT strategy [4] which is a typical conventional caching strategy. Then, we propose a new strategy which extends the PT strategy to consider the correlation among data items. 4.1 Conventional Prefetching-Based Caching Strategy Several caching strategies have been proposed so far to improve the average response time of information systems which use a \push-based" data delivery mechanism. These strategies can be classied into two categories: prefetching-based and non-prefetching-based, which are distinguished by the time when each data is replaced. In prefetching-based strategies, data items which seem to be important are prefetched into a cache in advance. It is generally supposed that prefetching-based strategies are more suitable for \push-based" information systems, since these strategies can reduce the average response time almost without any additional cost. The PT strategy is a typical prefetching-based strategy, and it gives the best performance among the conventional strategies proposed so far. Here is a brief explanation of the PT strategy. The PT strategy: 1. Every time a new item is broadcast, a PT value is assigned to each item that is in the cache and is currently broadcast. Here, let P 0 i denote the probability that item i will be requested, T i denote the broadcast period of item i, i denote the time that has passed since item i has been cached, and i denote the time remaining until i is broadcast next. The PT value X i which is assigned to item i is expressed as follows: X i = P 0 i 1 T i 0 P 0 i 1 i (= P 0 i 1 i) (2) The PT value takes a maximum value P 0 i 1 T i upon insertion into the cache and takes a minimum value 0 when it is broadcast next. 2. X j, which is the PT value of the newly broadcast item j, is compared with the lowest PT value, X min, inthe cache. 3. If X j is larger than X min, the item with the lowest PT value is removed from the cache and j is inserted. Otherwise, no cache replacement occurs. Time b e f a b c d e f g h Currently Broadcasting Cache 1cycle a b... Figure 4: Item sets C and Q i for item e. The PT value, X i, represents the average response time when a client accesses item i if it is not stored in the cache. Therefore, for a given item set in the cache, the replacement based on the PT value is optimal at the moment when each item is broadcast. Although this replacement is not always optimal in the long term, this strategy gives the best performance out of all of the conventional strategies. C Q 4.2 CBPT (Correlation-Based PT) Strategy When the correlation among data items is considered, it is also eective to remove from the cache the item which requires the shortest response time. Based on this fact, we propose the following caching strategy, called the CBPT (Correlation-Based PT) strategy, which extends the PT strategy to consider the correlation among data items. The CBPT strategy: 1. Every time a new item is broadcast, a CBPT value is assigned to each item that is in the cache and is currently broadcast. Here, let i denote the time remaining until the item i is broadcast next and P ij denote the probability that items i and j will be requested at the same time { i.e., the correlation between i and j. Moreover, let C denote the set of items which are in the cache and Q i denote the set of data items which will be broadcast before item i is broadcast next and which are not contained in C. The CBPT value of item i, Y i, is represented by the following equation: Y i = i 1 X X P ik + ( i 0 k) 1 P ik (3) k2q i k2c 2. Y j, which is the CBPT value of the newly broadcast item j, is compared with the lowest CBPT value, Y min, in the cache. 3. If Y j is larger than Y min, the item with the lowest CBPT value is removed from the cache and j is inserted into the cache. Otherwise, no cache replacement occurs. Figure 4 shows the sets C and Q i for computing the CBPT value of the item e when the item a is currently being broadcast in the program consisting of data items represented by the letters a to h and when the items b, e, and f are in the cache. The CBPT value, Y i, represents the average response time to a client's simultaneous requests for two items, i and one other arbitrary item, assuming that the item i is not e
5 stored in the cache. Therefore, for the given item set in the cache, the replacement based on the CBPT strategy is optimal at the moment when each item is broadcast. Similar to the PT strategy, although the replacement based on the CBPT strategy is not always optimal in the long term, this strategy seems to give a good performance for the same reasons. If we let P ii denote the probability that a client requests only one item i in equation (3), the CBPT strategy can still be used even if there is no correlation among the data items. The conventional PT strategy is a special case of the CBPT strategy where there is no correlation among data items. 5 PERFORMANCE EVALUATION In this section, we show the performance results from simulations of the CBS and CBPT strategies. The following assumptions were made for the simulation experiments: There exist 120 data items (item identiers: 1, 111, 120) which are each broadcast once according to the broadcast program. It takes 10 units of time to broadcast one item in the program. Although this value proportionally aects the response time, it has relatively little eect on the simulation results, so we choose this value arbitrarily. The probability that a client issues simultaneous requests for two items is 0.1 at each unit time. This value does not aect the response time, since the system's access frequency does not aect our proposed scheduling and caching strategies. Hence, this value is also chosen arbitrarily. The probability that two items i and j (i =1; 111; 120, j = 1; 111; 120) will be requested at the same time is expressed by an i-j element, P ij (P ij = P ji), in the access probability matrix (a 120 dimensional matrix). For the purpose of simplicity, it is assumed that P ii = 0 for each item i (i =1; 111; 120). The remaining elements are assigned either 0 or some positive value. In the simulations, the following two access probability matrices are used. MATRIX 1: All elements except for the diagonal ones (P ii, i =1; 111; 120) are assigned 0 or a constant value. The percentage of the elements which are not assigned 0 is a variable in the simulations in section and section 5.2. As the percentage of the elements which are not assigned 0 gets lower, the correlation between each two items becomes stronger. MATRIX 2: The data items are divided into several groups. The elements for every combination of two items in a group are assigned a positive value, and the rest of the elements are assigned 0. This means that the correlation exists only among data items which are in a same group. The positive value assigned to each element is selected randomly from three values: `large', `medium', and `small'. The ratio `large':`medium':`small' is 8:5:2. The number of groups is a variable in the simulation in section As the number of groups gets larger, the correlation range becomes smaller and each correlation becomes more conspicuous. Average Response Time Figure 5: Percent (%) CBS SCATTER Average response time of the CBS strategy (Simulation 1). 5.1 Evaluation of the CBS Strategy In this subsection, we evaluate the interval between the responses to two access requests which are issued at the same time. Evaluating the interval between two responses is suf- cient because the response time to the rst access does not depend on the employed scheduling strategy. Here, we call this interval the `response time' for simplicity. For comparison, we also evaluate the average response time of the random scheduling strategy which does not consider the correlation among data items Simulation 1 The average response times of the two strategies, the CBS strategy and the random scheduling strategy, using MA- TRIX 1 are compared, varying the ratio (%) of elements which are not 0 in the matrix. Figure 5 shows the result of this simulation. The horizontal axis indicates the percentage of elements which are not 0. In the graph, the random scheduling strategy is shown as `SCATTER'. The result shows that the CBS strategy gives shorter response times than the random scheduling strategy. Moreover, it also shows that the dierence in response time between two strategies increases as the percentage of elements which are not 0 gets smaller { i.e., as the correlation gets stronger Simulation 2 The average response times of the two strategies using MA- TRIX 2 is compared, varying the number of the item groups. Figure 6 shows the result of this simulation. The horizontal axis indicates the number of groups. The result shows that the CBS strategy gives shorter response times than the random scheduling strategy. Moreover, it also shows that the dierence in the performance between two strategies becomes larger as the number of groups becomes larger { i.e., as the correlation among data items becomes more conspicuous.
6 CBS SCATTER 500 CBPT PT Average Response Time Average Response Time Number of Groups Percent(%) Figure 6: Average response time of the CBS strategy (Simulation 2). Figure 7: Average response time of the CBPT strategy. 5.2 Evaluation of the CBPT Strategy In this subsection, the average response time of our proposed CBPT strategy is evaluated in the environment where the client has a cache and the size of the cache is 40 percent of the size of one program cycle. Figure 7 shows the simulation result using MATRIX 1, varying the ratio of the elements which are not P 0. For comparison, the average response time of the PT strategy is also shown, assigning each item to the value Pi 0 M = Pij as the access probability in order to j=1 compute the PT value. The horizontal axis indicates the percentage of the elements which are not 0. The result shows that the CBPT strategy gives better performance than the PT strategy, which is considered to give the best performance among the conventional strategies. In particular, the dierence in performance between the two strategies becomes larger as the correlation among data items gets stronger. Although in this paper the access requests for two items are issued at the same time, the CBPT strategy is expected to give even better performance when the access requests for more than two items are issued at the same time. This is because the CBPT strategy replaces the items in a cache based on the correlation among data items as well as the items' access probabilities. 6 CONCLUSION In this paper, we considered \push-based" information systems in which each client issues access requests for two correlated data items at the same time, and discussed the scheduling and the caching of broadcast data items that gives careful consideration to the correlation among data items. First, we proposed a scheduling strategy which puts data items with strong correlation side by side in the broadcast program in order to reduce the average response time. Then, we proposed a caching strategy which extends the conventional PT strategy so that it can take advantage of correlation among broadcast data for greater eciency. We also showed simulation results which we did to evaluate the eectiveness of our proposed strategies. The sim- ulation results show that correlation among data items is a signicant factor in system performance. As a part of our future work, we are planning to extend the CBS strategy to consider the broadcast frequencies of data items, since in the conventional scheduling strategies, the server frequently broadcasts data items which have high access probabilities. So far, we have assumed an environment in which each client issues access requests for two data items at the same time. However, in a real environment, there are also situations in which the client accesses a set of correlated data items with some intervals. We are now studying the scheduling and caching strategies for such cases. REFERENCES [1] Acharya, S., Alonso, R., Franklin, M., and Zdonik, S.: Broadcast Disks: Data Management for Asymmetric Communication Environments, Proc. ACM SIGMOD Conference, pp.199{210 (1995) [2] Acharya, S., Franklin, M., and Zdonik, S.: Dissemination-Based Data Delivery Using Broadcast Disks, IEEE Personal Communications, Vol.2, No.6, pp.50{60 (1995) [3] Acharya, S., Franklin, M., and Zdonik, S.: Disseminating Updates on Broadcast Disks, Proc. Int'l Conf. on Very Large Data Bases (VLDB'96), pp.354{365 (1996) [4] Acharya, S., Franklin, M., and Zdonik, S.: Prefetching from a Broadcast Disks, Proc. Int'l Conf. on Data Engineering (ICDE'96), pp.276{285 (1996) [5] Acharya, S., Franklin, M., and Zdonik, S.: Balancing Push and Pull for Data Broadcast, Proc. ACM SIG- MOD Conference, pp.183{194 (1997) [6] Ammar, M.H. and Wong, J.W.: On the Optimality of Cyclic Transmissions in Teletext Systems, IEEE Transactions on Communications, Vol.35, No.1, pp.68{ 73 (1987)
7 [7] Arora, S.: Polynomial Time Approximation Schemes for Euclidean Traveling Salesman and Other Geometric Problems, Journal of the ACM, Vol.45, No.5, pp.753{ 782 (1998) [8] Bowen, T.F., Gopal, G., Herman, G., Hickey, T., Lee, K.C., Manseld, W.H., Raitz, J., and Wienrib, A.: The Datacycle Architecture, Communications of the ACM, Vol.35, No.12, pp.71{81 (1992) [9] Chen, M.S., Yu, P.S., and Wu., K.L.: Indexed Sequential Data Broadcasting in Wireless Mobile Computing, Proc. Int'l Conf. on Distributed Computing Systems (ICDCS'97), pp.124{131 (1997) [10] Dao, S. and Perry, B.: Information Dissemination in Hybrid Satellite/Terrestrial Networks, IEEE Data Engineering Bulletin, Vol.19, No.3, pp.12{18 (1996) [11] Das, D., Kapoor, S., and Smid, M.: On the Complexity of Approximating Euclidean Traveling Salesman Tours and Minimum Spanning Trees, Algorithmica, Vol.19, pp.447{460 (1997) [12] David, K.: Polychannel Systems for Mass Digital Communication, Communications of the ACM, Vol.33, No.2, pp.141{151 (1990) [13] Franklin, M. and Zdonik, S.: Dissemination-Based Information Systems, Proc. IEEE Data Engineering Bulletin, Vol.19, No.3, pp.20{30 (1996) [14] Gondhalekar, V., Jain, R., and Werth, J.: Scheduling on Airdisks: Ecient Access to Personalized Information Services via Periodic Wireless Data Broadcast, Technical Report CS-TR-96-25, Univ. Texas at Austin, Dept. of Comp. Sci. (1996) [15] Grassi, V.: Prefetching Policies for Energy Saving and Latency Reduction in a Wireless Broadcast Data Delivery System, Proc. ACM Int'l Workshop on Modeling, Analysis and Simulation of Wireless and Mobile Systems (ACM MSWIS 2000), pp.77{84 (2000) [16] Hameed, S. and Vaidya, N.H.: Log-time Algorithms for Scheduling Single and Multiple Channel Data Broadcast, Proc. Int'l Conf. on Mobile Computing and Networking (MOBICOM 97), pp.90{99 (1997) [17] Hameed, S. and Vaidya, N.H.: Ecient Algorithm for Scheduling Data Broadcast, ACM-Baltzer Journal of Wireless Networks, Vol.5, No.3, pp.183{193 (1999) [18] Herman, G., Gopal, G., Lee, K., and Weinrib, A.: The Datacycle Architecture for Very High Throughput Database Systems, Proc. ACM SIGMOD Conference, pp.97{103 (1987) [19] Imielinski, T., Viswanathan, S., and Badrinath, B.R.: Energy Ecient Indexing On Air, Proc. ACM SIG- MOD Conference, pp.25{36 (1994) [20] Imielinski, T. and Badrinath, B.R.: Mobile Wireless Computing, Communications of the ACM, Vol.37, No.10, pp.20{28 (1994) [21] Imielinski, T., Viswanathan, S., and Badrinath, B.R.: Data on Air: Organization and Access, IEEE Transaction on Knowledge and Data Engineering, Vol.9, No.3, pp.353{372 (1997) [22] Jain, R. and Werth, J.: Airdisks and AirRAID : Modeling and Scheduling Periodic Wireless Data Broadcast (Extended Abstract), DIMACS Tech. Report 95-11, Rutgers University (1995) [23] Katayama, K. and Narihisa, H.: A New Iterated Local Search Algorithm Using Genetic Crossover for the Traveling Salesman Problem, Proc. ACM Symposium on Applied Computing (ACM SAC'99), pp.302{306 (1999) [24] Lin, L. and Xingming, Z.: Heuristic MultiDisk Scheduling for Data Broadcasting, Proc. Int'l Workshop on Satellite-Based Information Services (WOSBIS'97), pp.1{5 (1997) [25] Peng, W.C. and Chen, M.S.: Dynamic Generation of Data Broadcasting Programs for a Broadcast Disk Array in a Mobile Computing Environment, Proc. ACM Int'l Conf. on Information Knowledge Management (ACM CIKM 2000), pp.38{45 (2000) [26] Prabhakara, K., Hua, K.A., and Oh, J.H.: Multi-Level Multi-Channel Air Cache Designs for Broadcasting in a Mobile Environment, Proc. Int'l Conf. on Data Engineering (ICDE 2000), pp.167{176 (2000) [27] Stathatos, K., Roussopoulos, N., and Baras, J.: Adaptive Data Broadcast in Hybrid Networks, Proc. Int'l Conf. on Very Large Data Bases (VLDB'97), pp.326{ 335 (1997) [28] Su, C.J. and Tassiulas, L.: Joint Broadcast Scheduling and User's Cache Management for Ecient Information Delivery, Proc. Int'l Conf. on Mobile Computing and Networking (MOBICOM'98), pp.33{42 (1998) [29] Su, C.J., Tassiulas, L., and Tsotras, V.J.: Broadcast Scheduling for Information Distribution, ACM-Baltzer Journal of Wireless Networks, Vol.5, No.2, pp.137{147 (1999) [30] Vaidya, N.H. and Hameed, S.: Improved Algorithms for Scheduling Data Broadcast, Tech. Report , Comp. Sc. Dept., Texas A&M University (1997) [31] Yu, J.X., Sakata, T., and Tan, K.L.: Statistical Estimation of Access Frequencies in Data Broadcasting Environments, ACM-Baltzer Journal of Wireless Networks, Vol.6, No.2, pp.89{98 (2000)
An Adaptive Query Processing Method according to System Environments in Database Broadcasting Systems
An Query Processing Method according to System Environments in Database Broadcasting Systems M. KASHITA T. TERADA T. HARA Graduate School of Engineering, Cybermedia Center, Graduate School of Information
More informationVolume 3, Issue 9, September 2013 International Journal of Advanced Research in Computer Science and Software Engineering
Volume 3, Issue 9, September 2013 ISSN: 2277 128X International Journal of Advanced Research in Computer Science and Software Engineering Research Paper Available online at: www.ijarcsse.com Optimal Round
More informationStretch-Optimal Scheduling for On-Demand Data Broadcasts
Stretch-Optimal Scheduling for On-Demand Data roadcasts Yiqiong Wu and Guohong Cao Department of Computer Science & Engineering The Pennsylvania State University, University Park, PA 6 E-mail: fywu,gcaog@cse.psu.edu
More informationAn Efficient Partition and Matching Algorithm for Query-Set-based. Broadcasting in Multiple Channel Mobile Environment
An Efficient Partition and Matching Algorithm for Query-Set-based Broadcasting in Multiple Channel Mobile Environment Jing-Feng Lin, Guang-Ming Wu, and Derchian Tsaih 3 Department of Computer Science and
More informationData Access on Wireless Broadcast Channels using Keywords
Data Access on Wireless Broadcast Channels using Keywords Mr. Vijaykumar Mantri 1, Mr. Nagaraju A 2 Dept of IT, Padmasri Dr. B. V. Raju Institute of Technology, Narsapur, Dist.Medak, Andhra Pradesh, India.
More informationReplicated Part Non Replicated
Indexing techniques for data broadcast on wireless channels Dik Lun Lee & Qinglong Hu Department of Computer Science, The Hong Kong University of Science and Technology, Clear Water Bay, Hong Kong dlee@cs.ust.hk
More informationProject Report, CS 862 Quasi-Consistency and Caching with Broadcast Disks
Project Report, CS 862 Quasi-Consistency and Caching with Broadcast Disks Rashmi Srinivasa Dec 7, 1999 Abstract Among the concurrency control techniques proposed for transactional clients in broadcast
More informationA Hybrid Data Delivery Method of Data Broadcasting and On-demand Wireless Communication
Vol. 47 No. SIG 19(TOD 32) IPSJ Transactions on Databases Dec. 2006 Regular Paper A Hybrid Data Delivery Method of Data Broadcasting and On-demand Wireless Communication Jing Cai, Tsutomu Terada, Takahiro
More informationCoding and Scheduling for Efficient Loss-Resilient Data Broadcasting
Coding and Scheduling for Efficient Loss-Resilient Data Broadcasting Kevin Foltz Lihao Xu Jehoshua Bruck California Institute of Technology Department of Computer Science Department of Electrical Engineering
More informationBroadcast Disks: Scalable solution for an asymmetric environment
Broadcast Disks: Scalable solution for an asymmetric environment Byungho Lee Computer Science & Engineering, University of Texas at Arlington blee@cse.ute.edu Abstract As mobile computing gains more popularity,
More informationDynamic Broadcast Scheduling in DDBMS
Dynamic Broadcast Scheduling in DDBMS Babu Santhalingam #1, C.Gunasekar #2, K.Jayakumar #3 #1 Asst. Professor, Computer Science and Applications Department, SCSVMV University, Kanchipuram, India, #2 Research
More informationObject Modeling from Multiple Images Using Genetic Algorithms. Hideo SAITO and Masayuki MORI. Department of Electrical Engineering, Keio University
Object Modeling from Multiple Images Using Genetic Algorithms Hideo SAITO and Masayuki MORI Department of Electrical Engineering, Keio University E-mail: saito@ozawa.elec.keio.ac.jp Abstract This paper
More informationAnalysis of a Cyclic Multicast Proxy Server Architecture
I. J. Communications, Network and System Sciences, 2008, 4, 285-385 Published Online November 2008 in SciRes (http://www.scirp.org/journal/ijcns/). Analysis of a Cyclic Multicast Proxy Server Architecture
More informationPeriodic Scheduling in On-Demand Broadcast System
Periodic Scheduling in On-Demand Broadcast System Nitin Prabhu, Vijay Kumar SCE, Computer Networking University of Missouri-Kansas City Kansas City, MO 64110 npp21c (kumarv)@umkc.edu Indrakshi Ray Computer
More informationWeb-based Energy-efficient Cache Invalidation in Wireless Mobile Environment
Web-based Energy-efficient Cache Invalidation in Wireless Mobile Environment Y.-K. Chang, M.-H. Hong, and Y.-W. Ting Dept. of Computer Science & Information Engineering, National Cheng Kung University
More informationHybrid Cooperative Caching in a Mobile Environment
Hybrid Cooperative Caching in a Mobile Environment Hong Va Leong 1, Chi-yin Chow 2 1 Department of Computing, The Hong Kong Polytechnic University Hong Kong cshleong@comp.polyu.edu.hk 2 Department of Computing
More informationIndexing Techniques for Wireless Data Broadcast under Data Clustering and Scheduling
Indexing Techniques for Wireless Data Broadcast under Data Clustering and Scheduling Qinglong Hu* Wang-C hien Lee Dept of Computer Science GTE Laboratories Inc. Univ. of Science and Technology 40 Sylvan
More informationData Indexing for Heterogeneous Multiple Broadcast Channel
Data Indexing for Heterogeneous Multiple Broadcast Channel Andrew Y. Ho and Dik Lun Lee Department of Computer Science The Hong Kong University of Science and Technology Clear Water Bay, Hong Kong Email:
More informationEvaluation of a Broadcast Scheduling Algorithm
Evaluation of a Broadcast Scheduling Algorithm Murat Karakaya 1 and Özgür Ulusoy2 1 Department of Technical Sciences Turkish Land Forces Academy, Ankara 06100, Turkey 2 Department of Computer Engineering
More informationMultiversion Data Broadcast
1224 IEEE TRANSACTIONS ON COMPUTERS, VOL. 51, NO. 10, OCTOBER 2002 Multiversion Data Broadcast Evaggelia Pitoura, Member, IEEE Computer Society, and Panos K. Chrysanthis, Member, IEEE Abstract Recently,
More informationIntroduction to Approximation Algorithms
Introduction to Approximation Algorithms Dr. Gautam K. Das Departmet of Mathematics Indian Institute of Technology Guwahati, India gkd@iitg.ernet.in February 19, 2016 Outline of the lecture Background
More informationData Dissemination Techniques in Mobile Computing Environment
ABSTRACT 2016 IJSRST Volume 2 Issue 6 Print ISSN: 2395-6011 Online ISSN: 2395-602X Themed Section: Science and Technology Data Dissemination Techniques in Mobile Computing Environment R. Kavitha *1, S.
More informationTCP over Wireless Networks Using Multiple. Saad Biaz Miten Mehta Steve West Nitin H. Vaidya. Texas A&M University. College Station, TX , USA
TCP over Wireless Networks Using Multiple Acknowledgements (Preliminary Version) Saad Biaz Miten Mehta Steve West Nitin H. Vaidya Department of Computer Science Texas A&M University College Station, TX
More informationRESPONSIVENESS IN A VIDEO. College Station, TX In this paper, we will address the problem of designing an interactive video server
1 IMPROVING THE INTERACTIVE RESPONSIVENESS IN A VIDEO SERVER A. L. Narasimha Reddy ABSTRACT Dept. of Elec. Engg. 214 Zachry Texas A & M University College Station, TX 77843-3128 reddy@ee.tamu.edu In this
More informationOn a Cooperation of Broadcast Scheduling and Base Station Caching in the Hybrid Wireless Broadcast Environment
On a Cooperation of Broadcast Scheduling and Base Station Caching in the Hybrid Wireless Broadcast Environment Jing Cai, Tsutomu Terada, Takahiro Hara, and Shojiro Nishio Outline Background Hybrid Wireless
More informationPull vs. Hybrid: Comparing Scheduling Algorithms for Asymmetric Time-Constrained Environments
Pull vs. Hybrid: Comparing Scheduling Algorithms for Asymmetric Time-Constrained Environments Jesus Fernandez-Conde and Daniel Mozos Department of Computer Architecture Universidad Complutense de Madrid,
More informationWeb page recommendation using a stochastic process model
Data Mining VII: Data, Text and Web Mining and their Business Applications 233 Web page recommendation using a stochastic process model B. J. Park 1, W. Choi 1 & S. H. Noh 2 1 Computer Science Department,
More informationA NEW HEURISTIC ALGORITHM FOR MULTIPLE TRAVELING SALESMAN PROBLEM
TWMS J. App. Eng. Math. V.7, N.1, 2017, pp. 101-109 A NEW HEURISTIC ALGORITHM FOR MULTIPLE TRAVELING SALESMAN PROBLEM F. NURIYEVA 1, G. KIZILATES 2, Abstract. The Multiple Traveling Salesman Problem (mtsp)
More informationEfficient Remote Data Access in a Mobile Computing Environment
This paper appears in the ICPP 2000 Workshop on Pervasive Computing Efficient Remote Data Access in a Mobile Computing Environment Laura Bright Louiqa Raschid University of Maryland College Park, MD 20742
More informationA Cost-Efficient Scheduling Algorithm of On-Demand Broadcasts
Wireless Networks 9, 239 247, 2003 2003 Kluwer Academic Publishers. Manufactured in The Netherlands. A Cost-Efficient Scheduling Algorithm of On-Demand Broadcasts WEIWEI SUN, WEIBIN SHI and BOLE SHI Department
More informationTECHNICAL RESEARCH REPORT
TECHNICAL RESEARCH REPORT Adaptive Data Broadcasting Using Air-Cache by K. Stathatos, N. Roussopoulos, J.S. Baras CSHCN T.R. 96-12 (ISR T.R. 96-69) The Center for Satellite and Hybrid Communication Networks
More information2 Data Reduction Techniques The granularity of reducible information is one of the main criteria for classifying the reduction techniques. While the t
Data Reduction - an Adaptation Technique for Mobile Environments A. Heuer, A. Lubinski Computer Science Dept., University of Rostock, Germany Keywords. Reduction. Mobile Database Systems, Data Abstract.
More informationMOBILE VIDEO COMMUNICATIONS IN WIRELESS ENVIRONMENTS. Jozsef Vass Shelley Zhuang Jia Yao Xinhua Zhuang. University of Missouri-Columbia
MOBILE VIDEO COMMUNICATIONS IN WIRELESS ENVIRONMENTS Jozsef Vass Shelley Zhuang Jia Yao Xinhua Zhuang Multimedia Communications and Visualization Laboratory Department of Computer Engineering & Computer
More informationMinoru SASAKI and Kenji KITA. Department of Information Science & Intelligent Systems. Faculty of Engineering, Tokushima University
Information Retrieval System Using Concept Projection Based on PDDP algorithm Minoru SASAKI and Kenji KITA Department of Information Science & Intelligent Systems Faculty of Engineering, Tokushima University
More informationCPET 565/CPET 499 Mobile Computing Systems. Lecture 8. Data Dissemination and Management. 2 of 3
CPET 565/CPET 499 Mobile Computing Systems Lecture 8 and Management 2 of 3 Based on the Text used in the course: Fundamentals of Mobile & Pervasive Computing, 2005, by Frank Adelstein, et. al, from McGraw-Hill
More informationStretch-Optimal Scheduling for On-Demand Data Broadcasts
COMBINATORIAL OPTIMIZATION IN COMMUNICATION NETWORKS Maggie Cheng, Yingshu Li and Ding-Zhu Du (Eds.) pp. 622-637 c 2005 Springer Science + Business Media Stretch-Optimal Scheduling for On-Demand Data Broadcasts
More informationEnergy-Efficient Mobile Cache Invalidation
Distributed and Parallel Databases 6, 351 372 (1998) c 1998 Kluwer Academic Publishers. Manufactured in The Netherlands. Energy-Efficient Mobile Cache Invalidation KUN-LUNG WU, PHILIP S. YU AND MING-SYAN
More informationA Novel Replication Strategy for Efficient XML Data Broadcast in Wireless Mobile Networks
JOURNAL OF INFORMATION SCIENCE AND ENGINEERING 32, 309-327 (2016) A Novel Replication Strategy for Efficient XML Data Broadcast in Wireless Mobile Networks ALI BORJIAN BOROUJENI 1 AND MEGHDAD MIRABI 2
More informationTransaction Processing in Mobile Database Systems
Ashish Jain* 1 http://dx.doi.org/10.18090/samriddhi.v7i2.8631 ABSTRACT In a mobile computing environment, a potentially large number of mobile and fixed users may simultaneously access shared data; therefore,
More informationPull vs Push: A Quantitative Comparison for Data Broadcast
Pull vs Push: A Quantitative Comparison for Data Broadcast Demet Aksoy Mason Sin-Fai Leung Computer Science Department University of California, Davis (aksoy,leungm)@cs.ucdavis.edu Abstract Advances in
More informationEgemen Tanin, Tahsin M. Kurc, Cevdet Aykanat, Bulent Ozguc. Abstract. Direct Volume Rendering (DVR) is a powerful technique for
Comparison of Two Image-Space Subdivision Algorithms for Direct Volume Rendering on Distributed-Memory Multicomputers Egemen Tanin, Tahsin M. Kurc, Cevdet Aykanat, Bulent Ozguc Dept. of Computer Eng. and
More information(a) (b) (c) Phase1. Phase2. Assignm ent offfs to scan-paths. Phase3. Determination of. connection-order offfs. Phase4. Im provem entby exchanging FFs
Scan-chain Optimization lgorithms for Multiple Scan-paths Susumu Kobayashi Masato Edahiro Mikio Kubo C&C Media Research Laboratories NEC Corporation Kawasaki, Japan Logistics and Information Engineering
More informationConnectivity, Energy and Mobility Driven Clustering Algorithm for Mobile Ad Hoc Networks
Connectivity, Energy and Mobility Driven Clustering Algorithm for Mobile Ad Hoc Networks Fatiha Djemili Tolba University of Haute Alsace GRTC Colmar, France fatiha.tolba@uha.fr Damien Magoni University
More informationcell router mobile host
In Mobile Computing, T. Imielinski and H. F. Korth eds., Kluwer Academic Publishers, 1996 22 STRATEGIES FOR QUERY PROCESSING IN MOBILE COMPUTING Masahiko TSUKAMOTO, Rieko KADOBAYASHI* and Shojiro NISHIO
More informationQuasi-consistency and Caching with Broadcast Disks
Quasi-consistency and Caching with Broadcast Disks Rashmi Srinivasa and Sang H. Son Department of Computer Science University of Virginia Charlottesville, VA {rashmi, son}@cs.virginia.edu Abstract. The
More informationMore NP-complete Problems. CS255 Chris Pollett May 3, 2006.
More NP-complete Problems CS255 Chris Pollett May 3, 2006. Outline More NP-Complete Problems Hamiltonian Cycle Recall a hamiltonian cycle is a permutation of the vertices v i_1,, v i_n of a graph G so
More informationChapter 9 Graph Algorithms
Introduction graph theory useful in practice represent many real-life problems can be if not careful with data structures Chapter 9 Graph s 2 Definitions Definitions an undirected graph is a finite set
More informationAdvanced Methods in Algorithms HW 5
Advanced Methods in Algorithms HW 5 Written by Pille Pullonen 1 Vertex-disjoint cycle cover Let G(V, E) be a finite, strongly-connected, directed graph. Let w : E R + be a positive weight function dened
More informationRESEARCH ARTICLE. Accelerating Ant Colony Optimization for the Traveling Salesman Problem on the GPU
The International Journal of Parallel, Emergent and Distributed Systems Vol. 00, No. 00, Month 2011, 1 21 RESEARCH ARTICLE Accelerating Ant Colony Optimization for the Traveling Salesman Problem on the
More informationVANS: Visual Ad hoc Network Simulator
VANS: Visual Ad hoc Network Simulator Masako Shinohara, Hideki Hayashi, Takahiro Hara, Akimitsu Kanzaki and Shojiro Nishio Graduate School of Information Science and Tech., Osaka University {sinohara.masako,
More informationSignature caching techniques for information filtering in mobile environments
Wireless Networks 5 1999) 57 67 57 Signature caching techniques for information filtering in mobile environments Wang-Chien Lee a, and Dik Lun Lee b a GTE Laboratories Incorporated, 40 Sylvan Road, Waltham,
More informationUsing Hybrid Algorithm in Wireless Ad-Hoc Networks: Reducing the Number of Transmissions
Using Hybrid Algorithm in Wireless Ad-Hoc Networks: Reducing the Number of Transmissions R.Thamaraiselvan 1, S.Gopikrishnan 2, V.Pavithra Devi 3 PG Student, Computer Science & Engineering, Paavai College
More informationChapter 9 Graph Algorithms
Chapter 9 Graph Algorithms 2 Introduction graph theory useful in practice represent many real-life problems can be if not careful with data structures 3 Definitions an undirected graph G = (V, E) is a
More information1 The Traveling Salesman Problem
Comp 260: Advanced Algorithms Tufts University, Spring 2011 Prof. Lenore Cowen Scribe: Jisoo Park Lecture 3: The Traveling Salesman Problem 1 The Traveling Salesman Problem The Traveling Salesman Problem
More informationV1.0: Seth Gilbert, V1.1: Steven Halim August 30, Abstract. d(e), and we assume that the distance function is non-negative (i.e., d(x, y) 0).
CS4234: Optimisation Algorithms Lecture 4 TRAVELLING-SALESMAN-PROBLEM (4 variants) V1.0: Seth Gilbert, V1.1: Steven Halim August 30, 2016 Abstract The goal of the TRAVELLING-SALESMAN-PROBLEM is to find
More informationModule 6 NP-Complete Problems and Heuristics
Module 6 NP-Complete Problems and Heuristics Dr. Natarajan Meghanathan Professor of Computer Science Jackson State University Jackson, MS 39217 E-mail: natarajan.meghanathan@jsums.edu P, NP-Problems Class
More informationNotes for Lecture 24
U.C. Berkeley CS170: Intro to CS Theory Handout N24 Professor Luca Trevisan December 4, 2001 Notes for Lecture 24 1 Some NP-complete Numerical Problems 1.1 Subset Sum The Subset Sum problem is defined
More informationDrawing Bipartite Graphs as Anchored Maps
Drawing Bipartite Graphs as Anchored Maps Kazuo Misue Graduate School of Systems and Information Engineering University of Tsukuba 1-1-1 Tennoudai, Tsukuba, 305-8573 Japan misue@cs.tsukuba.ac.jp Abstract
More information1e+07 10^5 Node Mesh Step Number
Implicit Finite Element Applications: A Case for Matching the Number of Processors to the Dynamics of the Program Execution Meenakshi A.Kandaswamy y Valerie E. Taylor z Rudolf Eigenmann x Jose' A. B. Fortes
More informationPBW 654 Applied Statistics - I Urban Operations Research. Unit 3. Network Modelling
PBW 54 Applied Statistics - I Urban Operations Research Unit 3 Network Modelling Background So far, we treated urban space as a continuum, where an entity could travel from any point to any other point
More information160 M. Nadjarbashi, S.M. Fakhraie and A. Kaviani Figure 2. LUTB structure. each block-level track can be arbitrarily connected to each of 16 4-LUT inp
Scientia Iranica, Vol. 11, No. 3, pp 159{164 c Sharif University of Technology, July 2004 On Routing Architecture for Hybrid FPGA M. Nadjarbashi, S.M. Fakhraie 1 and A. Kaviani 2 In this paper, the routing
More information[8] I.F. Akyildiz and J.S.M. Ho. Dynamic moible user location update for wireless pcs networks. Wireless Neworks, 1(2), 1995.
References [1] A. Acharya and B. Badrinath. Checkpointing distributed applications on mobile computers. In Proceedings of the 3rd International Conference on Parallel and Distributed Information Systems.
More informationData Caching under Number Constraint
1 Data Caching under Number Constraint Himanshu Gupta and Bin Tang Abstract Caching can significantly improve the efficiency of information access in networks by reducing the access latency and bandwidth
More informationPredicated Software Pipelining Technique for Loops with Conditions
Predicated Software Pipelining Technique for Loops with Conditions Dragan Milicev and Zoran Jovanovic University of Belgrade E-mail: emiliced@ubbg.etf.bg.ac.yu Abstract An effort to formalize the process
More informationLEAST COST ROUTING ALGORITHM WITH THE STATE SPACE RELAXATION IN A CENTRALIZED NETWORK
VOL., NO., JUNE 08 ISSN 896608 00608 Asian Research Publishing Network (ARPN). All rights reserved. LEAST COST ROUTING ALGORITHM WITH THE STATE SPACE RELAXATION IN A CENTRALIZED NETWORK Y. J. Lee Department
More informationConsistent Logical Checkpointing. Nitin H. Vaidya. Texas A&M University. Phone: Fax:
Consistent Logical Checkpointing Nitin H. Vaidya Department of Computer Science Texas A&M University College Station, TX 77843-3112 hone: 409-845-0512 Fax: 409-847-8578 E-mail: vaidya@cs.tamu.edu Technical
More informationOn The Complexity of Virtual Topology Design for Multicasting in WDM Trees with Tap-and-Continue and Multicast-Capable Switches
On The Complexity of Virtual Topology Design for Multicasting in WDM Trees with Tap-and-Continue and Multicast-Capable Switches E. Miller R. Libeskind-Hadas D. Barnard W. Chang K. Dresner W. M. Turner
More informationA Method for Secure Query Processing in Mobile Databases
Engineering Letters, 14:1, EL_14_1_20 (Advance online publication: 12 February 2007) A Method for Secure Query Processing in Mobile Databases D. Saha and N. Chowdhury Abstract A method for secure query
More informationAn approximation algorithm for a bottleneck k-steiner tree problem in the Euclidean plane
Information Processing Letters 81 (2002) 151 156 An approximation algorithm for a bottleneck k-steiner tree problem in the Euclidean plane Lusheng Wang,ZimaoLi Department of Computer Science, City University
More information1 The Traveling Salesman Problem
Comp 260: Advanced Algorithms Tufts University, Spring 2018 Prof. Lenore Cowen Scribe: Duc Nguyen Lecture 3a: The Traveling Salesman Problem 1 The Traveling Salesman Problem The Traveling Salesman Problem
More informationPerformance Evaluation of a Wireless Hierarchical Data Dissemination System
Performance Evaluation of a Wireless Hierarchical Data Dissemination System Qinglong Hu*& Dik Lun Lee Department of Computer Science University of Science and Technology Clear Water Bay, Hong Kong qinglong@cs.ust.hk
More informationAn Improved Upper Bound for the Sum-free Subset Constant
1 2 3 47 6 23 11 Journal of Integer Sequences, Vol. 13 (2010), Article 10.8.3 An Improved Upper Bound for the Sum-free Subset Constant Mark Lewko Department of Mathematics University of Texas at Austin
More informationAn Updates Dissemination Protocol for Read-Only Transaction Processing in Mobile Real-Time Computing Environments
An Updates Dissemination Protocol for Read-Only Transaction Processing in Mobile Real-Time Computing Environments Guohui Li 1, Hongya Wang 1,2, Jixiong Chen 1, Yingyuan Xiao 1, Yunsheng Liu 1 1 College
More informationPartha Sarathi Mandal
MA 515: Introduction to Algorithms & MA353 : Design and Analysis of Algorithms [3-0-0-6] Lecture 39 http://www.iitg.ernet.in/psm/indexing_ma353/y09/index.html Partha Sarathi Mandal psm@iitg.ernet.in Dept.
More informationFuzzy Inspired Hybrid Genetic Approach to Optimize Travelling Salesman Problem
Fuzzy Inspired Hybrid Genetic Approach to Optimize Travelling Salesman Problem Bindu Student, JMIT Radaur binduaahuja@gmail.com Mrs. Pinki Tanwar Asstt. Prof, CSE, JMIT Radaur pinki.tanwar@gmail.com Abstract
More informationA B. A: sigmoid B: EBA (x0=0.03) C: EBA (x0=0.05) U
Extending the Power and Capacity of Constraint Satisfaction Networks nchuan Zeng and Tony R. Martinez Computer Science Department, Brigham Young University, Provo, Utah 8460 Email: zengx@axon.cs.byu.edu,
More informationUsing Genetic Algorithm with Triple Crossover to Solve Travelling Salesman Problem
Proc. 1 st International Conference on Machine Learning and Data Engineering (icmlde2017) 20-22 Nov 2017, Sydney, Australia ISBN: 978-0-6480147-3-7 Using Genetic Algorithm with Triple Crossover to Solve
More informationA Fast Recursive Mapping Algorithm. Department of Computer and Information Science. New Jersey Institute of Technology.
A Fast Recursive Mapping Algorithm Song Chen and Mary M. Eshaghian Department of Computer and Information Science New Jersey Institute of Technology Newark, NJ 7 Abstract This paper presents a generic
More informationTechnische Universität München, Zentrum Mathematik Lehrstuhl für Angewandte Geometrie und Diskrete Mathematik. Combinatorial Optimization (MA 4502)
Technische Universität München, Zentrum Mathematik Lehrstuhl für Angewandte Geometrie und Diskrete Mathematik Combinatorial Optimization (MA 4502) Dr. Michael Ritter Problem Sheet 4 Homework Problems Problem
More informationState Space Reduction for the Symmetric Traveling Salesman Problem through Halves Tour Complement
State Space Reduction for the Symmetric Traveling Salesman Problem through Halves Tour omplement Kamal R l-rawi ept of omputer Science, Faculty of Information Technology, Petra University, JORN E-mail:kamalr@uopedujo
More informationCS 204 Lecture Notes on Elementary Network Analysis
CS 204 Lecture Notes on Elementary Network Analysis Mart Molle Department of Computer Science and Engineering University of California, Riverside CA 92521 mart@cs.ucr.edu October 18, 2006 1 First-Order
More informationData gathering using mobile agents for reducing traffic in dense mobile wireless sensor networks
Mobile Information Systems 9 (23) 295 34 295 DOI.3233/MIS-364 IOS Press Data gathering using mobile agents for reducing traffic in dense mobile wireless sensor networks Keisuke Goto, Yuya Sasaki, Takahiro
More informationScan-Based BIST Diagnosis Using an Embedded Processor
Scan-Based BIST Diagnosis Using an Embedded Processor Kedarnath J. Balakrishnan and Nur A. Touba Computer Engineering Research Center Department of Electrical and Computer Engineering University of Texas
More informationImproved Collision Resolution Algorithms for Multiple Access Channels with Limited Number of Users * Chiung-Shien Wu y and Po-Ning Chen z y Computer a
Improved Collision Resolution Algorithms for Multiple Access Channels with Limited Number of Users * Chiung-Shien Wu y and Po-Ning Chen z y Computer and Communication Research Labs. ITRI, Hsinchu, Taiwan
More informationModule 6 P, NP, NP-Complete Problems and Approximation Algorithms
Module 6 P, NP, NP-Complete Problems and Approximation Algorithms Dr. Natarajan Meghanathan Associate Professor of Computer Science Jackson State University Jackson, MS 39217 E-mail: natarajan.meghanathan@jsums.edu
More informationAdaptive Data Dissemination in Mobile ad-hoc Networks
Adaptive Data Dissemination in Mobile ad-hoc Networks Joos-Hendrik Böse, Frank Bregulla, Katharina Hahn, Manuel Scholz Freie Universität Berlin, Institute of Computer Science, Takustr. 9, 14195 Berlin
More informationHidefumi Wakamatsu, Yuusuke Tanaka, Akira Tsumaya, Keiichi Shirase, and Eiji Arai
Representation and Planning of Deformable Linear Object Manipulation Including Knotting Hidefumi Wakamatsu, Yuusuke Tanaka, Akira Tsumaya, Keiichi Shirase, and Eiji Arai Dept. of Manufacturing Science,
More informationExtensions to RTP to support Mobile Networking: Brown, Singh 2 within the cell. In our proposed architecture [3], we add a third level to this hierarc
Extensions to RTP to support Mobile Networking Kevin Brown Suresh Singh Department of Computer Science Department of Computer Science University of South Carolina Department of South Carolina Columbia,
More informationRecent PTAS Algorithms on the Euclidean TSP
Recent PTAS Algorithms on the Euclidean TSP by Leonardo Zambito Submitted as a project for CSE 4080, Fall 2006 1 Introduction The Traveling Salesman Problem, or TSP, is an on going study in computer science.
More informationA Backoff Algorithm for Improving Saturation Throughput in IEEE DCF
A Backoff Algorithm for Improving Saturation Throughput in IEEE 80.11 DCF Kiyoshi Takahashi and Toshinori Tsuboi School of Computer Science, Tokyo University of Technology, 1404-1 Katakura, Hachioji, Tokyo,
More informationThe Memetic Algorithm for The Minimum Spanning Tree Problem with Degree and Delay Constraints
The Memetic Algorithm for The Minimum Spanning Tree Problem with Degree and Delay Constraints Minying Sun*,Hua Wang* *Department of Computer Science and Technology, Shandong University, China Abstract
More informationDepartment of. Computer Science. Remapping Subpartitions of. Hyperspace Using Iterative. Genetic Search. Keith Mathias and Darrell Whitley
Department of Computer Science Remapping Subpartitions of Hyperspace Using Iterative Genetic Search Keith Mathias and Darrell Whitley Technical Report CS-4-11 January 7, 14 Colorado State University Remapping
More information(INTERFERENCE AND CONGESTION AWARE ROUTING PROTOCOL)
Qos of Network Using Advanced Hybrid Routing in WMN, Abstract - Maximizing the network throughput in a multichannel multiradio wireless mesh network various efforts have been devoted. The recent solutions
More informationsource3 Backbone s1 s2 R2 R3
Fast and Optimal Multicast-Server Selection Based on Receivers' Preference Akihito Hiromori 1, Hirozumi Yamaguchi 1,Keiichi Yasumoto 2, Teruo Higashino 1, and Kenichi Taniguchi 1 1 Graduate School of Engineering
More informationImprovement of Buffer Scheme for Delay Tolerant Networks
Improvement of Buffer Scheme for Delay Tolerant Networks Jian Shen 1,2, Jin Wang 1,2, Li Ma 1,2, Ilyong Chung 3 1 Jiangsu Engineering Center of Network Monitoring, Nanjing University of Information Science
More informationEfficient Data Access to Multi-channel Broadcast Programs
Efficient Data Access to Multi-channel Broadcast Programs Wai Gen Yee Department of Computer Science Illinois Institute of Technology 10 West 31st Street Chicago, IL 60616 yee@iit.edu Shamkant B. Navathe
More informationModified Order Crossover (OX) Operator
Modified Order Crossover (OX) Operator Ms. Monica Sehrawat 1 N.C. College of Engineering, Israna Panipat, Haryana, INDIA. Mr. Sukhvir Singh 2 N.C. College of Engineering, Israna Panipat, Haryana, INDIA.
More informationA tabu search based memetic algorithm for the max-mean dispersion problem
A tabu search based memetic algorithm for the max-mean dispersion problem Xiangjing Lai a and Jin-Kao Hao a,b, a LERIA, Université d'angers, 2 Bd Lavoisier, 49045 Angers, France b Institut Universitaire
More informationLower Bounds for Insertion Methods for TSP. Yossi Azar. Abstract. optimal tour. The lower bound holds even in the Euclidean Plane.
Lower Bounds for Insertion Methods for TSP Yossi Azar Abstract We show that the random insertion method for the traveling salesman problem (TSP) may produce a tour (log log n= log log log n) times longer
More informationInformation Discovery, Extraction and Integration for the Hidden Web
Information Discovery, Extraction and Integration for the Hidden Web Jiying Wang Department of Computer Science University of Science and Technology Clear Water Bay, Kowloon Hong Kong cswangjy@cs.ust.hk
More information