Browse > Article
http://dx.doi.org/10.9708/jksci.2011.16.9.107

SGOSST Mechanism for Quality of Service In Network  

Kim, In-Bum (Dept. of Internet Information, Kimpo College)
Publication Information
Journal of the Korea Society of Computer and Information / v.16, no.9, 2011 , pp. 107-114 More about this Journal
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.
Keywords
Weighted Minimum Spanning Tree; Steiner Minimum Tree; Gosst Point; Qos(Quality of Services); SGOSST(Scaled-grid Grade Of Services Steiner minimum Tree);
Citations & Related Records
Times Cited By KSCI : 5  (Citation Analysis)
연도 인용수 순위
1 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   DOI   ScienceOn
2 S.Lee, C.Han, "A Study of Multicast Tree Problem with Multiple Constraints", Journal of KSII, Vol. 5, No.5, pp.129-138, 2004
3 B. Bell, "Steiner Minimal Tree Problem", http://www.css.taylor.edu/-bbell/steiner/, 1999
4 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
5 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.   DOI   ScienceOn
6 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   DOI   ScienceOn
7 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
8 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
9 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
10 D.Kim, S.Kim, "Energy Efficient Routing Scheme forWireless Sensor Networks," Journal of KICS, Vol.35, No5, pp.417-422, 2010
11 E.J. Cockayne and D.E. Hewgrill, "Improved computation of plane Steiner minimal tree," Algorithmica, Vol.7, pp.219-229, 1992.   DOI   ScienceOn
12 F.K. Hwang, "A Primer of the Euclidean Steiner problem," Annals of Operations Research, Vol.33, pp.73-84, 1991   DOI   ScienceOn
13 T.H. Cormen, C.E Leiserson, R.L. Rivest and C. Stein, "Introduction to Algorithms," 2nd Ed., MIT