2004
DOI: 10.1109/twc.2004.826310
|View full text |Cite
|
Sign up to set email alerts
|

Performance Analysis of Handoff Resource Allocation Strategies Through the State-Dependent Rejection Scheme

Abstract: Abstract-The state-dependent rejection scheme (SRS) provides a common framework for analysing existing handoff schemes and for designing new ones easily. Designing new schemes is made simple by determining the appropriate set of state-dependent probabilities. The Markov analysis of SRS is simple and useful for drawing initial conclusions on handoff strategies. The analysis and simulations carried out here demonstrate the capability of SRS to adapt to different mobility and load scenarios and to achieve good pe… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

1
23
0
7

Year Published

2006
2006
2010
2010

Publication Types

Select...
4
2
2

Relationship

0
8

Authors

Journals

citations
Cited by 48 publications
(31 citation statements)
references
References 28 publications
1
23
0
7
Order By: Relevance
“…Since PD cannot be perceived by the users, PF is computed through it. If we take into account that a call on average visits α+1 cells (i.e., requires α HO), the probability of failure can be computed by [22]:…”
Section: Simulation Setupmentioning
confidence: 99%
See 1 more Smart Citation
“…Since PD cannot be perceived by the users, PF is computed through it. If we take into account that a call on average visits α+1 cells (i.e., requires α HO), the probability of failure can be computed by [22]:…”
Section: Simulation Setupmentioning
confidence: 99%
“…The Carried Traffic (CT) is a measure of the efficiency of system capacity utilization and is of interest to network operators. It is calculated using the output of the simulation in the following way [22]:…”
Section: Performance Figuresmentioning
confidence: 99%
“…Obsérvese la diferencia en el comportamiento de las colas de reintentos frente a los típicos sistemas con colas de espera como el que podemos encontrar en [Bar04,HR86]. En este último caso, los servidores permanecen en activo hasta que la cola se vacía.…”
Section: Estructura De Un Sistema De Reintentosunclassified
“…Nótese que en algunos modelos, puesto que el tiempo entre reintentos consecutivos debidos a un handover es mucho menor que el tiempo de servicio y que el tiempo entre la llegada de peticiones consecutivas de servicio, estos reintentos se han modelado mediante una cola con impaciencia [Bar04]. En estos casos, el tiempo de permanencia en dicha cola representa el periodo de permanencia en el área de solape.…”
Section: Reintentos En Redes Móviles Celularesunclassified
“…La literatura sobre propuestas de mecanismos de prioridad para sistemas con dos tipos de tráfico y su estudio es extensísima, incluso cuando nos limitamos a la aplicación en redes celulares (véase por ejemplo [Bar04,DS04] y sus referencias). En [Bar04], Barceló propone un marco genérico de análisis de una familia de mecanismos de control del admisión, SRS (State-dependent Rejection Scheme), en los que la probabilidad de aceptar una nueva sesión depende del número de canales ocupados en ese momento.…”
Section: Sistemas Monoserviciounclassified