Maciej Stasiak, Mariusz Głąbowski Arkadiusz Wiśniewski, Piotr Zwierzykowski Modeling of Overflow Traffic Systems Modeling and Dimensioning of Mobile Networks:

Slides:



Advertisements
Similar presentations
Ch. 12 Routing in Switched Networks
Advertisements

Maciej Stasiak, Mariusz Głąbowski Arkadiusz Wiśniewski, Piotr Zwierzykowski Basic Definitions and Terminology Modeling and Dimensioning of Mobile Networks:
Maciej Stasiak, Mariusz Głąbowski Arkadiusz Wiśniewski, Piotr Zwierzykowski Models of Links Carrying Multi-Service Traffic Chapter 7 Modeling and Dimensioning.
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.
Lecture: 4 WDM Networks Design & Operation
Example 1 Solve ax b c for x. Then use the solution to solve Solve a literal equation + = += 2x SOLUTION STEP 1 Solve ax b c for x. += ax b c Write.
Chapter 4: Network Layer
Author: Wayne Grover (materials set in PowerPoint by J. Doucette 2002) 1 Alternate Routing Other H. U. C Alternate Route AB High Usage Route (Direct Route)
1 Performance Evaluation of Computer Networks Objectives  Introduction to Queuing Theory  Little’s Theorem  Standard Notation of Queuing Systems  Poisson.
Pattern Classification All materials in these slides were taken from Pattern Classification (2nd ed) by R. O. Duda, P. E. Hart and D. G. Stork, John Wiley.
November 2001Dynamic Alternative Routing1 Yashar Ganjali Stanford University November 2001.
Hidden Markov Model: Extension of Markov Chains
Chapter 3 (part 3): Maximum-Likelihood and Bayesian Parameter Estimation Hidden Markov Model: Extension of Markov Chains All materials used in this course.
Trunking & Grade of Service
Queuing Networks: Burke’s Theorem, Kleinrock’s Approximation, and Jackson’s Theorem Wade Trappe.
Mariusz Głąbowski, Adam Kaliszan, Maciej Stasiak A New Convolution Algorithm of Blocking Probability Calculation in Full-Availability Group with Bandwidth.
Write reasons for each step
Basic teletraffic concepts An intuitive approach
Fundamental Lower Bound for Node Buffer Size in Intermittently Connected Wireless Networks Yuanzhong Xu, Xinbing Wang Shanghai Jiao Tong University, China.
1 Meeyoung Cha, Sue Moon, Chong-Dae Park Aman Shaikh Placing Relay Nodes for Intra-Domain Path Diversity To appear in IEEE INFOCOM 2006.
5.4 Sum and Difference Formulas In this section students will use sum and difference formulas to evaluate trigonometric functions, verify identities, and.
Modelling and channel borrowing in mobile communications networks Richard J. Boucherie University of Twente Faculty of Mathematical Sciences University.
Networks of Queues Plan for today (lecture 6): Last time / Questions? Product form preserving blocking Interpretation traffic equations Kelly / Whittle.
Presenter: Jonathan Murphy On Adaptive Routing in Wavelength-Routed Networks Authors: Ching-Fang Hsu Te-Lung Liu Nen-Fu Huang.
Chapter 7 Sampling and Sampling Distributions ©. Simple Random Sample simple random sample Suppose that we want to select a sample of n objects from a.
Chapter 61 Continuous Time Markov Chains Birth and Death Processes,Transition Probability Function, Kolmogorov Equations, Limiting Probabilities, Uniformization.
Model under consideration: Loss system Collection of resources to which calls with holding time  (c) and class c arrive at random instances. An arriving.
An Optimal Design of the M/M/C/K Queue for Call Centers
OPTIMAL POLICIES FOR A MULTI- ECHELON INVENTORY PROBLEM ANDREW J. CLARK AND HERBERT SCARF October 1959 Presented By İsmail Koca.
Warm Up #4 1. Write 15x2 + 6x = 14x2 – 12 in standard form. ANSWER
Approximating the Performance of Call Centers with Queues using Loss Models Ph. Chevalier, J-Chr. Van den Schrieck Université catholique de Louvain.
Effects of Call Arrival Rate and Mobility on Network Throughput in Multi-Cell CDMA Manju Hegde, Robert Akl, Paul Min Washington University St. Louis,
The M/M/ N / N Queue etc COMP5416 Advanced Network Technologies.
Greetings from Almaty. Сentral idea The optimization of resource usage for a particular type of traffic.
1 Presented by Sarbagya Buddhacharya. 2 Increasing bandwidth demand in telecommunication networks is satisfied by WDM networks. Dimensioning of WDM networks.
Solving Linear Equations Define and use: Linear Equation in one variable, Solution types, Equivalent Equations.
Maciej Stasiak, Mariusz Głąbowski Arkadiusz Wiśniewski, Piotr Zwierzykowski Model of the Nodes in the Packet Network Chapter 10.
1 An Arc-Path Model for OSPF Weight Setting Problem Dr.Jeffery Kennington Anusha Madhavan.
CSE 2813 Discrete Structures Solving Recurrence Relations Section 6.2.
Notes Over 5.6 Quadratic Formula
1 Dynamic RWA Connection requests arrive sequentially. Setup a lightpath when a connection request arrives and teardown the lightpath when a connection.
Telecommunications JBCardenas © 1982 JBC © 1982~2006 v 3.01 HW1 due before Q3 © jbc Max group size 4, with XX is remainder modulo 6 of sum of equivalent.
Load Balanced Link Reversal Routing in Mobile Wireless Ad Hoc Networks Nabhendra Bisnik, Alhussein Abouzeid ECSE Department RPI Costas Busch CSCI Department.
Flows and Networks Plan for today (lecture 6): Last time / Questions? Kelly / Whittle network Optimal design of a Kelly / Whittle network: optimisation.
EXAMPLE 1 Solve an equation with two real solutions Solve x 2 + 3x = 2. x 2 + 3x = 2 Write original equation. x 2 + 3x – 2 = 0 Write in standard form.
Queueing Theory II.
System Provisioning.
Topics to be Discussed Star-Delta Transformation. Equivalence.
CTMCs & N/M/* Queues.
Adv. Wireless Comm. Systems - Cellular Networks -
2 Understanding Variables and Solving Equations.
Finite M/M/1 queue Consider an M/M/1 queue with finite waiting room.
Generalized Jackson Networks (Approximate Decomposition Methods)
En Wang 1,2 , Yongjian Yang 1 , and Jie Wu 2
Warmup 1. Solve x2 – 14x + 9 = 0 by completing the square.
1.206J/16.77J/ESD.215J Airline Schedule Planning
Transportation Engineering Route Choice January 28, 2011
6.4 Factoring and Solving Polynomial Equations
“Sizing the Direct Route”
Network Planning dan Dimensioning (2)
Queueing Theory II.
2 Understanding Variables and Solving Equations.
Pattern Classification All materials in these slides were taken from Pattern Classification (2nd ed) by R. O. Duda, P. E. Hart and D. G. Stork, John.
Pattern Classification All materials in these slides were taken from Pattern Classification (2nd ed) by R. O. Duda, P. E. Hart and D. G. Stork, John.
Chapter-5 Traffic Engineering.
Warm Up #4 1. Write 15x2 + 6x = 14x2 – 12 in standard form. ANSWER
One step equations Chapter 2 Section 2.1.
Solving 1 and 2 Step Equations
Presentation transcript:

Maciej Stasiak, Mariusz Głąbowski Arkadiusz Wiśniewski, Piotr Zwierzykowski Modeling of Overflow Traffic Systems Modeling and Dimensioning of Mobile Networks: from GSM to LTE

Simplified division of groups in a network High usage groups o Blocking probability of the group is higher than the acceptable level of blocking in the network Low usage groups o Blocking probability of the group is lower or equal than the acceptable level of blocking in the network 2Modeling and Dimensioning of Mobile Networks: from GSM to LTE

Hierarchical network configuration Modeling and Dimensioning of Mobile Networks: from GSM to LTE3 Low usage group High usage group Transit level Local level

Fixed hierarchical alternative routing Public networks generally use hierarchical alternative call routing strategy with fixed sequences of alternative choices Sequences o Direct (first choice links) Calls not accepted are offered to the second choice links o Alternative choice links Calls not accepted are offered to the next choice link o Last choice links Calls not accepted are lost Modeling and Dimensioning of Mobile Networks: from GSM to LTE4

A network example AB – direct path o the first choice path o origin – destination pair ACB – second choice path ADB – third choice path ADCB – last choice path 5

Overflow traffic Because of the paekedness of overflow traffic, a larger number of links is required to carry the same amount of traffic, at an acceptable blocking probability, than it would be required for Poisson traffic Modeling and Dimensioning of Mobile Networks: from GSM to LTE6

Overflow traffic parameters Mean value of overflow traffic R Variance of overflow traffic σ 2 Peakedness (variance/mean) Spreadness (variance-mean) Modeling and Dimensioning of Mobile Networks: from GSM to LTE7 A... R, D (σ 2,Z) V

Overflow traffic parameters 8 Parameteroffered trafficcarried traffic overflow traffic Peakedness factor Z = 1Z < 1Z > 1 Spreadness factor D = 0D < 0D > 0

Markov process in the overflow system Modeling and Dimensioning of Mobile Networks: from GSM to LTE9 State probability: A R, D (σ 2,Z) V  Primary groupSecondary group where: i(t) is the number of occupied links in the primary group, j(t) is the number of occupied links in the secondary group. Primary (direct) group Secondary (overflow) group

Two-dimensional Markov process Modeling and Dimensioning of Mobile Networks: from GSM to LTE10 State equations

Two-dimensional Markov process Modeling and Dimensioning of Mobile Networks: from GSM to LTE11 State equations

Parameters of overflow traffic Results - Riordan formulae NOTE! o For Poisson traffic stream the variance is equal to the mean value, thus: Modeling and Dimensioning of Mobile Networks: from GSM to LTE12

Dimensioning of overflow groups (one- parameter model) Determination of overflow traffic parameters: Required capacity of the alternative group: Modeling and Dimensioning of Mobile Networks: from GSM to LTE13

Equivalent Random Traffic method step 1 ERT Modeling and Dimensioning of Mobile Networks: from GSM to LTE14 V ov

ERT method - step 2 Modeling and Dimensioning of Mobile Networks: from GSM to LTE15 Traffic stream overflowing from equivalent group is the same as the sum of traffic streams overflowing from real groups V ov V1V1 A1A1 R 1, D 1 VkVk AkAk R 1, D k V ov V* A* R, D equivalent group

ERT method - step 2 Modeling and Dimensioning of Mobile Networks: from GSM to LTE16 Iteration method can be used to solve this equations V ov V1V1 A1A1 R 1, D 1 VkVk AkAk R 1, D k V ov V* A* R, D equivalent group

ERT method - step 2 Modeling and Dimensioning of Mobile Networks: from GSM to LTE17 Rapp approximate solution V ov V1V1 A1A1 R 1, D 1 VkVk AkAk R 1, D k V ov V* A* R, D equivalent group

ERT method - step 2 Blocking probability of the total offered traffic in the system Modeling and Dimensioning of Mobile Networks: from GSM to LTE18 V ov V* A* R

ERT method - step 3 Blocking probability in the overflow group Modeling and Dimensioning of Mobile Networks: from GSM to LTE19

ERT methodPoisson traffic + overflow traffic) Determination of overflow traffic parameters: Modeling and Dimensioning of Mobile Networks: from GSM to LTE20 V ov V1V1 A1A1 R 1, D 1 A3A3 V2V2 A2A2 R 2, D 2

Hayward’s equivalence method Hayward’s equivalence method Modeling and Dimensioning of Mobile Networks: from GSM to LTE21 V ov V1V1 A1A1 R1R1 VkVk AkAk RkRk

Interpretation of the Hayward method Modeling and Dimensioning of Mobile Networks: from GSM to LTE22 (V, R, Z) - system (V, R, Z)-system transformation into Z equal subsystems (V/Z, R/Z, 1): Blocking probability in each subsystem is the same and can be evaluated by Erlang formula: R, Z V R/Z,1 V/Z R/Z,1 V/Z R/Z,1 V/Z 1 2 Z (V/Z, R/Z, 1) - subsystems transformation

Dimensioning of the networks links Erlang FormulaHayward Formula Modeling and Dimensioning of Mobile Networks: from GSM to LTE23 Hayward Formula is used for dimensioning network groups with unrecognized traffic pattern. Frequently, it is assumed that Z = (2 - 3).

Dimensioning of groups in the network Two problems are needed to be solved for dimensioning of groups in the network with hierarchical alternative routing o Determination of optimal capacity for high usage group o Dimensioning of overflow groups Attention o Traffic stream offered to alternative groups is not an Erlang traffic stream Modeling and Dimensioning of Mobile Networks: from GSM to LTE24