The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
We originally design a mechanism of spectrum sharing for cognitive radio networks (CRNs), which can protect secondary users from dropping call and improve the user capacity compared with traditional scheme. Continuous time Markov process is adopted for modeling interactions between primary users and secondary users in proposed mechanism. Based on quasi-birth and death process (QBD) theory, we present...
With the increasing popularity of web services on the Internet, besides functionalities, Quality of Service (QoS) is becoming an important concern for describing characteristics of web services. QoS rankings provide valuable information for making optimal service selection and recommendation from a set of functionally similar or equivalent service candidates. However, in order to obtain such rankings,...
For integrated service systems supporting real-time (RT) and non-real-time (NRT) traffic, evaluating the performance of the NRT traffic is often challenging. An approximation based on a fluid model - the so-called Fluid Approximation (FA) - can be used when RT traffic has much larger successful call arrival rate than the NRT traffic, while otherwise it may introduce errors. In this paper, we propose...
Opportunistic Spectrum Access (OSA) has been proposed as a promising solution to the spectrum scarcity problem. OSA network not only respects the rights of incumbent license holders but also takes care of the Quality of Service (QoS) of secondary users. In this paper, a multichannel preemptive priority queuing model is developed and a buffer is introduced to reduce the force termination probability...
Development of schedulers for real-time embedded systems is an emerging area of research as it addresses unsolved scheduling issues like co-operative scheduling, pre-emptive scheduling, micro-kernel based scheduling, etc. Use of statistical schedulers over deterministic schedulers offers the advantage of improved bandwidth utilization, better timeliness and resource management, higher throughput and...
The study presented in this manuscript is motivated by the performance analysis of three-node telecommunication networks with HOL priority feed backed service, deadlock and blocking. This model is based on the performance of the Markovian three-node queuing network with finite capacity buffers, for which new and practical results are provided. Here, a two-dimensional state graph is constructed and...
In this paper, we present a simple two-class QoS model for random access systems. We provide a practical mechanism for categorizing the available resources into two distinct service classes prior to medium access. We use an a Markov chain model to define the states and transitions, and derive the system access success probability. This provides a mathematical basis for an accurate model that can be...
In this paper, we develop an analytical model based on Markov chains for studying the handoff performance of the Integrated Cellular Ad hoc Relaying (iCAR) system. We verify the analytical model via simulations. Then, based on the model, we analyze the call blocking and dropping probabilities of iCAR system with and without call admission control (CAC) schemes. The fractional guard channel scheme...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.