2/16/2016 Subject Name: Digital Switching Systems Subject Code:10EC82 Prepared By: Aparna.P, Farha Kowser Department: Electronics and Communication Date:3-3-2015.

Slides:



Advertisements
Similar presentations
Introduction to Traffic Engineering
Advertisements

Modeling and Dimensioning of Mobile Networks: from GSM to LTE
E&CE 418: Tutorial-4 Instructor: Prof. Xuemin (Sherman) Shen
Maciej Stasiak, Mariusz Głąbowski Arkadiusz Wiśniewski, Piotr Zwierzykowski Groups models Modeling and Dimensioning of Mobile Networks: from GSM to LTE.
Florida Institute of technologies ECE 5221 Personal Communication Systems Prepared by: Dr. Ivica Kostanic Lecture 19: Traffic planning (3) Spring 2011.
Capacity Setting and Queuing Theory
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)
Multiaccess Problem How to let distributed users (efficiently) share a single broadcast channel? ⇒ How to form a queue for distributed users? The protocols.
EE 489 Traffic Theory University of Alberta Dept. of Electrical and Computer Engineering Wayne Grover TRLabs and University of Alberta.
On Modeling Feedback Congestion Control Mechanism of TCP using Fluid Flow Approximation and Queuing Theory  Hisamatu Hiroyuki Department of Infomatics.
Waiting Lines Queues.
Little’s Theorem Examples Courtesy of: Dr. Abdul Waheed (previous instructor at COE)
Mobile Communication Systems
7/3/2015© 2007 Raymond P. Jefferis III1 Queuing Systems.
Trunking & Grade of Service
1 Describing of parameters of traffic generated by user of multimedia services offered by telco operators Jacek Oko, Janusz Klink Institute of Telecommunication.
Local Number Portability Traffic Analysis Calculations ENGR 475 – Telecommunications October 19, 2006 Harding University Jonathan White.
Lecture 11: Cellular Networks
Applications of Poisson Process
8/28/2015  A. Orda, R. Rom, A. Segall, Design of Computer Networks Prof. Ariel Orda Room 914, ext 4646.
Basic teletraffic concepts An intuitive approach
Simulation Examples ~ By Hand ~ Using Excel
Interference ,Trunking and GOS
CHAPTER SIX FUNCTIONS OF RANDOM VARIABLES SAMPLING DISTRIBUTIONS.
ISM 270 Service Engineering and Management Lecture 7: Forecasting and Managing Service Capacity.
Florida Institute of technologies ECE 5221 Personal Communication Systems Prepared by: Dr. Ivica Kostanic Lecture 17: Traffic planning Spring 2011.
Introduction Random Process. Where do we start from? Undergraduate Graduate Probability course Our main course Review and Additional course If we have.
Software Performance Testing Based on Workload Characterization Elaine Weyuker Alberto Avritzer Joe Kondek Danielle Liu AT&T Labs.
Introduction to Operations Research
Lecture 5: Cellular networks Anders Västberg Slides are a selection from the slides from chapter 10 from:
Cellular Wireless Networks
Florida Institute of technologies ECE 5221 Personal Communication Systems Prepared by: Dr. Ivica Kostanic Lecture 20: Traffic planning (4) Spring 2011.
1 Voice Traffic Engineering & Management. 2 PSTN and PBX networks are designed with 2 objectives: Maximize usage of their circuits Maximize usage of their.
Introduction to Network Design. e 2 Acknowledgement Edward Chow Robert Cahn.
M/M/1 queue λn = λ, (n >=0); μn = μ (n>=1) λ μ λ: arrival rate
COMT 2201 Managing Telecommunications Systems. COMT 2202 Managing Telecommunications Configuration Management Security Management Accounting Management.
1 Chapters 8 Overview of Queuing Analysis. Chapter 8 Overview of Queuing Analysis 2 Projected vs. Actual Response Time.
EE6610: Week 6 Lectures.
Network Design and Analysis-----Wang Wenjie Queuing Theory III: 1 © Graduate University, Chinese academy of Sciences. Network Design and Performance Analysis.
EELE 5490, Fall, 2009 Wireless Communications Ali S. Afana Department of Electrical Engineering Class 4 Sep. 30 th, 2009.
Modeling and Simulation Queuing theory
The M/M/ N / N Queue etc COMP5416 Advanced Network Technologies.
CSCI1600: Embedded and Real Time Software Lecture 19: Queuing Theory Steven Reiss, Fall 2015.
COMT 4291 Computing Resource Requirements for Circuit Switched Networks Introduction.
EE 489 Telecommunication Systems Engineering University of Alberta Dept. of Electrical and Computer Engineering Introduction to Traffic Theory Wayne Grover.
Signalling Techniques
C HAPTER 4  Hypothesis Testing -Test for one and two means -Test for one and two proportions.
The Cellular Concept Early Mobile Communications The Cellular Concept
Lecture#14 Methods of the queuing theory The Bonch-Bruevich Saint-Petersburg State University of Telecommunications Series of lectures “Telecommunication.
Chapter 5 Elementary Stochastic Analysis Prof. Ali Movaghar.
COMT 4291 Queuing Analysis COMT Call/Packet Arrival Arrival Rate, Inter-arrival Time, 1/ Arrival Rate measures the number of customer arrivals.
Chap 2 Network Analysis and Queueing Theory 1. Two approaches to network design 1- “Build first, worry later” approach - More ad hoc, less systematic.
© 2015 McGraw-Hill Education. All rights reserved. Chapter 17 Queueing Theory.
Thought of the day Thought of the day Difference between science and spirituality is same as the difference between word and silence. Sameer Trapasiya.
Queueing Fundamentals for Network Design Application ECE/CSC 777: Telecommunications Network Design Fall, 2013, Rudra Dutta.
1 BIS 3106: Business Process Management (BPM) Lecture Nine: Quantitative Process Analysis (2) Makerere University School of Computing and Informatics Technology.
Abu Bashar Queuing Theory. What is queuing ?? Queues or waiting lines arise when the demand for a service facility exceeds the capacity of that facility,
CHANNEL LOADING CALCULATOR FOR 700 MHz Regional Planning Committee Guidance By Joe Kuran Wednesday March 9 th 2016.
Chapter 4 Circuit-Switching Networks
Tele traffic A telephone network is composed of a variety of common equipment, such as: Digital receivers Call processors Inter-stage switching links &
Fundamentals of Cellular Networks (Part IV)
Finite M/M/1 queue Consider an M/M/1 queue with finite waiting room.
Trunking Theory In general, there are many more users than channels--everyone can’t have a permanent personal channel! Fortunately, only a small fraction.
Subject Name: DIGITAL SWITCHING SYSTEMS Subject Code: 10EC82
Waiting Lines Queues.
Dept. of Electrical and Computer Engineering
The M/G/1 Queue and others.
Chapter-5 Traffic Engineering.
Course Description Queuing Analysis This queuing course
VIRTUE MARYLEE MUGURACHANI QUEING THEORY BIRTH and DEATH.
Presentation transcript:

2/16/2016 Subject Name: Digital Switching Systems Subject Code:10EC82 Prepared By: Aparna.P, Farha Kowser Department: Electronics and Communication Date:

Unit 3 Telecommunication Traffic

Unit of traffic Congestion Traffic measurement GOS Mathematical Model of traffic Lost call systems Queueing systems

TRAFFIC DESIGN REQUIREMENTS In the study of tele traffic engineering, to model a system and to analyze the change in traffic after designing, the static characteristics of an exchange should be studied. The incoming traffic undergoes variations in many ways. The traffic is unpredictable and random in nature. So, the traffic pattern/characteristics of an exchange should be analyzed for the system design. The grade of service and the blocking probability are also important parameters for the traffic study.

Traffic Statistics The following statistical information provides answer for the requirement of trunk circuits for a given volume of offered traffic and grade of service to interconnect the end offices. The statistical descriptions of a traffic is important for the analysis and design of any switching network. Calling rate Holding time Distribution of destinations. User behavior Average occupancy

Traffic Pattern An understanding of the nature of telephone traffic and its distribution with respect to time (traffic load) which is normally 24 hours is essential. It helps in determining the amount of lines required to serve the subscriber needs. The variations are not uniform and varies season to season, month to month, day to day and hour to hour. Busy hour. Traditionally, a telecommunication facility is engineered on the intensity of traffic during the busy hour in the busy session. Taking into account the fluctuations in traffic, CCITT in its recommendations E.600 defined the busy hour as follows.

Busy hour. Continuous 60 minutes interval for which the traffic volume or the number of call attempts is greatest. Peak busy hour. It is the busy hour each day varies from day to day, over a number of days. Time consistent busy hour. The 1 hour period starting at the same time each day for which the average traffic volume or the number of call attempts is greatest over the days under consideration.

Call completion rate (CCR). Based on the status of the called subscriber or the design of switching system the call attempted may be successful or not. The call completion rate is defined as the ratio of the number of successful calls to the number of call attempts. Busy hour call attempts Busy hour calling rate. Day-to-day hour traffic ratio

Units of Telephone Traffic Traffic intensity is measured in two ways. They are (a) Erlangs and (b) Cent call seconds (CCS). Erlangs. The international unit of traffic is the Erlangs. It is named after the Danish Mathematician, Agner Krarup Erlang, who laid the foundation to traffic theory in the work he did for the copenhagen telephone company starting 1908.

Grade of Service (GOS) For non-blocking service of an exchange, it is necessary to provide as many lines as there are subscribers. But it is not economical. So, some calls have to be rejected and retried when the lines are being used by other subscribers. The grade of service refers to the proportion of unsuccessful calls relative to the total number of calls. GOS is defined as the ratio of lost traffic to offered traffic.

Blocking Probability and Congestion The value of the blocking probability is one aspect of the telephone company’s grade of service. Based on the number of rejected calls, GOS is calculated, whereas by observing the busy servers in the switching system, blocking probability will be calculated. When the number of sources is large, the probability of a new call arising is independent of the number already in progress and therefore the call congestion is equal to time congestion.

MODELLING OF TRAFFIC To analyze the statistical characteristics of a switching system, traffic flow and service time, it is necessary to have a mathematical model of the traffic offered to telecommunication systems. The facilities of the switching systems are shared by many users. This arrangement may introduce the possibility of call setup inability due to lack of available facilities. The mathematical description of the queueing system characterics is called a queueing model.

Lost Calls Cleared (LCC) System The LCC model assumes that, the subscriber who does not avail the service, hangs up the call, and tries later. The first person to account fully and accurately for the effect of cleared calls in the calculation of blocking probabilities was A.K. Erlang in The Erlang loss system can be modeled by birth and death process with birth and death rate as follows.

Queueing Systems In this the call will not lost it will be delayed The assumptions are  Pure chance traffic  Statistical Equilibrium  Full availability  Calls which encounter congestion enter into a queue and stored until a server becomes free.

Queueing Systems Second Erlang’s Distribution Let x be the no.of calls in the System. When x N, all the servers are busy and incoming calls encounter delay; there are N calls Served and x-N calls in the queue. IF x≤N: There is no queue the system will act as lost call system in the absence of congestion.

Queueing Systems If x>N: The probability of a call arrival during time δt is given by The Probability of a transition from x-1 to x is given by The probability of call ending is given by The transition probability from x to x-1 is given by

Queueing Systems

If there is no limit for the queue x can have any value between 0 and ∞ We can write This is second erlangs Distribution formula

Queueing Systems Probability of Delay. Delay occurs if all servers are busy, the probability that there are at least Z calls in the system is given by

Queueing Systems This is called Erlang’s delay formula