Abstract
Planning and designing the next generation of IP router or switched broadband networks seems a daunting challenge considering the many complex, interacting factors affecting the performance and cost of such networks. Generally, this complexity implies that it may not even be clear what constitutes a “good” network design for a particular specification. Different network owners or operators may view the same solution differently, depending on their unique needs and perspectives. Nevertheless, we have observed a core common issue arising in the early stages of network design efforts involving leading-edge broadband switched technologies such as ATM, Frame Relay, and SMDS; or even Internet IP router networks. This core issue can be stated as follows: Given a set of service demands for the various network nodes, where should switching or routing equipment be placed to minimize the Installed First Cost of the network? Note that the specified service demands are usually projections for a future scenario and generally entail significant uncertainty. Despite this uncertainty, we have found that network owners and operators generally feel it is worthwhile to obtain high-level advice on equipment placement with a goal of minimizing Installed First Cost. This paper reports on a heuristic approach we have implemented for this problem that has evolved out of real network design projects. A tool with both a Solution Engine and an intuitive Graphical User Interface has been developed. The approach is highly efficient; for example, the tool can often handle LATA-sized networks in seconds or less on a workstation processor. By using only nodal demands rather than the more complex point-to-point demands usually required in tools of this sort, we have created an approach that is not only highly efficient, but is also a better match to real design projects in which demand data is generally scant and highly uncertain.
Similar content being viewed by others
References
Cosares, S., D. Deutsch, I. Saniee, and O. Wasem. (1995). “SONET Toolkit: A Decision Support System for Designing Robust and Cost-Effective Fiber-Optic Networks,” Interfaces, 25(1), 20–40.
Gavish, B. and K. Altinkemer. (1986). “Parallel Savings Heuristics for the Topological Design of Local Access Tree Networks,” '86, 130–139.
Gavish, B. and I. Neuman. (1989). “A System for Routing and Capacity Assignment in Computer Communication Networks,” IEEE Trans. Communications 37(4), 360–366.
Gavish, B., P. Trudeau, M. Dror, M. Gendreau, and L. Mason. (1989). “Fiberoptic Circuit Network Design Under Reliability Constraints,” IEEE J. Selected Areas in Communications, 7(8), 1181–1187.
Mahey, P., A. Ouorou, L. LeBlanc, and J. Chifflet. (1998). “A New Proximal Decomposition Algorithm for Routing in Telecommunications Networks,” Networks, 31(4), 227–238.
McQuillan, J. (1995). “Planning Networks without Network Planning,” Business Communications Review, 25(7), 10–12.
Wasem, O.J., A.M. Gross, and G.A. Tlapa. (1995). “Forecasting Broadband Demand Between Geographic Areas,” IEEE Communications Magazine, 33(2), 50–57.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Gannett, J.W. Fast, Efficient Equipment Placement Heuristics for Broadband Switched or Internet Router Networks. Journal of Heuristics 6, 39–64 (2000). https://doi.org/10.1023/A:1009661626037
Issue Date:
DOI: https://doi.org/10.1023/A:1009661626037