ATEC Web of Conferences 76, (8) IFID 8 https://do.org/./matecconf/876 Regonal Load Balancng Crcutous Bandwdth Allocaton ethod Based on Dynamc Aucton echansm Wang Chao, Zhang Dalong, Ran Xaomn atonal Dgtal Swtchng System Engneerng and Technologcal Research Center,ZhengZhou, Chna; College of Informaton Engneerng, Zhengzhou Unversty, Zhengzhou,Chna Abstract. Amng at the problem of lnk congeston caused by the shortage of network bandwdth resources at the user end, ths paper frst proposes a regonal load balancng dea. Then, for the problem of bandwdth resource allocaton n regonal load balancng, a bandwdth allocaton model s establshed and a dynamc aucton algorthm s proposed. The algorthm calculates the lnk qualty and stablty by constructng a lnk model, and ntroduces the aucton bandwdth to the auctoneer's ncentve degree to obtan the aucton bddng functon. The smulaton results show that the algorthm can effectvely mprove the user's network status, reduce the servce response delay, ncrease the throughput, and at the same tme can effectvely prevent the aucton user's false bddng behavor, so that the aucton quote quckly converges to the mum quote, reduces the number of auctons, and reduces Communcaton overhead. ITRODUCTIO The rapd development of the Internet has put hgher demands on the bandwdth. Although the lnk capacty s qute adequate, overconsumpton of lnk congeston and bandwdth s stll wdespread n the Internet. Therefore, t s of great sgnfcance to effcently use the avalable bandwdth resources n the network. For the allocaton of lmted resources, the prce control mechansm s an effectve soluton (Song Qzhu, ). The most typcal control mechansm based on prce s to set a statc prce for each unt resource, the most obvous advantage of ths method s smple and easy to mplement (Odlyzko A, 997). However, the statc prcng model can not adapt to the dynamc changes of network traffc n the network envronment where the resource s demand changes dynamcally. In order to solve the problem of bandwdth resource allocaton n dynamc network envronment better, a dynamc prcng model s proposed. A classcal dynamc prcng model uses the aucton way to prce the network bandwdth for mum beneft (Semret, 999). Dramtnos (7) proposed a dstrbuted network bandwdth aucton mechansm for Dutch mult-unt auctons by settng a suffcently hgh bddng prce for each lnk's bandwdth and conductng prce reducton auctons based on varable prce reducton rules untl the frst bdder appears. The method uses dfferent bddng prces to reflect the mbalance of lnk s bandwdth requrements, meanwhle, the prcng method usng VCG (Vckrey-Clarke-Groves) mechansm ensures the bddng behavor of the bdders. However, ths mechansm requres bdders to montor bddng progress at all tme, whch leads to large communcaton costs. Tpsuwan Y (9) comparatved the advantages and dsadvantages of three bandwdth allocaton methods, and proposed a centralzed aucton mechansm based on game theory and dynamc bandwdth allocaton method.as bdders ntally submtted prce may be dfferent from the fnal payment prce, bandwdth utlzaton and ntal offer s used to determne ts fnal offer and avod fake quotatons. Lnk evaluaton s a way to mprove routng performance through lnk qualty (Chan K P, and Ln-Yuan L, ). To solve the problem of network congeston caused by multconcurrency servces, ths paper frst proposes a soluton of regonal load balancng, then proposes a dynamc bandwdth aucton method. Based on the centralzed dynamc aucton mechansm, the classfcaton of bandwdth resources s frstly refned by evaluatng the lnk s qualty to meet the needs of dfferent bdders. The prcng rules based on lnk s qualty can effectvely nhbt bddng's fake bddng behavor. At the same tme, ths paper also proposes aucton ncentve value mechansm, whch determnes the degree of stmulaton or suppresson of bandwdth resources to the bdders n each round of auctons, t avods the communcaton overhead of multple nteractve nteractons between aucton partes, not noly Correspondng author: ok46sdu@6.com, ttengzhang@6.com The Authors, publshed by EDP Scences. Ths s an open access artcle dstrbuted under the terms of the Creatve Commons Attrbuton Lcense 4. (http://creatvecommons.org/lcenses/by/4./).
ATEC Web of Conferences 76, (8) IFID 8 https://do.org/./matecconf/876 ensures that the aucton ends wthn lmted rounds, but also makes aucton quotes quckly tend to the mum. Fnally, the problem s smplfed by separately solvng the mum beneft of each unt nstead of calculatng the global mum beneft. The rest of ths paper s organzed as follows.in Secton,we ntroduce the concept of regonal load balancng.in Secton,we descrbe the model of bandwdth allocaton and lnk qualty.then we descrbe the bandwdth aucton algorthm n Secton 4.Extensve smulatons are dscussed n Secton.Secton 6 concludes ths paper. REGIOAL LOAD BALACIG In a mult-isp (Internet Servce Provders) network, the tradtonal mult-wa router only consders the load balance wthn the devce and does not consder the load balancng wthn the regon, t easly leads to the user's data transmsson between dfferent ISPs. However, the brdge bandwdth between dfferent ISP servers s often dffcult to meet the demand of large amount of data transmsson, whch lmts the mplementaton of load balancng. eanwhle, due to massve data forwardng between ISP brdges, the transmsson delay of user servces under the load balancng polcy ncreases, makng t dffcult to satsfy users' QoE. In order to solve the above problem, ths paper presents a regonal load balancng technology - through multple gateways (the gateway needs more than two WA ports) to collaborate wth each other, and to complete the round robn forwardng of the servces of the congested gateways wthn a certan spatal doman. That s, usng the correspondng WA ports and lnks of dle gateways n the local area to mplement detourng and forwardng of the congested lnks, and avodng the preempton of load balancng servces on the brdge bandwdth between ISPs. Enablng multple users to reuse access band-wdth resources of a certan WA port on demand to mprove network access rate and throughput so as to complete dstrbuted traffc balance at the bottom and enable effcent access to data, vdeo, and other servces on dfferent ISP servers. Regonal load balancng s a load balancng technology that enables cooperatve forwardng and traffc transfer among multple devces wthn a certan spatal doman to round off congested lnks. Forwardng user s data on the congeston sde by borrowng the lnks of other dle gateways, the load of the congested lnks and nodes can be release and the servce response tme of the congested gateway can be reduced, so as to acheve dstrbuted traffc balance. The prncple s shown n Fgure. When multple gateways n a network cooperate wth each other to complete bandwdth rentng and lnk bypassng, traffc load of the congested nodes s transferred to dle nodes. Adoptng ths crcutous strategy can avod the transmsson pressure of traffc between two dfferent ISPs and mplement the underlyng mult-network convergence. Fgure : Regonal load balancng prncple dagram ODEL BUILDIG. Aucton odel Although the lnk capacty s suffcent, as the network user base and the user's level of network qualty requrements ncrease dramatcally, the user's demand for bandwdth s far greater than the bandwdth resources provded by the operator. Whle centralzed allocaton algorthm s easy to form a "heat sland" effect, and the central server s easy to become a performance bottleneck, and there s a delay n the nteracton and update of the nformaton, whch can not well adapt to the network wth frequent dynamc changes. To ratonally allocate resources on demand and ensure the farness of resource allocaton as well as the beneft of resource provders, ths paper adopts the aucton method for the band-wdth allocaton of users wth the same bandwdth requrements. For the allocaton of bandwdth resources to users requestng the same bandwdth, ths paper descrbes the aucton model as a optmzaton problem. Accordng to bdders submt the offer nformaton to determne the bandwdth allocaton program. The model defnes partcpants as three types: partcpants wth free bandwdth resources are auctoneers, partcpants who request bandwdth resources are bdders, agents who decde on bandwdth allocaton results and payment rules for both bdders. Durng the aucton, the total revenue obtaned by defnng auctoneers s W, where W s the revenue obtaned by the auctoneer, so the aucton model can be abstracted as follow: s. t. B C, B,,, Where W () B s the bandwdth requrement of bdder.
ATEC Web of Conferences 76, (8) IFID 8 https://do.org/./matecconf/876 In order to solve the mum value, the above optmzaton problem s decomposed to solve the optmal value of each auctoneer so as to opt-mze the overall return. Therefore, Eq. () can be decomposed nto the followng formula: W () s. t. B B, B,,, Where B s the free bandwdth resource pro-vded by the auctoneer and s the total number of bdders owned by the auctoneer.. Lnk Qualty The purpose of the regon load balancng stra-tegy s to realze the traffc transfer from the congested node to the dle node, that s to select a better-qualty path for data transmsson. In the transmsson of the servce, the congeston status of the lnk s more mportant than the number of hops to affect users QoS. To acheve regonal load balancng, you need to measure the qualty of the path between the clent and the server. In the end-to-end mult-hop lnk topology shown n Fgure, D s a server, S s a clent gateway, and the others nodes are routers. For the clent, the effect of the neghbor node on t s QoS s hgher than that of the remote node. Therefore, the lnk weght vector s ntroduced as the mpact value of each lnk qualty on the clent. The weght of lnk k s: k () k Where s the total number of end-to-end hops, k s the lnk number, and the closer t s to the clent k, the larger t s. S - - - Fgure : End-to-end mult-hop forwardng lnk In ths paper, the round-trp delay of packets s the man parameter of lnk qualty. In normal con-dtons, we defne the average roundtrp delay s RTT, then the qualty of lnk k s: RTT Qk k (4) RTTk Where RTT k s the average round-trp delay of lnk k n the qualty calculaton perod. Therefore, the clent s port to the operator's server path qualty Q s: RTT Q k () k RTTk In the mult-hop path from the user termnal to the server, there may be multple lnks wth the same qualty. In order to dstngush the qualty of the lnks, a lnk s stablty parameter s ntroduced. Assume that the end-toend path performs m mea-surements wthn one RTT calculaton perod., so the lnk RTT matrx R s obtaned: D RTT RTT m R (6) RTT RTT m Where RTT represents the th RTT measurement of lnk. Therefore, the lnk s stablty S s the var-ance of matrx R : S DR (7) 4 BADWIDTH AUCTIO ALGORITH As the bdder often requests more bandwdth than the actual demand n bddng, n order to avod the bddng behavor of the bdder and result n the waste of resources, the bddng party's payment functon P bd s defned, ndcatng that the re-quested lnk qualty s Q bd and the bandwdth s B,the bdder s payment functon bd s defned by the followng formula: Pbd ( Qauc Qbd ) Bbd Sauc (8) Where and are unt prce coeffcent constants of lnk qualty and bandwdth. If a bdder requests a bandwdth greater than the actual demand, the cost to be pad by the bdder ncreases wth a certan dfference n the qualty of the lnk, thereby suppressng the bdder's fake bddng behavor. If the bdder needs a certan bandwdth, the hgher the bddng lnk qualty s, the hgher the cost wll be borne. Bddng process, dfferent bdders may be dfferent, set a quotaton n the hghest offer s F, then the next quotaton, the last hghest bd s the reserve prce of the offer. Suppose the n th bd quotaton of bdder s F n, the hghest quotaton of the bd s F n, n order to reduce the bddng process nformaton nteracton, makng bddng quckly converge to the hghest quotaton, we propose a ncentve functon n, sad the tem s attractve or repulsve to the bdder n the quote. The ncentve value s determned by the attracton generated by the rato of the qualty of the bddng obect to the bdder's own network qualty and the prce ncrease per bddng quote, as follows: Qauc, n Qbd n (9) F nf n n, n F n When n, bdder wll conduct the next bd, when n, bdder wll gve up bddng. From Eq.(9), we can see that when n, n s a decreasng functon, that s the bddng enthusasm of bdders wll gradually decrease as the number of bddng ncreases. After lmted rounds of bddng, n, bddng partcpants gve up aucton and the aucton ends. From Eq.(8), we know that the mum that an auctoneer can obtan n each round aucton s
ATEC Web of Conferences 76, (8) IFID 8 P B [ln(n) C] B, where C s the bd bd bd Euler's constant and C.77. In the case of the same bandwdth request and the number of hops between the clent and the operator's server, B and n s a bd constant. In order to make the bddng prce quckly converge to the mum bddng prce, we set up bd L tmes per round. When n, the bdder bd ncreases to be s: Pbd, n P bd n F n X Pn, n n Pn, so the bddng round of bdder n n (), In the Eq.(), where X n and, Pn P bd B bd. From Eq.(),we can see that each round of bddng the quote s hgher than the the hghest quote of last round of bddng, combned wth Eq.(9), t can be obtaned wthn lmted rounds of auctons, the quotaton wll quckly converge to the hghest fnal prce. SIULATIO AALYSIS In order to verfy the advantages and ds-advantages of the proposed bandwdth allocaton algorthm, S s used to desgn the followng experment. The expermental results are shown n Fgure, There were sx users who made fake quotes and compared the performance and cost before and after ther quotes. Increased performance cost delay (s) throughput (Kbps) delay (s)...8.6.4.. user user user.8 4 6 7 8 9 tme (s) 6 4 Fgure 4: User's delay n case 4 6 8 4 6 8 tme (s)..... user user user Fgure : User's throughput n case. tme (s) 6 user4 https://do.org/./matecconf/876 Fgure 6: User's delay n case user4 user user6 Proft (%) throughput (Kbps) 4 user user6 4 6 User ID Fgure : Fake quote proft contrast We can see from the Fgure that when users make fake quotes, ther performance mprovement rato s far less than the ncrease n cost, so the prcng rules provded n ths paper can effectvely avod the problem of false quotes. In order to evaluate the mpact of the proposed algorthm on the performance of networks, the effect of lnk qualty and bandwdth on users s smulated under two scenaros respectvely: Case s the effect on performance of users leasng dfferent band-wdths under the same lnk qualty; case s the effect on the user's performance under the condton that the bandwdth of the user s the same and the lnk qualty s dfferent. In the case, the delay of three users and the throughput result are shown n Fgure 4 and ; In the case, the delay and through-put results shown n Fgure 6 and 7. 4 6 8 4 6 8 tme (s) Fgure 7: User's throughput n case Comparng Fgure 4 and 6 shows that after the transmsson s stable, when the lnk qualty s dfferent and the bandwdth s the same, the better the lnk qualty s, the lower the delay s. As can be seen from the comparson between Fgure and 7, the throughput of the clent s related to the band-wdth and the lnk qualty. When the bandwdth s the same, the better the lnk qualty s, the larger the throughput s. In the case of a certan lnk qualty, the larger the bandwdth, the greater the throughput. Because the method proposed n ths paper mproves the lnk qualty and ncreases the logcal bandwdth at the same tme, so can better mprove user s QoE. To verfy the advantages and dsadvantages of the proposed algorthm, we smulate the bddng stuaton of 4
ATEC Web of Conferences 76, (8) IFID 8 bdders under the same bandwdth and bddng under dfferent bandwdth requests by multple bdders. The smulaton results are shown n Fgure 8 and Fgure 9. Quote Quote 4 6 7 8 9 Aucton tmes data data data data4 Fgure 8: The same bandwdth s quote 8 4 6 7 8 9 Aucton tmes Fgure 9: Dfferent request bandwdth s quote Where Fgure 8 s a bddng result of four bdders bddng smultaneously wth a bandwdth of. From Fgure 8, t can be seen that n the case of a bddng bandwdth of a certan sze, bdders' ntal quotatons are not necessarly the same. In the bddng process, each Therefore, the bdders bd n the next round of bddng s also dfferent, and the hghest bd of the last bd s the lowest bd of the next round of bddng. Wthn the lmted rounds of bddng, the quotaton reaches the hghest quotaton of the bandwdth, When a bdder frst reached the mum quotaton, the aucton ended. As can be seen from Fgure 9, for dfferent aucton bandwdths, the ntal bddng prce s dfferent and the hghest bddng prce s also dfferent. The prce dfference of bddng for two adacent bddng rounds has nothng to do wth the bddng bandwdth, but both reach the hghest quotaton wthn the lmted bddng tmes. Therefore, when the hghest bd prce s obtaned for each round of quotatons, the total aucton proceeds reach the mum. References https://do.org/./matecconf/876. Song Qzhu. Research on arket Allocaton echansm of Rado Spectrum Resources [D]. Beng Unversty of Posts and Telecommuncatons,.. Odlyzko A. A odest Proposal for Preventng Internet Congeston[]. Center for Dscrete athematcs & Theoretcal Computer Scence, 997.. Semret, Lao R F, Campbell A T, et al. arket prcng of dfferentated Internet servces[c]// Seventh Internatonal Workshop on Qualty of Servce. IEEE, 999:84-9. 4. Dramtnos, Stamouls G D, Courcoubets C. An aucton mechansm for allocatng the bandwdth of networks to ther users[]. Elsever orth-holland, Inc. 7.. Tpsuwan Y, Kamonsantro S, Srsabye J, et al. An aucton-based dynamc bandwdth allocaton wth senstvty n a wreless networked control system[j]. Computers & Industral Engneerng, 9, 7():4-4. 6. Chan K P, Fu W C, Yu C. Haar Wavelets for Effcent Smlarty Search of Tme-Seres: Wth and Wthout Tme Warpng[J]. Knowledge & Data Engneerng IEEE Transactons on,, ():686-7. 7. Ln-Yuan L. Lnk Predcton on Complex etworks[j]. Journal of Unversty of Electronc Scence & Technology of Chna,, 9():6-66. 6 COCLUSIO In ths paper, we propose a regonal load balancng scheme based on dual WA routers from the perspectve of users and propose an aucton-based bandwdth allocaton strategy for the lnk congeston n the network and the uneven allocaton of bandwdth resources. Based on the dle state and lnk qualty of the clent routers n the logcal area, the bandwdth resources are auctoned and allocated dynamcally. The smulaton results show that the bandwdth allocaton strategy proposed n ths paper can effectvely ensure that the auctoneer can obtan greater benefts whle mprovng bdder QoS.