Load Balancing Algorithm Based on QoS Awareness Applied in Wireless Networks

Transcription

1 , pp Loa Balancing Algoithm Bas on QoS Awanss Appli in Wilss Ntwoks CHEN Xiangqian, MA Shaohui Dpatmnt of Comput Scinc an Tchnology, Hnan Mchanic an Elctical Engining Collg, Hnan Xinxiang, , China Zhao Kai Taching Affais Division, Pingingshan Univsity, Hnan Pingingshan, , China Abstact. In o to uc businss latncy an packt loss at, to impov th thoughput of intgation of htognous wilss ntwok, to achiv loa ivsification an to impov n quality of svic, whil th a many poblms on th opout at of th taitional loa balancing algoith pocssing thoughput, lay an businss, thfo, gatway loa balancing algoithm is popos in this pap. All tminals in th accss ntwok can flct th ffctivnss of th avag ntwok loa lvl of th ntwok, this algoithm will gain wight of th loa in th ntwok of small businss tminal to switch to th ntwok loa which is light. Fist, it fins th htognous ntwoks an ntwok tminal payoff function utility function, which a us to chaactiz th xpinc an ntwok QOS tminal loa situation, an thn psnts th spcific pocsss of th gatway loa balancing algoithm. Finally, switching cisional loa balancing algoithm, popos by Yan X, tc. is compa with simulation xpimnts an it shows that: th popos gatway loa balancing algoithm has stong obustnss to achiv ntwok loa balancing an to achiv a balanc us of ntwok souc. Kywos: fficincy, loaing iffncs, al-tim businss, switching cision 1 Intouction Loa balancing is an impotant way, which maks full us of htognous wilss ntwok soucs. Though th loa balancing among th htognous ntwoks, th high pobability of ntwok loa can b uc, th ovall utilization of ntwok soucs is impov an th blocking pobability is uc to povi uss a btt QOS, so th loa balancing btwn th ntwoks is also an impotant aspct of consiing th accss algoithm slct [1-3]. Th us can only accss a kin of ntwok at th sam tim with th taitional ha loa balancing svic, which can not satisfy iffntiation of th us svic, sulting in patially utiliz htognous ntwok soucs an high taffic blocking atio. ISSN: ASTL Copyight 2015 SERSC

2 2 Popos Schm Th co ia of algoithm is: th QOS incom of tminal n can flcts th cunt lvl of ntwok quality of svic civ, th gat th bnfits is, th btt th sulting quality of svic is, an vic vsa; th avag QOS bnfit of all tminals in a accssing ntwok (hinaft fin as a ntwok utility) can flcts th loa lvl of th ntwok, th lag th avag gain of th tminal is, th loa on th ntwok is light, an vic vsa. In o to achiv ivsification an to incas th svic quality of loa tminal, th algoithm will switch small businsss with gain havy loa in th ntwok to a light tminal ntwok loa. In o to cay out th tminal to slct th RAN an its accss ffctivly an ynamically, th multimo tminal will xpinc unifi managmnt fom th ntwok si, which will b complt by th ntwok si managmnt ntity (Ntwok si manag, NSM). Th tminal will intact with NSM though th tminal-si managmnt ntity (Tminal-si manag, TSM), ynamically achiving factoing of switching/accssing. Th intaction btwn NSM an TSM is complt though managmnt contol channl (Managmnt an contol channl, MCC). NSM is ploy in th co ntwok, an is sha by a pluality of RAN. RAN will convy ach contxt infomation to NSM, thn NSM tansf ach contxt infomation of RAN to th tminal fo th cisions though th MCC ownlink tansmission. TSM of ach tminal sns contxt infomation of th tminal though uplink tansmission of th MCC to NSM. Bas on contxt infomation of RAN an tminal, NSM uss th appopiat ntwok slction algoithm to vlop statgis an policis issu un th vaious tminals. Tminal thn chooss accoing to thi ns an ntwok configuation cisions an configus to accss th appopiat RAN. Th pap will assum th tminal in th ntwok / int-cll hanov fast nough, an thus, th loa balancing pocss, u to switching lay caus by th upp isk of businss isuption can b igno. Diffnt typs of wilss ntwok svics hav iffnt QOS quimnts. Bas on th chaactistics of th vaious svics, wilss svics can b classifi into th typs of basic svics, as shown in Tabl 1. Tabl1. Wilss ntwok taffic typs an thi QOS quimnts Rat of chang Th minimum at Maximum at Tim lay quimnts A typical businss Ral-tim businss constant vaiabl = = VoIP MPEG 192 Copyight 2015 SERSC

3 Th al-tim businss vaiabl HTTP Accoing to al-tim quimnts, th wilss businss can b classifi into al-tim businss (Ral tim, RT) an non-al-tim svic (Non-al tim, NRT). Accoing to whth th at can chang o not, al-tim svic has bn ivi into two typs of constant at an vaiabl at. Minimum svic tim at a constant at an th maximum at quimnts a qual, that is th at a unchang. Th vaiabl at al-tim svic is possss of th minimum an maximum at quimnts. Whn th waiting tim of a al-tim svic xcs th maximum packt lay tolanc, th packt will b isca. Non-al-tim svic ns not to lay, an th minimum banwith can bcom zo. In o to chaactiz th obtain tminal fom th cunt ntwok quality of svic, bas on th QOS quimnts of iffnt businss, si function to constuct th tminal payoff function is us. So suppos J is th st of kins of RAN, I psnts th st of tminals in th ntwok, fining an accssing tminal i I of RAN j J QOS bnfit function is as follows: U gm on 1 (1 ). BT 1 x p ( ) m m a x m 1 (1 ). BRT 1 x p ( ) m Fo al-tim svics, at th pmis to mt th minimum banwith, using an avag lay to masu us gains, th small th tim lay is, th high th gain is; fo non-al-tim svics to th us, using avag sp of th us gains to masu, th lag th at is, th high th incom is; m a x If lay fo al-tim svics th nomaliz, whin of avag lay of al-tim svics: m a x (1) nots th xpctancy As th nomalization about Non-al-tim svics at, it hlps to nsu a minimum at of non-al-tim svics; an is constant paamts, which tmins th stpnss of th cuv of th function, th lag th valu is, th stp th cuv changs, th high th snsitivity to th n quality of svic is. Fomula (1) as fin in vnu function flcts QOS-awanss of tminal, th Copyight 2015 SERSC 193

4 function maps a pluality of QOS paamts with asonabl pcption o xpinc fo th us to QOS lvl, givs a masumnt of th QOS of iffnt uss by using unifom quantization lvls stanas. To chaactiz th loa lvl of th accssing ntwok, th wilss accss ntwok fins th utility of all th tminals connct to th ntwok avag of QOS bnfit. Suppos at a tim, a tminal can only accss a RAN, thn th gain RAN J I can b xpss as Whin, 1 t a l i in t o R A N 0 o th j R j i n J I, 0 I J 1, 0 Obviously, th havi ntwok loa will sult in low avag QOS bnfit of tminal; othwis th tminal avag QOS gains will b high. Thfo, th avag QOS bnfit of th tminal, namly th ntwok loa of th ntwok utility can flcts th situation. Ntwok utility is high, inicating that th ntwok loa is light, othwis it inicats th ntwok loa is havi. i j (2) 3 Conclusion Fo th intgation of htognous wilss ntwok communication scnaio, th ntwok loa balancing algoithm was popos bas on th QOS, which is falln into switchabl loa balancing algoithm. Algoithm is bas on QOS gains an ntwok utility of a gnaliz fatu fo wilss businss uss, an it is abl to chaactiz th quality of svic tminal ntwok xpinc an ntwok loa conitions, an it is univsally applicabl fo a vaity of htognous ntwok. Among thm, th univsality of ntwok utility to htognous ntwok maks htognous ntwok loa compaability compaabl, abl to achiv switching btwn htognous ntwok loa balancing. Simulation sults show that th popos gatway loa balancing algoithm can impov intgation of htognous ntwok thoughput, uc businss latncy an packt loss at, with stong obustnss to achiv ntwok loa balancing an to achiv a balanc us of ntwok soucs. Rfncs 1. Kasman Suhaii, Fo Lumban Gaol, Th Masumnt of Optimization Pfomanc of Manag Svic Division with ITIL Famwok using Statistical Pocss Contol. Jounal of Ntwoks, Vol 8, No 3 (2013), Guang Yan, Zhu Yu-Fi, Gu Chun-Xiang, Fi Jin-long, H Xin-Zhng, A Famwok fo 194 Copyight 2015 SERSC

5 Automat Scuity Poof an its Application to OAEP. Jounal of Ntwoks, Vol 8, No 3 (2013), Yishuang Gng, Kavh Pahlavan, On th Accuacy of RF an Imag Pocssing Bas Hybi Localization fo Wilss Capsul Enoscopy, IEEE Wilss Communications an Ntwoking Confnc (WCNC), Ma Ji H, Yishuang Gng an Kavh Pahlavan, Towa Accuat Human Tacking: Molling Tim-of-Aival fo Wilss Waabl Snsos in Multipath Envionmnt, IEEE Snso Jounal, 14(11), , Nov Copyight 2015 SERSC 195