Abstract
To appropriately size networks that support Switched Multi-megabit Data Service (SMDS), we must determine how much additional capacity is needed and where it is needed so as to minimize the total capacity augmentation cost. We consider two combinatorial optimization problem formulations. These two formulations are compared for their relative applicability and complexity.
A solution procedure based upon Lagrangean relaxation is proposed for one of the formulations. In computational experiments, the proposed algorithm determines solutions that are within a few percent of an optimal solution in minutes of CPU time for networks with 10 to 26 nodes. In addition, the proposed algorithm is compared with a Most Congested First (MCF) heuristic. For the test networks, the proposed algorithm achieves up to 152% improvement in the total cost over the MCF heuristic.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Bell Communications Research, “Generic System Requirements in Support of SMDS,” TR-TSV-000772, Issue 1, May 1991.
T. Cox and F. Dix, “SMDS: The Beginning of WAN Superhighways,” Data Communications, April 1991.
J.L. Wang and E.A. White, “An Integrated Methodology for Supporting Packet Network Engineering,” Proc. IEEE Globecom, December 1990.
J.L. Wang, “An Integrated Methodology for Supporting Network Planning and Traffic Engineering with Considerations to SMDS Service,” Proc. IEEE Globecom, December 1991.
F. Y.S. Lin and J.L. Wang, “Minimax Open Shortest Path First Routing Algorithms in Networks Supporting the SMDS Service,” Proc. ICC, May 1993.
Bell Communications Research, “Generic Requirements for SMDS Networking,” TA-TSV-001059, Issue 2, August 1992.
OSPFIGP Working Group of the Internet Engineering Task Force, “The OSPF Specification, Version 2,” Network Working Group Request for Comments (RFC 1131), June 1990.
E.W. Dijkstra, “A Note on Two Problems in Connection with Graphs,” Numerical Mathematics, Vol. 1, pp. 269-271, October 1959.
F. Y.S. Lin, “Allocation of End-to-end Delay Objectives for Networks Supporting SMDS,” this book.
A.S. Tanenbaum, Computer Networks, Prentice-Hall, 1988. U.A.M. Geoffrion, “Lagrangean Relaxation and Its Uses in Integer Programming,” Math. Programming Study, 2:82-114, 1974.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1994 Springer Science+Business Media New York
About this chapter
Cite this chapter
Lin, F.Y.S. (1994). Link Set Sizing for Networks Supporting SMDS. In: Frisch, I.T., Malek, M., Panwar, S.S. (eds) Network Management and Control. Springer, Boston, MA. https://doi.org/10.1007/978-1-4899-1298-5_41
Download citation
DOI: https://doi.org/10.1007/978-1-4899-1298-5_41
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4899-1300-5
Online ISBN: 978-1-4899-1298-5
eBook Packages: Springer Book Archive