Long‐Term Evolution

Stasiak, Maciej; Głąbowski, Mariusz; Wiśniewski, Arkadiusz; Zwierzykowski, Piotr

doi:10.1002/9780470976036.ch3

Cited by 18 publications

(5 citation statements)

References 1 publication

Supporting

Mentioning

Contrasting

Order By: Relevance

“…If now, another call arrives in the 2nd link, then this call cannot be offloaded to the 1st link (since j 1 = 1) but it can be served by the 2nd link due to bandwidth availability. In that case the new state will be (1,4). A similar rationale exists when we consider call arrivals in the 1st link and the states (3, 0), (4,0), (4,1) and (5,1).…”

Section: Appendix -Tutorial Examplementioning

confidence: 81%

“…In that case the new state will be (1,4). A similar rationale exists when we consider call arrivals in the 1st link and the states (3, 0), (4,0), (4,1) and (5,1). Based on the solution of the 42 GB equations of Fig.…”

Section: Appendix -Tutorial Examplementioning

confidence: 90%

“…Then, the call will be accepted in the 2nd link and the new state will be (0, 3). If another new call arrives in the 2nd link then the call will be offloaded to the 1st link (and served by that link) and the new state will be (1,3). If now, another call arrives in the 2nd link, then this call cannot be offloaded to the 1st link (since j 1 = 1) but it can be served by the 2nd link due to bandwidth availability.…”

Section: Appendix -Tutorial Examplementioning

confidence: 99%

“…Quality of service (QoS) mechanisms are necessary in contemporary communication networks in order to provide the required bandwidth needed by calls. In the case of call-level traffic in a single link, modeled as a loss system, such a QoS mechanism is a bandwidth sharing policy [1]. The simplest bandwidth sharing policy is the complete sharing (CS) policy, where a new call is accepted in the system if there exist enough available bandwidth units (b.u.).…”

Section: Introductionmentioning

confidence: 99%

“…Otherwise, call blocking occurs. The simplest teletraffic loss model that adopts the CS policy is the classic Erlang model [1]. In this model, the call arrival process is Poisson, while each call requires one b.u.…”

Section: Introductionmentioning

confidence: 99%

See 4 more Smart Citations

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

Bouckaert¹,

Naudts²,

Moerman³

et al. 2018

JTIT

View full text Add to dashboard Cite

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.

show abstract

Section: Appendix -Tutorial Examplementioning

confidence: 81%

Section: Appendix -Tutorial Examplementioning

confidence: 90%

Section: Appendix -Tutorial Examplementioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 3 more Smart Citations

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

Bouckaert¹,

Naudts²,

Moerman³

et al. 2018

JTIT

View full text Add to dashboard Cite

show abstract

A transmit antenna selection diversity scheme based on ACK/NACK feedback

Pan

Yang

Jin

et al. 2009

2009 15th Asia-Pacific Conference on Communications

View full text Add to dashboard Cite

Making a well-founded choice of the wireless technology for train-to-wayside data services

Verstrepen

Joseph

Tanghe

et al. 2010

2010 9th Conference of Telecommunication, Media and Internet

View full text Add to dashboard Cite

Abstract-The provisioning of wireless data services in the railway environment will become increasingly important for train operators and train constructors in the upcoming years. A wellfounded choice of the technology to be used for the outdoor network connection is investigated in this paper. Several wireless technologies -including HSPA, E-UTRA and WiMAX -are compared by calculating their wireless ranges for reception outside and inside trains, based on the location of the transceiver. These wireless ranges determine the number of base stations needed to cover a pre-defined area along a railway track. Results show that generally 3G (UMTS-HSPA) and 4G (E-UTRA/LTE) technologies offer the best coverage over a range of data rates, from 2 Mbps to 8 Mbps. These data rates relate to a wide variety of services, from network control data, surveillance, crew services to passenger Internet traffic.

show abstract

Long‐Term Evolution

Cited by 18 publications

References 1 publication

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

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

A transmit antenna selection diversity scheme based on ACK/NACK feedback

Making a well-founded choice of the wireless technology for train-to-wayside data services

Contact Info

Product

Resources

About