scholarly journals Congestion Probabilities in Erlang-Engset Multirate Loss Models under the Multiple Fractional Channel Reservation Policy

2016 ◽  
Vol 21 (1) ◽  
pp. 35-46 ◽  
Author(s):  
Ioannis D. Moscholios
Keyword(s):  
Random Process ◽  
High Speed ◽  
Form Solution ◽  
Communication Link ◽  
Available Bandwidth ◽  
Channel Reservation ◽  
Blocking Probabilities ◽  
First Case ◽  
Recursive Formulas ◽  
Call Blocking Probabilities

Abstract A communication link that accommodates different service-classes whose calls have different bandwidth requirements and compete for the available bandwidth under the Multiple Fractional Channel Reservation (MFCR) policy is considered. The MFCR policy allows the reservation of real number of channels in order to favor high speed calls. Two call arrival processes are studied: i) the Poisson (random) process and ii) the quasi-random process. In the first case, calls come from an infinite number of sources while in the second case calls are generated by a finite number of sources. To determine call blocking probabilities for Poisson arriving calls, recursive formulas are proposed based on reverse transition rates. To determine time and call congestion probabilities for quasi-random arriving calls, recursive formulas are proven based on the fact that the steady state probabilities cannot be described by a product form solution. The accuracy of the new formulas is verified through simulation.

scholarly journals Call-level Analysis of a Two-Link Multirate Loss Model based on a Convolution Algorithm

2018 ◽  
Vol 1 ◽  
pp. 3-10
Author(s):  
Stefanos G. Sagkriotis ◽  
Spyros K. Pantelis ◽  
Ioannis D. Moscholios ◽  
Vassilios G. Vassilakis
Keyword(s):  
Form Solution ◽  
The Other ◽  
Bandwidth Sharing ◽  
Call Blocking ◽  
Loss Model ◽  
Available Bandwidth ◽  
Blocking Probabilities ◽  
Convolution Algorithm ◽  
Support Threshold ◽  
Call Blocking Probabilities

We consider a two-link system that accommodates Poisson arriving calls from different service-classes and propose a multirate teletraffic loss model for its analysis. Each link has two thresholds, which refer to the number of in-service calls in the link. The lowest threshold, named support threshold, defines up to which point the link can support calls offloaded from the other link. The highest threshold, named offloading threshold, defines the point where the link starts offloading calls to the other link. The adopted bandwidth sharing policy is the complete sharing policy, in which a call can be accepted in a link if there exist enough available bandwidth units. The model does not have a product form solution for the steady state probabilities. However, we propose approximate formulas, based on a convolution algorithm, for the calculation of call blocking probabilities. The accuracy of the formulas is verified through simulation and found to be quite satisfactory.

scholarly journals Probabilistic Retry and Threshold Multirate Loss Models for Impatient Calls

Telecom ◽  
2021 ◽  
Vol 2 (1) ◽  
pp. 28-41
Author(s):  
Ioannis D. Moscholios
Keyword(s):  
Service Time ◽  
Loss System ◽  
Call Blocking ◽  
Loss Model ◽  
Bandwidth Requirement ◽  
Blocking Probabilities ◽  
Recursive Formulas ◽  
Loss Models ◽  
Call Blocking Probabilities ◽  
Initial Peak

In this paper, a link of fixed capacity is considered that services calls from different service-classes. Calls arrive in the link according to a Poisson process, have an initial (peak) bandwidth requirement while their service time is exponentially distributed. We model this system as a multirate loss system and analyze two different multirate loss models. In the first model, named probabilistic retry loss model, if there is no available link bandwidth, a new call is blocked but retries with a lower bandwidth requirement and increased service time. To allow for the fact that a blocked call may be impatient, we assume that it retries with a probability. In the second model, named probabilistic threshold loss model, a call may reduce its bandwidth requirement (before blocking occurs) based on the occupied link bandwidth. To determine call blocking probabilities in both multirate loss models, we show that approximate but recursive formulas do exist that provide quite satisfactory results compared to simulation.

scholarly journals Call Blocking Probabilities under a Probabilistic Bandwidth Reservation Policy in Mobile Hotspots

Telecom ◽  
2021 ◽  
Vol 2 (4) ◽  
pp. 554-573
Author(s):  
Irene P. Keramidi ◽  
Ioannis D. Moscholios ◽  
Panagiotis G. Sarigiannidis
Keyword(s):  
Iterative Algorithms ◽  
Access Point ◽  
Arrival Process ◽  
It Services ◽  
Bandwidth Reservation ◽  
Call Blocking ◽  
Loss Model ◽  
Available Bandwidth ◽  
Blocking Probabilities ◽  
Call Blocking Probabilities

In this paper we study a mobility-aware call admission control algorithm in a mobile hotspot. To this end, a vehicle is considered which has an access point with a fixed capacity. The vehicle alternates between stop and moving phases. When the vehicle is in the stop phase, it services new and handover calls by prioritizing them via a probabilistic bandwidth reservation (BR) policy. Based on this policy, new handover calls may enter the reservation space with a predefined probability. When the vehicle is in the moving phase, it services new calls only. In that phase, two different policies are considered: (a) the classical complete sharing (CS) policy, where new calls are accepted in the system whenever there exists available bandwidth, and (b) the probabilistic BR policy. Depending on the selected policy in the moving phase, we propose the probabilistic BR loss model (if the CS policy is selected) and the generalized probabilistic BR loss model (if the probabilistic BR policy is selected). In both stop and moving phases, where the call arrival process is Poisson, calls require a single bandwidth unit in order to be accepted in the system, while the service time is exponentially distributed. To analytically determine call blocking probabilities and the system’s utilization, we propose efficient iterative algorithms based on two-dimensional Markov chains. The accuracy of the proposed algorithms is verified via simulation.

Analysis of Inter-Satellite Optical Wireless Communication System

2017 ◽  
Vol 7 (10) ◽  
pp. 10
Author(s):  
Rajbir Singh
Keyword(s):  
Wireless Communication ◽  
Optical Networks ◽  
Data Transmission ◽  
High Speed ◽  
Open Space ◽  
Communication Link ◽  
Optical Wireless Communication ◽  
Optical Wireless ◽  
High Speed Data ◽  
Speed Data Transmission

Optical networks are bandwidth efficient networks are used for long haul communication providing seamless data transfer. For high speed data transmission in open space between different satellites, Inter-satellite Optical wireless communication (IsOWC) is widely used .In this paper we have evaluated the performance of IsOWC communication link for high speed data transmission .The performance of the system is evaluated on the basis of qualitative parameters such as Q-factor and BER using optisystem simulator.

A 2 × 20 Gbps hybrid MDM-OFDM–based high-altitude platform-to-satellite FSO transmission system

2020 ◽  
Vol 0 (0) ◽  
Author(s):  
Vel Murugan Gomathy ◽  
T. V. Paramasivam Sundararajan ◽  
C. Sengodan Boopathi ◽  
Pandiyan Venkatesh Kumar ◽  
Krishnamoorthy Vinoth Kumar ◽  
...  
Keyword(s):  
High Altitude ◽  
Orthogonal Frequency Division Multiplexing ◽  
High Speed ◽  
Satellite Communication ◽  
Input Power ◽  
Transmission System ◽  
Communication Link ◽  
Space Optics ◽  
High Altitude Platform ◽  
Mode Division Multiplexing

AbstractIn the present study, the application of free space optics (FSO) transmission system to realize a long-reach high-altitude platform (HAP)-to-satellite communication link has been exploited. High-speed information transmission without interference is accomplished using orthogonal frequency division multiplexing (OFDM). Further, the information capacity of the proposed system is increased by employing mode division multiplexing (MDM). We have investigated the proposed MDM-OFDM-HAP-to-satellite FSO transmission system performance over varying FSO range, diameter of the receiver, pointing errors, and input power. Also, an improved transmission performance of the proposed system using a square root module is reported.

A secure high-speed retrodirective communication link

2005 ◽  
Vol 53 (11) ◽  
pp. 3548-3556 ◽  
Author(s):  
D.S. Goshi ◽  
K.M.K.H. Leong ◽  
T. Itoh
Keyword(s):  
High Speed ◽  
Communication Link
Sign in / Sign up

Export Citation Format

Share Document