Korean Management Science Review (경영과학)

The Korean Operations Research and Management Science Society (한국경영과학회)
권호 표지

Mobile Access Network Design

이동통신 액세스망 설계

  • 김후곤 (경성대학교 디지털비즈니스학부) ;
  • 백천현 (동의대학교 산업경영공학과) ;
  • 권준혁 (LG텔레콤) ;
  • 정용주 (부산외국어대학교 인터넷비즈니스공학과)
  • Published : 2007.11.30
Download PDF
⟨ Previous Next ⟩

Abstract

This study deals with the optimal design of mobile access network connecting base stations(BSs) and mobile switching centers(MSCs). Generally mobile operators constitute their access networks by leasing communication lines. Using the characteristic of leased line rate based on administration region, we build an optimization model for mobile access network design which has much smaller number of variables than the existing researches. And we develop a GUI based optimization tool integrating the well-known softwares such as MS EXCEL. MS VisualBasic, MS PowerPoint and Ip_solve, a freeware optimization software. Employing the current access network configuration of a Korean mobile carrier, this study using the optimization tool obtain an optimal solution for both single MSC access network and nation-wide access network. Each optimal access network achieves 7.45% and 9.49% save of lease rate, respectively. Considering the monthly charge and total amount of lease line rate, our optimization tool provides big amount of save in network operation cost. Besides the graphical representation of access networks makes the operator easily understand and compare current and optimal access networks.

Keywords

References

  1. [1] 김은정, 강동한, 이경식, 박성수, '용량제약이 있는 이계층 설비 입지선정 문제의 최적화 해법', 한국경영과학회/대한산업공학회 춘계공동학술대회, 2003
  2. 이창호, 윤종화, 정한욱, '설비용량을 고려한 계층적 네트워크의 설계 및 분석', 한국경영과학회지, 제19권, 제1호(1994), pp.69-83
  3. 조 건, '나무구조를 갖는 네트워크상에서의 제한용량이 있는 입지설정문제에 관한 연구', 대한산업공학회지, 제27권, 제3호(2001), pp.250-259
  4. 차동완, 정승학, 명영수, '설비용량에 제한이 있는 입지선정 문제에 대한 기존해법간의 비교분석', 한국경영과학회지, 제11권, 제2호 (1986), pp.1-6
  5. Andrews, M. and L. Zhang, 'The access network design problem,' Proceedings of the 39th Annual IEEE Symposium on Foundations of Computer Science, (1998), pp. 42-49
  6. Awerbuch, B. and Y. Azar, 'Buy-at-bulk network design,' Proceedings of the 38th Annual Symposium on Foundations of Computer Science, 1997
  7. Balakrishnan, A., T. Magnanti, and P. Mirchandani, 'Network design：in annotated bibliographies in combinatorial optimization,' M. Dell'Amico, F. Mali and S. Martello(eds.), John Wiley and Sons, New York, 1997
  8. Bartal, Y., 'On approximating arbitrary metrics by tree metrics,' Proceedings of the 30th Annual ACM Symposium on Theory of Computing, 1998
  9. Becchetti, L., J. Konemann, S. Leonardi, and M. Pal, 'Sharing the cost more efficiently： improved approximation for mul-ticommodity rent-or-buy problem,' Proceedings of the sixteenth annual ACMSIAM symposium on Discrete algorithms, 2005
  10. Charikar, M., C. Chekuri, A. Goel, and S. Guha, 'Approximating a finite metric by a small number of tree metrics,' Proceedings of the 39th Symposium on Foundations of Computer Science, 1998
  11. Epstein, R., Programming and capacitated network loading, Ph.D. Thesis, MIT, 1998
  12. Garg, N., R. Khandekar, G. Konjevod, R. Ravi, F.S. Salman, and A. Sinha, 'On the integrality gap of a natural formulation of the single-sink buy-at-bulk network design problem,' Lecture Notes in Computer Science, Vol.2081(2001)
  13. Guha, S., A. Meyerson, and K. Munagala, 'A constant factor approximation for the single sink edge installation problem,' Proceedings of the 33rd Annual ACM Symposium on Theory of Computing, 2001
  14. Hao Q. et al., 'A low-cost cellular mobile communication system：a hierarchical optimization network resource planning approach,' IEEE JSAC, Vol.15, No.7(1997), pp. 1315-1326
  15. Hassin, R., R. Ravi, and F.S. Salman, 'Approximation algorithms for a capacitated network design problem,' Lecture Notes in Computer Science, Vol.1913(2000)
  16. Holma, H. and A. Toskala, WCDMA for UMTS, Revised Ed., John and Wiley & Sons, 2001
  17. Krishnamanchari B. and S.B. Wicker, 'Optimization of fixed network design in cellular systems using local search algorithm,' Proceedings of IEEE VTC, (2000), pp. 1632-1638
  18. Laiho, J., A. Wacker, and T. Novosad, Radio Network Planning and Optimization for UMTS, Wiley, 2002
  19. Magnanti, T., P. Mirchandani, and R. Vachani, 'Modelling and solving the two-facility network loading problem,' Operations Research, Vol.43(1995), pp. 142-157 https://doi.org/10.1287/opre.43.1.142
  20. Salman, F.S., J. Cheriyan, R. Ravi, and S. Subramanian, 'Buy at bulk network design：Approximating the single sink edge installation problem,' Proceedings of the 8th Annual ACM-SIAM Symposium on Discrete Algorithms, 1997
  21. Shmoys, D.B., E. Tardos, and K. Aardal, 'Approximation algorithms for facility location problems,' Proceedings of the 29th Annual ACM Symposium on Theory of Computing, 1997
  22. Talwar, K., 'Single-sink buy-at-bulk LP has constant integrality gap,' Lecture Notes in Computer Science, Vol.2337(2002)