On the retrial and redial phenomena in GSM networks

2000-01-01
Onur, Ertan
Ersoy, C
Caglayan, MU
GSM operators work with call data that include retrials and redials as well. Based on these inflated, virtual call attempt statistics, it appears that enormous demands are put on the available spectrum. In this paper, we develop simple models to estimate the expected number of retrials and redials per original call attempt, which is used to determine the effective load and the number of traffic channels required to meet the grade of service. It is shown that significantly fewer channels are capable of handling high traffic loads.

Suggestions

On the Efficiency of Selective Search
Hafizoglu, Fatih; Kucukoglu, Emre Can; Altıngövde, İsmail Sengör (2017-04-13)
Our work shows that the query latency for selective search over a topically partitioned collection can be reduced by up to 55%. We achieve this by physically storing the documents in each topical cluster across all shards and building a cluster-skipping index at each shard. Our approach also achieves uniform load balance among the shards.
A comparative evaluation of XML repositories
Ünal, Özgül; Doğaç, Asuman; Department of Information Systems (2002)
Recently XML has established itself as the standard for representing data in scientific and business applications. Starting out as a standard data exchange format over the web, it has become instrumental in all kinds of applications. Almost all standardization efforts on the web today are based on XML. As a consequence, the amount of XML data being stored and processed is large and will be increasing at a very rapid rate. This has caused XML data management to become a focus of research efforts in the datab...
Towards finding optimal mixture of subspaces for data classification
Musa, Mohamed Elhafiz Mustafa; Atalay, Mehmet Volkan; Department of Computer Engineering (2003)
In pattern recognition, when data has different structures in different parts of the input space, fitting one global model can be slow and inaccurate. Learning methods can quickly learn the structure of the data in local regions, consequently, offering faster and more accurate model fitting. Breaking training data set into smaller subsets may lead to curse of dimensionality problem, as a training sample subset may not be enough for estimating the required set of parameters for the submodels. Increasing the ...
Enhanced adjacent extreme-point search and tabu search for the minimum concave-cost uncapacitated transshipment problem
Bazlamaçcı, Cüneyt Fehmi (Informa UK Limited, 1996-09-01)
Practicable methods for optimising concave-cast, uncapacitated transshipment networks are non exact. In this paper, one such effective method, that of adjacent extreme point search, is further developed to enhance its overall computational efficiency. The enhanced search algorithm is then imbedded in a tabu search scheme which proved capable of finding better solutions, by a wide margin in some instances. Another tabu search scheme, somewhat inferior in terms of solution quality but computationally more eff...
On event signal reconstruction in wireless sensor networks
Atakan, Baris; Akan, Oezguer B. (2007-05-18)
In Wireless Sensor Networks (WSN), the effective detection and reconstruction of the event signal is mainly based on the regulation of sampling and communication parameters used by the sensor nodes. The aim of this paper is to understand the effect of these parameters on the reconstruction performance of event signal in WSN. Theoretical analysis and results show that with proper selection of sampling and communication parameters, the event signal can be satisfactorily reconstructed at the sink. Furthermore,...
Citation Formats
E. Onur, C. Ersoy, and M. Caglayan, “On the retrial and redial phenomena in GSM networks,” 2000, Accessed: 00, 2020. [Online]. Available: https://hdl.handle.net/11511/55009.