This paper proposes an analytical model for delayed reservation scheme, which can be exactly analyzed. By applying it to a server-based QoS management network, we can obtain the related blocking probability and the waiting time distribution of requests, and discuss its performance by means of numerical results. The numerical results show that the delayed scheme can improve the blocking probabil...

Common Radio Resource Management (CRRM) is required to support the provision of Quality of Service (QoS) and the efficient utilization of radio resources in coexisting different Radio Access Technologies (RATs). In this paper, an Adaptive-Terminal Modality-Based Joint Call Admission Control (ATJCAC) algorithm is proposed to enhance connection-level QoS and reduce call blocking/dropping probabil...

The outage probability is a key performance measure for real-time traffic in wireless networks, often considered as even more critical than the blocking probability. The blocking and outage probabilities do not have closed-form expressions as they depend in a too complex way on the traffic characteristics (call duration, bit rate requirement), the radio conditions (fading, shadowing, noise, int...

We consider multi-class blocking systems in which jobs require a single processing step. There are groups of servers that can each serve a different subset of all job classes. The assignment of jobs occurs according to some fixed overflow policy. We are interested in the blocking probabilities of each class. This model can be used for call centers, tele-communication and computer networks. An a...

Blocking probability has been one of the significant parameters in the design of WDM optical networks. In most of the network topologies the probability for each link to be occupied is different. There are always some links which are more likely to be used than others which can be denoted as key links. The existing routing algorithms do not take this important factor into account significantly....

One of the major concerns in the field of computer Network is how to Transfer large amount of data and Transfer that data without any congestion or faults. Optical Burst Switching networks are used today for the huge transfer of data. So, Fault Tolerance is an important Issue in the Optical burst switching network. Fault tolerant refers to the ability of the network to transfer the information ...

This paper presents a concise yet comprehensive description of a multi-channel Vehicle-to-Infrastructure (V2I) communication system. Existing mathematical models for such a system overlook some of its essential behavioural characteristics such as the reneging, force-termination and ultimately blocking of service requests. A multi-server queueing model with First-In-First-Out (FIFO) service poli...

This paper proposes an improved wireless communication channel reservation policy to address the impact on network performance cannot be analyzed under the original model with the primary and secondary users communication channel occupancy rates, and the problem that the secondary user blocking state is significantly higher than the primary user blocking probability under the original model. Si...

In a lexical decision task (LDT) in which list composition is manipulated, a typical finding to date has been a slowdown for easy items (e.g., high-frequency words) but little speedup for hard items (e.g., low-frequency words) when they are mixed together. This asymmetric frequency-blocking effect contrasts with the symmetric pattern (both a speedup for hard items and a slowdown for easy items ...

This paper proposes an adaptive unicast routing algorithm for large scale symmetric networks comprising 2 × 2 switch elements such as Beneš networks. This algorithm trades off the probability of blocking against algorithm execution time. Deterministic algorithms exploit the rearrangeability property of Beneš networks to ensure a zero blocking probability for unicast connections, at the expense ...