The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
Storage backend characterization is vital to the workload aware storage platform which aims at providing optimal mapping between storage workloads and backends. Storage benchmarking as one major activity in the path of backend characterization, is very challenging due to the diversity and complexity of the storage environments. In this paper, we present our storage benchmarking design and implementation...
A non-orthogonal waveform superposition scheme for high reliable wireless communications is analyzed, and certain design rules for the scheme are discussed. The capacity of the scheme is superior than that of Nyquist signaling by use of waveform superposition and excess bandwidth. It's proved that the channel capacity can eventually reach the capacity of waveform channel, when the superposition multiplicity...
This paper demonstrates the physical and logical topological slicing in computer networks through Software Defined Networks (SDN) with the added benefit of data privacy. To deal with the complex requirements of the modern networks, a sudden re-configuration of a network is often required. Modern applications require the configuration of networks on a fly and according to dynamically changing requirements,...
Non-orthogonal multiple access (NOMA) is a promising multiple access scheme for next generation wireless networks. This paper investigates the sum rate maximization problem for NOMA system over a frequency selective fading channel with its users being paired according to their channel powers. A hierarchical power allocation process is proposed, whereby the users are divided into two groups such that...
Due to secondary code and AltBOC modulation,the primary code acquisition of the Galileo E5 signal can be complicated and requires additional hardware sources and algorithmic complexity in a receiver. In this paper, we propose a fast primary code acquisition technique for the Galileo E5 signal to reduce both hardware and algorithm complexities, while achieving a similar or better performance in receiver...
The bandwidth of the sampling systems, especially for time-interleaved analog-to-digital converters, needs to be extended along with the rapid increase of the sampling rate. A digitally assisted technique becomes a feasible approach to extend the analog bandwidth, as it is impractical to implement the extension in analog circuits. This paper derives accurate order estimation formulas for the bandwidth...
Coverage enhancement and low complexity are quite important aspects to support and broaden the application of machine type communication (MTC) in long term evolution (LTE). Repeating the same data across multiple subframes is widely considered as basic solution to improve the coverage. Low complexity target is mainly achieved by reducing the supported bandwidth and restricting the data processing...
There are several existing techniques like Direct Loss Subtraction, Through-Reflection-Line (TRL) calibration and Automatic Fixture Removal (AFR) with 2XThrough fixtures for characterizing PCB unit length insertion loss. In this paper, 1) a new method for characterizing PCB loss by using AFR with 1X Open fixtures is proposed. This new method has been proved to have the similar accuracy with TRL and...
To ensure the reliability of distributed storage systems, we studied network bandwidth-aware multiple fault tolerant erasure codes. A flat XOR code is one of the sparse graph codes designed for distributed storage systems. It encodes and decodes data by exclusive OR (XOR) operation with low complexity. However, conventional construction methods of flat XOR codes are not optimal in terms of repair...
We present a robust method to predict full radiation patterns over a large frequency bandwidth using the knowledge of the pattern at a few frequency points. The frequency points are selected adaptively such that a set of linearly independent basis functions, called characteristic basis function patterns (CBFPs), is obtained. The model consists of a linear combination of CBFPs where expansion coefficients...
We propose a framework for optimizing in-network processing (INP) in wireless sensor networks. INP provides a platform for processing (e.g., fusing, aggregating or compressing) the data along the transmission routes in the sensor network. This can reduce the volume of transmitted data, therefore optimizing the utilization of energy and bandwidth. However, such data processing must ensure that the...
In this paper, our objective is to identify the best possible bitrate for transmitting Ultra High Definition (UHD) content at different complexity levels and frame rates. We compressed several UHD videos at different bitrate levels and evaluated their quality through subjective tests. Results revealed that when the original videos are not available, naïve viewers cannot distinguish the difference...
Recently, Intra Line Copy (ILC) and Intra String Copy (ISC) have been introduced as effective means for screen content coding during the development of HEVC Screen Content Coding Extensions. Although conceptually sharing the same theoretical basis, which is essentially string matching, they differ from each other in a number of significant ways. This paper presents detailed comparisons between them...
In this paper, we have proposed a new hierarchical interconnection network called Tori-connected Flattened Butterfly Network (TFBN). It is a hierarchical interconnection network which is able to interconnect millions of nodes in the network to achieve high performance and cost-effective design for massively parallel computing system. TFBN consists of multiple basic modules of flattened butterfly network...
Hadoop which is an open source software framework uses MapReduce framework to process data. But its current implementation there is no direct support for file formats as well as it does not take heterogeneity amongst the cluster into consideration. With default block placement policy it distributes the data randomly. When there is heterogeneous environment so it's hard to utilise the power of each...
A hybrid direct sequence and frequency hopping (DSFH) spread spectrum signal can greatly improve ranging precision and jamming resisting capability in spacecraft TT and C (Tracking, Telemetry and Command). The frequency hopping adds another searching dimension to acquisition and increases the acquisition complexity. Therefore, this paper designs a phase-compensating-based acquisition algorithm. First,...
Applications in modern data centers have a wide variety of resource requirements along the four main dimensions of computing, memory, storage, and networking. Data centers must manage these resources separately for each dimension, resulting in highly inefficient allocation of precious resources or even disastrous schemes that contribute to low utilization or over-provisioning of resources. However,...
Designers of large user-oriented distributed applications, such as social networks and mobile applications, have adopted measures to improve the responsiveness of their applications. Latency is a major concern as people are very sensitive to it. Geo-replication is a commonly used mechanism to bring the data closer to clients. Nevertheless, reaching the closest datacenter can still be considerably...
We study the fundamental k-nearest neighbor (kNN) search problem on distributed time series. A server has constantly received various reference time series Q of length X and seeks the exact kNN over a collection of time series distributed across a set of M local sites. When X and M are large, and when the amount of query increases, simply sending each Q to all M sites incurs high communication bandwidth...
A fundamental concern for energy renewable wireless mesh networks (WMNs) is properly routing exotic traffic across the network according to the energy adequacy at different mesh APs, such that the probability that mesh APs deplete their energy and go out of service is minimized, or equivalently, the network sustainability is maximized. However, existing sustainable routing schemes suffer significantly...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.