• xmlui.mirage2.page-structure.header.title
    • français
    • English
  • Help
  • Login
  • Language 
    • Français
    • English
View Item 
  •   BIRD Home
  • LAMSADE (UMR CNRS 7243)
  • LAMSADE : Publications
  • View Item
  •   BIRD Home
  • LAMSADE (UMR CNRS 7243)
  • LAMSADE : Publications
  • View Item
JavaScript is disabled for your browser. Some features of this site may not work without it.

Browse

BIRDResearch centres & CollectionsBy Issue DateAuthorsTitlesTypeThis CollectionBy Issue DateAuthorsTitlesType

My Account

LoginRegister

Statistics

Most Popular ItemsStatistics by CountryMost Popular Authors
Thumbnail - Request a copy

Performance Evaluation of Mobile Networks based on stochastic ordering of Markov chains

Mokdad, Lynda; Castel-Taleb, Hind; Ben Othman, Jalel (2006), Performance Evaluation of Mobile Networks based on stochastic ordering of Markov chains, Studia Informatica Universalis, 4, 2, p. 191-208

Type
Article accepté pour publication ou publié
Date
2006
Journal name
Studia Informatica Universalis
Volume
4
Number
2
Publisher
Hermann
Pages
191-208
Metadata
Show full item record
Author(s)
Mokdad, Lynda
Castel-Taleb, Hind
Ben Othman, Jalel cc
Abstract (EN)
The modeling of mobile networks is difficult because of the number of users and their mobilities. In this study, we present a new methodology based upon stochastic ordering of Markov chains in order to evaluate the performance measures in wireless networks. These kind of networks are based on cellular systems. The cellular systems use different frequency coverage in order to increase system capacity. During a communication, a user may move from one cell to another which is named the handover. We propose to compute the dropping handover probabilities. The system is represented by a continuous time Markov chain which is too large to be solved by a numerical method. Our approach is to define a new Markov chain with a smaller state space size, and which provides an upper bound for the dropping handover probabilities. We define an aggregation process based on the weak stochastic orderings in order to define the aggregated upper Markov chain. We have proved using the stochastic comparison that the aggregatedMarkov chain provides an upper bound for the dropping handover probabilities.
Subjects / Keywords
Wireless networks; mobility; Quality of Service; Performance evaluation; Stochastic bounds; Stochastic orders

Related items

Showing items related by title and author.

  • Thumbnail
    Performance Analysis of a Call Admission Control for mobile networks 
    Mokdad, Lynda; Castel-Taleb, Hind; Ben Othman, Jalel (2005) Communication / Conférence
  • Thumbnail
    Bounds on Performance Measures in Wireless Networks 
    Mokdad, Lynda; Castel-Taleb, Hind; Ben Othman, Jalel (2003) Communication / Conférence
  • Thumbnail
    Multi-services MAC protocol for wireless Networks 
    Ben Othman, Jalel; Castel-Taleb, Hind; Mokdad, Lynda (2005) Communication / Conférence
  • Thumbnail
    Stochastic Ordering based Markov process aggregations: applications to tandem queues 
    Castel-Taleb, Hind; Mokdad, Lynda; Pekergin, Nihal (2006) Communication / Conférence
  • Thumbnail
    Stochastic comparisons: a methodology for the performance evaluation of fixed and mobile 
    Mokdad, Lynda; Castel-Taleb, Hind (2008) Article accepté pour publication ou publié
Dauphine PSL Bibliothèque logo
Place du Maréchal de Lattre de Tassigny 75775 Paris Cedex 16
Phone: 01 44 05 40 94
Contact
Dauphine PSL logoEQUIS logoCreative Commons logo