• DocumentCode
    3194421
  • Title

    Link State Information Approximation for Hierarchical QoS Routing

  • Author

    Kwon, Sora ; Jeon, Changho

  • Author_Institution
    Dept. of Comput. Sci. & Eng., Hanyang Univ., Ansan, South Korea
  • fYear
    2011
  • fDate
    26-29 April 2011
  • Firstpage
    1
  • Lastpage
    6
  • Abstract
    In this paper, Service Boundary Line approximation method is proposed to improve the accuracy of aggregated link state information in transport networks that conduct hierarchical QoS routing. This method selects the main link state information in the network and transports the data to the external networks together with the aggregation information, reducing information distortion caused from the loss of some link state information during link aggregation process. The proposed method is especially useful for aggregating links that have both delay and bandwidth as their QoS parameters. Simulation results show that our approximation method requires a storage space that is 1.5-2 times larger than those in other known techniques, depending on the main line state information selection method, but that information accuracy is 2-5 times higher.
  • Keywords
    delays; quality of service; telecommunication links; telecommunication network routing; delay; hierarchical QoS routing; information distortion; link aggregation process; link state information approximation; service boundary line approximation method; transport networks; Accuracy; Bandwidth; Delay; Linear approximation; Quality of service; Routing;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Information Science and Applications (ICISA), 2011 International Conference on
  • Conference_Location
    Jeju Island
  • Print_ISBN
    978-1-4244-9222-0
  • Electronic_ISBN
    978-1-4244-9223-7
  • Type

    conf

  • DOI
    10.1109/ICISA.2011.5772389
  • Filename
    5772389