Distributed Computing & Network Design Problems in Telecommunications
Session: SB32
Date/Time: Sunday 10:15-11:45
Type: Sponsored
Sponsor: Technical Section on Telecommunications
Track:
Cluster:
Room:
Chair: Ishwar K. Murthy
Chair Address: Louisiana State University, 3178 CEBA Bldg., Nicholson Ext, Dept. of IS & Dec. Sci., Baton Rouge, LA 70803-6316
Chair E-mail: imurthy@unix1.sncc.lsu.edu
Chair:
Chair Address:
Chair E-mail:
- SB32.1 Exact Algorithms for Tree Topologies in Telecom Network Design
- Trilochan Sastry;
Indian Institute of Management, Vastrapur, Ahmedabad, 380015 , India;
sastry@iimahd.ernet.in
We study exact algorithms for several variations of the capacitated network design problem, all of which are known to be NP-hard. We describe a tree enumeration algorithm and a dynamic programming path-based algorithm. The worst case running times of the 2 is faster for problem instances where the capacity constraint on edges is very tight... - SB32.2 Examining the Diffusion of Distributed Database Technology
- Balaji Rajagopalan;
Illinois State University, 5520 Dept. of Acctng., Normal, IL 61790-5520;
brajag@ilstu.edu
- Rathindra Sarathy;
Illinois State University, Dept. of Acct. & IS, 5520 College of Bus., Normal, IL 61790-5520;
rsarathy@ilstu.edu
Our objective is to use established diffusion models to study the extent of DDB technology in organizations. Swanson's (1994) tri-core model of IS innovation, as well as research by Grover et al. (1997) will be used in the study of DDB diffusion. - SB32.3 Client Server Network Design: Formulations & Algorithms
We will focus on the design of 3-tier router based client server networks using current communicatin technologies such as ATM and frame relay. Several alternate formulations of the problem with varying levels of complexity will be discussed. Solution methodologies and computational results will also be discussed.
For information on individual presentations, please contact the authors
directly.
Return to Conference home page
|
