186 research outputs found
Call blocking probabilities for Poisson traffic under the Multiple Fractional Channel Reservation policy
No full textIn this paper, we study the performance of the Multiple Fractional Channel Reservation (MFCR) policy, which is a bandwidth reservation policy that allows the reservation of real (not integer) number of channels in order to favor calls of high channel (bandwidth) requirements. We consider a link of fixed capacity that accommodates Poisson arriving calls of different service-classes with different bandwidth-per-call requirements. Calls compete for the available bandwidth under the MFCR policy. To determine call blocking probabilities, we propose approximate but recursive formulas based on the notion of reserve transition rates. The accuracy of the proposed method is verified through simulation
Handoff modeling in cellular CDMA with finite sources and state-dependent bandwidth requirements
No full textIt is envisioned that small cells are going to play an important role in future cellular networks. Due to limited coverage areas of small cells and increased user mobility, a proper analysis and evaluation of handoff traffic is of major importance. In this paper, we propose a novel teletraffic model for the analysis of handoff traffic in cellular CDMA networks. When the cell load is above a predefined threshold, we allow the handoff calls to reduce their bandwidth requirements in order to avoid blocking. Our model also realistically assumes a finite number of traffic sources in the cell and enables analytical determination of uplink blocking probabilities for new and handoff calls. To this end, the CDMA system has been described as a continuous-time Markov chain in order to derive an efficient recursive formula for the calculation of system state probabilities. The proposed analytical model has been validated through simulation experiments, which show good accuracy of the derived results
An Erlang multirate loss model supporting elastic traffic under the threshold policy
No full textIn this paper, we propose a multirate teletraffic loss model of a single link with certain bandwidth capacity that accommodates Poisson arriving calls, which can tolerate bandwidth compression (elastic traffic), under the threshold policy. When compression occurs, the service time of new and in-service calls increases. The threshold policy provides different QoS among service-classes by limiting the number of calls of a service-class up to a pre-defined threshold, which can be different for each service-class. Due to the bandwidth compression mechanism, the steady state probabilities in the proposed model do not have a product form solution. However, we approximate the model by a reversible Markov chain, and prove recursive formulas for the calculation of call blocking probabilities and link utilization. The accuracy of the proposed formulas is verified through simulation and found to be very satisfactory
Cabozantinib in patients with advanced prostate cancer: results of a phase II randomized discontinuation trial
No full textAbstract not availableDavid C. Smith, Matthew R. Smith, Christopher Sweeney, Aymen A. Elfiky, Christopher Logothetis, Paul G. Corn, Nicholas J. Vogelzang, Eric J. Small, Andrea L. Harzstark, Michael S. Gordon, Ulka N. Vaishampayan, Naomi B. Haas, Alexander I. Spira, Primo N. Lara Jr, Chia-Chi Lin, Sandy Srinivas, Avishay Sella, Patrick Schöffski, Christian Scheffold, Aaron L. Weitzman, and Maha Hussai
Design and characterization of an integrated Remote Access Unit for wireless communication
No full textDesign time reliability predictions for supporting runtime security measuring and adaptation
No full textThe interoperability challenge for autonomic computing
No full textInteroperability is an emerging need for autonomic computing systems, which stems from the very success of these systems. Autonomic computing is increasingly popular; soon autonomic control components will be commonplace, and present in almost every large or complex application. This inevitably leads to situations where multiple autonomic components coexist and interact either directly or indirectly within the same application or system. Problems can arise when numerous independently designed autonomic components interact. We advocate a service-based approach to interoperability and present a set of requirements for such an approach. We briefly present a universal interoperability service which automatically discovers and manages potential conflicts between manager components
- …
