SlideShare a Scribd company logo
1 of 11
Download to read offline
Algorithm for selecting the BTS to be optimized for
MCDR Reduction
Rahmatjon Hakimov
http://oftob.com, http://oftob.ru
rahmatjon at gmail.com
June 24, 2015
Rahmatjon Hakimov (http://oftob.com) Algorithm for MCDR Reduction June 24, 2015 1 / 11
Overview
1 Problem statement
2 Definitions
3 Statements
4 Algorithm for selecting the BTS to be optimized
5 Example of SQL-script for Cell Weight calculation
Rahmatjon Hakimov (http://oftob.com) Algorithm for MCDR Reduction June 24, 2015 2 / 11
Problem statement
Reduction of MCDR (Mobile Call Defect Ratio) is one of the
prioritized tasks on Network Quality.
One of the approachs to decrease MCDR is to change physical and
soft parameters of BTSs.
Since human, time and other kinds of resources are limited, the
process of selecting of BTSs to be optimized is important.
Which BTS should be optimized first in order to achieve maximum
effect on the reduction of overall/total MCDR?
Rahmatjon Hakimov (http://oftob.com) Algorithm for MCDR Reduction June 24, 2015 3 / 11
Definitions
# of defective calls = (# of failed calls) + (# of dropped calls)
MCDR = total # of defective calls
total # of call attempts
DPMO - Defects Per Million Opportunities
MCDR DPMO = total # of defective calls
total # of call attempts ∗ 1000000 or
MCDR DPMO = MCDR ∗ 1000000
BTS MCDR = # of defective calls in BTS
# of call attempts in BTS
BTS MCDR = BTS MCDR ∗ 1000000
BTS MCDR Weight =
= MCDR −
(# of defective calls) - (# of defective calls in BTS)
(# of call attempts) − (# of call attempts in BTS)
Rahmatjon Hakimov (http://oftob.com) Algorithm for MCDR Reduction June 24, 2015 4 / 11
Statements
Let:
wj be BTS #j MCDR Weight
mj be number of defective calls in BTS #j
nj be total number of calls in BTS #j
m be total number of defective calls in the network
n be total number of calls in the network.
Statement 1
BTS #j MCDR Weight is equal to 0, if and only if, its MCDR is equal to
Total MCDR:
wj = 0 ⇐⇒
mj
nj
=
m
n
.
Rahmatjon Hakimov (http://oftob.com) Algorithm for MCDR Reduction June 24, 2015 5 / 11
Statements (cont.)
Statement 2
BTS #j MCDR Weight is greater than 0, if and only if, its MCDR is
greater than Total MCDR:
wj > 0 ⇐⇒
mj
nj
>
m
n
.
Statement 3
BTS #j MCDR Weight is less than 0, if and only if, its MCDR is less than
Total MCDR:
wj < 0 ⇐⇒
mj
nj
<
m
n
.
Rahmatjon Hakimov (http://oftob.com) Algorithm for MCDR Reduction June 24, 2015 6 / 11
Statements (cont.)
Statement 4
Assume w1 > wj ∀j = 2, ..., k. Then
m − m1
n − n1
<
m − mj
n − nj
∀j = 2, ..., k.
Statement 5
If the number of defective calls in the BTS #j becomes equal to
m
(r)
j =
m(rnj − nj ) + mj (n − rnj )
r(n − nj )
,
then its weight in the total MCDR decreases r times.
Rahmatjon Hakimov (http://oftob.com) Algorithm for MCDR Reduction June 24, 2015 7 / 11
Statements (cont.)
Assume that BTS #j was chosen for optimization and during the
optimization:
A0) number of call attempts in this and all another BTSs does not change;
B0) number of defective calls in another BTSs does not change.
Statement 6
If number of defective calls in BTS #j is decreased from mj to
m∗
j =
(m−mj )nj
n−nj
, then:
1. Total MCDR decreases from m
n to
m−mj
n−nj
, i.e. minus wj .
2. BTS #j MCDR Weight becomes equal to 0.
Corollary
If BTS with the highest weight in total MCDR is chosen for optimization
and assumptions A0 and B0 are met, then the reduction of this BTS’s
MCDR Weight to 0 gives the maximum effect on Total MCDR reduction.
Rahmatjon Hakimov (http://oftob.com) Algorithm for MCDR Reduction June 24, 2015 8 / 11
Algorithm for selecting the BTS to be optimized
1 Calculate the Total MCDR.
2 Calculate MCDR Weight of each BTS.
3 Find BTS #j with the highest MCDR Weight wj .
4 Decrease number of defective calls in BTS #j (from mj to m∗
j ).
5 Recalculate the Total MCDR.
6 Go to step 2, if it is necessary.
Rahmatjon Hakimov (http://oftob.com) Algorithm for MCDR Reduction June 24, 2015 9 / 11
SQL-script for Cell Weight calculation
Example (Code for Oracle 10g)
/* Formatted on 03-July-2014 15:45:40 (QP5 v5.160) */
SELECT t1.dt, t1.cell,
t1.call_attempts, t1.failed_calls, t1.dropped_calls,
(t1.dropped_calls + t1.failed_calls) / t1.call_attempts
* 1000000 mcdr_dpmo,
((t2.dropped_calls + t2.failed_calls) / t2.call_attempts
- ( t2.dropped_calls - t1.dropped_calls
+ t2.failed_calls - t1.failed_calls)
/ (t2.call_attempts - t1.call_attempts))
* 1000000 weight_dpmo
FROM report.mv_mcdr_3g_detail t1, report.mv_mcdr_3g t2
WHERE t1.dt = t2.dt AND t1.call_attempts > 0
Rahmatjon Hakimov (http://oftob.com) Algorithm for MCDR Reduction June 24, 2015 10 / 11
Thank you!
Rahmatjon Hakimov (http://oftob.com) Algorithm for MCDR Reduction June 24, 2015 11 / 11

More Related Content

Similar to Algorithm for selecting the BTS to be optimized for MCDR Reduction

08 gsm bss network kpi (immediate assignment success rate) optimization manual
08 gsm bss network kpi (immediate assignment success rate) optimization manual08 gsm bss network kpi (immediate assignment success rate) optimization manual
08 gsm bss network kpi (immediate assignment success rate) optimization manual
tharinduwije
 
Gsm bss-network-kpi-tch-assignment-success-rate-optimization-manual(asr)
Gsm bss-network-kpi-tch-assignment-success-rate-optimization-manual(asr)Gsm bss-network-kpi-tch-assignment-success-rate-optimization-manual(asr)
Gsm bss-network-kpi-tch-assignment-success-rate-optimization-manual(asr)
Ayann Khan
 

Similar to Algorithm for selecting the BTS to be optimized for MCDR Reduction (19)

Competitive Demand Response Trading in Electricity Markets: Aggregator and En...
Competitive Demand Response Trading in Electricity Markets: Aggregator and En...Competitive Demand Response Trading in Electricity Markets: Aggregator and En...
Competitive Demand Response Trading in Electricity Markets: Aggregator and En...
 
A Novel 4WD Permanent Magnet Synchronous Motor for an Electrical Vehicle Cont...
A Novel 4WD Permanent Magnet Synchronous Motor for an Electrical Vehicle Cont...A Novel 4WD Permanent Magnet Synchronous Motor for an Electrical Vehicle Cont...
A Novel 4WD Permanent Magnet Synchronous Motor for an Electrical Vehicle Cont...
 
05 gsm bss network kpi (tch congestion rate) optimization manual
05 gsm bss network kpi (tch congestion rate) optimization manual05 gsm bss network kpi (tch congestion rate) optimization manual
05 gsm bss network kpi (tch congestion rate) optimization manual
 
Delay Optimized Full Adder Design for High Speed VLSI Applications
Delay Optimized Full Adder Design for High Speed VLSI ApplicationsDelay Optimized Full Adder Design for High Speed VLSI Applications
Delay Optimized Full Adder Design for High Speed VLSI Applications
 
IRJET- A Novel 5 Stage MTCNT Delay Line at 32nm Technology Node
IRJET-  	  A Novel 5 Stage MTCNT Delay Line at 32nm Technology NodeIRJET-  	  A Novel 5 Stage MTCNT Delay Line at 32nm Technology Node
IRJET- A Novel 5 Stage MTCNT Delay Line at 32nm Technology Node
 
Hardware-in-the-loop setup for enhanced modular multi-level converter with re...
Hardware-in-the-loop setup for enhanced modular multi-level converter with re...Hardware-in-the-loop setup for enhanced modular multi-level converter with re...
Hardware-in-the-loop setup for enhanced modular multi-level converter with re...
 
Investigation Effect of Outage Line on the Transmission Line for Karbalaa-132...
Investigation Effect of Outage Line on the Transmission Line for Karbalaa-132...Investigation Effect of Outage Line on the Transmission Line for Karbalaa-132...
Investigation Effect of Outage Line on the Transmission Line for Karbalaa-132...
 
08 gsm bss network kpi (immediate assignment success rate) optimization manual
08 gsm bss network kpi (immediate assignment success rate) optimization manual08 gsm bss network kpi (immediate assignment success rate) optimization manual
08 gsm bss network kpi (immediate assignment success rate) optimization manual
 
Transmission Congestion Management by Using Series Facts Devices and Changing...
Transmission Congestion Management by Using Series Facts Devices and Changing...Transmission Congestion Management by Using Series Facts Devices and Changing...
Transmission Congestion Management by Using Series Facts Devices and Changing...
 
Gsm bss-network-kpi-tch-assignment-success-rate-optimization-manual(asr)
Gsm bss-network-kpi-tch-assignment-success-rate-optimization-manual(asr)Gsm bss-network-kpi-tch-assignment-success-rate-optimization-manual(asr)
Gsm bss-network-kpi-tch-assignment-success-rate-optimization-manual(asr)
 
MTBF_ Concept and Application - Oxeltech.pdf
MTBF_ Concept and Application - Oxeltech.pdfMTBF_ Concept and Application - Oxeltech.pdf
MTBF_ Concept and Application - Oxeltech.pdf
 
Om0015
Om0015Om0015
Om0015
 
Transmission congestion management effects on reducing cost of bilateral mark...
Transmission congestion management effects on reducing cost of bilateral mark...Transmission congestion management effects on reducing cost of bilateral mark...
Transmission congestion management effects on reducing cost of bilateral mark...
 
A Hybrid Formulation between Differential Evolution and Simulated Annealing A...
A Hybrid Formulation between Differential Evolution and Simulated Annealing A...A Hybrid Formulation between Differential Evolution and Simulated Annealing A...
A Hybrid Formulation between Differential Evolution and Simulated Annealing A...
 
Demand-Side Flexibility for Reliable Ancillary Services in a Smart Grid: Elim...
Demand-Side Flexibility for Reliable Ancillary Services in a Smart Grid: Elim...Demand-Side Flexibility for Reliable Ancillary Services in a Smart Grid: Elim...
Demand-Side Flexibility for Reliable Ancillary Services in a Smart Grid: Elim...
 
Torque Ripple Minimization of a BLDC Motor Drive by Using Electronic Commutat...
Torque Ripple Minimization of a BLDC Motor Drive by Using Electronic Commutat...Torque Ripple Minimization of a BLDC Motor Drive by Using Electronic Commutat...
Torque Ripple Minimization of a BLDC Motor Drive by Using Electronic Commutat...
 
Measurement MCQs with Answers.pdf
 Measurement MCQs with Answers.pdf Measurement MCQs with Answers.pdf
Measurement MCQs with Answers.pdf
 
Cost-Modelling
Cost-ModellingCost-Modelling
Cost-Modelling
 
Computer Application in Power system: Chapter six - optimization and security
Computer Application in Power system: Chapter six - optimization and securityComputer Application in Power system: Chapter six - optimization and security
Computer Application in Power system: Chapter six - optimization and security
 

Recently uploaded

Artificial Intelligence: Facts and Myths
Artificial Intelligence: Facts and MythsArtificial Intelligence: Facts and Myths
Artificial Intelligence: Facts and Myths
Joaquim Jorge
 

Recently uploaded (20)

Data Cloud, More than a CDP by Matt Robison
Data Cloud, More than a CDP by Matt RobisonData Cloud, More than a CDP by Matt Robison
Data Cloud, More than a CDP by Matt Robison
 
Apidays New York 2024 - Scaling API-first by Ian Reasor and Radu Cotescu, Adobe
Apidays New York 2024 - Scaling API-first by Ian Reasor and Radu Cotescu, AdobeApidays New York 2024 - Scaling API-first by Ian Reasor and Radu Cotescu, Adobe
Apidays New York 2024 - Scaling API-first by Ian Reasor and Radu Cotescu, Adobe
 
Partners Life - Insurer Innovation Award 2024
Partners Life - Insurer Innovation Award 2024Partners Life - Insurer Innovation Award 2024
Partners Life - Insurer Innovation Award 2024
 
Boost Fertility New Invention Ups Success Rates.pdf
Boost Fertility New Invention Ups Success Rates.pdfBoost Fertility New Invention Ups Success Rates.pdf
Boost Fertility New Invention Ups Success Rates.pdf
 
GenAI Risks & Security Meetup 01052024.pdf
GenAI Risks & Security Meetup 01052024.pdfGenAI Risks & Security Meetup 01052024.pdf
GenAI Risks & Security Meetup 01052024.pdf
 
Polkadot JAM Slides - Token2049 - By Dr. Gavin Wood
Polkadot JAM Slides - Token2049 - By Dr. Gavin WoodPolkadot JAM Slides - Token2049 - By Dr. Gavin Wood
Polkadot JAM Slides - Token2049 - By Dr. Gavin Wood
 
Strategies for Unlocking Knowledge Management in Microsoft 365 in the Copilot...
Strategies for Unlocking Knowledge Management in Microsoft 365 in the Copilot...Strategies for Unlocking Knowledge Management in Microsoft 365 in the Copilot...
Strategies for Unlocking Knowledge Management in Microsoft 365 in the Copilot...
 
A Year of the Servo Reboot: Where Are We Now?
A Year of the Servo Reboot: Where Are We Now?A Year of the Servo Reboot: Where Are We Now?
A Year of the Servo Reboot: Where Are We Now?
 
2024: Domino Containers - The Next Step. News from the Domino Container commu...
2024: Domino Containers - The Next Step. News from the Domino Container commu...2024: Domino Containers - The Next Step. News from the Domino Container commu...
2024: Domino Containers - The Next Step. News from the Domino Container commu...
 
Artificial Intelligence: Facts and Myths
Artificial Intelligence: Facts and MythsArtificial Intelligence: Facts and Myths
Artificial Intelligence: Facts and Myths
 
Top 10 Most Downloaded Games on Play Store in 2024
Top 10 Most Downloaded Games on Play Store in 2024Top 10 Most Downloaded Games on Play Store in 2024
Top 10 Most Downloaded Games on Play Store in 2024
 
Mastering MySQL Database Architecture: Deep Dive into MySQL Shell and MySQL R...
Mastering MySQL Database Architecture: Deep Dive into MySQL Shell and MySQL R...Mastering MySQL Database Architecture: Deep Dive into MySQL Shell and MySQL R...
Mastering MySQL Database Architecture: Deep Dive into MySQL Shell and MySQL R...
 
TrustArc Webinar - Stay Ahead of US State Data Privacy Law Developments
TrustArc Webinar - Stay Ahead of US State Data Privacy Law DevelopmentsTrustArc Webinar - Stay Ahead of US State Data Privacy Law Developments
TrustArc Webinar - Stay Ahead of US State Data Privacy Law Developments
 
Manulife - Insurer Innovation Award 2024
Manulife - Insurer Innovation Award 2024Manulife - Insurer Innovation Award 2024
Manulife - Insurer Innovation Award 2024
 
Bajaj Allianz Life Insurance Company - Insurer Innovation Award 2024
Bajaj Allianz Life Insurance Company - Insurer Innovation Award 2024Bajaj Allianz Life Insurance Company - Insurer Innovation Award 2024
Bajaj Allianz Life Insurance Company - Insurer Innovation Award 2024
 
A Domino Admins Adventures (Engage 2024)
A Domino Admins Adventures (Engage 2024)A Domino Admins Adventures (Engage 2024)
A Domino Admins Adventures (Engage 2024)
 
HTML Injection Attacks: Impact and Mitigation Strategies
HTML Injection Attacks: Impact and Mitigation StrategiesHTML Injection Attacks: Impact and Mitigation Strategies
HTML Injection Attacks: Impact and Mitigation Strategies
 
Apidays New York 2024 - The value of a flexible API Management solution for O...
Apidays New York 2024 - The value of a flexible API Management solution for O...Apidays New York 2024 - The value of a flexible API Management solution for O...
Apidays New York 2024 - The value of a flexible API Management solution for O...
 
Workshop - Best of Both Worlds_ Combine KG and Vector search for enhanced R...
Workshop - Best of Both Worlds_ Combine  KG and Vector search for  enhanced R...Workshop - Best of Both Worlds_ Combine  KG and Vector search for  enhanced R...
Workshop - Best of Both Worlds_ Combine KG and Vector search for enhanced R...
 
Boost PC performance: How more available memory can improve productivity
Boost PC performance: How more available memory can improve productivityBoost PC performance: How more available memory can improve productivity
Boost PC performance: How more available memory can improve productivity
 

Algorithm for selecting the BTS to be optimized for MCDR Reduction

  • 1. Algorithm for selecting the BTS to be optimized for MCDR Reduction Rahmatjon Hakimov http://oftob.com, http://oftob.ru rahmatjon at gmail.com June 24, 2015 Rahmatjon Hakimov (http://oftob.com) Algorithm for MCDR Reduction June 24, 2015 1 / 11
  • 2. Overview 1 Problem statement 2 Definitions 3 Statements 4 Algorithm for selecting the BTS to be optimized 5 Example of SQL-script for Cell Weight calculation Rahmatjon Hakimov (http://oftob.com) Algorithm for MCDR Reduction June 24, 2015 2 / 11
  • 3. Problem statement Reduction of MCDR (Mobile Call Defect Ratio) is one of the prioritized tasks on Network Quality. One of the approachs to decrease MCDR is to change physical and soft parameters of BTSs. Since human, time and other kinds of resources are limited, the process of selecting of BTSs to be optimized is important. Which BTS should be optimized first in order to achieve maximum effect on the reduction of overall/total MCDR? Rahmatjon Hakimov (http://oftob.com) Algorithm for MCDR Reduction June 24, 2015 3 / 11
  • 4. Definitions # of defective calls = (# of failed calls) + (# of dropped calls) MCDR = total # of defective calls total # of call attempts DPMO - Defects Per Million Opportunities MCDR DPMO = total # of defective calls total # of call attempts ∗ 1000000 or MCDR DPMO = MCDR ∗ 1000000 BTS MCDR = # of defective calls in BTS # of call attempts in BTS BTS MCDR = BTS MCDR ∗ 1000000 BTS MCDR Weight = = MCDR − (# of defective calls) - (# of defective calls in BTS) (# of call attempts) − (# of call attempts in BTS) Rahmatjon Hakimov (http://oftob.com) Algorithm for MCDR Reduction June 24, 2015 4 / 11
  • 5. Statements Let: wj be BTS #j MCDR Weight mj be number of defective calls in BTS #j nj be total number of calls in BTS #j m be total number of defective calls in the network n be total number of calls in the network. Statement 1 BTS #j MCDR Weight is equal to 0, if and only if, its MCDR is equal to Total MCDR: wj = 0 ⇐⇒ mj nj = m n . Rahmatjon Hakimov (http://oftob.com) Algorithm for MCDR Reduction June 24, 2015 5 / 11
  • 6. Statements (cont.) Statement 2 BTS #j MCDR Weight is greater than 0, if and only if, its MCDR is greater than Total MCDR: wj > 0 ⇐⇒ mj nj > m n . Statement 3 BTS #j MCDR Weight is less than 0, if and only if, its MCDR is less than Total MCDR: wj < 0 ⇐⇒ mj nj < m n . Rahmatjon Hakimov (http://oftob.com) Algorithm for MCDR Reduction June 24, 2015 6 / 11
  • 7. Statements (cont.) Statement 4 Assume w1 > wj ∀j = 2, ..., k. Then m − m1 n − n1 < m − mj n − nj ∀j = 2, ..., k. Statement 5 If the number of defective calls in the BTS #j becomes equal to m (r) j = m(rnj − nj ) + mj (n − rnj ) r(n − nj ) , then its weight in the total MCDR decreases r times. Rahmatjon Hakimov (http://oftob.com) Algorithm for MCDR Reduction June 24, 2015 7 / 11
  • 8. Statements (cont.) Assume that BTS #j was chosen for optimization and during the optimization: A0) number of call attempts in this and all another BTSs does not change; B0) number of defective calls in another BTSs does not change. Statement 6 If number of defective calls in BTS #j is decreased from mj to m∗ j = (m−mj )nj n−nj , then: 1. Total MCDR decreases from m n to m−mj n−nj , i.e. minus wj . 2. BTS #j MCDR Weight becomes equal to 0. Corollary If BTS with the highest weight in total MCDR is chosen for optimization and assumptions A0 and B0 are met, then the reduction of this BTS’s MCDR Weight to 0 gives the maximum effect on Total MCDR reduction. Rahmatjon Hakimov (http://oftob.com) Algorithm for MCDR Reduction June 24, 2015 8 / 11
  • 9. Algorithm for selecting the BTS to be optimized 1 Calculate the Total MCDR. 2 Calculate MCDR Weight of each BTS. 3 Find BTS #j with the highest MCDR Weight wj . 4 Decrease number of defective calls in BTS #j (from mj to m∗ j ). 5 Recalculate the Total MCDR. 6 Go to step 2, if it is necessary. Rahmatjon Hakimov (http://oftob.com) Algorithm for MCDR Reduction June 24, 2015 9 / 11
  • 10. SQL-script for Cell Weight calculation Example (Code for Oracle 10g) /* Formatted on 03-July-2014 15:45:40 (QP5 v5.160) */ SELECT t1.dt, t1.cell, t1.call_attempts, t1.failed_calls, t1.dropped_calls, (t1.dropped_calls + t1.failed_calls) / t1.call_attempts * 1000000 mcdr_dpmo, ((t2.dropped_calls + t2.failed_calls) / t2.call_attempts - ( t2.dropped_calls - t1.dropped_calls + t2.failed_calls - t1.failed_calls) / (t2.call_attempts - t1.call_attempts)) * 1000000 weight_dpmo FROM report.mv_mcdr_3g_detail t1, report.mv_mcdr_3g t2 WHERE t1.dt = t2.dt AND t1.call_attempts > 0 Rahmatjon Hakimov (http://oftob.com) Algorithm for MCDR Reduction June 24, 2015 10 / 11
  • 11. Thank you! Rahmatjon Hakimov (http://oftob.com) Algorithm for MCDR Reduction June 24, 2015 11 / 11