• DocumentCode
    2530990
  • Title

    New QoS approximation approach for topology aggregation

  • Author

    Zhang, Jingjun ; Han, Yuanbin ; Wang, Liguo

  • Author_Institution
    Sci. Res. Office, Hebei Univ. of Eng., Handan
  • fYear
    2008
  • fDate
    19-21 Nov. 2008
  • Firstpage
    1
  • Lastpage
    5
  • Abstract
    Topology aggregation in hierarchical networks has been recognized as an effective way for the purpose of reducing the storage of state information. However, it also introduces deviation from original information. To find the optimal tradeoff between information reduction and accuracy for topology aggregation, two novel approximation approaches based on the conception of approximation staircase was proposed in this paper. The approximation staircase formed by least square method is used to represent the QoS supported area to compress each domain into a full mesh topology. Both the performance analysis and experimental results show that the proposed approaches can minimize more information distortion without increasing the space complexity and time complexity than existing approaches.
  • Keywords
    computational complexity; least squares approximations; quality of service; telecommunication network topology; QoS approximation; hierarchical networks; information reduction; least square method; mesh topology; space complexity; state information; time complexity; topology aggregation; Bandwidth; Circuit topology; Delay; Educational institutions; Least squares approximation; Least squares methods; Network topology; Performance analysis; Routing; Tree data structures;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    TENCON 2008 - 2008 IEEE Region 10 Conference
  • Conference_Location
    Hyderabad
  • Print_ISBN
    978-1-4244-2408-5
  • Electronic_ISBN
    978-1-4244-2409-2
  • Type

    conf

  • DOI
    10.1109/TENCON.2008.4766752
  • Filename
    4766752