direkt zum Inhalt springen

direkt zum Hauptnavigationsmenü

Sie sind hier

TU Berlin

Page Content

Publications by Type: Conference and Workshop Publications

see also conference papers, workshop papers, demos, and posters. (under construction)

An Experimental Study of k-Splittable Scheduling for DNS-Based Traffic Allocation.
Citation key AACFKKV-ESkSDTA-03
Author Agarwal, Amit and Agarwal, Tarun and Chopra, Sumit and Feldmann, Anja and Kammenhuber, Nils and Krysta, Piotr and Vöcking, Berthold
Title of Book Euro-Par 2003. Parallel Processing, 9th International Euro-Par Conference, Klagenfurt, Austria, August 26-29, 2003. Proceedings
Pages 230–235
Year 2003
ISBN 3-540-40788-X
Location Klagenfurt, Austria
Volume 2790
Publisher Springer
Series Lecture Notes in Computer Science
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 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.
Link to publication Download Bibtex entry

Zusatzinformationen / Extras

Quick Access:

Schnellnavigation zur Seite über Nummerneingabe

Under Construction

This page/section is
still under construc-
tion. Please try again
later.