449557
Power allocation and scheduling for MAC layer design in UWB networks
This paper proposes a practical joint power allocation and scheduling scheme for medium access control (MAC) layer design in ultra-wideband (UWB) networks. The scheme increases system spectral efficiency and reduces power consumption by fully considering the properties of the UWB, such as its capacity in supporting parallel transmission and providing accurate positioning, and its stringent constraint on computational complexity. Practical implementations of the proposed scheme are achieved by introducing a margin based power allocation scheme and an exclusive region based scheduling scheme. The margin based power allocation scheme is carried out based on each link's own information, and is simple to implement, while the exclusive region based scheduling scheme takes into account the interaction among different links. Simulation results show that the proposed power allocation and scheduling schemes exhibit good performance in terms of the average number of slots per frame and the power consumption reduction
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
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.
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.
9442074
Generalized Latin squares II
Abstract This paper is a continuation of a study on a new class of combinatorial structures called generalized Latin squares or 〈k,l〉-Latin squares. Here, we study the existence question of perfect 〈k,l〉-Latin squares. The main result is an existence theorem for the case M = 2, where M is the multiplicity of the generalized Latin squares. Specifically, we show that for given positive integers N, k = ip, l = iq, where i = gcd(k,l), there exists a perfect 〈k,l〉-Latin square of order N with M = 2 if and only if (i) N = 4k, (ii) pq(p + q)| N, and (iii) q|2.
7390429
Program-level adaptive memory management
Most application's performance is impacted by the amount of available memory. In a traditional application, which has a fixed working set size, increasing memory has a beneficial effect up until the application's working set is met. In the presence of garbage collection this relationship becomes more complex. While increasing the size of the program's heap reduces the frequency of collections, collecting a heap with memory paged to the backing store is very expensive. We first demonstrate the presence of an optimal heap size for a number of applications running on a machine with a specific configuration. We then introduce a scheme which adaptively finds this good heap size. In this scheme, we track the memory usage and number of page faults at a program's phase boundaries. Using this information, the system selects the soft heap size. By adapting itself dynamically, our scheme is independent of the underlying main memory size, code optimizations, and garbage collection algorithm. We present several experiments on real applications to show the effectiveness of our approach. Our results show that program-level heap control provides up to a factor of 7.8 overall speedup versus using the best possible fixed heap size controlled by the virtual machine on identical garbage collectors.
735556
Lightweight reference affinity analysis
Previous studies have shown that array regrouping and structure splitting significantly improve data locality. The most effective technique relies on profiling every access to every data element. The high overhead impedes its adoption in a general compiler, In this paper, we show that for array regrouping in scientific programs, the overhead is not needed since the same benefit can be obtained by pure program analysis.We present an interprocedural analysis technique for array regrouping. For each global array, the analysis summarizes the access pattern by access-frequency vectors and then groups arrays with similar vectors. The analysis is context sensitive, so it tracks the exact array access. For each loop or function call, it uses two methods to estimate the frequency of the execution. The first is symbolic analysis in the compiler. The second is lightweight profiling of the code. The same interprocedural analysis is used to cumulate the overall execution frequency by considering the calling context. We implemented a prototype of both the compiler and the profiling analysis in the IBM® compiler, evaluated array regrouping on the entire set of SPEC CPU2000 FORTRAN benchmarks, and compared different analysis methods. The pure compiler-based array regrouping improves the performance for the majority of programs, leaving little room for improvement by code or data profiling.
29710029
Covering convex sets with non-overlapping polygons
Abstract We prove that given n ⩾3 convex, compact, and pairwise disjoint sets in the plane, they may be covered with n non-overlapping convex polygons with a total of not more than 6 n −9 sides, and with not more than 3 n −6 distinct slopes. Furthermore, we construct sets that require 6 n −9 sides and 3 n −6 slopes for n ⩾3. The upper bound on the number of slopes implies a new bound on a recently studied transversal problem.
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.