Full metadata record
DC FieldValueLanguage
dc.contributor.authorYang, Chih-Chiangen_US
dc.contributor.authorChen, Chienen_US
dc.contributor.authorChen, Jing-Yingen_US
dc.date.accessioned2014-12-08T15:20:23Z-
dc.date.available2014-12-08T15:20:23Z-
dc.date.issued2009en_US
dc.identifier.isbn978-1-4244-5403-7en_US
dc.identifier.urihttp://hdl.handle.net/11536/14501-
dc.identifier.urihttp://dx.doi.org/10.1109/I-SPAN.2009.44en_US
dc.description.abstractModern Web-server systems use multiple servers to handle an increased user demand. Such systems need effective methods to spread the load among web servers evenly in order to keep web server utilization high while providing sufficient quality of service for end users. In conventional DNS-based load balancing architecture, a Doman Name Server (DNS) dispatches requests to web servers based on their load status. Because web servers need to inform the DNS server about their load status from time to time, a so-called load buffer range is often employed to reduce the update frequency. Without care, however, using a load buffer range may result in load oscillation among web servers. To address this problem, we propose a Random Early Detection (RED) method with the intuition that the probability for a web server to become overloaded in near future is directly proportional to its current load. Simulation confirms that our method helps reducing the oscillation of the web server load significantly.en_US
dc.language.isoen_USen_US
dc.subjectDNS-baseden_US
dc.subjectload buffer rangeen_US
dc.subjectREDen_US
dc.titleRandom Early Detection Web Servers for Dynamic Load Balancingen_US
dc.typeArticleen_US
dc.identifier.doi10.1109/I-SPAN.2009.44en_US
dc.identifier.journal2009 10TH INTERNATIONAL SYMPOSIUM ON PERVASIVE SYSTEMS, ALGORITHMS, AND NETWORKS (ISPAN 2009)en_US
dc.citation.spage364en_US
dc.citation.epage368en_US
dc.contributor.department資訊工程學系zh_TW
dc.contributor.departmentDepartment of Computer Scienceen_US
dc.identifier.wosnumberWOS:000291013200062-
Appears in Collections:Conferences Paper


Files in This Item:

  1. 000291013200062.pdf

If it is a zip file, please download the file and unzip it, then open index.html in a browser to view the full text content.