Abstract
In this paper we consider designing a high-speed virtual private network using a combination of heterogeneous telecommunication services. In particular, we consider mixing SMDS access lines and point-to-point digital leased lines to construct a virtual private network at minimum cost. We develop a nonlinear combinatorial optimization model and a simulated annealing algorithm to find a high-performance, low-cost network design. We compute lower bounds on cost savings from using mixed services as opposed to pure SMDS based on actual tariffs and realistic traffic.
Similar content being viewed by others
References
Ameritech, http://www.ameritech.com:1080/products/custom/product/34w.html (2000).
Bell Atlantic Internet Solutions, http://bellatlantic.net/aboutus/news/dedicated110196.html (1996).
D. Bienstock and O. Gunluk, Capacitated network design - polyhedral structure and computation, INFORMS Journal on Computing 8 (1996) 243-259.
R. Cahn, Wide Area Network Design (Morgan Kaufmann, Los Altos, CA, 1998).
CiTR, http://www.citr.com.au/fastpac.html (2000).
G. Dahl and M. Stoer, A cutting plane algorithm for multicommodity survivable network design problems, INFORMS Journal on Computing 10 (1998) 1-11.
G. Freedman, http://www.elec.uow.edu.au/conferences/95-50/atnac95.html (1995).
C.A. Heckart, The Guide to Frame Relay Networking (Flatiron Publishing, 1994).
J.W. Herrmann, A dual ascent approach to the fixed-charge capacitated network design problem, European Journal of Operational Research 95 (1996) 476-490.
F. Kaefer and J.S. Park, Interconnecting LANs and a FDDI backbone using transparent bridges: A model and solution algorithms, INFORMS Journal on Computing 10 (1998) 25-39.
S. Kirkpatrick, C. Gelatt and M. Vecchi, Optimization by simulated annealing, Science 220 (1983) 671-680.
R.W. Klessig and K. Tesink, SMDS: Wide-Area Data Networking with Switched Multi-Megabit Data Service (Prentice-Hall, Englewood Cliffs, NJ, 1995).
L.J. LeBlanc, J.S. Park, V. Sridhar and J. Kalvenes, Topology design and bridge-capacity assignment for interconnecting token ring LANs: A simulated annealing approach, Telecommunication Systems 6 (August 1996) 21-43.
K. Lee, K. Park and S. Park, Design of capacitated networks with tree configurations, Telecommunication Systems 6 (1996) 1-20.
Y. Lee, B.H. Lim and J.S. Park, A hub location problem in designing digital data service networks: Lagrangian relaxation approach, Location Science 4 (1996) 185-194.
T.L. Magnanti, P. Mirchandani and R. Vachani, Modeling and solving the two-facility capacitated network loading problem, Operations Research 43 (1995) 142-157.
S. Nye, http://www.techweb.com/printableArticle?doc_id=TWB19980203S0007 (1998).
J.S. Park and V. Sridhar, Benders-and-cut algorithm for fixed-charge capacitated network design problems, European Journal of Operational Research 125 (2000) 622-632.
PSINet, http://www.psi.com/news/pr/97/edugate.html (1997).
A. Rawlings, http://www.infowin.org/ACTS/IENM/NEWSCLIPS/arch1997/971002uk.html (1997).
S. Soni, S. Narasimhan and L. LeBlanc, Access network design with reliability constraints, Working paper, Owen Graduate School of Management, Vanderbilt University (2001).
Switched Multimegabit Data Service, http://www.cisco.com/univercd/cc/td/doc/cisintwk/ito_doc/smds.htm (2001).
V. Sridhar, J.S. Park and B. Gavish, LP-based heuristic algorithms for interconnecting token rings via source routing bridges, Journal of Heuristics 6 (2000) 149-166.
Verizon and the General Services Administration of the U.S. Federal Government, Private communication (November 2001).
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Park, J.S., LeBlanc, L.J. & Lim, B.H. Network Design Using SMDS and Leased Lines. Telecommunication Systems 20, 151–162 (2002). https://doi.org/10.1023/A:1015497518532
Issue Date:
DOI: https://doi.org/10.1023/A:1015497518532