IMPACT OF MOBILITY IN DENSE LTE-A NETWORKS WITH SMALL CELLS M. Bruno Baynat (Université Pierre et Marie Curie – LIP6) Mme. Raluca-Maria Indre (Orange Labs)

Slides:



Advertisements
Similar presentations
Xia Zhou*, Stratis Ioannidis ♯, and Laurent Massoulié + * University of California, Santa Barbara ♯ Technicolor Research Lab, Palo Alto + Technicolor Research.
Advertisements

Mobility Increase the Capacity of Ad-hoc Wireless Network Matthias Gossglauser / David Tse Infocom 2001.
Modeling and Dimensioning of Mobile Networks: from GSM to LTE
Maciej Stasiak, Mariusz Głąbowski Arkadiusz Wiśniewski, Piotr Zwierzykowski Groups models Modeling and Dimensioning of Mobile Networks: from GSM to LTE.
Delay and Throughput in Random Access Wireless Mesh Networks Nabhendra Bisnik, Alhussein Abouzeid ECSE Department Rensselaer Polytechnic Institute (RPI)
Cell Design to Maximize Capacity in CDMA Networks Robert Akl, D.Sc.
Load Balancing of Elastic Traffic in Heterogeneous Wireless Networks Abdulfetah Khalid, Samuli Aalto and Pasi Lassila
Silberschatz, Galvin and Gagne  2002 Modified for CSCI 399, Royden, Operating System Concepts Operating Systems Lecture 19 Scheduling IV.
Wenye Wang Xinbing Wang Arne Nilsson Department of Electrical and Computer Engineering, NC State University March 2005 A New Admission Control Scheme under.
Queueing Models for P2P Systems.  Extend classical queuing theory for P2P systems.  Develop taxonomy for different variations of these queuing models.
Modelling and Performance Analysis of BitTorrent-Like Peer-to-Peer Networks.
TCP Stability and Resource Allocation: Part II. Issues with TCP Round-trip bias Instability under large bandwidth-delay product Transient performance.
Queuing Theory For Dummies
HW # Due Day: Nov 23.
*Sponsored in part by the DARPA IT-MANET Program, NSF OCE Opportunistic Scheduling with Reliability Guarantees in Cognitive Radio Networks Rahul.
Channel Allocation for the GPRS Design and Performance Study Huei-Wen Ferng, Ph.D. Assistant Professor Department of Computer Science and Information Engineering.
Queueing Analysis for Access Points with Failures and Handoffs of Mobile Stations in Wireless Networks Chen Xinyu and Michael R. Lyu The Chinese Univ.
OS Fall ’ 02 Performance Evaluation Operating Systems Fall 2002.
1 Performance Evaluation of Computer Networks Objectives  Introduction to Queuing Theory  Little’s Theorem  Standard Notation of Queuing Systems  Poisson.
Queueing Theory: Part I
1 Queueing Theory H Plan: –Introduce basics of Queueing Theory –Define notation and terminology used –Discuss properties of queuing models –Show examples.
Queueing Network Model. Single Class Model Open - Infinite stream of arriving customers Closed - Finite population eg Intranet users Indistinguishable.
ECE 776 Information Theory Capacity of Fading Channels with Channel Side Information Andrea J. Goldsmith and Pravin P. Varaiya, Professor Name: Dr. Osvaldo.
Little’s Theorem Examples Courtesy of: Dr. Abdul Waheed (previous instructor at COE)
1 Multiple class queueing networks Mean Value Analysis - Open queueing networks - Closed queueing networks.
On G-network and resource allocation in multimedia systems 報告者 : 王敬育.
7/3/2015© 2007 Raymond P. Jefferis III1 Queuing Systems.
OS Fall ’ 02 Performance Evaluation Operating Systems Fall 2002.
HW # Due Day: Nov 23.
Dimitrios Konstantas, Evangelos Grigoroudis, Vassilis S. Kouikoglou and Stratos Ioannidis Department of Production Engineering and Management Technical.
Investigating Depth-Fanout Trade-Off in WiMAX Mesh Networks Salim Nahle Luigi Iannone Benoit Donnet Timur Friedman Laboratoire LIP6 – CNRS Université Pierre.
Introduction to Queuing Theory
Alleviating cellular network congestion caused by traffic lights Hind ZAARAOUI, Zwi ALTMAN, Tania JIMENEZ, Eitan ALTMAN.
A bit on Queueing Theory: M/M/1, M/G/1, GI/G/1 Yoni Nazarathy * EURANDOM, Eindhoven University of Technology, The Netherlands. (As of Dec 1: Swinburne.
1 Performance Evaluation of Computer Networks: Part II Objectives r Simulation Modeling r Classification of Simulation Modeling r Discrete-Event Simulation.
M EAN -V ALUE A NALYSIS Manijeh Keshtgary O VERVIEW Analysis of Open Queueing Networks Mean-Value Analysis 2.
OPTIMAL SERVER PROVISIONING AND FREQUENCY ADJUSTMENT IN SERVER CLUSTERS Presented by: Xinying Zheng 09/13/ XINYING ZHENG, YU CAI MICHIGAN TECHNOLOGICAL.
PhD-TW-Colloquium, October 09, 2008Polling systems as performance models for mobile ad hoc networking Ahmad Al Hanbali, Richard Boucherie, Jan-Kees van.
Online Spectrum Allocation for Cognitive Cellular Network Supporting Scalable Demands Jianfei Wang
Probability Review Thinh Nguyen. Probability Theory Review Sample space Bayes’ Rule Independence Expectation Distributions.
EE360 PRESENTATION On “Mobility Increases the Capacity of Ad-hoc Wireless Networks” By Matthias Grossglauser, David Tse IEEE INFOCOM 2001 Chris Lee 02/07/2014.
Microprocessor-based systems Curse 7 Memory hierarchies.
Placement of WiFi Access Points for Efficient WiFi Offloading in an Overlay Network Adviser : Frank, Yeong-Sung Lin Presented by Shin-Yao Chen.
Analysis of a Multiservice and an Elastic Traffic Model on a CDMA link Ioannis Koukoutsidis Post-Doctoral Fellow, INRIA Projet MAESTRO.
報告人:陳柏偉 日期: 指導老師:林永松.  ABSTRACT  INTRODUCTION  MODEL FOR ELASTIC TRAFFIC  INTERFERENCE COORDINATION SCHEMES  SELF-ORGANIZING INTERFERENCE.
Introduction to Operations Research
Performance evaluation of video transcoding and caching solutions in mobile networks Jim Roberts (IRT-SystemX) joint work with Salah Eddine Elayoubi (Orange.
NETE4631:Capacity Planning (2)- Lecture 10 Suronapee Phoomvuthisarn, Ph.D. /
Modelling and channel borrowing in mobile communications networks Richard J. Boucherie University of Twente Faculty of Mathematical Sciences University.
Flows and Networks Plan for today (lecture 6): Last time / Questions? Kelly / Whittle network Optimal design of a Kelly / Whittle network: optimisation.
Queuing Theory Basic properties, Markovian models, Networks of queues, General service time distributions, Finite source models, Multiserver queues Chapter.
Modeling and Analysis of Computer Networks
On Optimizing the Backoff Interval for Random Access Scheme Zygmunt J. Hass and Jing Deng IEEE Transactions on Communications, Dec 2003.
Queuing Networks Jean-Yves Le Boudec 1. Contents 1.The Class of Multi-Class Product Form Networks 2.The Elements of a Product-Form Network 3.The Product-Form.
Networks Plan for today (lecture 8): Last time / Questions? Quasi reversibility Network of quasi reversible queues Symmetric queues, insensitivity Partial.
Queuing Networks Jean-Yves Le Boudec 1. Networks of Queues Stability Queuing networks are frequently used models The stability issue may, in general,
An Optimal Service Ordering for a World Wide Web Server A Presentation for the Fifth INFORMS Telecommunications Conference March 6, 2000 Amy Csizmar Dalal.
Yoni Nazarathy Gideon Weiss University of Haifa Yoni Nazarathy Gideon Weiss University of Haifa The Asymptotic Variance Rate of the Departure Process of.
yahoo.com SUT-System Level Performance Models yahoo.com SUT-System Level Performance Models8-1 chapter11 Single Queue Systems.
Cell Zooming for Cost-Efficient Green Cellular Networks
1 Dr. Ali Amiri TCOM 5143 Lecture 8 Capacity Assignment in Centralized Networks.
M/M/1 Queues Customers arrive according to a Poisson process with rate. There is only one server. Service time is exponential with rate  j-1 jj+1...
Content caching and scheduling in wireless networks with elastic and inelastic traffic Group-VI 09CS CS CS30020 Performance Modelling in Computer.
1 An Analytical Model for the Dimensioning of a GPRS/EDGE Network with a Capacity Constraint on a Group of Cells r , r , r Nogueira,
SERENA: SchEduling RoutEr Nodes Activity in wireless ad hoc and sensor networks Pascale Minet and Saoucene Mahfoudh INRIA, Rocquencourt Le Chesnay.
Adv. Wireless Comm. Systems - Cellular Networks -
Cellular Digital Packet Data: Channel Availability
Queuing Networks Mean Value Analysis
Resource Sharing with Subexponential Distributions
Presentation transcript:

IMPACT OF MOBILITY IN DENSE LTE-A NETWORKS WITH SMALL CELLS M. Bruno Baynat (Université Pierre et Marie Curie – LIP6) Mme. Raluca-Maria Indre (Orange Labs) M. Narcisse Nya (Université Pierre et Marie Curie – LIP6) M. Philippe Olivier (Orange Labs) M. Alain Simonian (Orange Labs) 1

PLAN  Context  Motivations  Goal  Network Model  Network assumptions  Modeling assumptions  Markovian Model  Fixed Point approximation  Performance results  Conclusion and future works 2 IDEFIX MEETING Mars 2015

CONTEXT  Constant increase of data in mobile networks  Massive deployment of small cells  Increase the proportion of mobile users  Impact of this increase on the performance of LTE-A 3 IDEFIX MEETING Mars 2015

MOTIVATIONS  Evaluate and quantify the impact of mobility on the performance of small cells 4 IDEFIX MEETING Mars 2015

GOAL  Simple analitical models  Influence of mobile users on the performance of static users  Amount of generated handovers 5 IDEFIX MEETING Mars 2015

NETWORK MODEL 6 IDEFIX MEETING Mars 2015

Macro Cell NETWORK MODEL 7 IDEFIX MEETING Mars 2015

NETWORK MODEL 8 Macro Cell IDEFIX MEETING Mars 2015

ASSUMPTIONS 9 IDEFIX MEETING Mars 2015

10 NETWORK ASSUMPTIONS  Cell with constant capacity C  Two types of users  Static users  Mobile users  Equitable ressources sharing : Round-Robin  Each users download data of size Σ  Full transmission for static users  Mobile users remain in the cell for a limited time θ IDEFIX MEETING Mars 2015

11 MODELING ASSUMPTIONS  Requests for transmission is generated according to Poisson processes  Rate λ s for static users  Rate λ m for mobile users  Exponential distribution of service time  Exponential remaining sojourn time of an active mobile user θ  Exponential distribution of data to download Σ IDEFIX MEETING Mars 2015

MARKOVIAN MODEL 12 IDEFIX MEETING Mars 2015

MARKOVIAN MODEL 13 n s, n m 13 n s, n m +1 n s +1, n m n s -1, n m n s, n m -1 Inverse of mean sojourn time Arrival rate of static users’ requests Arrival rate of mobile users’ requests Service rate of the cell IDEFIX MEETING Mars 2015

MARKOVIAN MODEL 14  The model is exact  Stability condition  Does not depend on the mobile users  Numerical resolution  Truncating both dimensions of state space  Gauss-Seidel or Least mean square IDEFIX MEETING Mars 2015

MARKOVIAN MODEL 15 IDEFIX MEETING Mars 2015 Mean time to transfer the average volume E(Σ)  Performance indicators of interest  Average throughput obtained by any user  Propotion of handover

MARKOVIAN MODEL 16  Limitations of the model :  Exponential distribution of mobile users sojourn time  Exponential distribution of data to transmit  Resolution complexity  Scalability IDEFIX MEETING Mars 2015

FIXED POINT APPROXIMATION 17 IDEFIX MEETING Mars 2015

18 FIXED POINT APPROXIMATION 18 Capacity of the cell Average size of the downloaded file Average size downloaded by a mobile user ?  Two classes of users with different service rate  Multi-class Processor-Sharing queue with two classes of customers IDEFIX MEETING Mars 2015

19 FIXED POINT APPROXIMATION 19 IDEFIX MEETING Mars 2015  Stability condition  Multi-class PS queue  Thus necessary that  For this system  is sufficient

20 FIXED POINT APPROXIMATION 20 IDEFIX MEETING Mars 2015  How to calculate ?  Depends on sojourn time and average throughput of the user  If the parameter is known  Standard results for the stationary multi-class processor sharing

21 FIXED POINT APPROXIMATION 21  Knowing the distribution of Σ  Fixed point Throughput of the user given by the PS queue  If is known IDEFIX MEETING Mars 2015

FIXED POINT APPROXIMATION  Performance indicators of interest  Average throughput obtained by any user  handover probability  Exponential distribution of and and 22

PERFORMANCE RESULTS 23 IDEFIX MEETING Mars 2015

24 PERFORMANCE RESULTS  Θ and Σ are both exponentially distributed  The Markovian model is exact IDEFIX MEETING Mars 2015 Static users throughputMobile users throughput

25 PERFORMANCE RESULTS  Θ and Σ are both exponentially distributed  The Markovian model is exact IDEFIX MEETING Mars 2015

26 PERFORMANCE RESULTS  Impact of sojourn time distribution IDEFIX MEETING Mars 2015

27 PERFORMANCE RESULTS  Impact of key parameters User throughput with differrent cell size User throughput with different speed IDEFIX MEETING Mars 2015

CONCLUSION & FUTURE WORKS 28 IDEFIX MEETING Mars 2015

29 CONCLUSION AND FUTURE WORKS IDEFIX MEETING Mars 2015  Markovian model  Exponential distribution of θ and Σ  Resolution complexity  Not extensible  Exact

30 CONCLUSION AND FUTURE WORKS IDEFIX MEETING Mars 2015  Fixed point approximation  Approximate model   Very simple  Easily extensible

31 CONCLUSION AND FUTURE WORKS IDEFIX MEETING Mars 2015  Future Works  Macro-cell with several coding zones  Several neighboring cells

THANK YOU FOR YOUR ATTENTION