Optimal Partitioning of Data Bases across Multiple Servers in a LAN

Lawrence Berman and Raj Nigam
Additional contact information
Lawrence Berman: Merrill Lynch & Company, Incorporated, Management Science Group, PO Box 9065, Princeton, New Jersey 08543-9065
Raj Nigam: Merrill Lynch & Company, Incorporated, Management Science Group, PO Box 9065, Princeton, New Jersey 08543-9065

Interfaces, 1992, vol. 22, issue 2, 18-27

Abstract: In 1987, Merrill Lynch was planning to establish about 450 local area networks (LANs) at its retail branch offices. Attached to the LANs would be personal computers for over 10,000 retail brokers, data-base servers providing customer and product data, and communication servers for interacting with remote systems and downloading data to the local data bases. The firm had not resolved how many data-base servers would be needed. We partitioned the data bases across multiple servers on a single LAN and developed an analytical methodology to determine the minimum number of data-base servers needed. We showed that, at most, two servers were needed for any branch office.

Keywords: queues: applications; computers: data bases; industries: finance (search for similar items in EconPapers)
Date: 1992
References: Add references at CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://dx.doi.org/10.1287/inte.22.2.18 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:orinte:v:22:y:1992:i:2:p:18-27

Access Statistics for this article

More articles in Interfaces from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().