论文信息 - An Experimental Study of k-Splittable Scheduling for DNS-Based Traffic Allocation

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.

[1] Robert McNaughton,et al. Scheduling with Deadlines and Loss Functions , 1959 .

[2] Miss A.O. Penney. (b) , 1974, The New Yale Book of Quotations.

[3] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[4] M. Garey. Johnson: computers and intractability: a guide to the theory of np- completeness (freeman , 1979 .

[5] Christos H. Papadimitriou. Efficient Search for Rationals , 1979, Inf. Process. Lett..

[6] Martin F. Arlitt,et al. Web server workload characterization: the search for invariants , 1996, SIGMETRICS '96.

[7] Azer Bestavros,et al. Self-similarity in World Wide Web traffic: evidence and possible causes , 1997, TNET.

[8] Keith W. Ross,et al. Computer networking - a top-down approach featuring the internet , 2000 .

[9] Anja Feldmann,et al. Dynamics of IP traffic: a study of the role of variability and the impact of control , 1999, SIGCOMM '99.

[10] James H. Cowie. Scalable Simulation Framework API Reference Manual , 1999 .

[11] Hadas Shachnai,et al. Multiprocessor Scheduling with Machine Allotment and Parallelism Constraints , 2002, Algorithmica.

[12] Peter Sanders,et al. Scheduling and Traffic Allocation for Tasks with Bounded Splittability , 2003, MFCS.

[13] Kurt Mehlhorn,et al. Optimal search for rationals , 2003, Inf. Process. Lett..