The aim of this paper is to present a method and a software program that are designed to help decision makers to plan, reorganize and relocate resources in the hospitals' hospitalization departments. When planning the hospitalization departments layout, the decision maker faces many various problems, that are further emphasized when taking into account budget limitations and space limitations. In this paper we propose a queueing theory-based method for addressing this problem. We deal with a fixed area available for placing resources in the department and consider various scenarios and strategies in order to gain insights that will help the decision makers within this area. A software was written using MATLAB, to generally construct all the balance equations for each scenario, with additional abilities that will allow to decide on the space, available capacity, costs and the specific arrival rates characterizing each department.

Efficient communication in Bluetooth networks requires design of intra and inter-piconet scheduling algorithms, and therefore, numerous algorithms have been proposed. However, due to complexities of the Bluetooth MAC, the performance of these algorithms has been analyzed mostly via simulation. We present analytic results regarding the exhaustive, gated, and limited (pure round robin) scheduling algorithms in piconets with bidirectional and unidirectional traffic. We show that a piconet operated according to the limited scheduling algorithm is equivalent to a 1-limited polling system and present exact results regarding symmetric piconets with bidirectional traffic. Then, the difficulties in analyzing the performance of the exhaustive and gated algorithms in a piconet with bidirectional traffic are demonstrated. In addition, we present exact analytic results for piconets with unidirectional traffic. We show that, surprisingly, in symmetrical piconets with only uplink traffic, the mean waiting time is the same for the exhaustive and limited algorithms. This observation results from the differences between piconets and traditional polling systems and can be extended for time-division-duplex systems with arbitrary packet lengths. Furthermore, we show that the mean waiting time in a piconet with only uplink traffic is significantly higher than its corresponding value in a piconet with only downlink traffic. Finally, we numerically compare the exact results to approximate results, presented in the past.

Efficient communication in Bluetooth networks requires design of intra and inter-piconet scheduling algorithms, and therefore numerous algorithms have been proposed. However, due to complexities of the Bluetooth MAC, the performance of these algorithms has been analyzed mostly via simulation. We present exact analytic results regarding the exhaustive, gated, and limited (pure round robin) scheduling algorithms in piconets with unidirectional traffic. We show that, surprisingly, in symmetrical piconets with only uplink traffic, the mean waiting time is the same for the exhaustive and limited algorithms. This observation is extended for time-division-duplex systems with arbitrary packet lengths. Furthermore, we show that the mean waiting time in a piconet with only uplink traffic is significantly higher than its corresponding value in a piconet with only downlink traffic. We then demonstrate the difficulties in analyzing the performance of the exhaustive and gated algorithms in a piconet with bi-directional traffic. Finally, we numerically compare the exact results to approximate results, presented in the past.

No abstract available.

A new approach to the analysis of hash table performance is presented.This approach is based on a direct probabilistic analysis, where the underlying probabilities are derived by using the ballot theorem and its ramifications.The method is first applied to analyze the performance of the classical (cyclic) linear probing scheme, and the results are used to solve an optimal storage allocation problem.A scheme frequently used in practice where the table is linear rather than cyclic is then analyzed using the same methodology.

A random-access file with N storage locations ~s consmdered.Records are added to the file from time to tmme A record wroth key ~f ~ ~2 ms hashed to storage location F(,o).A collismon ms resolved by the foUowmg chaining method' All records hashed to the same locatmon are chained to each other to form an ordered list, ordered m ascending order of the keys The first record of a list is stored either at location F(~0) or at an alternative start ff IocaUon F(,o) ms occupied.For thins process the multidimensional ume-dependent generating funcuon is derived, and the expected values of various state variables are calculated.These values are used to obtain formulas for the expected number of I/O operations needed for retrieval, addmon, or updating of a record Two measures of retrieval performance are calculated: (i) The expected number of addiuonal probes needed to find a record m the file This measure ms uniformly bounded by t. (n) The expected number of addmonal probes required to dmscover that a record is not in the file.This performance measure IS always smaller than the first and ms uniformly bounded by I/e.Addmon of a record consists of three steps.(l) checking that a record with the same key does not exmst in the file, (2) finding an empty locatmon, and (3) wrmng the record and updating all the pointers revolved The number of I/O operatmons needed for record addmon depends on the amount of reformation avadable on the occupancy of the file For various mformatmn levels the relevant performance measures are calculated and compared KEY WORDS AND PHRASES: hashing, colhslon resolutmon, chammg method, ordered list, multsdlmensmonal generatmg function, remeval performance CR CATEGORIES 3.72, 3 74, 4 33, 5.