A location-allocation problem for a web services provider in a competitive market

Web Services have become a viable component technology in distributed e-commerce platforms. Due to the move to high-speed Internet communication and tremendous increases in computing power, network latency has begun to play a more important role in determining service response time. Hence, the locations of a Web Services provider's facilities, customer allocation, and the number of servers at each facility have a significant impact on its performance and customer satisfaction. In this paper we introduce a location-allocation model for a Web Services provider in a duopoly competitive market. Demands for services of these servers are available at each node of a network, and a subset of nodes is to be chosen to locate one or more servers in each. The objective is to maximize the provider's profit. The problem is formulated and analyzed. An exact solution approach is developed and the results of its efficiency are reported.

[1]  Yuval Shavitt,et al.  Constrained mirror placement on the Internet , 2002, IEEE J. Sel. Areas Commun..

[2]  Michael F. Schwartz,et al.  Locating nearby copies of replicated Internet servers , 1995, SIGCOMM '95.

[3]  Vladimir Marianov,et al.  Probabilistic, Maximal Covering Location—Allocation Models forCongested Systems , 1998 .

[4]  Jesper M. Johansson.  On the impact of network latency on distributed systems design , 2000, Inf. Technol. Manag..

[5]  Vladimir Marianov,et al.  PROBABILISTIC MAXIMAL COVERING LOCATION-ALLOCATION FOR CONGESTED SYSTEMS , 1998 .

[6]  J. J. Garcia-Luna-Aceves,et al.  Improving Internet multicast with routing labels , 1997, Proceedings 1997 International Conference on Network Protocols.

[7]  Zvi Drezner,et al.  Facility location - applications and theory , 2001 .

[8]  Arthur G. Ryman,et al.  Developing XML Web services with WebSphere Studio Application Developer , 2002, IBM Syst. J..

[9]  S. Hakimi.  On locating new facilities in a competitive environment , 1983 .

[10]  Oded Berman,et al.  Competitive facility location model with concave demand , 2007, Eur. J. Oper. Res..

[11]  Lili Qiu,et al.  On the placement of Web server replicas , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).

[12]  Bhaba R. Sarker,et al.  Discrete location theory , 1991 .

[13]  B. Huffaker,et al.  Distance Metrics in the Internet , 2002, Anais do 2002 International Telecommunications Symposium.

[14]  Yi Sun,et al.  A location model for web services intermediaries , 2003 .

[15]  Giacomo Piccinelli,et al.  Service provision and composition in virtual business communities , 1999, Proceedings of the 18th IEEE Symposium on Reliable Distributed Systems.

[16]  Yi Sun,et al.  A location model for a web service intermediary , 2006, Decis. Support Syst..

[17]  Anees Shaikh,et al.  On the effectiveness of DNS-based server selection , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).

[18]  Ellen W. Zegura,et al.  A novel server selection technique for improving the response time of a replicated service , 1998, Proceedings. IEEE INFOCOM '98, the Conference on Computer Communications. Seventeenth Annual Joint Conference of the IEEE Computer and Communications Societies. Gateway to the 21st Century (Cat. No.98.

[19]  H. Hotelling.  Stability in Competition , 1929 .

[20]  Oded Berman,et al.  Facility Location Problems with Stochastic Demands and Congestion , 2002 .

[21]  Z. Drezner.  Competitive location strategies for two facilities , 1982 .

[22]  Mark Crovella,et al.  Dynamic Server Selection using Bandwidth Probing in Wide-Area Networks , 1996 .