Euro-PAR 2003, Klagenfurt, Austria An Experimental Study of k-Splittable Scheduling for DNS-Based Traffic Allocation Amit Agarwal ⋆ , Tarun Agarwal ⋆ , Sumit Chopra ⋆⋆ , Anja Feldmann ⋆⋆⋆ , Nils Kammenhuber ⋆⋆⋆ , Piotr Krysta † , and Berthold V ¨ ocking ‡ Topic 3: Scheduling and Load Balancing Abstract. The Internet domain name system (DNS) uses rotation of address lists to perform load distribution among replicated servers. We model this kind of load balancing mechanism in form of a set of request streams with different rates that should be mapped to a set of servers. Rotating a list of length k corresponds to breaking streams into k equally sized pieces. We compare this and other strategies of how to break the streams into a bounded number of pieces and how to map these pieces to the servers. One of the strategies that we study computes an optimal k-splittable allocation using a scheduling algorithm that breaks streams into at most k ≥ 2 pieces of possibly different size and maps these pieces to the servers in such a way that the maximum load over all servers is minimized. Our experimental study is done using the network simulator SSFNet. We study the average and maximum delay experienced by HTTP requests for various traffic allocation policies and traffic patterns. Our simulations show that splitting data streams can reduce the max- imum as well as the average latency of HTTP requests significantly. This im- provement can be observed even if streams are simply broken into k equally sized pieces that are mapped randomly to the servers. Using allocations computed by machine scheduling algorithms, we observe further significant improvements. 1 Introduction The Internet’s Domain Name System (DNS) is responsible for resolving host names like “www.tum.de” into IP addresses. This service is also being used to perform load distribution among distributed Web servers. Busy sites are repli- cated over multiple servers, with each server running on a different end sys- tem having its own IP address. Thus a set of IP addresses is associated with one canonical hostname contained in the DNS database. When clients make a DNS query for such a host name, the server returns the entire set of addresses, ⋆ IIT Delhi, India. This work was done while the author was visiting the MPI in Saarbr ¨ ucken. ⋆⋆ Department of Computer Science, Hansraj College, University of Delhi, India. This work was done while this author was visiting the MPI in Saarbr ¨ ucken. ⋆⋆⋆ Department of Computer Science, Technische Universit¨ at M ¨ unchen, Germany. † Max-Planck-Institut f ¨ ur Informatik, Saarbr ¨ ucken, Germany. ‡ Department of Computer Science, Universit¨ at Dortmund, Germany.