نتایج جستجو برای: blocking probability

تعداد نتایج: 267845  

Journal: :Wireless Networks 2015
Mostafa Zaman Chowdhury Mohammad Arif Hossain Shakil Ahmed Yeong Min Jang

In the modern era, cellular communication consumers are exponentially increasing as they find the system more user-friendly. Due to enormous users and their numerous demands, it has become a mandate to make the best use of the limited radio resources that assures the highest standard of Quality of Service (QoS). To reach the guaranteed level of QoS for the maximum number of users, maximum utili...

2001
Jason P. Jue Gaoxi Xiao

In this paper, we develop a model for evaluating the blocking probability of various connection management protocols for wavelengthrouted optical networks with dynamic lightpath establishment. The model characterizes both the blocking due to insufficient resources, as well as the blocking due to multiple interfering connection requests. We then use the analytical model to compare two connection...

2013
Shashank Chaturvedi Papiya Dutta

In the previous 20 years, wavelength conversion has received a considerable attention due to its strong influence on the blocking performance of wavelength-routed WDM networks. In a wavelength-routed WDM network, end users communicate with one another via all-optical WDM channels. In all-optical WDM channels optical fibre is used. Optical fibre is a single, hair-fine filament drawn from molten ...

2007
Chen Yu Yasushi Inoguchi Susumu Horiguchi

Banyan networks are attractive for serving as the optical switch architectures due to their nice properties of small depth and absolutely signal loss uniformity. Banyan structure is one of the candidates for serving as the directional-coupler (DC)-based switching systems that can switch signals at the rate of several terabits per second. Despite many advantages, optical banyan networks suffer f...

1997
Jorma T. Virtamo Samuli Aalto

We consider the calculation of time-dependent blocking probabilities in the M/M/n/n loss system. We present a new method which allows one to find the temporal evolution of the probability of any given state, and, in particular, that of the blocking state without the need to solve the probabilities of all the other states or to find the eigenvalues and eigenvectors of a very large matrix corresp...

1999
Sung Cheol CHANG Dan Keun SUNG

A dynamic pre-allocated connection (DPC) scheme is proposed to support fast handoff and to effectively utilize wireline links. Since the proposed scheme uses pre-allocated switched virtual connections (PSVCs), handoff can be quickly executed in real-time with reduced connection overhead. This dynamic resource management scheme increases utilization of wireline links due to statistical multiplex...

2015
ANDREW LI WARD WHITT JINGTONG ZHAO

The modified-offered-load approximation can be used to choose a staffing function (the time-varying number of servers) to stabilize delay probabilities at target levels in multi-server delay models with time-varying arrival rates, with or without customer abandonment. In contrast, as we confirm with simulations, it is not possible to stabilize blocking probabilities to the same extent in corres...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید