Journal of the Korea Society of Computer and Information (한국컴퓨터정보학회논문지)

Korean Society of Computer Information (한국컴퓨터정보학회)
권호 표지
DOI QR코드

DOI QR Code

SGOSST Mechanism for Quality of Service In Network

네트워크 QoS를 위한 SGOSST 메커니즘

  • Kim, In-Bum (Dept. of Internet Information, Kimpo College)
  • Received : 2011.06.07
  • Accepted : 2011.06.29
  • Published : 2011.09.30
Download PDF
⟨ Previous Next ⟩

Abstract

Because of boost of communications devices furnishing diverse services and rapid expansion of mobile business, good use and management of the existing network system become very important. Also, offering service corresponding with user communication requirement grades which vary widely in each person, is vital for communication service provider. In this paper, SGOSST, a mechanism of efficient network construction with minimum cost for network QoS is proposed. In experiments, though spending 252.97% more execution times, our SGOSST QoS network consumed 5.11% less connecting costs than the network constructed by weighted minimum spanning tree method. Therefore our mechanism can work well for efficient operation and service providing in the network formed with users and communication devices of various service requirement grade as smart/mobile equipment.

다양한 서비스를 제공하는 통신 기기의 활성화 및 모바일 사업의 급속한 확대로 인해 기존 네트워크 설비의 효율적인 활용 및 운용이 매우 중요시 되고 있다. 이와 함께 개인별 편차가 큰 사용자의 통신 요구 수준에 부합하는 서비스의 제공은 통신 사업자에게 매우 중요하다. 본 논문에서는 이러한 것들을 모두 만족시킬 수 있는 최소 연결 비용의 네트워크를 효과적으로 구성하여 네트워크 QoS를 구현하는 SGOSST를 제안한다. 실험에서 제안된 방법으로 생성된 SGOSST QoS 네트워크는, 가중치 반영 최소 신장 트리 방법으로 구현된 QoS 네트워크에 비해 실행시간은 252.97% 증가했으나, 네트워크 구성을 위한 연결 비용은 5.11% 감소하였다. 따라서 제안된 방법은 스마트 및 모바일 기기 등 다양한 서비스 요청 등급의 통신 기기들과 사용자들로 구성된 네트워크에서 효율적인 운용 및 서비스 제공 등에 잘 적용될 수 있을 것이다.

Keywords

References

  1. T.H. Cormen, C.E Leiserson, R.L. Rivest and C. Stein, "Introduction to Algorithms," 2nd Ed., MIT
  2. F.K. Hwang, "A Primer of the Euclidean Steiner problem," Annals of Operations Research, Vol.33, pp.73-84, 1991 https://doi.org/10.1007/BF02061658
  3. G.L. Xue, G.H. Lin. and D.Z. Du, "Grade of Service Steiner Minimum Trees in Euclidean Plane," Algorithmica, Vol.31, pp.479-500, 2001 https://doi.org/10.1007/s00453-001-0050-6
  4. S.Hong, Y.Won, "Optimal Channel Power Allocation by Exploiting Packet Semantics for Real-time Wireless Multimedia Communication," Journal of IEEK, Vol.47 CI, No1, pp.171-184, 2010
  5. J.Kim, K.Shin, W.Yoon and S.Choi, "A Study on Multimedia Data Scheduling for QoS Enhancement," Journal of IEEK, Vol46 CI, No5, pp.44-56, 2009
  6. J.KIm, C.Han, "Characteristics and Methods of Bandwidth Allocation According to Flow Features for QoS Control on Flow-Aware Network," Journal of IEEK, Vol45 TC, No9, pp.39-48, 2008
  7. D.Kim, S.Kim, "Energy Efficient Routing Scheme forWireless Sensor Networks," Journal of KICS, Vol.35, No5, pp.417-422, 2010
  8. E.J. Cockayne and D.E. Hewgrill, "Improved computation of plane Steiner minimal tree," Algorithmica, Vol.7, pp.219-229, 1992. https://doi.org/10.1007/BF01758759
  9. S.Lee, C.Han, "A Study of Multicast Tree Problem with Multiple Constraints", Journal of KSII, Vol. 5, No.5, pp.129-138, 2004
  10. B. Bell, "Steiner Minimal Tree Problem", http://www.css.taylor.edu/-bbell/steiner/, 1999
  11. I. Kim and C. Kim, "An Enhanced Heuristic Using Direct Steiner Point Locating and Distance Preferring MST Building Strategy for GOSST Problem," International Journal of Computer Science and Network Security, Vol.7, No.2, pp.164-175, 2007
  12. J. Kim, M. Cardei, I. Cardei and X. Jia, "A Polynomial Time Approximation Scheme for the Grade of Service Steiner Minimum Tree Problem," Algorithmica, Vol.42, pp.109-120, 2005. https://doi.org/10.1007/s00453-004-1133-y
  13. M. Karpiniski, I.I. Mandoiu, A. Olshevsky and A. Zelikovsky, "Improved Approximation Algorithms for the Quality of Service Multicast Tree Problem", Algorithmica, 42, pp.109-120, 2005 https://doi.org/10.1007/s00453-004-1133-y