An Experimental Study of k-Splittable Scheduling for DNS-Based Traffic Allocation
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 maximum as well as the average latency of HTTP requests significantly. This improvement 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.
Unable to display preview. Download preview PDF.
- 1.Barford, P., Crovella, M.: Web Server Workload Characterization: The Search for Invariants. In: Proceedings of theACM Sigmetrics Conference on Measurement and Modeling of Computer Systems, pp. 126–137 (1996)Google Scholar
- 2.Crovella, M., Bestavros, A.: Self-Similarity inWorldWideWeb Traffic: Evidence and Possible Causes. IEEE/ACM Transactions on Networking (1996)Google Scholar
- 3.Feldmann, A., Gilbert, A., Huang, P., Willinger, W.: Dynamics of IP traffic: a study of the role of variability and the impact of control. In: Proceedings of SIGCOMM 1999 (1999)Google Scholar
- 4.Garey, M.R., Johnson, D.S.: Computers and intractability: a guide to the theory of NPcompleteness. Freeman, New York (1979)Google Scholar
- 6.Krysta, P., Sanders, P., Vöcking, B.: Scheduling and Traffic Allocation for Tasks with Bounded Splittability. In: Rovan, B., Vojtáš, P. (eds.) MFCS 2003. LNCS, vol. 2747, pp. 500–510. Springer, Heidelberg (2003) (to appear)Google Scholar
- 7.Kurose, J.F., Ross, K.W.: Computer Networking: a top-down approach featuring the Internet. Addison-Wesley, Reading (2001)Google Scholar
- 10.Scalable Simulation Framework Research Network (SSFNet), http://www.ssfnet.org/
- 11.Agarwal, A., Agarwal, T., Chopra, S., Feldmann, A., Kammenhuber, N., Krysta, P., Vöcking, B.: An Experimental Study of k-Splittable Scheduling for DNS-Based Traffic Allocation. Technical Report TUM-I0304, Technische Universität München (2003)Google Scholar