Font Size: a A A

Research On Algorithm Of Multi-path Load Balance

Posted on:2008-08-11Degree:MasterType:Thesis
Country:ChinaCandidate:Y K WangFull Text:PDF
GTID:2178360242958804Subject:Computer application technology
Abstract/Summary:PDF Full Text Request
With the development of Internet applications and the increasing demands, diversity and complexity are shown on Internet, while the issue of network congestion and unbalanced distribution of traffic becomes big trouble. The backbone of Internet is fast, while the unbalance of the stub AS area and the backbone is still starving for solution.The topology of multi-ISP uplinks on the AS boundary is the network structure in this paper. A solution of network load balance is proposed based on multi-objective optimal theory. A scheme named MLOS (Multi-Link Optimal Select) based on multiple constraints of packet switch network is proposed to balance the traffic of multi-uplinks. By linear mapping tiny subsets of route space to network links, we got the quantization formulation of split scheduling algorithm according to non-cooperative route scheduling strategy at single controlling node. The cyclic bidding algorithm was designed to optimize the time-weighed property, which copy the single solution to parallel controlling nodes and parallelizes the computation of IP header recomposing. It also be provided that the approximate method of computing the extended granularity of the controlling nodes.Simulation and comparative experiments shows, the MLOS algorithm is suitable for the traffic flow optimization under different traffic-loads in a multi-links scenario, and the split scheduling algorithm solve the load balancing issue effectively.
Keywords/Search Tags:load balancing, comminuting scheduling, multi- constraints, optimal path
PDF Full Text Request
Related items