基于哈希模式的負(fù)載均衡性能研究計(jì)算機(jī)畢業(yè)論文外文翻譯

1、安徽建筑大學(xué)畢業(yè)設(shè)計(jì)外文翻譯專(zhuān) 業(yè) 網(wǎng)絡(luò)工程 班 級(jí) 學(xué)生姓名 xx 學(xué) 號(hào) xx 指導(dǎo)教師 performance of hashing-based schemes for internet load balancingzhiruo cao ,zheng wang ,ellen zeguracollege of computing georgia institute of technology atlanta, ga 30332-0280bell labs lucent technologies holmdel , nj 07733abstractload balancing is a ke

2、y technique for improving internet performance. effective use of load balancing requires good traffic distribution schemes. we study the performance of several hashing schemes for distributing traffic over multiple links while preserving the order of packets within a ow. although hashing-based load

3、balancing schemes have been proposed in the past, this is the first comprehensive study of their performance using real traffic traces.we evaluate five direct hashing methods and one table-based hashing method. we find that hashing using a 16-bit crc over the five tuple gives excellent load balancin

4、g performance. further, load-adaptive table-based hashing using the exclusive or of the source and destination ip addresses achieves comparable performance to the 16-bit crc. table-based hashing can also distribute traffic load according to unequal weights. we also report on four other schemes with

5、poor to moderate performance.keywordsload sharing, hashing.i. introductionload balancing (also known as load sharing) is a key technique for improving the performance and scalability of the internet. for example, many large enterprise networks are connected to multiple internet service providers (is

6、ps) to achieve redundant connectivity and to distribute traffic loading. inside the internet, the backbones are often engineered to have multiple parallel trunks between major points of presence to ensure high availability. typically, these parallel trunks are congured as equal-cost paths and allow

7、load balancing over them.the parallel trunks may become even more ubiquitous when the promising dense wavelength division multiplexing (dwdm) technology is deployed in the future internet back-bone. dwdm expands the capacity of communication trunks by allowing a greater number of channels to be carr

8、ied on a single optical fiber. with potentially tens or even hundreds of dwdm channels between major points, load balancing is essential in best utilizing the multiple parallel channels.parallel architectures have been used for packet processing for coping with exponential growth in internet traffic

9、, instead of one processing engine, packets are dispatched to multiple parallel engines inside a router to increase the overall processing throughput. the same technique is also used in scaling web servers. popular web servers often operate a farm of machines and the routers connected to them split

10、the http requests to different machines.for all of these examples, effective use of load balancing requires good schemes for splitting traffic over multiple links. in addition, since the majority of the traffic on the internet is tcp-based 1, traffic splitting schemes need to avoid packet misorderin

11、g within a tcp ow, which can falsely trigger congestion control mechanisms and cause unnecessary throughput degradation 2, 3.in this paper, we propose and evaluate a class of hashing based traffic splitting algorithms which preserve per-ow packet ordering. we consider five hash functions that are “d

12、irect,”meaning that the hash function produces a value in the range of 0.n-1, where n is the number of outgoing links. we also consider a table-based generalization that involves hashing to m bins, then assigning the m bins to the n outgoing links. table based hashing requires more state than direct

13、 hashing, but has the flexibility to support unequal load distribution and dynamic adaptation.our results are obtained by simulating the performance of a trafc splitter, using packet traces taken from two trunks of a major internet backbone provider. we nd that direct hashing with the destination ip

14、 address causes signicant imbalance across two links. using the internet checksum or the exclusive or of both the source ip address and destination ip address improves the performance considerably, though moderate imbalance persists. the more computationally complex 16-bit crc of the ve-tuple (sourc

15、e address, destination address, source port,destination port and protocol id) gives excellent load balancing performance, keeping the load and queue lengths very similar on two links. equally good load balancing can be achieved using table-based hashing with adaptation, which requires less computati

16、on than the crc but necessitates monitoring the link loads and storing (and adjusting) the mapping from table bins to links.table-based hashing has the additional advantage that it can distribute the load according to unequal weights. further, an index-based version of this scheme can alter the weig

17、ht distribution with minimal disruption to existing ows . our results conrm that the index-based hashing can accurately achieve a weighted distribution when adaptation is also used.the rest of this paper is organized as follows. in section ii we discuss related work in trafc splitting and load balan

18、cing. section iii describes the behavior of an ideal trafc splitter, explains the requirements for a practical system, and denes the performance metrics that will be used to assess various hashing-based schemes. the set of schemes that we consider are described in section iv. the results of our stud

19、y are described in section v, and include analysis of the randomness inherent in the trace data (section v-a). we conclude and mention areas for future work in section vi.ii. related workload balancing has been used in telecommunication networks in the form of inverse multiplexing 4. inverse multipl

20、exing allows service providers to offer wideband channels by combining multiple narrowband 56 kbps and 64 kbps trunks 5. the load balancing in inverse multiplexing is typically based on round robin distribution of packets or bytes 6, 7.our work differs from inverse multiplexing in two important dime

21、nsions. first, inverse multiplexing is designed for use over point-to-point links; its techniques are not typically applicable for network layer load balancing. internet load balancing, however, makes use of the natural redundancy in the network topology. the paths for load balancing, for example, e

22、qual-cost multi-paths, are discovered dynamically by routing protocols, such as ospf 8, rather than through configuration. second, in order to maintain synchronization and per-flow fifo packet ordering in inverse multiplexing, it is necessary to add extra packet headers with sequence numbers or to k

23、eep state at both ends of the channel. but, implementing these additional mechanisms for network load balancing requires a new network protocol. in comparison, the hashing-based schemes can maintain per-flow packet ordering and can be implemented without requiring any additional protocol support.has

24、hing has been widely used in indexing and searching 9.in the networking context, hashing-based algorithms for address lookup 10, ow identication 11 and packet demultiplexing 12 have been proposed in the past. the use of hashing for network load balancing is not new. some commercial router products h

25、ave implemented simple hashing over the ip destination address to distribute trafc 13. in the ospf optimized multipath protocol (ospf-omp) 14, a number of possible approaches for load balancing over multiple paths are mentioned , including per-packet round robin, dividing destination prexes among av

26、ailable next hops in the forwarding table, and dividing trafc according to a hash function applied to the source and destination pair. however, the proposed schemes are not evaluated with simulation or real network measurement. in the study of load balancing with ospf-omp, perfect hashing is assumed

27、15. a trafc splitting scheme using random numbers is proposed in 16. it applies the name-based mappings approach to load balancing 17. in this scheme, each next-hop is assigned with a weight based on a simple pseudo-random number function seeded with the ow identier and the next-hop identier. when a

28、 packet arrives, the weights are generated, and the next-hop receiving the highest weight is used for forwarding. the scheme is approximately times as expensive as a hashing-based scheme, where is the number of outgoing links. again, no performance study on the proposed scheme is presented.it is cle

29、ar that although hashing-based schemes for trafc splitting have been proposed in the past, and some simple schemes have even been implemented in commercial products, the performance of such schemes has not been adequately evaluated .this paper presents the rst comprehensive performance study on a wi

30、de range of hashing-based schemes, using real packet traces from backbone networks.iii. frameworkin this section, we describe the behavior of an ideal trafc splitter, explain the requirements for a practical system, and dene the performance metrics for assessing various schemes.a. reference modela l

31、oad balancing system typically comprises a trafc splitter and multiple outgoing links as shown in figure 1. in such a system, the trafc splitter receives an incoming packet from a higher-speed link and forwards it to one of the lower-speed outgoing links. a good load balancing system should be able

32、to split the trafc to the multiple outgoing links evenly or by some pre-dened proportion. in 7, it has been observed that there is a close relationship between fair queuing and load balancing. we now extend their observation to a mathematical model to obtain the constraints for ideal trafc splitting

33、.let us rst look at an ideal uid model where the trafc isinnitely divisible. suppose that there are out going links in the load balancing system, and the capacity of link i is ui . let si(t,t) be the amount of trafc forwarded to link i during the periodt,t. the ideal load balancing system should per

34、form as well as the corresponding system with a single outgoing link of capacity ui . therefore, the ideal system should satisfy the following for any period t,t:the trafc load is essentially split in proportion to the rates of the outgoing links. at any time instance, the trafc load is perfectly ba

35、lanced; all outgoing links are busy or idle at the same time. such a system is work-conserving; there is no bandwidth lost because of load balancing. by work-conserving, we mean no one outgoing link is idle while there is data waiting to be forwarded. ideal load balancing is obviously impractical in

36、 a real network system. as the basic unit of forwarding is at least a single approximately times as expensive as a hashing-based scheme packet, a packetized load balancing system is no longer work where is the number of outgoing links. again , no performance conserving. for example, suppose that a l

37、oad balancing systems has two outgoing links of the same capacity. assume that the system is initially idle, then a single packet arrives. the packet is forwarded to one of the two outgoing link. note that the packet is serviced with half of the total bandwidth available, thus it will take twice the

38、 amount of time to transmit compared with an ideal system. during this period, one of two outgoing links is busy servicing the packet while the other link remains idle. in a practical system, the trafc splitter may send several packets in a row to the same outgoing link, and thus increase the loss o

39、f bandwidth.in a packetized system, consider the worst case that all out going links have been idle since time t when a packet of maximum size pmax arrives and no more packets are coming until the packet is served. assume the packet is forwarded onto link i. during the service period, equation 1 no

40、longer holds because, where c is a fraction of the packet that has been serviced during the period. therefore, in a packetized system, the ideal load balancing should satisfy the following:over any interval t,t , where pmax is the maximum size of packet. that is, the difference between the time link

41、 i is busy and the time link j is busy should be no more than the time to send a largest packet over the slower link.b. requirementsthere are a number of basic requirements that trafc splitting schemes should meet for internet load balancing:low overhead . trafc splitting is executed for every packe

42、t in the packet forwarding path, thus the per-packet overhead it introduces is a major concern. trafc splitting algorithms should be very simple and preferably keep no or little state.high efciency. poor trafc distribution will result in uneven link utilization and loss of bandwidth. a trafc splitte

43、r should try to distribute trafc as close as possible to the reference model.high efciency. poor trafc distribution will result in uneven link utilization and loss of bandwidth. a trafc splitter should try to distribute trafc as close as possible to the reference model.per-flow ordering. packet mis-

44、ordering within a tcp ow can produce false congestion signals and cause unnecessary throughput degradation 2, 3. it is therefore an essential requirement that the traffic splitting algorithms maintain per-flow packet ordering. this has to be achieved without requiring a new protocol layer.let us now

45、 apply the above requirements to some of the possible traffic splitting approaches. take packet-by-packet round robin or some form of fair queuing for example. the overheads are low and the performance is typically close to optimal. however, per-ow ordering cannot be guaranteed unless additional mec

46、hanisms, such as sequence numbers or state keeping, are added. such additional mechanisms would increase the overhead drastically, and in many cases, only work over point-to-point links.hashing-based trafc splitting algorithms are stateless and fairly easy to compute, particularly with hardware assi

47、stance. what is more, if the hash functions use any combination of the ve-tuple as input, per-flow ordering can be preserved 1. as we will show later in this paper, many of the hashing-based schemes perform well. overall, hashing-based schemes meet the above requirements and offer the best tradeoff.

48、this is true because all packets within the same tcp ow have the same ve-tuple, thus the output of the hash function with the ve-tuple as input should always be the same.c. performance metricswe now discuss the basic performance metrics for evaluating trafc splitting algorithms for internet load bal

49、ancing.load distribution. from the perspective of load balancing, the most important performance metric is the distribution of bytes over time among the multiple outgoing links. as we have discussed at the beginning of this section, in an ideal system, the traffic load should be distributed in propo

50、rtion to the rates of the outgoing links.queue length. in any practical system, the load distribution curve usually fluctuate over the time. this fluctuation of load is absolved through buffering, thus the queue length of outgoing links reflects the cumulative effects of load balancing. in our analy

51、sis, the queue length is used as another performance metric. the queue length metric takes into account the fact that load distribution discrepancy during a lightly loaded period has far less real effect than a heavily loaded period .a good traffic splitting algorithm may not necessarily have perfec

52、t load distribution at all time instances, but it should be able to keep the queues small and balanced.non-work-conserving idle time. as we have discussed earlier, a packetized load balancing system is non-work- conserving. we dene the non-work-conserving idle time as the length of the period when a

53、t least one link is idle while others are busy. the idle time metric captures the non-work-conserving inclination of the system: the larger the idle time metric is, the farther away the system skews from work-conserving, and hence the less efficient the load balancing is.iv. hashing-based approaches

54、in this section, we describe the hashing-based schemes for load balancing that we will evaluate in the next section.a. direct hashingdirect hashing is a simple form of traffic splitting. with direct hashing, the traffic splitter applies a hash function to a set of fieds of the ve-tuple, and uses the

55、 hash value to select the outgoing link. it is very simple to implement and requires no extra state to be maintained. in this paper, we consider the following five direct hashing schemes.a.1 hashing of destination addressthe simplest scheme is to hash the ip destination address modulo the number of

56、outgoing links n. it can be expressed as:in this scheme, if n=2k , we effectively use the last k bits of the destination address as an index of the outgoing link. this hash function has been implemented by router vendors.a.2 hashing using xor folding of destination addressxor folding has been used i

57、n many hash functions, and has been shown to provide good performance in other applications 10. we propose a hash function with xor folding of the destination ip address. this hash function can be expressed as:where is di the ith octet of the destination ip address .this approach utilizes more bits

58、of the destination address in selecting the link.a.3 hashing using xor folding of source and destination addressesa simple modification to the previous hash function is to include the source address in the computation, i.e., xor folding with both the destination ip address and the source ip address .this hash function can be expressed as:where si and are the ith octets of the source and destination ip addresses respectively.a.4 internet checksumthe internet checks