Optimal Processing Policies for an e-Commerce Web Server

References

• Abdelmessih N., Silverstein M., Stanger P. The next chapter in business-to-consumer e-commerce: Advantage incumbent. (2001) . Report, The Boston Consulting Group, Boston, MAGoogle Scholar
• Aiello W. A., Mansour Y., Rajagopolan S., Rosen A. Competitive queue policies for differentiated services. Proc. IEEE INFOCOM (2000) 2:431–440Google Scholar
• Ancker C. J., Gafarian A. V. Queuing with impatient customers who leave at random. J. Indust. Engrg. (1962) 13:84–90Google Scholar
• Ancker C. J., Gafarian A. V. Some queuing problems with balking and reneging—I. Oper. Res. (1963a) 11:88–100Link, Google Scholar
• Ancker C. J., Gafarian A. V. Some queuing problems with balking and reneging—II. Oper. Res. (1963b) 11:928–937Link, Google Scholar
• Apostolopoulos N.Professional Site Server 3.0 (1999) (Wrox Press, Birmingham, UK) Google Scholar
• Barrer D. Y. Queuing with impatient customers and indifferent clerks. Oper. Res. (1957a) 5:644–649Link, Google Scholar
• Barrer D. Y. Queuing with impatient customers and ordered service. Oper. Res. (1957b) 5:650–656Link, Google Scholar
• Burman D. Insensitivity in queueing systems. Adv. Appl. Probab. (1981) 13:846–859Crossref, Google Scholar
• Computer Industry Almanac Inc. Internet users will top 1 billion in 2005. (2002) . Press release, March 21. http://www.c-i-a.com/pr032102.htmGoogle Scholar
• Dreyfus S. E., Law A. M.The Art and Theory of Dynamic Programming (1977) (Academic Press, New York) Google Scholar
• Green H. The great yuletide shakeout. Bus. Week (1999) November 1):18–28Google Scholar
• Gupta A., Stahl D. O., Whinston A. B. An economic approach to network computing with priority classes. J. Organ. Comput. Electr. Commerce (1996) 6:71–95Crossref, Google Scholar
• Kleinrock L. Analysis of a time-shared processor. Naval Res. Logist. Quart. (1964) 11:59–73Crossref, Google Scholar
• Kleinrock L. Time-shared systems: A theoretical treatment. J. Association Comput. Machinery (1967) 14:242–261Crossref, Google Scholar
• Kleinrock L.Queueing Systems: Volume 2, Computer Applications (1976) (Wiley, New York) Google Scholar
• Luss H. Operations research and capacity expansion problems: A survey. Oper. Res. (1982) 30:907–947Link, Google Scholar
• Marchand M. G. Priority pricing. Management Sci. (1974) 20:1131–Link, Google Scholar
• Mardesich J. The web is no shopper's paradise. Fortune (1999) 149:188–198Google Scholar
• Moe W. W., Fader P. S. Capturing evolving visit behavior in clickstream data. J. Interactive Marketing (2001) . ForthcomingGoogle Scholar
• Nair S., Hopp W. J. A model for equipment replacement due to technological obsolescence. Eur. J. Oper. Res. (1992) 63:207–221Crossref, Google Scholar
• O'Donovan T. M. Direct solutions of M/G/1 processor-sharing models. Oper. Res. (1974) 22:1232–1235Link, Google Scholar
• Rajagopalan S. Capacity expansion and equipment replacement: A unified approach. Oper. Res. (1998) 46:846–857Link, Google Scholar
• Rao M. R. Optimal capacity expansion with inventory. Oper. Res. (1976) 24:291–300Link, Google Scholar
• Rao S. S. Queuing with balking and reneging in M/G/1 systems. Metrika (1968) 12:173–188Google Scholar
• Sakata M., Noguchi S., Oizumi J. An analysis of the M/G/1 queue under round-robin scheduling. Oper. Res. (1971) 19:371–385Link, Google Scholar
• Stallings W.Operating Systems: Internals and Design Principles (1997) (Prentice Hall, Upper Saddle River, New Jersey) Google Scholar
• Stanford R. Reneging phenomena in single channel queues. Math. Oper. Res. (1979) 4:162–178Link, Google Scholar
• Tan Y. Value-based design of electronic commerce servers. (2000) . Doctoral dissertation, Department of Management Science, University of Washington, Seattle, WAGoogle Scholar
• Turner J. S. New directions in communications. IEEE Comm. Magazine (1986) 24:8–15Crossref, Google Scholar
• Whitt W. Improving service by informing customers about anticipated delays. Management Sci. (1999) 45:192–207Link, Google Scholar