Special Issue on Telecommunications Systems: Modeling, Analysis and Design || Back Matter

Back MatterSource: Operations Research, Vol. 43, No. 1, Special Issue on Telecommunications Systems:Modeling, Analysis and Design (Jan. - Feb., 1995), pp. 191-194Published by: INFORMSStable URL: http://www.jstor.org/stable/171772 .

Accessed: 09/05/2014 17:43

Your use of the JSTOR archive indicates your acceptance of the Terms & Conditions of Use, available at .http://www.jstor.org/page/info/about/policies/terms.jsp

.JSTOR is a not-for-profit service that helps scholars, researchers, and students discover, use, and build upon a wide range ofcontent in a trusted digital archive. We use information technology and tools to increase productivity and facilitate new formsof scholarship. For more information about JSTOR, please contact [email protected].

.

INFORMS is collaborating with JSTOR to digitize, preserve and extend access to Operations Research.

http://www.jstor.org

This content downloaded from 169.229.32.138 on Fri, 9 May 2014 17:43:09 PMAll use subject to JSTOR Terms and Conditions

http://www.jstor.org/action/showPublisher?publisherCode=informs

http://www.jstor.org/stable/171772?origin=JSTOR-pdf

http://www.jstor.org/page/info/about/policies/terms.jsp


S I

Narenda Agrawal, see Morris A. Cohen.

Vipul Agrawal, see Morris A. Cohen.

Anant Balakrishnan, whose research interests include modeling and solving large-scale discrete optimization problems in telecommunications and manufacturing, is Associate Professor of Management Science at MlT's Sloan School of Management. He has co-authored several papers on algorithms and the analysis of various network design problems. He is Area Editor for the ORSA Journal on Computing and serves on the editorial board of Telecommunication Systems.

Cheng-Shang Chang received his Ph.D. degree in Electri- cal Engineering from Columbia University in 1989. From 1989 to 1993 he was employed as a Research Staff Mem- ber at the IBM T. J. Watson Research Center, Yorktown Heights, N.Y. In 1993, he joined the Department of Elec- trical Engineering at National Tsing Hua University, Taiwan as an associate professor. His current interests are queueing theory, stochastic scheduling, and performance evaluation of telecommunication networks and parallel processing systems. This work was done while he was with IBM.

Suk-Gwon Chang is Professor of Information Systems/ Operations Research in the Department of Business Ad- ministration at Hanyang University, Korea. His research interests are in mathematical modeling and optimization, communication network planning and design, and performance evaluation of communication networks.

Morris A. Cohen is the Matsushita Professor of Manufac- turing and Logistics at The Wharton School of the Uni- versity of Pennsylvania, as well as Chairperson of the Operations and Information Management Department. He is also Co-Director of the Manufacturing and Logis- tics Research Center at Wharton. Narendra Agrawal is Assistant Professor at the Leavey School of Business and Administration of Santa Clara University, Vipul Agrawal is Assistant Professor at the Stern School of Business of New York University, and Ananth Raman is Assistant Professor at the Graduate School of Business Administration of Harvard University. The paper in this issue is the result of an industry study of channel choice for industrial paper and plastics distribution and was undertaken when all the authors were at The Wharton School.

Bezalel Gavish is Professor of Computers and Informa- tion Systems at the Owen Graduate School of Manage- ment at Vanderbilt University. He is editor of Telecommunication Systems Journal, telecommunications area editor for this journal, and is the editor for this

special issue of Operations Research. His research interests span the design and analysis of computer communication networks and distributed computing systems, combinatorial optimization, and scheduling and routing in manufacturing and logistic systems. His research in telecommunications focuses on topological design of wide area networks, fiber deployment, design and analysis of local access networis, capacity assignment and routing in backbone networks, configuring cellular phone systems, analysis of low earth orbit satellite systems, economic and organizational impact of telecommunications. He is a past president of the ORSA special interest group on telecommunications.

Luis Gouveia is Assistant Professor in the Department of Statistics and Operations Research at the University of Lisbon. He has a Ph.D. in Operations Research from the University of Lisbon. His research includes models and techniques for tree-like network design problems related to telecommunications.

Arie Harel is Assistant Professor of Management Science and Computer Information Systems at the School of Management, Rutgers University, Newark, New Jersey. He holds B.Sc. and M.Sc. degrees from Ben-Gurion Uni- versity, and a M. Phil. and a Ph.D. from the Graduate School of Business at Columbia University. His research interests are modeling and analysis of stochastic produc- tion systems and queueing systems.

Stanley R. Hayes is a Principal with ENVIRON Corpora- tion, directing the Air Sciences practice in the western U.S. His particular interests include exposure assessment, air quality modeling, and policy and regulatory compliance analysis.

Man-Tung T. Hsiao is Senior Designer in the Nonstop Networking Division at Tandem Computers, Inc., Cupertino, California. He was Assistant Professor of Electrical Engineering at Purdue University. His interests are high-speed network protocols and software, distributed multimedia communication networks, broadband ISBN, AIM, fault tolerant and highly available networks, parallel computer architecture, and wire- less communications networks.

R. L. Karandikar is Professor at the Indian Statistical Institute, New Delhi and is active in the field of stochastic differential equations. V. G. Kulkarni is Professor in the Department of Operations Research at the University of North Carolina, and has research interests in the application of stochastic processes to problems in telecommunications. The work reported here was stimulated by the second author's year-long visit to IBM, RTP, and

191



192 / Contributors

was completed when the first author was visiting the Center for Stochastic Processes at UNC.

V. G. Kulkarni, see R. L. Karandikar.

Ming-Jeng Lee is Advisory Programmer in Networking Systems Architecture at IBM, Research Triangle Park, N.C. His current interests are high-speed networks, network planning, and network management. He likes to solve network planning problems with optimization techniques.

B. N. W. Ma is with the Department of Electrical and Computer Engineering, Ryerson Polytechnic University, Toronto, where he is currently an associate professor. His research focuses on broadband communication networks, with a particular interest in performance analysis.

Thomas Magnanti serves as the George Eastman Professor of Management Science and co-director of the Operations Research Center at MIT. He is a former Pres- ident of ORSA and Editor of Operations Research, and is a member of the National Academy of Engineering. He is a joint recipient of the 1993 Lanchester Prize, and the 1994 Kimball Medal for Distinguished Service to ORSA. Both of his co-authored papers in this issue are an outgrowth of a collaboration with GTE Laboratories.

J. W. Mark is with the Department of Electrical and Computer Engineering at the University of Waterloo, where he is a professor. His research interests are in broadband communications, including network design and analysis, network routing and control, ATM network traffic management, and image and video coding. He is a Fellow of IEEE and is currently serving as a member of the Inter-Society Steering Committee of the IEEE/ACM Transactions on Networking.

Prakash Mirchandani is Assistant Professor of Business Administration at the Katz Graduate School of Business of the University of Pittsburgh. His interests include polyhedral combinatorics and heuristic analysis for discrete optimization problems. This paper grew out of Mirchandani's doctoral dissertation, and forms part of a series of papers on capacitated network design by the same authors.

Diana Pallant is a lecturer in the Department of Statistics at the University of Melbourne. The work for the paper in the current issue was undertaken while she was a research associate at the Teletraffic Research Centre at the University of Adelaide. Apart from her interests in the performance analysis of telecommunications networks, she has worked in several areas of stochastic modeling, including mathematical biology.

Aranth Raman, see Morris A. Cohen.

Harvey M. Richmond manages the exposure and health risk assessment program for criteria air pollultants, such

as ozone, in the Office of Air Quality Planning and Standards at the U.S. Environmental Protection Agency. His interests include the development and application of human exposure and health risk analysis models to aid national decisions on selecting the appropriate level for national ambient air quality standards.

Arlene S. Rosenbaum is Senior Scientist at Systems Applications International in San Rafael, Calif., an environmental consulting firm specializing in air quality analysis. Her general interests are the evaluation of external damages associated with air pollution and the use of optimization methods in designing emission control strategies.

Donald E. Smith is a Member of Technical Staff at Bellcore. He has worked on the development and application of queueing theory to problems in performance modeling. The subject areas of his work include operator services, overload control in common channel signaling, and AIM.

Alan Stulman is Associate Professor at St. John's University. He received a B.S. in mathematics from Brooklyn College and a Ph.D. in operations research and applied statistics from New York University. His research includes applied statistics and stochastic modeling.

Peter Taylor is a senior lecturer in the Department of Applied Mathematics at the University of Adelaide, and is Deputy Director of the Teletraffic Research Centre. His research interests cover most aspects of the analysis of stochastic processes, particularly stochastic networks.

Kent H. Tseng is Research Associate in the Broadband Networking Group at the Institute of Systems Science, Singapore. He received his Ph.D. in Electrical Engineer- ing from Purdue University in 1991. His current research is real-time multimedia protocols, multimedia systems, and traffic management in broadband networks.

Rita Vachani is the Manager of the Network Planning Department at GTE Laboratories Incorporated. She is actively involved in developing network planning systems for use by GTE business units. Optimization algorithms typically form an integral part of these decision support systems. Her research includes polyhedral combinatorics and capacitated network design problems.

Thomas S. Wallsten is Professor of Psychology and Director of the Cognitive Psychology Program at the University of North Carolina. His research interests include judgment, decision making, and risk assessment, with special foci on the nature, determinants, and communication of uncertainty associated with a lack of knowledge.

Rlonald G. Whitfield is Manager of the Decision and Risk Analysis Section at Argonne National Laboratory. His



Contributors / 193

work is directed at developing tools and procedures that aid governmental decision making.

Robert L. Winkler is James D. Duke Professor and Senior Associate Dean for Faculty and Research in the Fuqua School of Business, and Professor in the Institute of Statistics and Decision Sciences, at Duke University. His research centers on decision analysis, risk assessment, Bayesian inference, probability elicitation and evaluation, combining forecasts, and dependence assessment.

Richard T. Wong is a Member of the Technical Staff in the Operations Research Department at AT&T Bell Laboratories in Holmdel, New Jersey. His current pro- fessional interests are telecommunications network design and planning. He has published a number of papers related to network design, routing, and scheduling.

James R. Yee is Associate Professor in the Department of Electrical Engineering at the University of Hawaii. Dr. Yee is interested in communication network design problems, optimization, and stochastic processes.



The editor would like to acknowledge the contribution made by the referees listed below; without their help this special issue would not have been possible.

K. Altinkemer, Purdue University G. Anandalingam, University of Pennsylvania A. Amniri, Ohio State University R. Batta, State University of New York at Buffalo A. Baveja, State University of New York at Buffalo D. Bienstock, Columbia University 0. Boxma, C. W. I., Amsterdam, The Netherlands J. Bramel, Columbia University S. Browne, Columbia University J.-F. Chang, National Taiwan University K. C. Chang, I.B.M. T. J. Watson Research Center,

Yorktown Heights, New York X. Chao, New Jersey Institute of Technology E. G. Coffman, AT&T Bell Laboratories, Murray Hill,

New Jersey G. Dahl, University of Oslo, Norway A. Desai, Ohio State University M. Eisenberg, AT&T Bell Laboratories, Murray Hill,

New Jersey E. Erkut, University of Alberta, Canada D. Everitt, University of Melbourne, Australia M. Feinberg, GTE Laboratories, Waltham, Mass. M. Fisher, University of Pennsylvania J. Gerdes, Vanderbilt University S. A. Grandhi, Rutgers University B. Greenberg, University of Texas at Austin L. Hall, Johns Hopkins University F. Harche, New York University A. Harel, Rutgers University R. Harris, Royal Melbourne Institute of Technology,

Australia G. Hart, Columbia University M. I. Henig, Tel-Aviv University, Israel M. G. Hluchyj, Codex Corporation J. Y. Hui, Rutgers University 0. Ibe, GTE Laboratories, Waltham, Mass. S. K. Jacobson, Technical University of Denmark S.-R. Kai, GTE Laboratories, Waltham, Mass. H. Kanakia, AT&T Bell Laboratories, Murray Hill,

New Jersey 0. Kella, Hebrew University of Jerusalem, Israel I. Khan, University of Southern California S. Kheradpir, GTE Laboratories, Waltham, Mass. C.-K. Kim, Bell Communications Research, Morristown,

New Jersey L. LeBlanc, Vanderbilt University T. L. Lee, Bell Communications Research, Morristown,

New Jersey Y. Lee, U.S. West Advanced Technologies, Boulder,

Colorado J. K. Lenstra, Eindhoven University of Technology,

The Netherlands

J. Leung, University of Arizona H. Levy, Tel-Aviv University, Israel C.-L. Li, Washington University V. 0. K. Li, University of Southern California S. C. Liew, Bell Communications Research, Morristown,

New Jersey J. Lim, Hewlett-Packard D. F. Lynch, AT&T Bell Laboratories, Holmdel, New

Jersey J. W. Mark, University of Waterloo, Canada B. Melamed, NEC Research Institute M. Minoux, Laboratorie MASI, Universite de Paris,

France D. Mitra, AT&T Bell Laboratories, Murray Hill, New

Jersey S. Narasimhan, Georgia Institute of Technology I. Neuman, Fordham University T. Ott, Bell Communications Research, Morristown,

New Jersey T. Ozawa, Nippon Telegraph and Telephone

Corporation, Japan J. Park, University of Iowa H. Pirkul, Ohio State University S. Resheff, GTE Laboratories, Waltham, Mass. M. Rosenwein, AT&T Bell Laboratories, Holmdel,

New Jersey K. Ross, University of Pennsylvania V. Samalam, GTE Laboratories, Waltham, Mass. I. Saniee, Bell Communications Research, Morristown,

New Jersey S. Sen, University of Arizona L. Servi, GTE Laboratories, Waltham, Mass. D. Shallcross, IBM T. J. Watson Research, Yorktown

Heights, New York H. D. Sherali, Virginia Polytechnic Institute and State

University A. Shulman, GTE Laboratories, Waltham, Mass. D. Simchi-Levi, Northwestern University S. Sridhar, Vanderbilt University M. Stoer, Norwegian Telecom Research, Norway T. Suda, University of California T. Takahashi, Kyoto University, Japan H. Tijms, Vrije University, The Netherlands S. Tufeklci, University of Florida J. Turner, Washington University S. W. Wallace, University of Trondheim, Norway S. Whitehead, GTE Laboratories, Waltham, Mass. L. A. Wolsey, Catholique Universite de Louvain, Belgium D. Xiao, Columbia University Y. Yemini, Columbia University

194



0 AAA

Operations Research publishes quality operations research and management science work of interest to the OR practitioner and researcher in three substantive categories: methods, data based operational science, and the practice of OR. The Journal seeks papers reporting underlying data based principles of operational science, observations and modeling of operating systems, contributions to the methods and models of OR, case histories of applications, review articles, and discussions of the administrative environment, history, policy, practice, future, and arenas of application of operations research.

Complete studies that contain data, computer experi- ments, and model validation, and that integrate theory, methods, and applications are of particular interest. Thus, we encourage case studies of lasting value. Contributors should submit informal descriptions of cases to Interfaces.

In addition to the regular ARTICLES section, there are three special sections: OR PRACTICE contains practitioner- oriented applications, tutorials, and surveys. Application papers whose utility is as yet undemonstrated in practice or that are not tailored for practitioners should be submitted to the appropriate Area Editor. The OR FORUM section publishes papers on history, policy, analyses of current and future trends, and related subject matter. TECHNICAL NOTES

contains brief articles on all of the topics covered by the Jour- nal. For more information on subject coverage and editorial policy, see the Editorial and Area Editor statements published in the January-February 1993 issue.

All papers published in Operations Research are critically refereed. Initial refereeing of clear, concise, well written manuscripts normally takes about four months for papers of average length; generally a shorter time is needed for notes.

Decisions to publish manuscripts in Operations Research will be based, in part, on the answers to such questions as: Does this paper make a new and substantial contribution to the literature of operations research? Will it be of interest to a significant group of OR workers? Does the paper give sufficient introductory and summary material to inform readers of the context, importance, and possible fields of application of the material covered? Is it clearly, concisely, accurately and logically written? Could it benefit from con- densation or expansion? Is its character clear from the title, abstract and text? Does the paper describe its relation to previously published work, and does it give adequate credit and references to this work?

It is to be understood that the final decision concerning publication rests with the Editor.

INSTRUCTIONS FOR CONTRIBUTORS

GENERAL CONSIDERATONS

Authors should submit four, double-spaced typewritten copies of manuscripts directly to the appropriate Area Editor. The copy must be clearly legible. Also needed are: a copyright transfer agreement, a statement of contribution, and a cover letter. Papers not in the fields covered by the Area Editors (listed on the inside front cover of each issue) should be sent to

H. Donald Ratliff, Editor School of Industrial and Systems Engineering Georgia Institute of Technology Atlanta, GA 30332-0205

for assignment. Papers should not be sent to the Associate Editors.

Submission of a manuscript is a representation that the paper has neither been published nor submitted for publication elsewhere, and that, if the work is officially sponsored, it has been released for open publication. The manuscript should be accompanied by a Copyright Transfer Agreement from the authors (or their employers-whoever holds the copyright) transferring the copyright to INFORMS. The form for this agreement is printed in most issues of this journal and is also available from the Managing Editor and the Executive Director of INFORMS. This written transfer of copyright, which previously was assumed to be implicit in the act of submitting a manuscript, is necessary under the

1978 U.S. Copyright Law in order for INFORMS to con- tinue disseminating operations research results as widely as possible.

Manuscripts will not be returned to an author unless spe- cifically requested, or unless reviewers have provided anno- tations that will be of use to the author.

The text should be arranged as follows: title page, abstract, introduction, main sections, appendix, acknowledgment, and references. The appendix and acknowledgment are optional.

Observe the following points in preparing manuscripts. (Papers not conforming closely to these instructions will be returned to their authors for appropriate revisions.)

1. Statement of Contribution. A statement of contribution is required for each submitted paper. The form will appear in nearly every issue of the Journal and should be completed and submitted at the time a paper is sent to an Area Editor. The purpose of this statement is to aid area editors and reviewers in determining if the paper meets its stated objec- tives. Once a paper is accepted for publication, this statement will serve as the basis for the In This Issue column.

When preparing this statement, include the following: Why is the topic that is addressed in the paper important? What specific contributions does the paper make to operations research? What do you believe is the basis for publication? Provide a brief assessment of the near and long-term implica- tions of the contribution.



Keep the statement brief, preferably fitting into the space allocated on the printed form. Try not to overflow the page, however, a longer statement may be submitted if you believe that such an explanation is necessary. The statement should be expository and contain no mathematical notation. Attach one copy of the completed form to the submission. Failure to complete this item will delay the start of the review process.

2. Readability. The abstract and the introduction of every paper must be free of unnecessary jargon and clearly readable by any INFORMS member. These sections should be written in an expository style that will be comprehensible to readers who are not technical experts in the subject matter.

3. Title Page. Each paper should have a title page that contains the authors' names and addresses. The usual acknowledgments should be placed in a separate section at the back of the manuscript.

4. Abstract. Preface each article with a self-contained, one paragraph abstract that summarizes the problem and the principal results and conclusions. It should not contain for- mulas, references or abbreviations, nor exceed 200 words.

5. Introduction. The introduction must clearly state the problem, the results to be found in the paper and their sig- nificance to the OR community. It should not contain equations or mathematical notation. The introduction does not have a section heading or a number.

6. Main Sections. The main sections of the paper must be readable, the level of the mathematics and/or the terminol- ogy appropriate to the topic, and the material logically presented. Begin section numbering and headings with these sections.

7. Style. The message of your paper will be enhanced if it is presented in active, forceful, and concise prose. Since good writing is a craft at least as difficult as doing operations research, before beginning your paper you will be well ad- vised to refresh your acquaintance with the most important points of good style by spending some time with a source of good editorial advice, such as Writing a Technical Paper by Donald H. Menzel, Howard Mumford Jones, and Lyle G. Boyd (New York: McGraw-Hill, 1961). While the Editor and staff will correct minor lapses from good style in your manuscript, they cannot undertake wholesale revisions of poorly written papers. There is no a priori limit to the number of pages for a paper; however, conciseness and clarity of presentation are important publication criteria.

8. Spacing and Format. Double space manuscripts throughout, including the abstract, subsidiary matter (list of captions, for example), and references. No line-printed computer printouts will be considered for publication. In general, keep figures and tables to a minimum that is consistent with an adequate presentation of the textual information.

Each page of the manuscript should be numbered. Indent the first line of each paragraph. Spelling and hyphenation will follow Websters Third New International Dictionary (unabridged).

9. Footnotes. Operations Research does not use footnotes; incorporate subsidiary material that would otherwise appear in footnotes in the main text, possibly in parentheses or brackets, or place it in a Notes section at the end of the text, before the Acknowledgment and References. Desig- nate notes by using superscript numerals placed in serial order throughout the text.

10. Acknowledgment. Place acknowledgments of presentation, support and assistance in a final section that precedes the References, not on the title page.

11. References. List only those references that are cited in the text. References in the text should be cited by the author's surname and the year of publication-for example, Flood (1962). If the reference has two or three authors, cite all of the authors' surnames and the year of publication- Flood, Smith and Jones (1982). If the reference has more than three authors, cite the first author's surname followed by et al. and the year of publication-Brown et al. (1985). If there is more than one reference by the same author with the same year of publication, the first citation appearing in the text would read Flood (1962a), the second citation would read Flood (1962b), etc. Do not use parentheses or brackets for dates when the citation is already enclosed within parentheses. At the end of the paper list references alphabetically by the last name of the first author. Do not number the reference list. Double space this final section.

For journal references, give the author, year of publication, title, journal name, volume, and pages-for example:

FLOOD, M. M. 1962. New Operations Research Potentials. Opns. Res. 10, 423-436.

For book references, give the author, year of publication, title, publisher, city, state, and pages-for example:

MORSE, P. M., AND G. E. KIMBALL. 1951. Methods of Operations Research. John Wiley, New York, 44-65.

For references to working papers or dissertations cite the author, title, type of document, department, university, and location, for example:

ROSENWEIN, M. 1986. Design and Application of Solution Methodologies to Optimize Problems in Transportation Lo- gistics. Ph.D. Dissertation. Department of Decision Sci- ences, University of Pennsylvania, Philadelphia.

12. Mathematical Expressions. Within the text, use the solidus whenever possible in preference to built-up frac-

tions, e.g., a/(1 - b) rather than 1 ab write complicated

exponentials in the form exp( ); avoid subscripts or superscripts on subscripts or superscripts; and, in general, mini- mize unusual typographical requirements. For displayed equations, use built-up fractions. Avoid lengthy equations that will take several lines to typeset (possibly by defining terms of the equations in separate displays).

Make subscripts and superscripts large and clear, and shown in a clearly inferior or superior position. The letter 1 and the numeral 1 and the letter 0 and the numeral 0, which are identical on most keyboards, should be identified. Sym- bols and Greek letters should be identified clearly: On their first occurrence, label unusual or ambiguous symbols by marginal notes. The difference between upper and lower case letters should be clear.

Display only those mathematical expressions that must be numbered for later reference or that need to be emphasized. Number displayed equations consecutively throughout the paper; do not number equations by section numbers. Appendix equations can be labeled Al, A2, etc. The numbers should be placed in parentheses to the right of the equation.



13. Reporting Computational Experience. In reporting computational experience on the efficiency of algorithms follow the guidelines given in Operations Research, Volume 29, No. 2, "Reporting Computational Experience in Operations Research."

14. Tables. Tables should be numbered with roman numerals, have a title, and be referred to sequentially in the text. Column headings should be brief and not use abbreviations. Do not use vertical rules. The use of footnotes is encouraged; designate these by lower case letters. The submission of original tables suitable for reproduction is not necessary; all tables will be typeset for consistency. Each table should be on a separate sheet and not interleaved in the text.

15. Figures. Line drawings should be prepared in black ink or preferably via a laser printer or plotter on white bond or vellum paper. For best results, fit the figure onto a 81/2 x 11 inch sheet with at least a 1 inch margin all-around. Orig- inal drawings will be required on acceptance of a paper. Copies are sufficient for reviewers.

Lettering should be done on a computer, with a mechani- cal lettering set or its equivalent. The figure should be of sufficient size so that after photoreduction, letters and numbers are legible.

Do not clutter the figure with information that makes it difficult to read. All details on the figures should be checked carefully because correction on proofs necessitates reshooting.

Each figure must be cited and will be placed in the order mentioned in the text. Each figure must have a caption and a number (arabic). Do not place the caption on the original of the figure-these go on a separate sheet. Do not differentiate between illustrations and figures.

Lines must be sufficiently thick to reproduce well, and decimal points, periods and dots must be sufficiently large to allow for reduction. The same type of lettering should be used for all figures. The figure and the lettering should be in proportion so that both can accommodate reduction. Do not use different sized type within a figure.

16. Subject Classification Scheme for the OR/MS Index. Determine the appropriate subject classifications (up to 3) and accompanying descriptive phrases for all work submitted. A complete list of categories appears at the back of most issues; refer to the revised scheme as it appears in Volume 37, No. 1 (January-February 1989) and in subse- quent issues. Choose from one to three subject categories for each manuscript. For every category chosen, write a short phrase that puts the paper in context. (The phrase can be a concise rendering of the title, or it may specify some aspect of the paper that is important but not apparent in the

title.) The length of each phrase, including spaces and punc- tuation, should not exceed 60 characters. This information will be printed on the title page of every article, technical note, and letter that is published.

Subject categories and phrases must either appear on the title page of the manuscript (this is the preferred method), or authors may use the form provided (see the bottom half of the Copyright Transfer Agreement).

Do not repeat the subject classifications from the subject categories. The accompanying phrase should help to further clarify the paper within a subject category.

17. Reprints. Operations Research does not have paper charges, nor does it supply free reprints. Authors of accepted articles may order reprints at reasonable rates at the time they submit their corrected galley proofs. Reprints of individual articles are not available from INFORMS.

Reproduction of Journal Articles

1. Permission is granted to quote from this Journal in scientific works with the customary acknowledgment of the source. The reprinting of a figure, table or an excerpt requires the consent of one of the original authors and the notification of INFORMS.

2. Reprinting of any article or a portion of an article beyond that permitted in Paragraph 1 requires written permission from the copyright holder (INFORMS) and payment of an appropriate royalty. Reprinting requests should be directed to the INFORMS Business Office and should contain the following details: author, title, volume, number, year, intended purpose or use of the article (book, journal, abstract, anthology, etc.) and estimated sale price of the work. Permission must first be obtained from the author(s) and submitted to INFORMS with the request.

3. Libraries maintaining a "reserve list" are permitted to reproduce five copies of an article for this purpose. Addi- tional copies are subject to the copying fee as covered in the 1978 U.S. Copyright Law as explained in the following paragraph.

4. Copying without fee is permitted provided that the copies are not made or distributed for direct commercial advantage and are distributed without charge beyond cost. Credit to the source should be given, and abstracting with credit is permitted. Other copying of articles is permitted provided that a per-copy fee is paid through the Copyright Clearance Center, Inc., 222 Rosewood Drive, Danverse, MA 01923, (508) 750-8400. For permission to republish, write to the INFORMS (290 Westminster Street, Provi- dence, RI 02903). To copy otherwise, or to republish, requires a separate fee and/or specific permission.

Announcements should be sent to John Llewellyn Lionheart Publishing, Inc. 2555 Cumberland Parkway Atlanta, GA 30339

Books for Review should be sent to Professor Benjamin Lev Book Review Editor, Interfaces School of Management University of Michigan 4901 Evergreen Road Dearborn, MI 48128-1491



A i

OPPORTUNITIES N iN1 / YOUR CHOICE INFORMS offers you the INFORMS offers you one chance to grow professionally of three leading journals with and prepare yourself for the MS/OR 1995 your membership dues. challenges that lie ahead as we reach the 21 st century

BENEFITS * Networking * Special interest groups * Nine leading-edge journals * Geographic chapters *Meetings, seminars, workshops *Job Placement Service *Group insurance program *OR/MS Today, bi-monthly news magazine

Recognition in profession t Discounts on publications and meetings * INFORMS On-Line

Yes! I wish to become a member of INFORMS! EgER STUDENT/ RtEi

MEMBERSHIP TERM ......... January '95 - December'95 $80.00 [ $40.00 1 $20.00

vChoose the journal you wish to receive free with your membership: 0 INTERFACES 0 MANAGEMENT SCIENCE 0 OPERATIONS RESEARCH

VSubscribe at the member price to: 1995 Regular Student/Retired

INTERFACES ..................................... C: Vol. 25 $30.00 $15.00 MANAGEMENT SCIENCE .C Vol.41 $45.00 $22.50 OPERATIONS RESEARCH .C Vol.43 $45.00 $22.50 INFORMATION SYSTEMS RESEARCH .L Vol. 6 $45.00 $22.50 JOURNAL ON COMPUTING .L Vol. 7 $40.00 $20.00 MARKETING SCIENCE ............................ C Vol. 14 $45.00 $22.50 MATHEMATICS OF OPERATIONS RESEARCH O. Vol.20 $35.00 $17.50 ORGANIZATION SCIENCE .O Vol. 6 $45.00 $22.50 TRANSPORTATION SCIENCE .L Vol.29 $30.00 $15.00

a Check Enclosed O VISA O MasterCard # Exp. Date_ NAME -------------- MAILING ADDRESS ........ .. CITY ______________________________STATE _______ZIP___________

TELEPHONE ( ) ELECTRONIC MAIL CODE _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _

*Speciai introductory offer for new student members only. Include faculty certification of student status with paymenlt. I certify that this individual is a full-time student: jOr Professor .__________________________ Institution ...__________________________



THE 1994 LANCHESTER PRIZE CALL FOR NOMINATIONS

The Lanchester Prize has been awarded each year since 1954 for the best published contributions in operations research in the English language. For 1994 the prize is $5,000 and a commemorative medallion.

Books and papers for the 1994 Prize will be screened by a Committee appointed by the INFORMS Board. To be eligible for consideration, the book or paper must be nominated to the Committee. Anyone may make nominations; this notice is a call for nominations.

Requirements-to be eligible for the Lanchester Prize, a book, paper, or group of books or papers must:

* be on an operations research subject * have been published in 1994, or two years prior to 1994, or, in the case of a group, at

least one member of a group must have been published in 1993, or the two years prior to 1993

* be written in the English language * have appeared in the open literature

Books or papers may be case histories, reports of research representing new results, or primarily exposition. For a nominated set (group of either articles or books) published over more than one year, it is expected that each element in the set is part of one continuous effort, such as a multi- year project or a continuously written, multi-volume book.

The Committee will use the following criteria in making judgments: * extent to which the contribution advances the state of the art of operations research * originality of the ideas or methods * new areas of application it opens up * degree to which existing theory or method is unified or simplified * clarity and excellence of the exposition

Send nominations to: Dean Matthew J. Sobel Harriman School SUNY at Stony Brook Stony Brook, NY 11794-3775 Phone: (516) 632-7175 msobel@fac. har. sunysb. edu

Nominations may be in any form, but must include the titles of paper(s) or book(s), author(s), place and date of publication, and six copies of the material. Supporting statements bearing on the worth of the publication in terms of the five criteria will be very helpful, but are not required. Each nomination will be carefully reviewed by the Committee.

Nominations must be received by March 31, 1995 to allow adequate time for review.

The decision of the committee and the INFORMS Board will be announced at the INFORMS National Meeting, Oct. 29-Nov. 1, 1995, in New Orleans, Louisiana.



Birds Hlock together for protection. AS it turns out, so do we.

Whoever said there is safety in numbers must have been talking about INFORMS. After

all, one of your greate-st member benefits is access to valuable insurance coverage. At group

rates outsiders envy. We've not only done all the legwork in finding these plans. We've tailored them to the

preferences of you, our members. The coverage is easy to update as your needs change. And

it stays with you, even when you change jobs. To speak with a customer service representative, call 1 800 424-988o3, or in Washington, DC

(202) 457-68'20, between 8:30 a.m. and 5:30 p.m. easten time. Its one time when the numbers

are all in your favor.

0 ty <INFORMS In 000 ksurance

g 0 f 0'V~n-Hsptal High-.S''DS:0f 00fft 0E0d ;0Limt Acc'.ident00 *; Mef ' dSicare" Supplement Insurance' 0

- f ''; 'ySItioy 1t;f T' 7 : t he N i ew?t iS;' ,; Yor i fe' Inurnc co pn 51 Maio Aveue New York NY 10010E'-t



ASSOCIATE EDITORS

Ramakrishna Akella Carnegie Mellon University

Agha Iqbal Ali University of Massachusetts

Egon Balas Carnegie Mellon University

Cynthia Barnhart Massachusetts Institute of Technology

Dimitris Bertsimas Massachusetts Institute of Technology

Karl Heinz Borgwardt Universitaet Augsburg

Cheng-Shang Chang IBM T.J. Watson Research Center

Xiuli Chao New Jersey Institute of Technology

Robert B. Cooper Florida Atlantic University

Teodor Crainic University of Quebec, Montreal

Jacques Desrosiers GERAD, Ecole des HEC

Hamilton Emmons Case Western Reserve University

A. Federgruen Columbia University

Peter C. Fishburn AT&T Bell Laboratories

Robert Fourer Northwestern University

Terry L. Friesz George Mason University

Guillermo Gallego Columbia University

Stanley Gershwin Massachusetts Institute of Technology

Donald Goldfarb Columbia University

Alan J. Goldman Johns Hopkins University

Winfried K. Grassmann University of Saskatchewan

Peter J. Haas IBMAlmaden Research Center

Nicholas G. Hall Ohio State University

Gordon B. Hazen Northwestern University

Patrick Jaillet University of Texas at Austin

Mark E. Johnson University of Central Florida

Edward Kaplan Yale University

W. David Kelton University of Minnesota

Peter C. Kiessler Clemson University

Paul R. Kleindorfer -

University of Pennsylvania Georgia-Ann Klutke

University of Texas at Austin Lode Li

Yale University Thomas M. Liebling

Ecole Polytechnique Federale de Lausanne

Yi-Hsin Liu University of Nebraska

Fransois Louveaux Universite de Namur

Timothy Lowe University of Iowa

Irvin J. Lustig Princeton University

Hirofumi Matsuo University of Texas at Austin

Joseph B. Mazzola Duke University

Kevin F. McCardle Duke University

Donald C. McNickle University of Canterbury

Rolf H. Mohring Technische Universitaet, Berlin

Karam Moinzadeh University of Washington

Herbert Moskowitz Purdue University

Henry Nuttle North Carolina State University

Amedeo R. Odoni Massachusetts Institute of Technology

Hasan Pirkul Ohio State University

Stephen M. Pollock University of Michigan

Evan L. Porteus Stanford University

Meir J. Rosenblatt Washington University/Technion

Susan Sanchez University of Missouri

Suvrajeet Sen University of Arizona

Leslie David Servi GTE Laboratories

Suresh Sethi University of Toronto

J. George Shanthikumar University of California, Berkeley

Prakash P. Shenoy University of Kansas

Bala Shetty Texas A&M University

David B. Shmoys Cornell University

Karl Sigman Columbia University

David Simchi-Levi Northwestern University

Marius M. Solomon Northeastern University

Lawrence D. Stone Metron, Inc.

Michael R. Taaffe University of Minnesota

Christopher S. Tang University of California, Los Angeles

Charles S. Tapiero ESSEC, Cergy Pontoise, France

Henk Tijms Vrije Universiteit

Devanath Tirupati University of Texas at Austin

Roger Tobin GTE Laboratories

Peter P. Wakker University of Leiden

Lawrence M. Wein Massachusetts Institute of Technology

Chelsea C. White III University of Michigan

Douglas J. White University of Virginia

Henry Wolkowicz University of Waterloo

Laurence A. Wolsey CORE

N. Keith Womer University of Mississippi

Martin A. Wortman Texas A&M University

Candace Arai Yano University of California, Berkeley

Milan Zeleny Fordham University at Lincoln Center

Yu-Sheng Zheng University of Pennsylvania

Paul H. Zipkin Columbia University

OR PRACTICE ASSOCIATE EDITORS

James H. Bookbinder University of Waterloo

Thomas M. Cook American Airlines, Inc.

Mark J. Eisner Exxon Company International

Saul I. Gass University of Maryland

Alan Gleit Bank of Boston

Clarence Haverly Haverly Systems

David S. P. Hopkins Stanford University

M. Eric Johnson Vanderbilt University

Parsumarti V. Kamesam IBM T.J. Watson Research Center

Ernest Koenigsberg University of California, Berkeley

Mark Lembersky Lembersky Chi Incorporated

Peter A. Morris Applied Decision Analysis, Inc.

James G. Root Coronado, California

David A. Schrady Naval Postgraduate School

Stephen A. Smith Santa Clara University

Paul Wyman Wyman Associates

*0 0 S. 0 * S



Volume 43 January-February 1995 Number 1

_S D1-1

FROM THE EDITOR 2

IN THIS ISSUE 3

OR PRACTICE

Analysis of Distribution Strategies in the Industrial Paper and Plastics Industry 6

Morris A. Cohen, Narendra Agrawal, Vipul Agrawal and Ananth Raman

An Assessment of Chronic Lung Injury Attributable to Long-Term Ozone Exposure 19

Robert L. Winkler, Thomas S. Wallsten Ronald G. Whitfield, Harvey M. Richmond, Stanley R. Hayes and Arlene S. Rosenbaum

PREFACE TO SPECIAL ISSUE

Telecommunications: A Revolution in Progress 29 Bezalel Gavish

SPECIAL ISSUE ARTICLES

Modeling Handovers in Cellular Mobile Networks With Dynamic Channel Allocation 33

Diana PaHlant and P. G. Taylor

Lower Bounding Procedures for Multiperiod Telecommunications Network Expansion Problems 43

Suk-Gwon Chang and Bezalel Gavish

A Decomposition Algorithm for Local Access Telecommunications Network Expansion Planning 58

Anantaram Balakrishnan, Thomas L. Magnanti and Richard T. Wong

Second-Order Fluid Flow Models: Reflected Brownian Motion in a Random Environment 77

R. L. Karandikar and V. G. Kulkarni

Optimal Control of Arrivals to Token Ring Networks With Exhaustive Service Discipline 89

Kent H. Tseng and Man-Tung Hsiao

A Logical Topology and Discrete Capacity Assignment Algorithm for Reconfigurable Networks 102

Ming-Jeng Lee and James R. Yee

Smoothing Point Processes as a Means to Increase Throughput 117

Cheng-Shang Chang

A 2n Constraint Formulation for the Capacitated Minimal Spanning Tree Problem 130

Luis Gouveia

Modeling and Solving the Two-Facility Capacitated Network Loading Problem 142

Thomas L. Magnanti, Prakash Mirchandani and Rita Vachani

Approximation of the Mean Queue Length of an MIGIc Queueing System 158

Jon W. Mark and Bobby N. W. Ma

Speech Compression in Attendent Services: Analysis of a Queueing System With Delay Dependent Service Times 166

Donald E. Smith

Polling, Greedy and Horizon Sewvers on a Circle 177 Arie Harel and Alan Stulman

TECHNICAL NOTE

An Efficient Algorithm for the Multiperiod Capacity of One Location in Telecommunications 187

Iraj Saniee

CONTRIBUTORS 191

APPRECIATION TO REFEREES 194

Cover illustration: Cluster of cells, from Pallant and Taylor, "Modeling Handovers in Cellular Mobile Networks With Dynamic Channel Allocation, " p. 37.

S S * S sz' S * *. * 0 * * *



Date post:	09-Jan-2017
Category:	Documents
Upload:	dangduong
View:	212 times
Download:	0 times

Special Issue on Telecommunications Systems: Modeling, Analysis and Design || Back Matter

Documents