This document describes using MATLAB to simulate packet traffic using an M/M/1 queue with Erlang C distribution. The simulation finds:
1) The probability of packets being delayed is 0.6402.
2) The average delay for all packets is 382.33 microseconds.
3) The probability of delay exceeding 10 microseconds is 0.6296.
4) The probability of delay exceeding 4 milliseconds is 0.0007895.
The results show the system can acceptably handle packets with over 99% experiencing delays under 4 milliseconds.
Basic communication operations - One to all BroadcastRashiJoshi11
Brief description of Basic communication operations in parallel computing along with description of One to all Broadcast, its implementation on ring, mesh and hypercube, cost of and how to improve speed of one to all broadcast.
Basic communication operations - One to all BroadcastRashiJoshi11
Brief description of Basic communication operations in parallel computing along with description of One to all Broadcast, its implementation on ring, mesh and hypercube, cost of and how to improve speed of one to all broadcast.
AN OPEN SHOP APPROACH IN APPROXIMATING OPTIMAL DATA TRANSMISSION DURATION IN ...csandit
In the past decade Optical WDM Networks (Wavelength Division Multiplexing) are being used quite often and especially as far as broadband applications are concerned. Message packets transmitted through such networks can be interrupted using time slots in order to maximize network usage and minimize the time required for all messages to reach their destination.However, preempting a packet will result in time cost. The problem of scheduling message packets through such a network is referred to as PBS and is known to be NP-Hard. In this paper we have reduced PBS to Open Shop Scheduling and designed variations of polynomially
solvable instances of Open Shop to approximate PBS. We have combined these variations and called the induced algorithm HSA (Hybridic Scheduling Algorithm). We ran experiments to establish the efficiency of HSA and found that in all datasets used it produces schedules very close to the optimal. To further establish HSA’s efficiency we ran tests to compare it to SGA, another algorithm which when tested in the past has yielded excellent results.
Optimization of Collective Communication in MPICH Lino Possamai
This is a lecture about the paper: "Optimization of Collective Communication in MPICH". Department of Computer Science, University Ca' Foscari of Venice, Italy
I am Samantha H. I am a Digital Signal Processing Assignment Expert at matlabassignmentexperts.com. I hold a Master's in Matlab, the University of Alberta Canada. I have been helping students with their assignments for the past 14 years. I solve assignments related to Digital Signal Processing.
Visit matlabassignmentexperts.com or email info@matlabassignmentexperts.com.
You can also call on +1 678 648 4277 for any assistance with Digital Signal Processing Assignment.
A CRITICAL IMPROVEMENT ON OPEN SHOP SCHEDULING ALGORITHM FOR ROUTING IN INTER...IJCNCJournal
In the past years, Interconnection Networks have been used quite often and especially in applications where parallelization is critical. Message packets transmitted through such networks can be interrupted
using buffers in order to maximize network usage and minimize the time required for all messages to reach
their destination. However, preempting a packet will result in topology reconfiguration and consequently in
time cost. The problem of scheduling message packets through such a network is referred to as PBS and is
known to be NP-Hard. In this paper we haveimproved,
ritically, variations of polynomially solvable
instances of Open Shop to approximate PBS. We have combined these variations and called the induced
algorithmI_HSA (Improved Hybridic Scheduling Algorithm). We ran experiments to establish the efficiency
of I_HSA and found that in all datasets used it produces schedules very close to the optimal. In addition, we
tested I_HSA with datasets that follow non-uniform distributions and provided statistical data which
illustrates better its performance.To further establish I_HSA’s efficiency we ran tests to compare it to SGA,
another algorithm which when tested in the past has yielded excellent results.
ENHANCEMENT OF TCP FAIRNESS IN IEEE 802.11 NETWORKScscpconf
The usage of fixed buffers in 802.11 networks has a number of disadvantages associated with
it. This includes high delay, reduced throughput and inefficient channel utilisation. To
overcome this, a dynamic buffer sizing algorithm, the A* algorithm has been implemented at
the access point. In this algorithm buffer size is dynamically adjusted depending upon the
current channel conditions and hence delay is reduced and the throughput is maintained. But
in 802.11 networks with DCF collision avoidance mechanism, it creates significant amount of
unfairness between the upstream and downstream TCP flows, with clusters of upstream ACKs
blocking downstream data at the access point. Thus a variation of the Explicit Window
Adaptation (EWA) scheme has been used to regulate the queuing time of the upload clients by
calculating the feedback value at the access point. This creates fairness and increases the number of transmission opportunities for the downstream traffic
AN OPEN SHOP APPROACH IN APPROXIMATING OPTIMAL DATA TRANSMISSION DURATION IN ...csandit
In the past decade Optical WDM Networks (Wavelength Division Multiplexing) are being used quite often and especially as far as broadband applications are concerned. Message packets transmitted through such networks can be interrupted using time slots in order to maximize network usage and minimize the time required for all messages to reach their destination.However, preempting a packet will result in time cost. The problem of scheduling message packets through such a network is referred to as PBS and is known to be NP-Hard. In this paper we have reduced PBS to Open Shop Scheduling and designed variations of polynomially
solvable instances of Open Shop to approximate PBS. We have combined these variations and called the induced algorithm HSA (Hybridic Scheduling Algorithm). We ran experiments to establish the efficiency of HSA and found that in all datasets used it produces schedules very close to the optimal. To further establish HSA’s efficiency we ran tests to compare it to SGA, another algorithm which when tested in the past has yielded excellent results.
Optimization of Collective Communication in MPICH Lino Possamai
This is a lecture about the paper: "Optimization of Collective Communication in MPICH". Department of Computer Science, University Ca' Foscari of Venice, Italy
I am Samantha H. I am a Digital Signal Processing Assignment Expert at matlabassignmentexperts.com. I hold a Master's in Matlab, the University of Alberta Canada. I have been helping students with their assignments for the past 14 years. I solve assignments related to Digital Signal Processing.
Visit matlabassignmentexperts.com or email info@matlabassignmentexperts.com.
You can also call on +1 678 648 4277 for any assistance with Digital Signal Processing Assignment.
A CRITICAL IMPROVEMENT ON OPEN SHOP SCHEDULING ALGORITHM FOR ROUTING IN INTER...IJCNCJournal
In the past years, Interconnection Networks have been used quite often and especially in applications where parallelization is critical. Message packets transmitted through such networks can be interrupted
using buffers in order to maximize network usage and minimize the time required for all messages to reach
their destination. However, preempting a packet will result in topology reconfiguration and consequently in
time cost. The problem of scheduling message packets through such a network is referred to as PBS and is
known to be NP-Hard. In this paper we haveimproved,
ritically, variations of polynomially solvable
instances of Open Shop to approximate PBS. We have combined these variations and called the induced
algorithmI_HSA (Improved Hybridic Scheduling Algorithm). We ran experiments to establish the efficiency
of I_HSA and found that in all datasets used it produces schedules very close to the optimal. In addition, we
tested I_HSA with datasets that follow non-uniform distributions and provided statistical data which
illustrates better its performance.To further establish I_HSA’s efficiency we ran tests to compare it to SGA,
another algorithm which when tested in the past has yielded excellent results.
ENHANCEMENT OF TCP FAIRNESS IN IEEE 802.11 NETWORKScscpconf
The usage of fixed buffers in 802.11 networks has a number of disadvantages associated with
it. This includes high delay, reduced throughput and inefficient channel utilisation. To
overcome this, a dynamic buffer sizing algorithm, the A* algorithm has been implemented at
the access point. In this algorithm buffer size is dynamically adjusted depending upon the
current channel conditions and hence delay is reduced and the throughput is maintained. But
in 802.11 networks with DCF collision avoidance mechanism, it creates significant amount of
unfairness between the upstream and downstream TCP flows, with clusters of upstream ACKs
blocking downstream data at the access point. Thus a variation of the Explicit Window
Adaptation (EWA) scheme has been used to regulate the queuing time of the upload clients by
calculating the feedback value at the access point. This creates fairness and increases the number of transmission opportunities for the downstream traffic
(Slides) Efficient Evaluation Methods of Elementary Functions Suitable for SI...Naoki Shibata
Naoki Shibata : Efficient Evaluation Methods of Elementary Functions Suitable for SIMD Computation, Journal of Computer Science on Research and Development, Proceedings of the International Supercomputing Conference ISC10., Volume 25, Numbers 1-2, pp. 25-32, 2010, DOI: 10.1007/s00450-010-0108-2 (May. 2010).
http://www.springerlink.com/content/340228x165742104/
http://freshmeat.net/projects/sleef
Data-parallel architectures like SIMD (Single Instruction Multiple Data) or SIMT (Single Instruction Multiple Thread) have been adopted in many recent CPU and GPU architectures. Although some SIMD and SIMT instruction sets include double-precision arithmetic and bitwise operations, there are no instructions dedicated to evaluating elementary functions like trigonometric functions in double precision. Thus, these functions have to be evaluated one by one using an FPU or using a software library. However, traditional algorithms for evaluating these elementary functions involve heavy use of conditional branches and/or table look-ups, which are not suitable for SIMD computation. In this paper, efficient methods are proposed for evaluating the sine, cosine, arc tangent, exponential and logarithmic functions in double precision without table look-ups, scattering from, or gathering into SIMD registers, or conditional branches. We implemented these methods using the Intel SSE2 instruction set to evaluate their accuracy and speed. The results showed that the average error was less than 0.67 ulp, and the maximum error was 6 ulps. The computation speed was faster than the FPUs on Intel Core 2 and Core i7 processors.
I am Bernard. I am a Computer Networking Assignment Expert at computernetworkassignmenthelp.com. I hold a Master's in Computer Science from, University of Leeds, UK. I have been helping students with their assignments for the past 12 years. I solve assignments related to Computer Networking.
Visit computernetworkassignmenthelp.com or email support@computernetworkassignmenthelp.com.
You can also call on +1 678 648 4277 for any assistance with Computer Networking Assignment.
NEW BER ANALYSIS OF OFDM SYSTEM OVER NAKAGAMI-n (RICE) FADING CHANNELijcseit
Modern wireless communication systems support high speed multimedia services. These services require
high data rates with acceptable error rates. Orthogonal Frequency Division Multiplexing (OFDM) is a
capable candidate to solve this problem. In this paper, a new expression for the BER of OFDM system has
been derived over Nakagami–n (Rice) fading channels using characteristics function (CHF) approach. The
exact probability density function of first order of Nakagami-n (Rice) random vector is used to derive the
expression for the error rates of OFDM system. The BER derivation of Rician fading channel is slightly
more complex compared to the Nakagami–m distribution because the PDF of the Rician RV contains an
explicit term of a modified Bessel function of first kind. Earlier, this problem was solved by replacing the
Bessel function with its infinite series and exponential integral representation. Here we propose an integral
expression to remove the complexity of the expression.
FPGA Design & Simulation Modeling of Baseband Data Transmission SystemIOSR Journals
Abstract: This paper describes a study on a baseband data transmission system developed for undergraduate
students studying communication engineering. Theoretical material, developed in the lectures, is briefly
covered. A practical system is presented with pre-detection filtering being employed to improve the bit error
rate. A simulation of the complete system is carried out on a Sun work station using the MATLAB simulation
package. Simulation and theoretical results are compared.
A general overview of signal encoding
You will learn why to use digital encoding, how signal is transmitted and received and how analog signals are converted to digital
Some digital encoding methods
A presentation prepared by my friend's friend. I have done no editing at all, I'm just uploading the presentation as it is.
Notes about Lynas advanced material plan (lamp)sulaim_qais
Some of my findings about Lynas Advanced Material Plant (LAMP)... This humble note is just for my reference and still in research. Hope that i learn something.. and share with me ur oppinion
Perception/ Myth and facts...
Lynas, LAMP, Malaysia Lynas, Radioactive, Nuclear reactor
Acetabularia Information For Class 9 .docxvaibhavrinwa19
Acetabularia acetabulum is a single-celled green alga that in its vegetative state is morphologically differentiated into a basal rhizoid and an axially elongated stalk, which bears whorls of branching hairs. The single diploid nucleus resides in the rhizoid.
How to Make a Field invisible in Odoo 17Celine George
It is possible to hide or invisible some fields in odoo. Commonly using “invisible” attribute in the field definition to invisible the fields. This slide will show how to make a field invisible in odoo 17.
A Strategic Approach: GenAI in EducationPeter Windle
Artificial Intelligence (AI) technologies such as Generative AI, Image Generators and Large Language Models have had a dramatic impact on teaching, learning and assessment over the past 18 months. The most immediate threat AI posed was to Academic Integrity with Higher Education Institutes (HEIs) focusing their efforts on combating the use of GenAI in assessment. Guidelines were developed for staff and students, policies put in place too. Innovative educators have forged paths in the use of Generative AI for teaching, learning and assessments leading to pockets of transformation springing up across HEIs, often with little or no top-down guidance, support or direction.
This Gasta posits a strategic approach to integrating AI into HEIs to prepare staff, students and the curriculum for an evolving world and workplace. We will highlight the advantages of working with these technologies beyond the realm of teaching, learning and assessment by considering prompt engineering skills, industry impact, curriculum changes, and the need for staff upskilling. In contrast, not engaging strategically with Generative AI poses risks, including falling behind peers, missed opportunities and failing to ensure our graduates remain employable. The rapid evolution of AI technologies necessitates a proactive and strategic approach if we are to remain relevant.
Operation “Blue Star” is the only event in the history of Independent India where the state went into war with its own people. Even after about 40 years it is not clear if it was culmination of states anger over people of the region, a political game of power or start of dictatorial chapter in the democratic setup.
The people of Punjab felt alienated from main stream due to denial of their just demands during a long democratic struggle since independence. As it happen all over the word, it led to militant struggle with great loss of lives of military, police and civilian personnel. Killing of Indira Gandhi and massacre of innocent Sikhs in Delhi and other India cities was also associated with this movement.
Introduction to AI for Nonprofits with Tapp NetworkTechSoup
Dive into the world of AI! Experts Jon Hill and Tareq Monaur will guide you through AI's role in enhancing nonprofit websites and basic marketing strategies, making it easy to understand and apply.
June 3, 2024 Anti-Semitism Letter Sent to MIT President Kornbluth and MIT Cor...Levi Shapiro
Letter from the Congress of the United States regarding Anti-Semitism sent June 3rd to MIT President Sally Kornbluth, MIT Corp Chair, Mark Gorenberg
Dear Dr. Kornbluth and Mr. Gorenberg,
The US House of Representatives is deeply concerned by ongoing and pervasive acts of antisemitic
harassment and intimidation at the Massachusetts Institute of Technology (MIT). Failing to act decisively to ensure a safe learning environment for all students would be a grave dereliction of your responsibilities as President of MIT and Chair of the MIT Corporation.
This Congress will not stand idly by and allow an environment hostile to Jewish students to persist. The House believes that your institution is in violation of Title VI of the Civil Rights Act, and the inability or
unwillingness to rectify this violation through action requires accountability.
Postsecondary education is a unique opportunity for students to learn and have their ideas and beliefs challenged. However, universities receiving hundreds of millions of federal funds annually have denied
students that opportunity and have been hijacked to become venues for the promotion of terrorism, antisemitic harassment and intimidation, unlawful encampments, and in some cases, assaults and riots.
The House of Representatives will not countenance the use of federal funds to indoctrinate students into hateful, antisemitic, anti-American supporters of terrorism. Investigations into campus antisemitism by the Committee on Education and the Workforce and the Committee on Ways and Means have been expanded into a Congress-wide probe across all relevant jurisdictions to address this national crisis. The undersigned Committees will conduct oversight into the use of federal funds at MIT and its learning environment under authorities granted to each Committee.
• The Committee on Education and the Workforce has been investigating your institution since December 7, 2023. The Committee has broad jurisdiction over postsecondary education, including its compliance with Title VI of the Civil Rights Act, campus safety concerns over disruptions to the learning environment, and the awarding of federal student aid under the Higher Education Act.
• The Committee on Oversight and Accountability is investigating the sources of funding and other support flowing to groups espousing pro-Hamas propaganda and engaged in antisemitic harassment and intimidation of students. The Committee on Oversight and Accountability is the principal oversight committee of the US House of Representatives and has broad authority to investigate “any matter” at “any time” under House Rule X.
• The Committee on Ways and Means has been investigating several universities since November 15, 2023, when the Committee held a hearing entitled From Ivory Towers to Dark Corners: Investigating the Nexus Between Antisemitism, Tax-Exempt Universities, and Terror Financing. The Committee followed the hearing with letters to those institutions on January 10, 202
Biological screening of herbal drugs: Introduction and Need for
Phyto-Pharmacological Screening, New Strategies for evaluating
Natural Products, In vitro evaluation techniques for Antioxidants, Antimicrobial and Anticancer drugs. In vivo evaluation techniques
for Anti-inflammatory, Antiulcer, Anticancer, Wound healing, Antidiabetic, Hepatoprotective, Cardio protective, Diuretics and
Antifertility, Toxicity studies as per OECD guidelines
Model Attribute Check Company Auto PropertyCeline George
In Odoo, the multi-company feature allows you to manage multiple companies within a single Odoo database instance. Each company can have its own configurations while still sharing common resources such as products, customers, and suppliers.
1. 1 | P a g e
STUDENT NAME SULAIM BIN AB QAIS ID NUMBER
TITLE
PACKET TRAFFIC USING
ERLANG C DISTRIBUTION
MODEL OF M/M/1 USING
MATLAB
2. 2 | P a g e
TABLE OF CONTENT
INTRODUCTION Pg 3
METHODOLOGY Pg 6
DATA AND ANALYSIS Pg 14
CONCLUSION Pg 16
REFERENCE Pg 16
3. 3 | P a g e
INTRODUCTION
Telecommunication traffic or teletraffic engineering is the application of traffic engineering
to telecommunication. We use statistical data which include queuing theory, the nature of
traffic, and simulation to make predictions and plan telecommunication network or the
internet. As the result, reliable service with lower cost can be achieved.
This field is founded by A. K. Erlang for circuit-switch network. However, as packet -switch
network exhibit Markovian Properties which can be modelled by Poisson arrival process,
Erlang’s work is applicable for packet-switch network [1].
Queueing theory is the mathematical study of waiting lines or queues. The study is modelled
to predict probability of queue length and waiting time. This model is developed by A. K.
Erlang to describe the Copenhagen telephone exchange [2].
Erlang determine the probability of encountering delay, when traffic, A is offered to a
queuing system with N trunk/server as shown in figure 1.1:
Figure 1.1
Erlang’s solution depends on the following assumption:
1. Call arrival & termination are random in nature (pure-chance traffic)
2. Statistical equilibrium – probability of arriving call at busy hour equal to the
probability of ending the call (value of A must less N)
3. Full availability – server will directly process the memory/Queue traffic when
available
4. Calls which encounter congestion enter a queue are stored until server becomes free
Such system is sometimes known as M/M/N system. In queueing theory there were
several representation of queuing systems. M/M/1 queue represent the queue length with
single server. In this representation, arrivals are determined by poisson process. If A>N,
calls are entering the system at a greater rate than they leave. As the result, the length of
the queue must continually increase towards infinity. This is not statistical equilibrium.
4. 4 | P a g e
Let X be the total number of calls in the system.
Thus, when X<N, then X calls are being served and there is no delay or no congestion.
When X>N , all the servers are busy and incoming calls encounter delay; there are N calls
being served and X-N calls in the queue.
Probability of a call arrive in a very short period of time is given by :
(offered traffic x time)/mean service time.
Delay occurs if all servers are busy when X>N. When probability of delay increases the
Grade Of Service (GOS) increase. We wanted to have lower GOS as possible, thus a
design must have low delay probability.
Probability of delay denoted as E2,N(A) is significant only when X>=N. E2,N(A) is
known as Erlang delay formula and A is the offered traffic/ traffic intensity in Erlang
unit. E2,N(A) shows that when we increase offered traffic per server (A/N), the probability
of delay increase until it reaches probability of 1 which is 100% [3].
Erlang-A know as the first Erlang formula while Erlang-B known use in loss-network.
Erlang C is used in queuing network [4].
Erlang C is a mathematical equation that we use in this study. It calculates the probability
that a call waits (Pw) by applying N number of servers/trunks at a given traffic
Intensity/offered traffic (A).
Equation (1.1)
If we have 200 calls per hour, and the average duration of each call is 3 minutes, then we
have 600 minutes of total call duration per hour. 600 minutes is equal to 10 hours call
duration. Thus, the traffic intensity, A is 10 Erlangs (10 hour call duration observed in 1
hour). This means that we need minimum of 10 servers/trunks, N. This minimum server
5. 5 | P a g e
is only applicable if when all calls arrive at exactly the moment that the previous call has
finished and there is no queuing. Meaning we need to have more than 10 servers
Nevertheless, by using erlang C formula we can understand the probability a call waits
and work out on the service level.
To calculate the service level as formula below :
Equation (1.2)
Target time is the time calls are answered in second. This must be greater than average
speed of answer (ASA), we may need to check this first by referring equation 1.3.
AHT is the average handling time is the average call duration in second.
Service level is unitless which can be represented in percentage by multiplying by 100. If
our service level target is 80% and we get less than that, we need to increase the number
of server/trunk.
Average Speed of answer (ASA) is given as below [5]:
Equation (1.3)
In packet traffic A is replaced with ρ which is the arrival rate. The arrival rate can be
calculated based on the bit rate over line speed or server speed.
In this paper we will answer the below question based on the MATLAB simulation.
Consider packets arrived in a network is according to Poisson processes; the packets
transmission times in nodes are assumed to be independent and exponentially distributed
based on M/M/1 queueing system. The link of the network is using E1 carrier and the lost
call delayed system is operating in the network. In average, the new packet arrival rate is
2980 per second with average packet length size of 55 bytes.
Evaluate the network capability in handling the arrival of the packets. Analyze the
probability of the packets being delayed and the average delay for all the packets to reach
the server. Next, compute the probability of the packets to be delayed exceeding 10 µsec
and the probability of the packets to be delayed more than 4 msec. Observe all the
situations and state your comment regarding the delay of the packets. Finally, set up the
transition diagram for this network system.
6. 6 | P a g e
METHODOLOGY
Measurement Tools: Hardware and software used in this analysis :
1. Desktop PC specification as below:
Operating System : Windows 10
Processor : Intel ® Core™ i7-6700K CPU @ 4GHz
Installed memory (RAM) : 8 GB (7.89GB usable)
System Type: 64-bit Operating system, x640based processor
2. MATLAB R2020a Software (Trial Version) with ‘SimEvent’ library
Experimental Setup : Installation of MATLAB R2020a software (trial version)
1. Go to link https://www.mathworks.com/campaigns/products/trials.html
2. Check ‘I agree’ radio button and click ‘SUBMIT’
3. Pick the ‘Simulink Essentials’ package as below by clicking on the image
4. Click ‘Select and Continue’
7. 7 | P a g e
5. Click on ‘Windows’. The software started downloading. The file size is about
222MB.
6. Open the downloaded file and run. The unzip process appeared as below :
7. Insert my email and click ‘Next’.
8. Insert your MATLAB account password.
8. 8 | P a g e
9. Check radio button ‘Agree’ and click ‘Next’.
10. Select your license and click ‘Next’. We can select either listed license that are in the
list.
11. Select the destination for MATLAB software installation and click ‘Next’.
12. Select the check list as below and click ‘Next’.
9. 9 | P a g e
13. Click ‘Next’ until landed on the page with button ‘Begin Install’. Click this button to
run the installation.
14. After we finish the installation open MATLAB Software from Desktop icon
Experimental Setup: Coding the Simulation:
1. Create a folder named ‘New folder’ in Desktop.
2. Get Erlang B and Erlang C function script from MATLAB forum as below:
Erlang B
function B = erlangb (n, A)
% This function computes the Erlang B probability that a system with n
% servers, no waiting line, Poisson arrival rate lambda, service rate
% (per server) mu, and intensity A = lambda / mu will have all servers
busy.
% The probability is B=(A^m / m!) / (sum (A^k / k!), k=0…m)
% The recurrence is B (0, A) = 1.
% B (n, A)=(A*B (n - 1, A) / n) / (1+A*B (n - 1, A) / n)
if ( (floor (n) ~= n) | (n < 1) )
warning ('n is not a positive integer');
A=NaN;
return;
end;
10. 10 | P a g e
if (A < 0.0)
warning ('A is negative!');
A=NaN;
return;
end;
B=1;
for k=1:n,
B=( (A*B) / k) / (1 + A*B / k);
end;
function C=erlangc (n, A)
% This function computes the Erlang C probability that a system with n
% servers, infinite waiting line, Poisson arrival rate lambda, service rate
% (per server) mu, and intensity A=lambda / mu will have all servers busy.
% It uses the formula C (n, A)=n*B (n, A) / (n-A*(1 - B (n, A) ) )
if ( (floor (n) ~= n) | (n < 1) )
warning ('n is not a positive integer');
A=NaN;
return;
end;
if (A < 0.0)
warning ('A is negative!');
A=NaN;
return;
end;
B=erlangb (n, A);
C=n*B / (n - A*(1 - B) );
Erlang C
function C=erlangc(n,A)
% This function computes the Erlang C probability that a system with n
% servers, infinite waiting line, Poisson arrival rate lambda, service rate
% (per server) mu, and intensity A=lambda / mu will have all servers busy.
% It uses the formula C (n, A)=n*B (n, A) / (n-A*(1 - B (n, A) ) )
if ( (floor (n) ~= n) | (n < 1) )
warning ('n is not a positive integer');
A=NaN;
return;
end;
if (A < 0.0)
warning ('A is negative!');
A=NaN;
return;
end;
B=erlangb (n, A);
C=n*B / (n - A*(1 - B) );
3. Copy and paste this script in separate notepad; one for erlang B and another for
Erlang C and save as erlangb.m and erlangc.m respectively inside the ‘New folder’.
4. In MATLAB window locate the folder and double click both erlangb.m and erlangc.m
to open the tab as picture shows.
11. 11 | P a g e
5. Click the + button to add a new tab.
6. Write the code as below to simulate the Erlang C calculation and to answer the
question given.
Lambda = 2980; % Packet arrival rate 2980 packet per second
L = 55*8; % packet average length 55Byte x 8 = 440 bits
S = 2048000; % speed of the server of 2.048Mbps
A = (Lambda*L)/S;%Arrival rate
n = 1; % number of server. Normally packet traffic we use 1 because of
point to point connection
C=erlangc (n,A);% p(delay>0)probability waiting happen.
h=A/Lambda; %Holding time
D = C*h/(n-A);% Average call delay in second = p(delay>0) x h/(n-A)
t = 0:0.00001:0.005; %x axis plot with resolution of 1us
Pd = C*exp(-(n-A)*(1/h)*t); %Pd is a probability packet to be delay
exceeding time t
plot (t,Pd, 'r');
xlabel ('Packet waiting time (s)');
ylabel ('Probability of arriving packet exceeding waiting time');
12. 12 | P a g e
Experimental Setup: Flow Chart of MATLAB Code
13. 13 | P a g e
Experimental Setup: Data collection technique:
1. Click the ‘Run’ icon and the script will run and generate the plot and calculate the
variable value.
2. Average packet delay acquired by writing “D” and enter in the Command Windows
and press ‘Enter’.
3. Probability of the packets being delayed acquired by writing “C” in the Command
Windows and press ‘Enter’.
4. Probability of the packets to be delayed exceeding certain time acquired by writing
‘Pd(t==[exceed time delay in s])’ and press ‘enter’.
14. 14 | P a g e
DATA AND ANALYSIS
Answering the question based on the MATLAB Coding simulation:
1. Probability of the packets being delayed is equal to
= 0.6402
This value shows that 64.02% of the packet arrive will have some delay in this system
before enter the server for process. Thus, 35.98% of the packet will be directly
process by the server without any delay.
2. The average delay for all the packets to be processed by the server is equal to
= 3.8233e-04 s = 0.00038233s = 382.33us
This average delay shows that average packet will encounter 382.33us before
accepted by the server to be process.
3. Probability of the packets to be delayed exceeding 10 µsec
= 0.6296
The probability of the packet to delay more than z time is the probability of arriving
packet has to wait longer than z time. The probability of arriving packet has to wait
longer than 10us is 62.96%. Meaning, that 37.07% of the packet will not be delay
more than 10us.
4. Probability of the packets to be delayed more than 4 msec
= 7.8951e-04 = 0.0007895
The probability of the packet to delay more than z time is the probability of arriving
packet has to wait longer than z time. The probability of arriving packet has to wait
longer than 4 ms is 0.07895%. Meaning, that the 99.921% of the packet will not be
delay more than 4 ms.
The simulation probability of packet needs to wait is important in determining the
customer satisfaction of how much delay most of the service will suffer. As having
non-delay system is costly, by implementing some acceptable delay could save much
cost. Nevertheless, the implementation of delay system should be low as possible until
it is unnoticeable by the user.
15. 15 | P a g e
Figure 2.1 shows probability of arriving packet exceeded target waiting time
The probability of packet delay reduced exponentially as target waiting time increase. From
the plotting we can understand that 10% of the arrived packet need to wait more than 1.2 ms.
Thus, we can say that this system having 90% of the packet need to wait less than 1.2 ms.
Figure 2.2 shows the state transition diagram of M/M/1 system
Packet delay waiting time = 1.2
2980 packet per second
Departure time = 0.0015s
16. 16 | P a g e
CONCLUSION
We conclude that the MATLAB coding/simulation used in calculating waiting probability for
M/M/1 system is successful with expected result. MATLAB software will help researcher to
observe packet traffic more clearly.
Based on the result that we have this system is acceptable as 99.921% of the packet will be
delay less than 4ms.
REFERENCE:
1.https://en.wikipedia.org/wiki/Teletraffic_engineering
2. https://en.wikipedia.org/wiki/M/M/1_queue
3. https://www.youtube.com/watch?v=T7D5UxyOs8U
4.https://files.osf.io/v1/resources/jf5ry/providers/osfstorage/5ad022779c8e73000c20df1a?ver
sion=1&displayName=2018_Traffic+Unit+and+Mathematical+Model_Sigit+Haryadi-2018-
04-13T03:22:31.755Z.pdf&action=download&direct
5. https://www.callcentrehelper.com/erlang-c-formula-example-121281.htm