• DocumentCode
    1623234
  • Title

    Access Service Network (ASN) Gateway Relocation Algorithms in WiMAX Networks

  • Author

    Liu, Zong-Hua ; Pan, Shin-Ying ; Chen, Jyh-Cheng

  • Author_Institution
    Dept. of Comput. Sci., Nat. Tsing Hua Univ., Hsinchu
  • fYear
    2008
  • Firstpage
    2674
  • Lastpage
    2679
  • Abstract
    WiMAX forum is developing and standardizing the end-to-end network architecture. The access service network (ASN) gateway (GW) plays a critical role in the system. How to reduce the load in the ASN GW has become an important issue. However, the standards only define the ASN GW relocation procedure without specifying when the relocation should be performed. In a real development, the key challenge to reduce the load of an ASN GW heavily relies on the decision of an appropriate time to relocate the MSs in an ASN GW. In this paper, we propose two effective ASN GW relocation algorithms. They can accurately estimate the traffic load and decide when to perform ASN GW relocation. The proposed algorithms can be accomplished by ASN GW alone. There is no need to exchange information among ASN GWs or get any help from other servers. They are fully compatible with existing systems and should be easy to implement. Extensive simulations have been performed to investigate the performance of the proposed algorithms. The results show that the proposed algorithms can increase overall throughput and reduce the loads of ASN GWs.
  • Keywords
    WiMax; internetworking; radio access networks; telecommunication traffic; ASN gateway relocation algorithm; WiMax network; access service network; traffic load estimation; Communications Society; Computer architecture; Computer science; Delay; Mobile radio mobility management; Next generation networking; Telecommunication traffic; Throughput; WiMAX; Wireless networks;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Communications, 2008. ICC '08. IEEE International Conference on
  • Conference_Location
    Beijing
  • Print_ISBN
    978-1-4244-2075-9
  • Electronic_ISBN
    978-1-4244-2075-9
  • Type

    conf

  • DOI
    10.1109/ICC.2008.505
  • Filename
    4533541