25793995
Update-based cache replacement policies in wireless data access
Most of cache replacement schemes are access-based replacement policies since they are based on object access frequency/time information. However, update information is extremely important since an updated object makes itself invalid, and the object hit information becomes useless. In this paper, we propose two update-based replacement policies, the least access-to-update ratio (LA2U) and least access-to-update difference (LAUD) in wireless data access, based on both update frequency and access frequency. Extensive simulations have been carried out to evaluate the proposed policies. Simulation results show that the proposed update-based policies outperform access-based policies at most cases. It is concluded that considering update information in designing replacement policies can increase cache performance, especially, when updates are heavy
11389576
Ultra-wideband wireless communications
Summary Ultra-wideband (UWB) communication techniques have attracted a great interest in both academia and industry in the past few years for applications in short-range wireless mobile systems. This is due to the potential advantages of UWB transmissions such as low power, high rate, immunity to multipath propagation, less complex transceiver hardware, and low interference. However, tremendous R&D efforts are required to face various technical challenges in developing UWB wireless systems, including UWB channel characterization, transceiver design, coexistence and interworking with other narrowband wireless systems, design of the link and network layers to benefit from UWB transmission characteristics. This paper is to provide an overview of UWB communications, summarize the previous research results, and identify further research issues that need to be tackled. The emphasis is placed on the commercial wireless communications. Copyright # 2003 John Wiley & Sons, Ltd.
7313627
Voice capacity analysis of WLAN with unbalanced traffic
An analytical model to study the performance of wireless local area networks (WLANs) supporting asymmetric nonpersistent traffic using the IEEE 802.11 distributed coordination function mode for medium access control (MAC) is developed. Given the parameters of the MAC protocol and voice codecs, the voice capacity of an infrastructure-based WLAN, in terms of the maximum number of voice connections that can be supported with satisfactory user-perceived quality, is obtained. In addition, voice capacity analysis reveals how the overheads from different layers, codec rate, and voice packetization interval affect voice traffic performance in WLANs, which provides an important guideline for network planning and management. The analytical results can be used for effective call admission control to guarantee the quality of voice connections. Extensive simulations have been performed to validate the analytical results
9894542
Reliability optimization of distributed access networks with constrained total cost
In this paper, we study the system reliability optimization of distributed access networks subject to a constraint on the total cost. We first formulate the cost-constrained system reliability optimization problem as a searching process in a combinatorial tree, which enumerates all the possible solutions to the problem. Because the calculation of each possible solution for the reliability problem is extremely time-consuming, a novel algorithm, the Shrinking & Searching Algorithm (SSA), is proposed to speed up the searching process. SSA jointly considers the upper bound of the system reliability for each branch in the combinatorial tree, and the cost constraint on the possible solutions. It avoids most of the redundant calculations in the searching process by gradually shrinking the difference between lower & upper bounds of the length of a path in the corresponding combinatorial tree, which represents a feasible solution. Case study & simulation results are presented to demonstrate the performance of the SSA.
768133
Performance analysis of TCP-friendly AIMD algorithms for multimedia applications
In this paper, the performance of TCP-friendly generic AIMD (Additive Increase and Multiplicative Decrease) algorithms for Web-based playback and multirate multimedia applications is investigated. The necessary and sufficient TCP-friendly condition is derived, and the effectiveness and responsiveness of AIMD are studied. Due to practical implications, a Dynamic TCP-friendly AIMD (DTAIMD) algorithm is proposed. Extensive simulation results are given to verify the derived necessary and sufficient condition, and to demonstrate the performance of the proposed DTAIMD algorithm.
16600319
Update-Based Cache Access and Replacement in Wireless Data Access
Cache has been applied for wireless data access with different replacement policies in wireless networks. Most of the current cache replacement schemes are access-based replacement policies since they are based on object access frequency/recency information. Access-based replacement policies either ignore or do not focus on update information. However, update information is extremely important since it can make access information almost useless. In this paper, we consider two fundamental and strongly consistent access algorithms: poll-per-read (PER) and call-back (CB). We propose a server-based PER (SB-PER) cache access mechanism in which the server makes replacement decisions and a client-based CB cache access mechanism in which clients make replacement decisions. Both mechanisms have been designed to be suitable for using both update frequency and access frequency. We further propose two update-based replacement policies, least access-to-update ratio (LA2U) and least access-to-update difference (LAUD). We provide a thorough performance analysis via extensive simulations for evaluating these algorithms in terms of access rate, update rate, cache size, database size, object size, etc. Our study shows that although effective hit ratio is a better metric than cache hit ratio, it is a worse metric than transmission cost, and a higher effective hit ratio does not always mean a lower cost. In addition, the proposed SB-PER mechanism is better than the original PER algorithm in terms of effective hit ratio and cost, and the update-based policies outperform access-based policies in most cases
45976743
Improved lightpath (wavelength) routing in large WDM networks
We address the problem of efficient circuit switching in wide area networks. The solution provided is based on finding optimal routes for lightpaths and semilightpaths. A lightpath is a fully optical transmission path, while a semilightpath is a transmission path constructed by chaining several lightpaths together, using wavelength conversion at their junctions. The problem thus is to find an optimal lightpath/semilightpath in the network in terms of the cost of wavelength conversion and the cost of using the wavelengths on links. We first present fast, efficient algorithms both for the general problem and for a natural restricted version. The new algorithms outperform earlier work, providing time improvements amounting to an almost linear time factor in most cases. Also, all our algorithms can be implemented on the network in a distributed way.
7529826
Finding the k Most Vital Edges in the Minimum Spanning Tree Problem
Abstract Let G(V, E) be a weighted, undirected, connected simple graph with n vertices and m edges. The k most vital edge problem with respect to a minimum spanning tree is to find a set S (⊆ E ) of k edges in G whose removal results in the greatest increase in the weight of the minimum spanning tree in the remaining graph G(V, E - S) . Although for arbitrary k , Frederickson et al. have shown that this problem is NP-hard, it is polynomial time solvable when k is fixed. In this paper we introduce a sparse, weighted k -edge connected certificate of a graph which has been found very useful. By using this certificate, we first present a general algorithm for the problem above. Then, for a fixed k > 1, we present efficient sequential and parallel algorithms. Our sequential algorithm runs in time O ( n k + 1 ). Our parallel algorithm runs in time O (log n log log n ) using O ( n k + 1 ) processors on an EREW PRAM. If the minimum spanning tree of G and the sparse, weighted ( k + 1)-edge connected certificate of G are given, the algorithm runs in time O (log n ) using O ( n k + 1 ) processors on the same model. Particularly, when k = 1, we develop parallel algorithms which require O (log n log log n ) time using O(m + n 2 ( log n log log n) ) processors on an EREW PRAM, and O (log n log log n ) time using O(m) processors on a CREW PRAM respectively, and the algorithm on the EREW PRAM is the fastest, compared with previous known algorithms.
34776029
Embedding between 2-D meshes of the same size
It is shown how to embed an x/sub 1/ /spl times/ 1/sub 1/ mesh M/sub 1/ into an s/sub 2/ /spl times/ t/sub 2/ mesh M/sub 2/, where s/sub 1/ /spl times/ t/sub 2/, s/sub 1/ < t/sub i/ (i = 1,2) such that the dilation is minimized. It is assumed that load = 1 and expansion = 1. For each case there is shown a lower bound on the dilation and a corresponding embedding method. The dilations by these embedding algorithms either match a lower bound or are very close to a lower bound.<<ETX>>
6914367
Context-sensitive information retrieval using implicit feedback
A major limitation of most existing retrieval models and systems is that the retrieval decision is made based solely on the query and document collection; information about the actual user and search context is largely ignored. In this paper, we study how to exploit implicit feedback information, including previous queries and clickthrough information, to improve retrieval accuracy in an interactive information retrieval setting. We propose several context-sensitive retrieval algorithms based on statistical language models to combine the preceding queries and clicked document summaries with the current query for better ranking of documents. We use the TREC AP data to create a test collection with search context information, and quantitatively evaluate our models using this test set. Experiment results show that using implicit feedback, especially the clicked document summaries, can improve retrieval performance substantially.
302118
A Hierarchical Model of Reference Affinity
To improve performance, data reorganization needs locality models to identify groups of data that have reference affinity. Much past work is based on access frequency and does not consider accessing time directly. In this paper, we propose a new model of reference affinity. This model considers the distance between data accesses in addition to the frequency. Affinity groups defined by this model are consistent and have a hierarchical structure. The former property ensures the profitability of data packing, while the latter supports data packing for storage units of different sizes. We then present a statistical clustering method that identifies affinity groups among structure fields and data arrays by analyzing training runs of a program. When used by structure splitting and array regrouping, the new method improves the performance of two test programs by up to 31%. The new data layout is significantly better than that produced by the programmer or by static compiler analysis.