Transaction Failure Research Articles

Estimating Inefficiency in Online Auctions

In this paper, we estimate the inefficiency in online auctions. Online auctions can be inefficient due to the Internet fraud. A typical example of Internet fraud is when sellers do not send goods to winning bidders even though they have received payment. Therefore, bidders always bear a risk of fraud, and this risk may lead to transaction failure. In our empirical example, we use eBay PlayStation 3 auctions held in 2009. We find that the efficiency loss is over $30 for more than 5% of online auctions. Furthermore, we also find the probability of the inefficient online auction is more than 0.25.

Transaction Failure Rates in the Aadhaar Enabled Payment System: Urgent Issues for Consideration and Proposed Solutions

The Aadhaar enabled Payment System (AePS) has witnessed a surge in transactions during India’s COVID-19-induced lockdown. Many providers have pivoted to use of this system as bank branches experienced service disruptions in the early weeks of the lockdown, limiting the cash-out points in India. This coincided with a huge demand for cash withdrawals by vulnerable citizens in response to announcement of cash transfer schemes by Central and State governments. Many migrants who are part of the mass exodus away from affected cities have heightened reliance on wayside shops and MicroATMs to access cash. Worryingly, the rise in AePS transactions has been accompanied by reports of a spike in transaction failure rates. This has serious consequences for consumers who desperately need to access and remit cash to stay afloat in the crisis. Unfortunately, limited published evidence and analysis of the nature of these transaction failures exists. This policy brief identifies the most serious categories of AePS transaction failures based on data and conversations with four financial institutions with a combined presence across the country. To understand the levels at which these failures occur, the AePS process flow is described in Section 2. Section 3 describes our understanding of the main reasons for AePS transaction failures, especially in April 2020,and highlights the impact on consumers. Section 4 of this brief proposes some immediate and medium-term solutions for urgent discussion, given the enormous costs these failures externalise to the most vulnerable users of India’s financial services infrastructure.

A Content Fingerprint-Based Cluster-Wide Inline Deduplication for Shared-Nothing Storage Systems

Deduplication has been principally employed in distributed storage systems to improve storage space efficiency. Traditional deduplication research ignores the design specifications of shared-nothing distributed storage systems such as no central metadata bottleneck, scalability, and storage rebalancing. Likewise, inline deduplication integration poses serious threats to storage system read/write performance, consistency, and scalability. Mainly, this is due to ineffective and error-prone deduplication metadata, duplicate lookup I/O redirection, and placement of content fingerprints and data chunks. Further, transaction failures after deduplication integration often render inconsistencies in data chunks, deduplication metadata, and garbage data chunks. results in rendering inconsistencies in data chunks, deduplication metadata, and garbage data chunks. In this paper, we propose G rate , a high-performance inline cluster-wide data deduplication, complying with the design constraints of shared-nothing storage systems. In particular, G rate eliminates duplicate copies across the cluster for high storage space efficiency without jeopardizing performance. We employ a distributed deduplication metadata shard , which promises high-performance deduplication metadata and duplicate fingerprint lookup I/Os without introducing a single point of failure. The placement of data and deduplication metadata is made cluster-wide based on the content fingerprint of chunks. We decouple the deduplication metadata shard from read I/O path and replace it with a read manifestation object to further speedup read performance. To guarantee deduplication-enabled transaction consistency and efficient garbage identification, we design a flag-based asynchronous consistency scheme , capable of repairing the missing data chunks on duplicate arrival. We design and implement G rate in Ceph. The evaluation shows an average of 18% performance bandwidth improvement over the content addressable deduplication approach at smaller chunk sizes, i.e., less than 128KB while maintaining high storage space savings.

The Link Between Causal Attribution and Recovery Satisfaction in Mobile Money Transaction Failures: The Mediating Role of Negative Emotions

The Link Between Causal Attribution and Recovery Satisfaction in Mobile Money Transaction Failures: The Mediating Role of Negative Emotions

Analyzing the Performance of Web-services during Traffic Anomalies

Intentional or unintentional, service denial leads to substantial economic and reputation losses to the users and the web-service provider. However, it is possible to take proper measures only if we understand and quantify the impact of such anomalies on the victim. In this paper, essential performance metrics distinguishing both transmission issues and application issues have been discussed and evaluated. The legitimate and attack traffic has been synthetically generated in hybrid testbed using open-source software tools. The experiment covers two scenarios, representing DDoS attacks and Flash Events, with varying attack strengths to analyze the impact of anomalies on the server and the network. It has been demonstrated that as the traffic surges, response time increases, and the performance of the target web-server degrades. The performance of the server and the network is measured using various network level, application level, and aggregate level metrics, including throughput, average response time, number of legitimate active connections and percentage of failed transactions.

Extended-RSA for Encryption Process to Improve Application Server Availability

Every enterprise stores and operates its transactions confidentially, therefore it has to encrypt the transaction to protect it from data intruders. Technically, most encryption processes are ranging from hundreds of milliseconds. If there is a lot of encrypting process, then the performance will be getting bottleneck and the transaction’s speed is being slowed down. In this paper, a promising scheme by adding GZIP compression on the former RSA encryption method to increase speed is proposed; thus every transaction is going to require less times, therefore the number of failed transactions or requests will be reduced. Hence, this way makes the transaction easier for customers to do. The result of little experimental test shows that using XOR to stream cipher-text to replace the absent of padding into specific bytes shows a lot of performance increase resulting other factors such as availability also affected without sacrificing the security level.

Risk Implemented Simultaneous Game-Theoretic Approach for Energy Trading in Residential Microgrids

Abstract With the promoting of residential microgrids, peer-to-peer (P2P) energy trading market among small household entities have emerged. In order to improve the flexibility of transactions and financial benefits for each participants, game-theoretic approaches have been widely investigated in recent studies. However, in current studies, these approaches still have some problems, such as the limitation of the number of participants and some unfair constraints on trade. To solve these problems, this paper proposes a simultaneous game-theoretic approach in the P2P energy trading. Proposed approach overcame the limits on participants’ number in this approach, and gives all participants equal rights to decide their trading prices for maximizing their own benefits. Besides, aiming to mitigate a potential risk of transaction failure in the simultaneous game-theoretic approach, a tool for risk analysis, “Value at Risk” (VaR), is also implemented into this approach. Through the VaR, participants could control their trading prices in a reasonable range to ensure successful energy trading. Moreover, case studies with multiple households involved in a residential microgrid confirm the effectiveness of the risk implemented simultaneous game-theoretic approach.

ATM Transaction Status Feature Analysis and Anomaly Detection

In this paper, based on ATM transaction status analysis and anomaly detection problem, by analyzing the transaction statistics of a bank ATM application system, the characteristic parameters of ATM transaction status are extracted and analyzed, then a set of targets are designed. An abnormal monitoring scheme that can promptly and accurately alarm the four abnormal situations in which the trading volume is steep, the transaction failure rate is increased, the transaction processing is slow, and the transaction response time is too long. Firstly, the transaction data is divided to distinguish between working days, non-working days, trading volume troughs, and normal trading periods, to avoid data interference between different time periods and to take into account the data discontinuity. The characteristics of the anomaly data were identified by K-Means Clustering Analysis. Then the data is analyzed by B-P Neural Network method, the change rule of ATM transaction status with time is obtained. According to this rule, the ATM transaction status is judged, and the abnormal situation is alarmed in time. Finally, this paper increases the amount and type of data collected, then increases the influencing factors such as ATM popularity, holidays, transaction types into the model, uses the existing transaction data before and after the Spring Festival to verify, in order to obtain a more realistic monitoring and early warning program. The transaction status anomaly monitoring scheme designed in this paper not only can correctly judge but also timely alarm the financial aid equipment failure scenarios, so that the security of the financial self-service equipment trading system is guaranteed.

A Comparative Study in Online Movie Ticket Booking System

Due to increase in technology and digitalization online movie system has become much more popular. Instead of wasting time in queues of movie counter, it provides easy and efficient way to book the tickets online. It is quite fascination to sit at home browses the movies which have been released, read the review and then book the tickets according to our feasibility. Movie booking system is actually in action for the last 15 years but it gained its popularity after 2004 and its reach increased several folds in the past 6–10 years because of increasing net accessibility. In the proposed research paper we have sorted out some of the major issues related to online movie management system. Due to increased traffic server problem and transaction failure are the major problems with online movie booking system. To sort out these Node JS and Mongo DB connectivity has been used. Also, there are some more features which have been addend and are new to movie booking system like mailing the review and trailer of the movie to the user while they book the ticket and showing the view of screen from different orientation of screen. For some trustworthy review we have designed our own questionnaire so that it can give exact view of what is the true review of movie. These reviews will cross checked by the editorial team and then published on the web site. So basically it¶s an advanced version of online movie booking system in which few new features has been added as well as the problems with previous system has been rectified.

Problems of the Russian Market of Merger and Absorption Transactions

Importance : Nowadays mergers and acquisitions, in addition to the organic growth, act as a tool for achieving competitiveness of the organization in the long run. While determining the strategic objectives of mergers and acquisitions, managers of the participants of transaction are driven by motives associated with obtaining synergetic effects, which require from the stakeholders concentration of resources, managers with sufficient experience and reasonable approaches to transactions at all stages. Thus, the complex of factors determines whether the transaction is successful and points out reasons for a failure. Objective : Develop the factors contributing to the failure in mergers and acquisitions at stages of implementation. Evaluate the necessity of measures, preventing failure of transaction and minimizing negative effects of it. Methods : Theoretical analysis, synthesis, systematization of scientific literature on the subject; structural analysis of mergers and acquisitions process, logical analysis of causes of unsuccessful transactions. Results : Determined the groups of factors weakening the ability to achieve success in mergers at stages of their implementation. Evaluated the necessity of measures, preventing failure of transaction . Conclusions and Relevance : It is concluded that mergers and acquisitions, despite their attractiveness for increasing business value even in times of deteriorating financial situation, carry many risks. In order to achieve desired effects, the parties involved in transaction must anticipate internal and external factors that can destroy the success of transaction on stages of preparation, closing the deal and in integration period, which determines the necessity of developing measures, minimizing negative effects of unsuccessful outcome of transactions.

Search, Matching, and the Role of Digital Marketplace Design in Enabling Trade: Evidence from Airbnb

Digital peer-to-peer marketplaces have increased the volume of trade in underutilized assets. I use the setting of Airbnb to investigate transaction costs in these markets and the role of search engine design in reducing these costs. I show that this market is characterized by many options, heterogeneity in preferences, and uncertain availability. Consequently, search is limited, time-consuming, and sometimes results in failed transaction attempts due to rejections of searchers by hosts. I estimate a model of search and matching and use it to show that the search engine plays a critical role in facilitating transactions. Without availability tracking and filtering, searches with accepted inquiries would fall by 68% and rejections would increase by 140%. Lastly, I show how searcher outcomes can be improved from the status quo (as of 2014) by algorithms that redirect searchers towards listings that are more likely to accept those searchers.

A Multi-Objective Optimization Algorithm to Predict Information in Mobile Databases

Recent advances in wireless data networking, satellite services and cell connections allow us to take advantage of mobile computing systems. Here, a problem is the mobility of computing process which needs to get information from databases. In fact, system movement during the transaction interrupts the mobile network connection to server wireless systems, and the disconnection causes failing in the running transaction so the mobile system has to run the transaction again. One way to avoid transaction failure is doing prediction process until connecting to the next wireless network. The objective of this study is to use particle swarm optimization (PSO) algorithm in order to provide a solution for prediction of the information sent to the mobile system for using the memory. Generally, PSO algorithms result in the best or an acceptable solution for optimized selection and design in many scientific and technological problems. Here, the objective of PSO is to select the best information to send to the mobile system when the connection is interrupted in order to prevent transaction failures. This study focuses only on information sent to the mobile system.

Fast Predictive Handshaking in Synchronous FPGAs for Fully Asynchronous Multisymbol Chip Links: Application to SpiNNaker 2-of-7 Links

Asynchronous handshaken interchip links are very popular among neuromorphic full-custom chips due to their delay-insensitive and high-speed properties. Of special interest are those links that minimize bit-line transitions for power saving, such as the two-phase handshaken non-return-to-zero (NRZ) 2-of-7 protocol used in the SpiNNaker chips. Interfacing such custom chip links to field-programmable gate arrays (FPGAs) is always of great interest, so that additional functionalities can be experimented and exploited for producing more versatile systems. Present-day commercial FPGAs operate typically in synchronous mode, thus making it necessary to incorporate synchronizers when interfacing with asynchronous chips. This introduces extra latencies and precludes pipelining, deteriorating transmission speed, particularly when sending multisymbols per unit communication packet. In this brief, we present a technique that learns to estimate the delay of a symbol transaction, thus allowing a fast pipelining from symbol to symbol. The technique has been tested on links between FPGAs and SpiNNaker chips, achieving the same throughput as fully asynchronous synchronizerless links between SpiNNaker chips. The links have been tested for periods of over one week without any transaction failure. Verilog codes of FPGA circuits are available as additional material for download.

Instant Recovery with Write-Ahead Logging: Page Repair, System Restart, Media Restore, and System Failover, Second Edition

Traditional theory and practice of write-ahead logging and of database recovery focus on three failure classes: transaction failures (typically due to deadlocks) resolved by transaction rollback; system failures (typically power or software faults) resolved by restart with log analysis, redo, and undo phases; and media failures (typically hardware faults) resolved by restore operations that combine multiple types of backups and log replay. The recent addition of single-page failures and single-page recovery has opened new opportunities far beyond the original aim of immediate, lossless repair of single-page wear-out in novel or traditional storage hardware. In the contexts of system and media failures, efficient single-page recovery enables on-demand incremental redo and undo as part of system restart or media restore operations. This can give the illusion of practically instantaneous restart and restore: instant restart permits processing new queries and updates seconds after system reboot and instant restore permits resuming queries and updates on empty replacement media as if those were already fully recovered. In the context of node and network failures, instant restart and instant restore combine to enable practically instant failover from a failing database node to one holding merely an out-of-date backup and a log archive, yet without loss of data, updates, or transactional integrity. In addition to these instant recovery techniques, the discussion introduces self-repairing indexes and much faster offline restore operations, which impose no slowdown in backup operations and hardly any slowdown in log archiving operations. The new restore techniques also render differential and incremental backups obsolete, complete backup commands on a database server practically instantly, and even permit taking full up-to-date backups without imposing any load on the database server. Compared to the first version of this book, this second edition adds sections on applications of single-page repair, instant restart, single-pass restore, and instant restore. Moreover, it adds sections on instant failover among nodes in a cluster, applications of instant failover, recovery for file systems and data files, and the performance of instant restart and instant restore.

Modeling of the business transaction failure by means of colored Petri Nets

Modeling of the business transaction failure by means of colored Petri Nets

Retail Web System Upgrading with Strategic Customer Using Threshold Policy

This paper mainly deals with the problems that online retailers are facing by some group of strategic customers by upgrading web system and goods pricing. A monopolist price of a product for which stylized dynamic pricing model is considered at the beginning and the price change is done on the product after considering some set of constraints based on the product availability. Due to some network issues sometimes website may get problems at that time there may be a chance of transaction failure for customer during online purchasing. To predict this probability and doing purchasing opinion depending on the belief of Transaction Success Probability (TSP).Considering this there will be a threshold policy for purchasing by customers here it is going to consider it as first one: Customers buy products only if his valuation for products is above threshold (total reduced profit) otherwise they will not take it into consideration. The threshold rises as TSP degrades, or customers turn out to be risk averse. Here we obtain the best cost of each phase and make out the best strategy for online shopping site customizing by threshold and upgrade the system when present TSP is less than threshold. The online trader turns to increase the price if he disregards strategic customer behavior. The value of disregarding strategic customer deeds is significant. The profit loss cost of disregarding strategic customer deeds grows as customer transaction cost rises.

An incremental hash-based optimistic concurrency control scenario for failure management in HDDBs - an application approach

During real-time transaction process there is a high probability of transaction failure due to the application of various concurrency control-based protocols and network overload. There are no effective methods to manage these failed transactions that provide the clients an opportunity to renew their transaction in a short span of time. In this paper, we propose a methodology which caters to the need for an effective concurrency control management by providing an efficient way to decrease the real-time as well as non-real-time work done by the server. Our proposed methodology represents an excellent blossom in the failure management environment. This method is based on the calculation of hash value of the data field and compares the current hash value with the previous hash value every time before the write operation takes place. The proposed methodology also allows the client to renew a failed transaction using their previous transaction details. We perform extensive experiments to validate the proposed methodology by using remote method invocation RMI. By performing extensive experiments, we epitomise the performance of this method with existing modalities. Experimental results show that the proposed methodology can achieve atomicity and optimistic instances for failure transactions in an efficient way.

Instant Recovery with Write-Ahead Logging: Page Repair, System Restart, and Media Restore

Traditional theory and practice of write-ahead logging and of database recovery techniques revolve around three failure classes: transaction failures resolved by rollback; system failures (typically software faults) resolved by restart with log analysis, “redo,” and “undo” phases; and media failures (typically hardware faults) resolved by restore operations that combine multiple types of backups and log replay. The recent addition of single-page failures and single-page recovery has opened new opportunities far beyond its original aim of immediate, lossless repair of single-page wear-out in novel or traditional storage hardware. In the contexts of system and media failures, efficient single-page recovery enables on-demand incremental “redo” and “undo” as part of system restart or media restore operations. This can give the illusion of practically instantaneous restart and restore: instant restart permits processing new queries and updates seconds after system reboot and instant restore permits resuming queries and updates on empty replacement media as if those were already fully recovered. In addition to these instant recovery techniques, the discussion introduces much faster offline restore operations without slowdown in backup operations and with hardly any slowdown in log archiving operations. The new restore techniques also render differential and incremental backups obsolete, complete backup commands on the database server practically instantly, and even permit taking full backups without imposing any load on the database server.

FTCOT: A Fault Tolerant Transaction Commit Protocol with Timeout Constraint for Mobile Environment

Now day’s transaction failure is a common issue in mobile environment. There are various cause of transaction failure in mobile environment, some of them most common are failure of coordinator (normally which is base station in case of mobile environment), disconnection of mobile device, low battery, handoff. This paper proposes the new transaction commit protocol, Fault Tolerant Transaction Commit Protocol with Timeout Constraint (FTCOT).It support coordinator failure, handoff (in case of mobility) which reduce transaction failure. This paper extends the feature of TCOT.

Harvard professor Mikolaj Piskorski’s research-based social media business development model

Purpose – The paper aims to present an interview with Mikolaj Piskorski, Associate Professor in the Strategy Business Unit at Harvard Business School, and one of the first researchers to write about the underlying economic, social and strategic drivers that make social networking important to strategists. Design/methodology/approach – The interview discusses his research-based insights that emphasize the importance of designing a network that enables transactions that would not occur otherwise, transactions of high value to both companies and individuals. Findings – Social networking that creates increased competitive advantage actually empowers customers to do things that they previously could not do or could not do easily or inexpensively. Practical implications – Social networks can potentially remedy the social failures and transaction failures that occur when an interaction that would benefit both parties fails to occur. A useful way of framing the problem to be solved looks at how to develop a social network platform that benefits stakeholders and how to develop a social strategy that benefits the sponsor. Originality/value – The key lesson: identify the strategic issue that you are trying to solve and what kind of transactions you can enable for customers that could create value for them and for your company, but which are not taking place. Then plan how social networking can enable these transactions to have more value.