By Topic

A load balance algorithm for WMS [Web Map Service]

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Pancheng Wang ; Dept. of Inf. Sci., CAS, Beijing, China ; Chongjun Yang ; Zhanfu Yu ; Yingchao Ren

Web Map Service (WMS) provides spatial information to Internet users by map images. Commonly, spatial data are stored as vector data. It is a long job to create map images from vector data. To reduce the time cost, we employ Linux cluster. When a map is requested, coordinates scope that is a rectangle defined with xmin, ymin, xmax, ymax must be specified. We design a load balance algorithm to divide the request rectangles into some sub-rectangles. Each sub-rectangle is sent to a WMS node to produce some sub-maps. The resulting map will be reconstructed by these sub-maps. All these sub-maps are produced in parallel, so less time is spent in producing an entire map. How to split request rectangles is the key problem. First, we present a method to calculate the 2D load weights distribution in the map scope. Second, nodes load abilities are evaluated. Then, the authors present a method for splitting the entire rectangles. This paper also discusses the performance of the algorithm.

Published in:

Geoscience and Remote Sensing Symposium, 2004. IGARSS '04. Proceedings. 2004 IEEE International  (Volume:5 )

Date of Conference:

20-24 Sept. 2004