Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userMitigation of Delayed Management Costs in Transaction-Oriented Systems
115
0
0.0
(
0
)
Added by
Dmitry Zinoviev
Publication date
2014
fields
Informatics Engineering
and research's language is
English
Ask ChatGPT about the research
No Arabic abstract
Abundant examples of complex transaction-oriented networks (TONs) can be found in a variety of disciplines, including information and communication technology, finances, commodity trading, and real estate. A transaction in a TON is executed as a sequence of subtransactions associated with the network nodes, and is committed if every subtransaction is committed. A subtransaction incurs a two-fold overhead on the host node: the fixed transient operational cost and the cost of long-term management (e.g. archiving and support) that potentially grows exponentially with the transaction length. If the overall cost exceeds the node capacity, the node fails and all subtransaction incident to the node, and their parent distributed transactions, are aborted. A TON resilience can be measured in terms of either external workloads or intrinsic node fault rates that cause the TON to partially or fully choke. We demonstrate that under certain conditions, these two measures are equivalent. We further show that the exponential growth of the long-term management costs can be mitigated by adjusting the effective operational cost: in other words, that the future maintenance costs could be absorbed into the transient operational costs.
rate research
Read More
The power of networks manifests itself in a highly non-linear amplification of a number of effects, and their weakness - in propagation of cascading failures. The potential systemic risk effects can be either exacerbated or mitigated, depending on the resilience characteristics of the network. The goals of this paper are to study some characteristics of network amplification and resilience. We simulate random Erdos-Renyi networks and measure amplification by varying node capacity, transaction volume, and expected failure rates. We discover that network throughput scales almost quadratically with respect to the node capacity and that the effects of excessive network load and random and irreparable node faults are equivalent and almost perfectly anticorrelated. This knowledge can be used by capacity planners to determine optimal reliability requirements that maximize the optimal operational regions.
Edge/Fog computing is a novel computing paradigm that provides resource-limited Internet of Things (IoT) devices with scalable computing and storage resources. Compared to cloud computing, edge/fog servers have fewer resources, but they can be accessed with higher bandwidth and less communication latency. Thus, integrating edge/fog and cloud infrastructures can support the execution of diverse latency-sensitive and computation-intensive IoT applications. Although some frameworks attempt to provide such integration, there are still several challenges to be addressed, such as dynamic scheduling of different IoT applications, scalability mechanisms, multi-platform support, and supporting different interaction models. FogBus2, as a new python-based framework, offers a lightweight and distributed container-based framework to overcome these challenges. In this chapter, we highlight key features of the FogBus2 framework alongside describing its main components. Besides, we provide a step-by-step guideline to set up an integrated computing environment, containing multiple cloud service providers (Hybrid-cloud) and edge devices, which is a prerequisite for any IoT application scenario. To obtain this, a low-overhead communication network among all computing resources is initiated by the provided scripts and configuration files. Next, we provide instructions and corresponding code snippets to install and run the main framework and its integrated applications. Finally, we demonstrate how to implement and integrate several new IoT applications and custom scheduling and scalability policies with the FogBus2 framework.
Given some of the recent advances in Distributed Hash Table (DHT) based Peer-To-Peer (P2P) systems we ask the following questions: Are there applications where unstructured queries are still necessary (i.e., the underlying queries do not efficiently map onto any structured framework), and are there unstructured P2P systems that can deliver the high bandwidth and computing performance necessary to support such applications. Toward this end, we consider an image search application which supports queries based on image similarity metrics, such as color histogram intersection, and discuss why in this setting, standard DHT approaches are not directly applicable. We then study the feasibility of implementing such an image search system on two different unstructured P2P systems: power-law topology with percolation search, and an optimized super-node topology using structured broadcasts. We examine the average and maximum values for node bandwidth, storage and processing requirements in the percolation and super-node models, and show that current high-end computers and high-speed links have sufficient resources to enable deployments of large-scale complex image search systems.
We analyze the optimal dividend payment problem in the dual model under constant transaction costs. We show, for a general spectrally positive L{e}vy process, an optimal strategy is given by a $(c_1,c_2)$-policy that brings the surplus process down to $c_1$ whenever it reaches or exceeds $c_2$ for some $0 leq c_1 < c_2$. The value function is succinctly expressed in terms of the scale function. A series of numerical examples are provided to confirm the analytical results and to demonstrate the convergence to the no-transaction cost case, which was recently solved by Bayraktar et al. (2013).
We consider conditional-mean hedging in a fractional Black-Scholes pricing model in the presence of proportional transaction costs. We develop an explicit formula for the conditional-mean hedging portfolio in terms of the recently discovered explicit conditional law of the fractional Brownian motion.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
