Abstract
Given a set of geographically distributed sites, information about the traffic between them, and information about the means by which they can be connected (links), the network design problem is to select some of the candidate connections. The goals in this selection typically include keeping the cost within a specified budget and providing sufficient connections to support the traffic offered at a specified capacity, speed, or throughput. Of course, the wide variety of traffic types and patterns, and of means of connection, results in a significant range of network design problems.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Assous, J.Y. (1986). First and Second Order Bounds for Terminal Reliability. Networks, 16:319–329.
Ball, M.O., C. J. Colbourn and J.S. Provan. (1995). Network Reliability. In M.O. Ball, T.L. Magnanti and G.L. Nemhauser (eds), Network Models, Handbooks in Operations Research and Management Science, pages 673–762. Elsevier, North-Holland, Amsterdam.
Buchsbaum, A.L. and M. Mihail. (1995). Monte Carlo and Markov Chain Techniques for Network Reliability and Sampling. Networks, 25:117–130.
Carey, M. and C. Hendrickson. (1984). Bounds on Expected Performance with Links Subject to Failure. Networks, 14:439–456.
Carrasco, E.H. and C.J. Colbourn. (1986). Reliability Bounds for Networks with Statistical Dependence. Proceedings of INFOCOM′86, Miami, pages 290–292.
Chamberland, S. and B. Sansò. (1997). Sequential and Parallel Algorithms that Incorporate Reliability into the Joint Routing and Capacity Assignment Problem for Computer Networks. Journal of Networks and Systems Management, 5(2):131–157.
Chiou, S.-N. and V.O.K. Li. (1986). Reliability Analysis of a Communication Network with Multimode Components. IEEE Transactions on Selected Areas in Communications, SAC-4:1156–1161.
Colbourn, C.J. (1987). The Combinatorics of Network Reliability. Oxford University Press, Oxford and New York.
Colbourn, C.J. (1991). Network Reliability: Numbers or Insight? Annals of Operations Research, 33:87–93.
Colbourn, C. J., M. Elbert, E. Litvak and T. Weyant. (1992). Performability Analysis of Large-Scale Packet-Switching Networks. International Conference on Communications (SUPERCOMM/ICC), Chicago, pages 416–419.
Colbourn, C.J. and L.D. Nel. (1990). Using and Abusing Bounds for Network Reliability. Proceedings of IEEE Telecommunications Conference (Globecom ′90), IEEE Press, pages 663–667.
Devitt, J.S. and C.J. Colbourn. (1992). On Implementing an Environment for Investigating Network Reliability. In Computer Science and Operations Research, pages 159–173. Pergamon Press, New York, NY.
Elperin, T., I. Gertsbakh and M.V. Lomonosov. (1991). Network Reliability Estimation using Graph Evolution Models. IEEE Transactions on Reliability, R-40:572–581.
Fishman, G.S. (1986). A Comparison of Four Monte Carlo Methods for Estimating the Probability of (s,t)-Connectedness. IEEE Transactions on Reliability, R-35:145–155.
Frank, H. and W. Chou. (1974). Network Properties of the ARPA Computer Network. Networks, 4:213–239.
Frank, H. and LT. Frisch. (1971). Communication, Transmission and Transportation Networks, Addison-Wesley, Reading, MA.
Frank, H., R.E. Kahn and L. Kleinrock. (1972). Computer Communication Network Design — Experience with Theory and Practice. AFIPS Conference Proceedings, 40:255–270.
Gavish, B. and K. Altinkemer. (1990). Backbone Network Design Tools with Economic Tradeoffs. ORSA Journal on Computing, 2:236–252
Girard, A. and B. Sansò. (1998). Multicommodity Flow Models, Failure Propagation and Reliable Network Design. IEEE/ACM Transportations on Networking, 6(1):82–93.
Hansen, P., B. Jaumard and G.-B.D. Nguetsé. (1996). Best Second Order Bounds for Two-Terminal Network Reliability with Dependent Edge Failures. Les Cahiers du GERAD, G-94-01, École des Hautes Études Commerciales, Montréal.
Harms, D.D. and C.J. Colbourn. (1994). Evaluating Performability: Most Probable States and Bounds. Telecommunication Systems, 2:275–300.
Harms, D.D., M. Kraetzl, C.J. Colbourn and J.S. Devitt. (1995). Network Reliability: Experiments with a Symbolic Algebra Environment. CRC Press, Boca Raton FL.
Jarvis, J.P. and D.R. Shier. (1993). An Algorithm for Approximating the Performance of Telecommunications Systems. Proceedings of the Telecommunication Systems Conference, Nashville, TN.
Karger, D, (1995). A Randomized Fully Polynomial Time Approximation Scheme for the All Terminal Network Reliability Problem. Proceedings of the Symposium on Theory Com/put.
Karger, D. (1997). Implementing a Randomized Fully Polynomial Time Approximation Scheme for the All Terminal Network Reliability Problem. Proceedings of the Symposium on Discrete Algorithms.
Kubat, P. (1989). Estimation of Reliability for Communication/Computer Networks — Simulation/Analytic Approach. IEEE Transactions on Communications, COM-37:927–933.
Kubat, P., U. Sumita and Y. Masuda. (1988). Dynamic Performance Evaluation of Communication/Computer Systems with Highly Reliable Components. Prob. Eng. Inf. Sci., 2:185–213.
Lam, Y.F. and V.O.K. Li. (1986). Reliability Modeling and Analysis of Communications Networks with Dependent Failures. IEEE Transactions on Communications, COM-34:82–84.
Lam, Y.F. and V.O.K. Li. (1986a). An Improved Algorithm for Performance Analysis of Networks with Unreliable Components, IEEE Transactions on Communications, COM-34:496–497.
Li, V.O.K. and J.A. Silvester. (1984). Performance Analysis of Networks with Unreliable Components. IEEE Transactions on Communications, COM-32:1105–1110.
Meyer, J.F. (1992). Performability: A Retrospective and some Pointers to the Future. Performance Evaluation, 14:139–156.
Nel, L.D. and C.J. Colbourn. (1990). Combining Monte Carlo Estimates and Bounds for Network Reliability. Networks, 20:277–298.
Sansò, B., M. Gendreau and F. Soumis. (1992). An Algorithm for Network Dimensioning under Reliability Consideration. Annals of Operations Research, 36:263–274.
Sansò, B. and F. Soumis. (1991). Communication and Transportation Network Reliability using Routing Models. IEEE Transactions on Communications, COM-39:1494–1501.
Sansò, B., F. Soumis and M. Gendreau. (1991). On the Evaluation of Telecommunications Network Reliability using Routing Models. IEEE Transactions on Reliability, R-40:29–38.
Shier, D.R. (1988). A New Algorithm for Performance Analysis of Communication Systems. IEEE Transactions on Communications, COM-36:516–519.
Shier, D.R. (1991). Network Reliability and Algebraic Structures. Oxford University Press, Oxford and New York.
Shier, D.R. and J.D. Spragins. (1985). Exact and Approximate Dependent Failure Models for Telecommunications Networks. Proceedings of INFOCOM′85, pages 200–205.
Shier, D.R., E. Valvo and R. Jamison. (1992). Generating the States of a Binary Stochastic System. Discrete Applied Mathematics, 38:489–500.
Shier, D.R. and D.E. Whited. (1987). Algebraic Methods Applied to Network Reliability Problems. SIAM Journal on Algebraic Discrete Methods, 8:251–262.
Spragins, J.D., J.C, Sinclair, Y.J. Kang and H. Jafari. (1986). Current Telecommunication Network Reliability Models: A Critical Assessment. IEEE Transactions on Selected Areas in Communications, SAC-4:1168–1173.
Valvo, E.J., D.R. Shier and R.E. Jamison. (1987). Generating the Most Probable States of a Communication System. Proceedings of INFOCOM′87, pages 1128–1136.
Yang, C.-L. and P. Kubat. (1989). Efficient Computation of Most Probable States for Communication Networks with Multimode Components. IEEE Transactions on Communications, COM-37:535–538.
Yang, C.-L. and P. Kubat. (1990). An Algorithm for Network Reliability Bounds. ORSA Journal on Computing, 2:336–345.
Zemel, E. (1982). Polynomial Algorithms for Estimating Network Reliability. Networks, 12:439–452.
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer Science+Business Media New York
About this chapter
Cite this chapter
Colbourn, C.J. (1999). Reliability Issues In Telecommunications Network Planning. In: Sansò, B., Soriano, P. (eds) Telecommunications Network Planning. Centre for Research on Transportation. Springer, Boston, MA. https://doi.org/10.1007/978-1-4615-5087-7_8
Download citation
DOI: https://doi.org/10.1007/978-1-4615-5087-7_8
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4613-7314-8
Online ISBN: 978-1-4615-5087-7
eBook Packages: Springer Book Archive