IFIP Performance 2007 On Processor Sharing (PS) and Its Applications to Cellular Data Network Provisioning Yujing Wu, Carey Williamson, Jingxiang Luo Department.

Slides:



Advertisements
Similar presentations
Lookback Scheduling for Long-Term Quality-of-Service Over Multiple Cells Hatem Abou-zeid*, Stefan Valentin, Hossam S. Hassanein*, and Mohamed F. Feteiha.
Advertisements

Mobility Increase the Capacity of Ad-hoc Wireless Network Matthias Gossglauser / David Tse Infocom 2001.
Detecting MAC Layer Back-off Timer Violations in Mobile Ad Hoc Networks Venkata Nishanth Lolla, Lap Kong Law, Srikanth V. Krishnamurthy, Chinya Ravishankar,
Queuing Network Models for Delay Analysis of Multihop Wireless Ad Hoc Networks Nabhendra Bisnik and Alhussein Abouzeid Rensselaer Polytechnic Institute.
2005/12/06OPLAB, Dept. of IM, NTU1 Optimizing the ARQ Performance in Downlink Packet Data Systems With Scheduling Haitao Zheng, Member, IEEE Harish Viswanathan,
1 Chapter 8 Queueing models. 2 Delay and Queueing Main source of delay Transmission (e.g., n/R) Propagation (e.g., d/c) Retransmission (e.g., in ARQ)
Short-Term Fairness and Long- Term QoS Lei Ying ECE dept, Iowa State University, Joint work with Bo Tan, UIUC and R. Srikant, UIUC.
DYNAMIC POWER ALLOCATION AND ROUTING FOR TIME-VARYING WIRELESS NETWORKS Michael J. Neely, Eytan Modiano and Charles E.Rohrs Presented by Ruogu Li Department.
Load Balancing of Elastic Traffic in Heterogeneous Wireless Networks Abdulfetah Khalid, Samuli Aalto and Pasi Lassila
Fair queueing and congestion control Jim Roberts (France Telecom) Joint work with Jordan Augé Workshop on Congestion Control Hamilton Institute, Sept 2005.
IP traffic and QoS control : the need for flow aware networking Jim Roberts France Telecom R&D NSF-COST Workshop.
1 Network Information Flow in Network of Queues Phillipa Gill, Zongpeng Li, Anirban Mahanti, Jingxiang Luo, and Carey Williamson Department of Computer.
CanQueue September 15, Performance Modeling of Stochastic Capacity Networks Carey Williamson iCORE Chair Department of Computer Science University.
Kuang-Hao Liu et al Presented by Xin Che 11/18/09.
Analyzing Multi-channel MAC Protocols for Underwater Sensor Networks Presenter: Zhong Zhou.
ECS 152A Acknowledgement: slides from S. Kalyanaraman & B.Sikdar
EEE440 Modern Communication Systems Cellular Systems.
Channel Allocation for the GPRS Design and Performance Study Huei-Wen Ferng, Ph.D. Assistant Professor Department of Computer Science and Information Engineering.
1 Cross-Layer Design for Wireless Communication Networks Ness B. Shroff Center for Wireless Systems and Applications (CWSA) School of Electrical and Computer.
1 Performance Evaluation of Computer Networks Objectives  Introduction to Queuing Theory  Little’s Theorem  Standard Notation of Queuing Systems  Poisson.
Flow-level Stability of Utility-based Allocations for Non-convex Rate Regions Alexandre Proutiere France Telecom R&D ENS Paris Joint work with T. Bonald.
Little’s Theorem Examples Courtesy of: Dr. Abdul Waheed (previous instructor at COE)
Rensselaer Polytechnic Institute © Shivkumar Kalvanaraman & © Biplab Sikdar1 ECSE-4730: Computer Communication Networks (CCN) Network Layer Performance.
EE360: Lecture 15 Outline Cellular System Capacity
STOCHASTIC GEOMETRY AND RANDOM GRAPHS FOR THE ANALYSIS AND DESIGN OF WIRELESS NETWORKS Haenggi et al EE 360 : 19 th February 2014.
Buffer Management for Shared- Memory ATM Switches Written By: Mutlu Apraci John A.Copelan Georgia Institute of Technology Presented By: Yan Huang.
Lesson 11: Solved M/G/1 Exercises
Submission doc.: IEEE 11-14/0070r0 Jan 2014 Josiam et.al., SamsungSlide 1 Joint MAC/PHY Evaluation Methodology Date: Authors:
Distributed resource allocation in wireless data networks: Performance and design Alexandre Proutière Orange-FT / ENS Paris.
21 Mar 2002 First Israelli-Swedish Workshop on Next Generation Networking1 / 28 Stochastic Analysis of Wireless-fair Scheduling Hwee Pink Tan and Raphael.
1 Performance Evaluation of Computer Networks: Part II Objectives r Simulation Modeling r Classification of Simulation Modeling r Discrete-Event Simulation.
Network Analysis A brief introduction on queues, delays, and tokens Lin Gu, Computer Networking: A Top Down Approach 6 th edition. Jim Kurose.
Adaptive CSMA under the SINR Model: Fast convergence using the Bethe Approximation Krishna Jagannathan IIT Madras (Joint work with) Peruru Subrahmanya.
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.
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.
Introduction to Queueing Theory
Networks of Queues Plan for today (lecture 6): Last time / Questions? Product form preserving blocking Interpretation traffic equations Kelly / Whittle.
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
1 Chapters 8 Overview of Queuing Analysis. Chapter 8 Overview of Queuing Analysis 2 Projected vs. Actual Response Time.
Congestion Control in CSMA-Based Networks with Inconsistent Channel State V. Gambiroza and E. Knightly Rice Networks Group
Delay-Based Back-Pressure Scheduling in Multi-Hop Wireless Networks 1 Bo Ji, 2 Changhee Joo and 1 Ness B. Shroff 1 Department of ECE, The Ohio State University.
Statistical-Time Access Fairness Index of One-Bit Feedback Fair Scheduler Fumio Ishizaki Dept. of Systems Design and Engineering Nanzan University, Japan.
A Joint Channel and Queue-Aware Scheduling for IEEE Wireless Metropolitan Area Networks Mehri Mehrjoo, Xuemin Shen, Kshirassgar Naik WCNC 2007.
7-1 Introduction to Queueing Theory l Components of a queueing system n probability density function (pdf) of interarrival times n pdf of service times.
Approximating the Performance of Call Centers with Queues using Loss Models Ph. Chevalier, J-Chr. Van den Schrieck Université catholique de Louvain.
Information Theory for Mobile Ad-Hoc Networks (ITMANET): The FLoWS Project Competitive Scheduling in Wireless Networks with Correlated Channel State Ozan.
The M/M/ N / N Queue etc COMP5416 Advanced Network Technologies.
OPERATING SYSTEMS CS 3530 Summer 2014 Systems and Models Chapter 03.
Content caching and scheduling in wireless networks with elastic and inelastic traffic Group-VI 09CS CS CS30020 Performance Modelling in Computer.
Maciej Stasiak, Mariusz Głąbowski Arkadiusz Wiśniewski, Piotr Zwierzykowski Model of the Nodes in the Packet Network Chapter 10.
2/14/2016  A. Orda, A. Segall, 1 Queueing Networks M nodes external arrival rate (Poisson) service rate in each node (exponential) upon service completion.
Flows and Networks Plan for today (lecture 6): Last time / Questions? Kelly / Whittle network Optimal design of a Kelly / Whittle network: optimisation.
Courtesy Piggybacking: Supporting Differentiated Services in Multihop Mobile Ad Hoc Networks Wei LiuXiang Chen Yuguang Fang WING Dept. of ECE University.
Michael Einhaus, ComNets, RWTH Aachen University Distributed and Adjacent Subchannels in Cellular OFDMA Systems Michael Einhaus Chair of Communication.
OPERATING SYSTEMS CS 3502 Fall 2017
Introduction to Queueing Theory
Supervised By: Prof. Bassem M.Mokhtar Mohamed Wagdy Nomeir
Howard Huang, Sivarama Venkatesan, and Harish Viswanathan
Scheduling in Wireless Communication Systems
Professor Arne Thesen, University of Wisconsin-Madison
Insensitivity in IP network performance
Computer Systems Performance Evaluation
Throughput-Optimal Broadcast in Dynamic Wireless Networks
Buffer Management for Shared-Memory ATM Switches
Javad Ghaderi, Tianxiong Ji and R. Srikant
Computer Systems Performance Evaluation
Chapter-5 Traffic Engineering.
Presentation transcript:

IFIP Performance 2007 On Processor Sharing (PS) and Its Applications to Cellular Data Network Provisioning Yujing Wu, Carey Williamson, Jingxiang Luo Department of Computer Science University of Calgary

IFIP Performance Motivation Insensitivity of network performance to the traffic details is a desirable property, since it facilitates robust traffic engineering. Example: Erlang B call blocking formula How about 3G cellular data networks? Are performance measures sensitive to the detailed traffic characteristics (e.g., flow size distribution, flow inter-arrival time, number of flows, correlations) or not?

IFIP Performance Synopsis of Paper Q: Processor Sharing (PS) = insensitivity? Egalitarian Processor Sharing (EPS): yes Discriminatory Processor Sharing (DPS): no DPS is a better model of cellular networks with Proportional Fairness (PF) scheduling Insensitivity study carried out for DPS DPS is “approximately insensitive” EV-DO simulation study verifies DPS results Results do not hold for differentiated services

IFIP Performance Key Contributions Improve the understanding of PS Prove the strict insensitivity of EPS in a relevant new case (i.e., finite capacity EPS) Systematically investigate the approximate insensitivity of DPS by simulation Apply these findings to traffic engineering for the downlink in 3G cellular data networks Practical insensitivity when PF scheduling is used Sensitivity when supporting differentiated services

IFIP Performance Outline Motivation & Contributions Modeling cellular data networks EPS and DPS results Simulation of a cellular system Service differentiation Summary

IFIP Performance Downlink Model for a Cellular Data Network data flow 1 data flow 2 data flow n MS PF scheduler current feasible rate: r( i ) TDM ms frame forward link C(t) CAC flow arrivals feasible rate of flow j at slot t realized throughput of flow j up to slot t schedule flow i at slot t propagation loss, shadowing, fast fading

IFIP Performance Modeling Cellular Networks The downlink of the cellular system behaves like a PS queue with respect to the flow-level performance With different assumptions about rate variations, the system can be abstracted to different models. Homogenous rate variation (idealized situation): the feasible rate fluctuates around the mean for all active flows, and these fluctuations are statistically identical for all users. Heterogeneous rate variation: the feasible rate fluctuations around the mean for active flows are statistically different. PF allocates more time to users with lower variability in the feasible rate. EPS DPS

IFIP Performance Traffic model I: Poisson flow arrivals The flow size distribution is general. Poisson process

IFIP Performance Traffic model II: Poisson session arrivals Flows in a session session arrival epochs (Poisson process) 1.distribution of number of flows per session 2.flow size distribution 3.think time distribution 4.correlation in successive flow and think time statistics general session structure flexibility to model more realistic traffic.

IFIP Performance Outline Motivation & Contributions Modeling cellular data networks EPS and DPS results Simulation of a cellular system Service differentiation Summary

IFIP Performance EPS Queue Results Insensitivity has been proven for: Poisson flow arrivals without blocking [Cohen; Kelly] Poisson session traffic with infinite capacity [Bonald et al. 2001abc; Bonald 2006; Borst 2003] We prove that the joint queue length distribution, mean number of active flows, and blocking probabilities are insensitive to the session structure in the finite-capacity EPS queue fed by Poisson session arrivals.

IFIP Performance Finite Capacity EPS system Model the system by a queueing network with a restricted state space. Apply results from stochastic queueing network theory for the proof. (see paper) Value? Assuming homogenous rate variation in the cellular system, we can replace the complicated Poisson session traffic with simple Poisson flows with exponentially distributed flow sizes. The simplified model will suffice for provisioning purposes.

IFIP Performance DPS Queue Results Rigorously speaking, performance is sensitive to the traffic details [Bonald 2004] Insensitive bounds and limiting approximations exist. [Fayolle 1980; van Kessel 2005; Bonald 2004; Boxma 2006] Do the insensitivity properties of EPS systems approximately carry over to DPS for certain parameter choices?

IFIP Performance DPS Model of 3G System M flow types Within type m, l m subclasses reflecting unequal sharing of time slots Assume all flows are geographically placed uniformly at random in the cell site, independent of their types.

IFIP Performance DPS Simulation Model Single class of traffic, but different flow weights Finite-capacity: at most 15 concurrent flows Two types of Poisson session traffic Type 1: 5 flows/session (deterministic), LN flow size (mean 2, CV 3), HyperExp thinking time (mean 1, CV 3) Type 2: Geo dist. for flow/session (mean 10), exp dist. thinking time (mean 0.05), flow sizes being one of five dist. (Deterministic, Exp, HyperExp, LN, Pareto) Change session details of type 2 and compare the results to those in the case where both types are Poisson flows with exponentially distributed sizes.

IFIP Performance DPS Simulation Results W i =[1, 2], i=1, 2W i =[1, 10], i=1, 2

IFIP Performance DPS Observations Flow details (session structure) have little impact on the first-order system performance unless the weights among different flows are highly skewed (e.g., the weight ratio is 10 or more). In practical cellular systems, the unequal slot sharing among flows caused by PF scheduling and by heterogeneous rate variations is only modest (e.g., weight ratio is less than 2). It is conjectured that traffic details do not affect the metrics relevant to network provisioning.

IFIP Performance Outline Motivation & Contributions Modeling cellular data networks EPS and DPS results Simulation of a cellular system Service differentiation Summary

IFIP Performance EV-DO System Model Simulate a shared downlink data channel of the central cell site surrounded by interfering cells (6 direct neighbours, and 12 outer cells). All BSs transmit at full power on the downlink. The channel model includes propagation loss, slow fading, and fast fading. Flows are placed uniformly at random in the center cell, and users do not move during flow transmission. Each active flow has a time-varying SINR updated at every slot.

IFIP Performance Static User Scenario Node ID Slot share 18.4% 17.9%16.9%14.6%13.7% xxxxxx node 1node 6 PF unfairness exists, but it is not extreme! BS

IFIP Performance Dynamic User Scenario Poisson flow arrivals flow size: m=50kB Poisson session arrivals flows per session: geometric dist., m=30; think time: exp dist., m=5s flow size: m=50KB No blocking Approximate insensitivity!

IFIP Performance Outline Motivation & Contributions Modeling cellular data networks EPS and DPS results Simulation of a cellular system Service differentiation Summary

IFIP Performance Service Differentiation Deliberately treat traffic unequally at the type level (i.e., strict priority) To what extent does the weight asymmetry among traffic types change the insensitivity property? A DPS system with two types of Poisson flow arrivals, each with a single subclass.

IFIP Performance DPS with Differentiated Service Change flow size distribution of high priority traffic type Change flow size distribution of low priority traffic type

IFIP Performance Service Differentiation Results Compared to the bias among subclasses, the bias among traffic types manifests sensitivity in a much more dramatic way. Depending on the traffic priority, variability in the flow size distribution has different impacts. Using simple traffic models may lead to under- estimation or over-estimation of performance in the cellular system when differentiated services are deployed.

IFIP Performance Summary Studied EPS/DPS models of cellular networks Extended the theoretical analysis of the EPS insensitivity to a new finite-capacity case. Showed that the first-order performance of DPS systems is approximately insensitive to the session structure in relevant regime for practical parameter settings. Simple and robust traffic engineering is possible for cellular systems using DPS for PF scheduling. The introduction of differentiated services may pose a great challenge for future cellular network provisioning.