Mariusz Głąbowski, Adam Kaliszan, Maciej Stasiak A New Convolution Algorithm of Blocking Probability Calculation in Full-Availability Group with Bandwidth.

Slides:



Advertisements
Similar presentations
Maciej Stasiak, Mariusz Głąbowski Arkadiusz Wiśniewski, Piotr Zwierzykowski Basic Definitions and Terminology Modeling and Dimensioning of Mobile Networks:
Advertisements

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.
Maciej Stasiak, Mariusz Głąbowski Arkadiusz Wiśniewski, Piotr Zwierzykowski Modeling of Overflow Traffic Systems Modeling and Dimensioning of Mobile Networks:
Wenye Wang Xinbing Wang Arne Nilsson Department of Electrical and Computer Engineering, NC State University March 2005 A New Admission Control Scheme under.
HMM-BASED PATTERN DETECTION. Outline  Markov Process  Hidden Markov Models Elements Basic Problems Evaluation Optimization Training Implementation 2-D.
Central Limit Theorem and Normal Distribution EE3060 Probability Yi-Wen Liu November 2010.
Analyzing Multi-channel MAC Protocols for Underwater Sensor Networks Presenter: Zhong Zhou.
Using Rational Approximations for Evaluating the Reliability of Highly Reliable Systems Z. Koren, J. Rajagopal, C. M. Krishna, and I. Koren Dept. of Elect.
1 Token Bucket Based CAC and Packet Scheduling for IEEE Broadband Wireless Access Networks Chi-Hung Chiang
Analysis of Web Caching Architectures: Hierarchical and Distributed Caching Pablo Rodriguez, Christian Spanner, and Ernst W. Biersack IEEE/ACM TRANSACTIONS.
Multiple Sender Distributed Video Streaming Thinh Nguyen, Avideh Zakhor appears on “IEEE Transactions On Multimedia, vol. 6, no. 2, April, 2004”
Performance Analysis of Wavelength-Routed Optical Networks with Connection Request Retrials Fei Xue+, S. J. Ben Yoo+, Hiroyuki Yokoyama*, and Yukio Horiuchi*
Halftoning Technique Using Genetic Algorithm Naoki Kobayashi and Hideo Saito 1994 IEEE.
Performance Evaluation of Peer-to-Peer Video Streaming Systems Wilson, W.F. Poon The Chinese University of Hong Kong.
Effective Gaussian mixture learning for video background subtraction Dar-Shyang Lee, Member, IEEE.
CS 561, Session 29 1 Belief networks Conditional independence Syntax and semantics Exact inference Approximate inference.
The moment generating function of random variable X is given by Moment generating function.
Simultaneous Rate and Power Control in Multirate Multimedia CDMA Systems By: Sunil Kandukuri and Stephen Boyd.
2001/09/12Chin-Kai Wu, CS, NTHU1 Dynamic Resource Management Considering the Real Behavior of Aggregate Traffic José R. Gallardo, Dimitrios Makrakis, and.
IE 594 : Research Methodology – Discrete Event Simulation David S. Kim Spring 2009.
The Research of Applying Random Early Blocking strategy to Dynamic Lightpath Routing National Yunlin University of Science & Technology.
Optimal Degree Distribution for LT Codes with Small Message Length Esa Hyytiä, Tuomas Tirronen, Jorma Virtamo IEEE INFOCOM mini-symposium
1 A Model for Multiobjective Routing Optimisation in MPLS with Two Service Classes – Resolution Strategies Rita Girão-Silva, José Craveirinha, João Clímaco.
1 Performance Analysis of a Preemptive and Priority Reservation Handoff Scheme for Integrated Service- Based Wireless Mobile Networks by Jingao Wang, Quing-An.
1 Call Admission Control for Multimedia Services in Mobile Cellular Networks : A Markov Decision Approach Jihyuk Choi; Taekyoung Kwon; Yanghee Choi; Naghshineh,
Presenter: Jonathan Murphy On Adaptive Routing in Wavelength-Routed Networks Authors: Ching-Fang Hsu Te-Lung Liu Nen-Fu Huang.
EE6610: Week 6 Lectures.
Link Dimensioning for Fractional Brownian Input Chen Jiongze PhD student, Electronic Engineering Department, City University of Hong Kong Supported by.
Examination Committee: Dr. Poompat Saengudomlert (Chairperson) Assoc. Prof. Tapio Erke Dr. R.M.A.P. Rajatheva 1 Telecommunications FoS Asian Institute.
Xu Huaping, Wang Wei, Liu Xianghua Beihang University, China.
1 Performance Analysis of the Distributed Coordination Function under Sporadic Traffic joint work with C.-F. Chiasserini (Politecnico di Torino)
Simulation techniques Summary of the methods we used so far Other methods –Rejection sampling –Importance sampling Very good slides from Dr. Joo-Ho Choi.
Discrete and Continuous Random Variables.  13 out of 21 students correctly identified the bottled water. How many correct identifications would you need.
The Extended Connection-Dependent Threshold Model for Elastic and Adaptive Traffic V. Vassilakis, I. Moscholios and M. Logothetis Wire Communications Laboratory,
Copyright © 2010, 2007, 2004 Pearson Education, Inc. All Rights Reserved. Section 5-5 Poisson Probability Distributions.
Survivable Traffic Grooming with Differentiated End-to-End Availability Guarantees in WDM Mesh Networks Proceedings of the 13th IEEE Workshop on Local.
The M/M/ N / N Queue etc COMP5416 Advanced Network Technologies.
An Optimal Distributed Call Admission control for Adaptive Multimedia in Wireless/Mobile Networks Reporter: 電機所 鄭志川.
1 Presented by Sarbagya Buddhacharya. 2 Increasing bandwidth demand in telecommunication networks is satisfied by WDM networks. Dimensioning of WDM networks.
Markov Chain Monte Carlo for LDA C. Andrieu, N. D. Freitas, and A. Doucet, An Introduction to MCMC for Machine Learning, R. M. Neal, Probabilistic.
A Variable Bandwidth Scheme for Predictive Control in Cellular Networks Hao Wang.
Maciej Stasiak, Mariusz Głąbowski Arkadiusz Wiśniewski, Piotr Zwierzykowski Model of the Nodes in the Packet Network Chapter 10.
1 Guard Channel CAC Algorithm For High Altitude Platform Networks Dung D. LUONG TRAN Minh Phuong Anh Tien V. Do.
By: Jesse Ehlert Dustin Wells Li Zhang Iterative Aggregation/Disaggregation(IAD)
802.11e EDCA WLN 2005 Sydney, Nov Paal E. Engelstad (presenter) UniK / Telenor R&D Olav N. Østerbø Telenor R&D
Gil McVean, Department of Statistics Thursday February 12 th 2009 Monte Carlo simulation.
Polymerase Chain Reaction: A Markov Process Approach Mikhail V. Velikanov et al. J. theor. Biol Summarized by 임희웅
The Birthday Problem. The Problem In a group of 50 students, what is the probability that at least two students share the same birthday?
Introduction to Multiple-multicast Routing Chu-Fu Wang.
DirectFit reconstruction of the Aya’s two HE cascade events Dmitry Chirkin, UW Madison Method of the fit: exhaustive search simulate cascade events with.
REU 2009-Traffic Analysis of IP Networks Daniel S. Allen, Mentor: Dr. Rahul Tripathi Department of Computer Science & Engineering Data Streams Data streams.
1 S Post-graduate course in Radio Communications Analysis Methods for Combined Voice and Data Huibin Lin
Performance Enhancement of Multirate IEEE WLANs with Geographically Scattered Stations 1 Duck-Yong Yang, 2 Tae-Jin Lee, 3 Kyunghun Jang, 3 Jin-Bong.
AN EFFICIENT TDMA SCHEME WITH DYNAMIC SLOT ASSIGNMENT IN CLUSTERED WIRELESS SENSOR NETWORKS Shafiq U. Hashmi, Jahangir H. Sarker, Hussein T. Mouftah and.
Generalization Performance of Exchange Monte Carlo Method for Normal Mixture Models Kenji Nagata, Sumio Watanabe Tokyo Institute of Technology.
Optimization of Monte Carlo Integration
QUANTUM TRANSITIONS WITHIN THE FUNCTIONAL INTEGRATION REAL FUNCTIONAL
TGax SLS MAC Calibration Test 4 Results
Lial/Hungerford/Holcomb: Mathematics with Applications 10e
Wavelet-Based Denoising Using Hidden Markov Models
Wavelet-Based Denoising Using Hidden Markov Models
AN ANALYTICAL MODEL OF MPEG-4 MULTIPLE DESCRIPTION VIDEO SOURCES
Pramod Bhatotia, Ruichuan Chen, Myungjin Lee
Analysis of Adaptive Media Playout for Stochastic Channel Models
8.2 The Geometric Distribution
Lial/Hungerford/Holcomb: Mathematics with Applications 10e Finite Mathematics with Applications 10e Copyright ©2011 Pearson Education, Inc. All right.
The Geometric Distributions
QoS routing Finding a path that can satisfy the QoS requirement of a connection. Achieving high resource utilization.
Presentation transcript:

Mariusz Głąbowski, Adam Kaliszan, Maciej Stasiak A New Convolution Algorithm of Blocking Probability Calculation in Full-Availability Group with Bandwidth Reservation Poznań University of Technology

M. Głąbowski et all: A New Convolution Algorithm of Blocking Probability Calculation... 2 Plan of the presentation  Full-availability group  Analytical models  One-dimensional Markov chain  Convolution algorithm  Full-availability group with reservation  Numerical results  Conclusions

M. Głąbowski et all: A New Convolution Algorithm of Blocking Probability Calculation... 3 Full availability group … V Shared Bandwidth Class 1: λ 1, μ 1, t 1 Class 2: λ 2, μ 2, t 2 Class 3: λ 3, μ 3, t 3 Class M: λ M, μ M, t M

M. Głąbowski et all: A New Convolution Algorithm of Blocking Probability Calculation... 4 Multi-dimensional Markov process

M. Głąbowski et all: A New Convolution Algorithm of Blocking Probability Calculation... 5 Multi-rate systems Analytical models One-dimensional Markov chain Convolution algorithm Poisson traffic modelBPP traffic model State – independent systems State – dependent systems State – independent systems State – dependent systems ?

M. Głąbowski et all: A New Convolution Algorithm of Blocking Probability Calculation... 6 One-dimensional Markov chain

M. Głąbowski et all: A New Convolution Algorithm of Blocking Probability Calculation... 7 Full-availability group … V Shared Bandwidth

M. Głąbowski et all: A New Convolution Algorithm of Blocking Probability Calculation... 8 Convolution algorithm  3 steps of algorithm:  Calculation of the occupancy distribution  Calculation of the aggregated occupancy distribution [P] V  Calculation of the blocking probability B i for the class i traffic stream

M. Głąbowski et all: A New Convolution Algorithm of Blocking Probability Calculation... 9 Convolution algorithm – step 1 [p 0 ] 1 V [p 1 ] 1 1 [p 2 ] 1 V [p 3 ] 1 V …[p V ] 1 V [p 0 ] 2 V [p 2 ] 2 V …[p V ] 2 V state

M. Głąbowski et all: A New Convolution Algorithm of Blocking Probability Calculation Convolution algorithm – step 2 [p 0 ] 1 V [p 1 ] 1 V [p 2 ] 1 V [p 3 ] 1 V …[p V ] 1 V * [p 0 ] 2 V [p 2 ] 2 V …[p V ] 2 V [p 0 ] 12 V [p 2 ] 12 V [p 3 ] 12 V …[p V ] 12 V = [p 2 ] 12 V = [p 0 ] 1 V [p 2 ] 2 V + [p 2 ] 1 V [p 0 ] 2 V (0+2=2) (2+0=2)

M. Głąbowski et all: A New Convolution Algorithm of Blocking Probability Calculation Convolution algorithm Step 2 & 3 Convolution algorithm – step 3 Convolution algorithm – step 2

M. Głąbowski et all: A New Convolution Algorithm of Blocking Probability Calculation Full-availability group with reservation Reservation spaceReservation treshold

M. Głąbowski et all: A New Convolution Algorithm of Blocking Probability Calculation Full-availability group with reservation  One-dimensional Markov chain

M. Głąbowski et all: A New Convolution Algorithm of Blocking Probability Calculation FAGR Convolution algorithm

M. Głąbowski et all: A New Convolution Algorithm of Blocking Probability Calculation FAGR Convolution algorithm p0p1p2p3p4 p0 0 p2 0 p4 p0 0 p2 0 p4 p0p1p2p3p4 4-th word of conditional distributions [Q] {1,2},{2} and [Q] {1,2},{1}

M. Głąbowski et all: A New Convolution Algorithm of Blocking Probability Calculation FAGR Convolution algorithm p0p1p2p3p4 p0 0 p2 0 p4 p0 0 p2 0 p4 p0p1p2p3p4 + PP ** [Q 1 ] 2+1 [Q 0 ] 2+1 [Q 4 ] 2+1 [Q 2 ] 1+2 [Q 0 ] 1+2 [Q 1 ] 1+2 [Q 3 ] 1+2 [Q 4 ] 1+2

M. Głąbowski et all: A New Convolution Algorithm of Blocking Probability Calculation FAGR Convolution algorithm [p] 1 [p] 2 [p]1 P(2) * * + P(1) [P] {1,2} [p] 3 [P] {1,2} P(3) * * + P(1,2) [P] {1,2,3} [p] 4 [P] {1,2,3} P(4) * * + P(1,2,3) …

M. Głąbowski et all: A New Convolution Algorithm of Blocking Probability Calculation Results

M. Głąbowski et all: A New Convolution Algorithm of Blocking Probability Calculation Results

M. Głąbowski et all: A New Convolution Algorithm of Blocking Probability Calculation Conclusions  This paper presents an approximate method of blocking probability calculations in the full availability group with reservation carrying a mixture of different traffic streams  The proposed method is based on convolution algorithm  The obtained calculation results have been compared with the results of simulation experiments. This research has confirmed a high accuracy of the proposed model