FLAIM: A Multi-level Anonymization Framework for Computer and Network Logs

FLAIM (Framework for Log Anonymization and Information Management) addresses two important needs not well addressed by current log anonymizers. First, it is extremely modular and not tied to the specific log being anonymized. Second, it supports multi-level anonymization, allowing system administrators to make fine-grained trade-offs between information loss and privacy/security concerns. In this paper, we examine anonymization solutions to date and note the above limitations in each. We further describe how FLAIM addresses these problems, and we describe FLAIM's architecture and features in detail.Comment: 16 pages, 4 figures, in submission to USENIX Lis

Slow subcarrier-hopped Space Division Multiple Access OFDM systems

Recently Space Division Multiple Access (SDMA) assisted Multi-Input-Multi-Output (MIMO) OFDM systems invoking Multi-User Detection (MUD) techniques have attracted substantial research interests, which are capable of exploiting both transmitter multiplexing gain and receiver diversity gain. Furthermore, the classic Frequency-Hopping (FH) technique can be effectively amalgamated with SDMA-OFDM systems, resulting in Frequency-Hopped (FH) SDMA-OFDM. In this paper we devise a Turbo Trellis Coded Modulation (TTCM) assisted subcarrier-based FH/SDMA-OFDM scheme, which may be able to fully exploit the attainable frequency diversity, while exhibiting a high Multi-User-Interference (MUI) resistance. In the high-throughput scenario investigated, the proposed Uniform Slow-SubCarrier-Hopped (USSCH) SDMA-OFDM system was capable of achieving 6dB Eb=N0 gain at the BER of 10¡4 over the conventional SDMA-OFDM system, while maintaining a similar complexity

Receiver Multiuser Diversity Aided Multi-Stage MMSE Multiuser Detection for DS-CDMA and SDMA Systems Employing I-Q Modulation

The so-called receiver multiuser diversity aided multistage minimum mean-square error multiuser detector (RMD/MS-MMSE MUD), which was proposed previously by the author, is investigated in the context of the direct-sequence code-division multiple-access (DS- CDMA) and space-division multiple-access (SDMA) systems that employ in- and quadrature-phase (I-Q) modulation schemes. A detection scheme is studied, which is operated in real domain in the principles of successive interference cancellation (SIC). The concept of noise recognition factor (NRF) is proposed for explaining the efficiency of SIC-type detectors and also for motivating to design other high-efficiency detectors. The achievable bit error rate (BER) performance of the RMD/MS-MMSE MUD is investigated for DS-CDMA and SDMA systems of either full-load or overload, when communicating over Rayleigh fading channels for the SDMA and over either additive white Gaussian noise (AWGN) or Rayleigh fading channels for the DS-CDMA. The studies and performance results show that the RMD/MS-MMSE MUD is a highly promising MUD. It has low implementation complexity and good error performance. Furthermore, it is a high-flexibility detector suitable for various communication systems operated in different communication environments

Cache Serializability: Reducing Inconsistency in Edge Transactions

Read-only caches are widely used in cloud infrastructures to reduce access latency and load on backend databases. Operators view coherent caches as impractical at genuinely large scale and many client-facing caches are updated in an asynchronous manner with best-effort pipelines. Existing solutions that support cache consistency are inapplicable to this scenario since they require a round trip to the database on every cache transaction. Existing incoherent cache technologies are oblivious to transactional data access, even if the backend database supports transactions. We propose T-Cache, a novel caching policy for read-only transactions in which inconsistency is tolerable (won't cause safety violations) but undesirable (has a cost). T-Cache improves cache consistency despite asynchronous and unreliable communication between the cache and the database. We define cache-serializability, a variant of serializability that is suitable for incoherent caches, and prove that with unbounded resources T-Cache implements this new specification. With limited resources, T-Cache allows the system manager to choose a trade-off between performance and consistency. Our evaluation shows that T-Cache detects many inconsistencies with only nominal overhead. We use synthetic workloads to demonstrate the efficacy of T-Cache when data accesses are clustered and its adaptive reaction to workload changes. With workloads based on the real-world topologies, T-Cache detects 43-70% of the inconsistencies and increases the rate of consistent transactions by 33-58%.Comment: Ittay Eyal, Ken Birman, Robbert van Renesse, "Cache Serializability: Reducing Inconsistency in Edge Transactions," Distributed Computing Systems (ICDCS), IEEE 35th International Conference on, June~29 2015--July~2 201

Multiuser MIMO-OFDM Systems using Subcarrier Hopping

Recently space division multiple access (SDMA) assisted multiple-input–multiple-output (MIMO) orthogonal frequency division multiplexing (OFDM) systems invoking multiuser detection (MUD) techniques have attracted substantial research interest, which is capable of exploiting both transmitter multiplexing gain and receiver diversity gain. A new scheme referred to here as slowsubcarrierhopping (SSCH) assisted multiuser SDMA-OFDM, is proposed. It is shown that, with the aid of the so-called uniform SSCH (USSCH) pattern, the multiuser interference (MUI) experienced by the high-throughput SDMA-OFDM system can be effectively suppressed, resulting in a significant performance improvement. In the investigations conducted, the proposed USSCH-aided SDMA-OFDM system was capable of outperforming a range of SDMA-OFDM systems considered, including the conventional SDMA-OFDM system dispensing with the employment of frequency-hopping techniques. For example, at an Eb/N0 value of 12 dB, the proposed USSCH/SDMA-OFDM system reduced the bit error ratio (BER) by about three orders of magnitude, in comparison to the conventional SDMA-OFDM system, while maintaining a similar computational complexity

Binary Independent Component Analysis with OR Mixtures

Independent component analysis (ICA) is a computational method for separating a multivariate signal into subcomponents assuming the mutual statistical independence of the non-Gaussian source signals. The classical Independent Components Analysis (ICA) framework usually assumes linear combinations of independent sources over the field of realvalued numbers R. In this paper, we investigate binary ICA for OR mixtures (bICA), which can find applications in many domains including medical diagnosis, multi-cluster assignment, Internet tomography and network resource management. We prove that bICA is uniquely identifiable under the disjunctive generation model, and propose a deterministic iterative algorithm to determine the distribution of the latent random variables and the mixing matrix. The inverse problem concerning inferring the values of latent variables are also considered along with noisy measurements. We conduct an extensive simulation study to verify the effectiveness of the propose algorithm and present examples of real-world applications where bICA can be applied.Comment: Manuscript submitted to IEEE Transactions on Signal Processin