• DocumentCode
    2778757
  • Title

    Improvement of maximum admissible QoS traffic by traffic observations

  • Author

    Mikoshi, Taiju ; Takenaka, Toyofumi ; Fujiwara, Takayuki ; Masuda, Akeo ; Shiomoto, Kohei

  • Author_Institution
    Grad. Sch. of Eng., Nihon Univ., Tokyo, Japan
  • fYear
    2011
  • fDate
    4-6 July 2011
  • Firstpage
    158
  • Lastpage
    163
  • Abstract
    We propose a scalable call admission control (CAC) scheme that avoids link congestion while maximizing the total admissible traffic of an IP backbone network. Our proposed scheme is scalable in the sense that it requires bandwidth reservation management only at ingress nodes instead of at every links in the core network. We have already evaluated the performance of admissible traffic in case where traffic observations are not executed at ingress nodes in the reference [1]. In this paper, in order to increase admissible traffic volumes, we newly formulate an LP problem in case where traffic observations are executed at ingress nodes for estimating offered traffic volumes between ingress and egress node pairs. We evaluated our proposed scheme for NSFNET and COST239 and showed that the total admissible traffic increases about 2.7 and 2.5 times more for NSFNET and COST239, respectively, compared with the case where traffic observations are not executed.
  • Keywords
    quality of service; telecommunication congestion control; telecommunication traffic; COST239; IP backbone network; NSFNET; admissible traffic; bandwidth reservation management; maximum admissible QoS traffic; scalable call admission control; traffic observations; Bandwidth; Equations; Gravity; Mathematical model; Network topology; Quality of service; Routing; Admissible Traffic; CAC; Input Limitation; Linear Programming; Traffic Observation;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    High Performance Switching and Routing (HPSR), 2011 IEEE 12th International Conference on
  • Conference_Location
    Cartagena
  • Print_ISBN
    978-1-4244-8454-6
  • Electronic_ISBN
    978-1-4244-8455-3
  • Type

    conf

  • DOI
    10.1109/HPSR.2011.5986020
  • Filename
    5986020