Connection Admission Control Schemes for Self-Similar Traffic - PowerPoint PPT Presentation

1 / 19
About This Presentation
Title:

Connection Admission Control Schemes for Self-Similar Traffic

Description:

Title: Connection Admission Control Schemes for Self-Similar Traffic Author: College of Engineering Last modified by: Carey Williamson Created Date – PowerPoint PPT presentation

Number of Views:99
Avg rating:3.0/5.0
Slides: 20
Provided by: CollegeofE203
Category:

less

Transcript and Presenter's Notes

Title: Connection Admission Control Schemes for Self-Similar Traffic


1
Connection Admission Control Schemes for
Self-Similar Traffic
  • Yanping Wang
  • Carey Williamson
  • University of Saskatchewan

2
Connection Admission Control
  • Features
  • important traffic management mechanism
  • improve network utilization (statistical
    multiplexing)
  • meet QOS requirements of all existing connections
  • Difficulties
  • diverse traffic characteristics
  • various QOS requirements
  • bursty, self-similar traffic (i.e., LRD)

3
Self-SimilarityPrevalence of Bursts Over Many
Time Scales
4
Properties of Self-Similar Traffic
  • Autocorrelation Function

5
(continued)
  • Variance-Time Plot

6
(continued)
  • R/S Pox Diagram

7
Research Objectives
  • Self-similarity
  • affects queuing behavior of aggregate traffic
  • has impact on network-engineering problems
  • admission control, rate control
  • Research objectives
  • CAC performance when presented with self-similar
    traffic
  • identify the impact of different parameters

8
CAC Algorithms
  • PCR CAC
  • QOS guaranteed
  • network resource wasted
  • SCR CAC
  • high network utilization
  • poor QOS performance
  • AVG CAC
  • allocates extra bandwidth to handle the
    burstiness in the traffic
  • GCAC
  • specified in P-NNI for efficient path selection
  • exploit multiplexing gains
  • Norros CAC
  • based on FBM model
  • traffic characteristics captured by m, a, and H
  • exploit multiplexing gains

9
Experimental Methodology (1)
  • Network Topology
  • Fractional-ARIMA Based Model
  • Hoskings model 3 transformations
  • LRD and SRD features adjustable
  • marginal distribution adjustable

10
Experimental Methodology (2)
  • Simulation Configuration
  • ATM-TN simulator
  • factors (m, a, H, b, C and ?)
  • metrics (CA, LU and CLR)
  • baseline configuration and the structured
    simulations
  • Simulation Validation
  • warmup phase
  • accuracy of the results

11
Simulation Results (1)Baseline Configuration
  • Call Acceptance Performance

12
Simulation Results (2)Baseline Configuration
  • Link Utilization

13
Simulation Results (3)Baseline Configuration
  • CLR Performance

14
Simulation Results (4)Baseline Configuration

15
Simulation Results (5)Parameter Effects
  • Source Granularity

16
Simulation Results (6)Parameter Effects
  • Source Variability

17
Conclusions (1) CAC Performance
  • Impact of the Parameters
  • source granularity, source variability
  • long-range correlation structure
  • buffer size, target CLR
  • link capacity
  • mixing traffic sources
  • Norros CAC and AVG CAC are promising
  • None of the CAC algorithms provides satisfying
    overall performance in all the scenarios

18
Conclusions (2) Impact of Self-Similarity
  • Strong impact on network performance
  • especially when link capacity is small
  • statistical multiplexing gains should be
    exploited
  • achievable link utilization increases as link
    capacity increases
  • ineffectiveness of buffering

19
Future Work
  • Multifractal property
  • multifractal vs. monofractal traffic
  • Estimated traffic parameters
  • accurate vs. poor traffic parameters
Write a Comment
User Comments (0)
About PowerShow.com