SYSTEM AND METHOD FOR MONITORING FRAUDELENT TRANSACTIONS AT MERCHANT LEVEL IN REAL TIME PAYMENT

Disclosed herein is a method and system providing Merchants direct access to the powerful issuer authorization rules engine to evaluate and block card payment transaction in real-time from potential fraud at checkout. The access to the intelligent rules can be made by enabling a secure connection to the Risk Manager (RM). The real-time data will empower the Merchant to not forward the fraudulent transaction onto the acquirer for further processing, saving the transaction processing fees as eliminating back-office overheads on failed payments

Tree-Chain: A Fast Lightweight Consensus Algorithm for IoT Applications

Blockchain has received tremendous attention in non-monetary applications including the Internet of Things (IoT) due to its salient features including decentralization, security, auditability, and anonymity. Most conventional blockchains rely on computationally expensive consensus algorithms, have limited throughput, and high transaction delays. In this paper, we propose tree-chain a scalable fast blockchain instantiation that introduces two levels of randomization among the validators: i) transaction level where the validator of each transaction is selected randomly based on the most significant characters of the hash function output (known as consensus code), and ii) blockchain level where validator is randomly allocated to a particular consensus code based on the hash of their public key. Tree-chain introduces parallel chain branches where each validator commits the corresponding transactions in a unique ledger. Implementation results show that tree-chain is runnable on low resource devices and incurs low processing overhead, achieving near real-time transaction settlement

S-Store: Streaming Meets Transaction Processing

Stream processing addresses the needs of real-time applications. Transaction processing addresses the coordination and safety of short atomic computations. Heretofore, these two modes of operation existed in separate, stove-piped systems. In this work, we attempt to fuse the two computational paradigms in a single system called S-Store. In this way, S-Store can simultaneously accommodate OLTP and streaming applications. We present a simple transaction model for streams that integrates seamlessly with a traditional OLTP system. We chose to build S-Store as an extension of H-Store, an open-source, in-memory, distributed OLTP database system. By implementing S-Store in this way, we can make use of the transaction processing facilities that H-Store already supports, and we can concentrate on the additional implementation features that are needed to support streaming. Similar implementations could be done using other main-memory OLTP platforms. We show that we can actually achieve higher throughput for streaming workloads in S-Store than an equivalent deployment in H-Store alone. We also show how this can be achieved within H-Store with the addition of a modest amount of new functionality. Furthermore, we compare S-Store to two state-of-the-art streaming systems, Spark Streaming and Storm, and show how S-Store matches and sometimes exceeds their performance while providing stronger transactional guarantees

Real-time transaction processing for autonomic grid application

The advances in computing and communication technologies and software have resulted in an explosive growth in computing systems and applications that impact all aspects of our life. Computing systems are expected to be effective and serve useful purpose when they are first introduced and continue to be useful as condition changes. With increase in complexity of systems and applications, their development, configuration, and management challenges are beyond the capabilities of existing tools and methodologies. So the system becomes unmanageable and insecure. So in order to make the systems selfmanageable and secure the concept of Autonomic computing is evolved. Autonomic computing offers a potential solution to these challenging research problems. It is inspired by nature and biological systems (such as the autonomic nervous system) that have evolved to cope with the challenges of scale, complexity, heterogeneity and unpredictability by being decentralized, context aware, adaptive and resilient. This new era of computing is driven by the convergence of biological and digital computing systems and is characterized by being self-defining, self-configuring, self-optimizing, self-protecting, self-healing, context aware and anticipatory. Autonomic computing is a new computing model to self manages computing systems with a minimal human interference. It provides an unprecedented level of self-regulation and hides complexity from Users. The Autonomic computing initiative is inspired by the human body’s autonomic nervous system. The autonomic nervous system monitors the heart- beats, checks blood sugar levels and maintains normal body temperature with out any conscious effort from the human. There is an important distinction between autonomic activity in the human body and autonomic responses in computer systems. Many of the decision made autonomic elements in computer systems make decisions based on tasks, which are chosen to be delegated to the technology. The influences of the autonomic nervous systems may imply that the autonomic computing initiative is concerned only with lowlevel self-managing capability such as reflex reaction. The basic application area of autonomic computing is grid computing. Both autonomic computing and grid computing are proposed as innovations of IT. Autonomic computing aims to present a solution to the rapidly increasing complexity crises in IT industry, as grid computing tries to share and integrate distributed computational resources and data resources. Basic aim is to implement the autonomic computing in grid related study like autonomic task distribution and handling in grids, and autonomic resource allocation. In this thesis paper we presents methods of calculating deadlines of global and local transaction And sub transaction by taking EDF algorithm and measure the performance by taking miss ratio in Different workload. We implement this work in an existing grid. The basic aim is to know autonomic computing better. It is a model to self manage computing Systems with minimal human interference. Self manage has properties like self-configuration, self-optimization, self-healing, self-protection. Autonomic grid computing combines autonomic computing with grid technologies to help companies to reduce the complexity associated with the grid system and hides the complexity from their grid user. Autonomic real-time transaction services incorporate fault tolerance into autonomic grid technology by automatically recovering systems from various failures. Here in this paper Deadlines of global transaction, sub transaction and local transaction are calculated by taking parameters arrival time, execution time, relative deadline, and slack time. We are taking a periodic transaction having λ (transaction arrival rate per second) Tasks are generated at different nodes with Poisson ratio with λ as workload. Miss ratio is the performance metrics. With increase in workload miss ratio first decreased and then rose. The reason was each sub transaction acted as a unit to compete for resources so that more workload the more system resource they consumed. So more transaction missed their deadlines, as they could not get enough resource in time. EDF algorithm has both less global and local miss ratios then other scheduling algorithm. If EDF is compare with FCFS or SJF or HPF it is apparent that both algorithms perform almost identically until no of transaction is low, then EDF misses fewer dead lines than other. Real-time transaction can handled by the grid in autonomic environment and satisfy properties of autonomic computing

A study of two transaction-processing architectures for distributed real-time database systems

Cataloged from PDF version of article.A real-time data base system (RTDBS) is designed to provide timely response to the transactions of data-intensive applications. Processing a transaction in a distributed RTDBS environment presents the design choice of how to provide access to remote data referenced by the transaction. Satisfaction of the timing constraints of transactions should be the primary factor to be considered in scheduling accesses to remote data. In this article, we describe and analyze two different alternative approaches to this fundamental design decision. With the first alternative, transaction operations are executed at the sites where required data pages reside. The other alternative is based on transmitting data pages wherever they are needed. Although the latter approach is characterized by large message volumes carrying data pages, it is shown in our experiments to perform better than the other approach under most of the work loads and system configurations tested. The performance metric used in the evaluations is the fraction of transactions that satisfy their timing constraints. © 1995

The "MIND" Scalable PIM Architecture

MIND (Memory, Intelligence, and Network Device) is an advanced parallel computer architecture for high performance computing and scalable embedded processing. It is a Processor-in-Memory (PIM) architecture integrating both DRAM bit cells and CMOS logic devices on the same silicon die. MIND is multicore with multiple memory/processor nodes on each chip and supports global shared memory across systems of MIND components. MIND is distinguished from other PIM architectures in that it incorporates mechanisms for efficient support of a global parallel execution model based on the semantics of message-driven multithreaded split-transaction processing. MIND is designed to operate either in conjunction with other conventional microprocessors or in standalone arrays of like devices. It also incorporates mechanisms for fault tolerance, real time execution, and active power management. This paper describes the major elements and operational methods of the MIND architecture

Transaction processing in distributed active real-time database systems

An active real-time database system (ARTDBS) is designed to provide timely response to the critical situations that are defined on database states. Although a number of studies have already addressed various issues in ARTDBSs, little attention has been paid to scheduling transactions in a distributed ARTDBS environment. In this paper, 2 we describe a detailed performance model of a distributed ARTDBS and investigate various performance issues in time-cognizant transaction processing in ARTDBSs. The experiments conducted evaluate the performance under various types of active workload and different distributed transaction-processing architectures. The performance metric used in the evaluations is the fraction of transactions that violate their timing constraints. We also describe and evaluate a nested transaction execution scheme that improves the real-time performance under high levels of active workload. © 1998 Elsevier Science Inc. All rights reserved