Browsing by Subject "Availability"
Now showing 1 - 6 of 6
Results Per Page
Sort Options
Item Open Access Dynamic congestion control in interconnected computer networks(IEEE, 1988-10) Ulusoy, Özgür; Baray, MehmetThe authors evaluate a window-based congestion control mechanism in an internetwork environment. They also propose and study two dynamic-window congestion-control algorithms. These algorithms provide further control to the window mechanism by adjusting the window size in accordance with the availability of the network resources at the destination. A comparison of dynamic algorithms with fixed window control is provided in terms of throughput and delay performance. It is shown that dynamic algorithms have considerable performance advantages over fixed-window control.Item Open Access Flora: a framework for decomposing software architecture to introduce local recovery(John Wiley & Sons Ltd., 2009-07) Sözer, H.; Tekinerdoǧan, B.; Akşit, M.The decomposition of software architecture into modular units is usually driven by the required quality concerns. In this paper we focus on the impact of local recovery concern on the decomposition of the software system. For achieving local recovery, the system needs to be decomposed into separate units that can be recovered in isolation. However, it appears that this required decomposition for recovery is usually not aligned with the decomposition based on functional concerns. Moreover, introducing local recovery to a software system, while preserving the existing decomposition, is not trivial and requires substantial development and maintenance effort. To reduce this effort we propose a framework that supports the decomposition and implementation of software architecture for local recovery. The framework provides reusable abstractions for defining recoverable units and the necessary coordination and communication protocols for recovery. We discuss our experiences in the application and evaluation of the framework for introducing local recovery to the open-source media player called MPlayer. Copyright 2009 John Wiley & Sons, Ltd.Item Open Access An inventory problem with two randomly available suppliers(Institute for Operations Research and the Management Sciences, 1997) Gürler, Ü.; Parlar, M.This paper considers a stochastic inventory model in which supply availability is subject to random fluctuations that may arise due to machine breakdowns, strikes, embargoes, etc. It is assumed that the inventory manager deals with two suppliers who may be either individually ON (available) or OFF (unavailable). Each supplier's availability is modeled as a semi-Markov (alternating renewal) process. We assume that the durations of the ON periods for the two suppliers are distributed as Erlang random variables. The OFF periods for each supplier have a general distribution. In analogy with queuing notation, we call this an Es1[Es2]/G1[G2] system. Since the resulting stochastic process is non-Markovian, we employ the "method of stages" to transform the process into a Markovian one, albeit at the cost of enlarging the state space. We identify the regenerative cycles of the inventory level process and use the renewal reward theorem to form the long-run average cost objective function. Finite time transition functions for the semi-Markov process are computed numerically using a direct method of solving a system of integral equations representing these functions. A detailed numerical example is presented for the E2[E2]/M[M] case. Analytic solutions are obtained for the particular case of "large" (asymptotic) order quantity, in which case the objective function assumes a very simple form that can be used to analyze the optimality conditions. The paper concludes with the discussion of an alternative inventory policy for modeling the random supply availability problem.Item Open Access A joint production and transportation planning problem with heterogeneous vehicles(2014) Toptal, A.; Koc, U.; Sabuncuoglu, I.We consider a manufacturer's planning problem to schedule order production and transportation to respective destinations. The manufacturer in this setting can use two vehicle types for outbound shipments. The first type is available in unlimited numbers. The availability of the second type, which is less expensive, changes over time. Motivated by some industry practices, we present formulations for three different solution approaches: the myopic solution, the hierarchical solution and the coordinated solution. These approaches vary in how the underlying production and transportation subproblems are solved, that is, sequentially versus jointly or heuristically versus optimally. We provide intractability proofs or polynomial-time exact solution procedures for the sub-problems and their special cases. We also compare the three solution approaches over a numerical study to quantify the savings from integration and explicit consideration of transportation availabilities. Our analytical and numerical results set a foundation and a need for a heuristic to solve the integrated problem. We thus propose a tabu search heuristic, which quickly generates near-optimal solutions.Item Open Access Optimizing decomposition of software architecture for local recovery(Springer New York LLC, 2013) Sözer, H.; Tekinerdoǧan, B.; Akşit, M.The increasing size and complexity of software systems has led to an amplified number of potential failures and as such makes it harder to ensure software reliability. Since it is usually hard to prevent all the failures, fault tolerance techniques have become more important. An essential element of fault tolerance is the recovery from failures. Local recovery is an effective approach whereby only the erroneous parts of the system are recovered while the other parts remain available. For achieving local recovery, the architecture needs to be decomposed into separate units that can be recovered in isolation. Usually, there are many different alternative ways to decompose the system into recoverable units. It appears that each of these decomposition alternatives performs differently with respect to availability and performance metrics. We propose a systematic approach dedicated to optimizing the decomposition of software architecture for local recovery. The approach provides systematic guidelines to depict the design space of the possible decomposition alternatives, to reduce the design space with respect to domain and stakeholder constraints and to balance the feasible alternatives with respect to availability and performance. The approach is supported by an integrated set of tools and illustrated for the open-source MPlayer software. © 2011 Springer Science+Business Media, LLC.Item Open Access Understanding and predicting trends in urban freight transport(IEEE, 2017-05-06) Mrazovic, P.; Eravci, Bahaeddin; Larriba-Pey, J. L.; Ferhatosmanoğlu, Hakan; Matskin, M.Among different components of urban mobility, urban freight transport is usually considered as the least sustainable. Limited traffic infrastructures and increasing demands in dense urban regions lead to frequent delivery runs with smaller freight vehicles. This increases the traffic in urban areas and has negative impacts upon the quality of life in urban populations. Data driven optimizations are essential to better utilize existing urban transport infrastructures and to reduce the negative effects of freight deliveries for the cities. However, there is limited work and data driven research on urban delivery areas and freight transportation networks. In this paper, we collect and analyse data on urban freight deliveries and parking areas towards an optimized urban freight transportation system. Using a new check-in based mobile parking system for freight vehicles, we aim to understand and optimize freight distribution processes. We explore the relationship between areas' availability patterns and underlying traffic behaviour in order to understand the trends in urban freight transport. By applying the detected patterns we predict the availabilities of loading/unloading areas, and thus open up new possibilities for delivery route planning and better managing of freight transport infrastructures. © 2017 IEEE.