Skip to main content
Log in

Some approaches to solving a multihour broadband network capacity design problem with single-path routing

  • Published:
Telecommunication Systems Aims and scope Submit manuscript

Abstract

In this paper, we consider solution approaches to a multihour combined capacity design and routing problem which arises in the design of dynamically reconfigurable broadband communication networks that uses the virtual path concept. We present a comparative evaluation of four approaches, namely: a genetic algorithm, a Lagrangian relaxation based subgradient optimization method, a generalized proximal point algorithm with subgradient optimization, and, finally, a hybrid approach where the subgradient based method is combined with a genetic algorithm. Our computational experience on a set of test problems of varying network sizes services) shows that the hybrid approach often is the desirable choice in obtaining the minimum cost network while the genetic algorithm based approach has the most difficulty in solving large scale problems.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. E.J. Anderson and M.C. Ferris, Genetic algorithms for combinatorial optimization: The assembly line balancing problem, ORSA Journal on Computing 6 (1994) 161–173.

    Google Scholar 

  2. A. Arvidsson, Management of reconfigurable virtual path networks, in: Proc. of the 14th Internat. Teletraffic Congress, Antibes, France (June 1994) pp. 931–940.

  3. G.R. Ash, R.H. Cardwell and R.P. Murray, Design and optimization of networks with dynamic routing, Bell Systems Technical Journal 60(8) (1981) 1787–1820.

    Google Scholar 

  4. G.R. Ash, A.H. Kafker and K.R. Krishnan, Servicing and real-time control of networks with dynamic routing, Bell Systems Technical Journal 60 (1981) 1821–1845.

    Google Scholar 

  5. D. Bertsekas and R. Gallager, Data Networks, 2nd ed. (Prentice-Hall, Englewood Cliffs, NJ, 1992).

    Google Scholar 

  6. D. Bertsekas and J. Tsitsiklis, Parallel and Distributed Computation: Numerical Methods (Prentice-Hall, Englewood Cliffs, NJ, 1989).

    Google Scholar 

  7. J. Burgin, Broadband ISDN resource management, Computer Networks & ISDN Systems 20 (1990) 323–331.

    Article  Google Scholar 

  8. CPLEX linear optimizer 4.0.3 with mixed integer solver; available at: www.cplex.com.

  9. S.C. Dafermos, An extended traffic assignment model with application to two-way traffic, Transportation Science 5 (1971) 366–389.

    Google Scholar 

  10. R. Dembo and J. Klincewicz, A scaled reduced gradient algorithm for network flow problems with convex separable costs, Mathematical Programming Study 15 (1981) 125–147.

    Google Scholar 

  11. M. De Prycker, ATM switching on demand, IEEE Network 6(2) (1992) 25–28.

    Article  Google Scholar 

  12. A. Dutta, Capacity planning of private networks using dcs under multibusy-hour traffic, IEEE Transactions on Communications 42 (1994) 2371–2374.

    Article  Google Scholar 

  13. A. Dutta and J.-I. Lim, A multi-period capacity planning model for backbone computer communication networks, Operations Research 40 (1992) 689–705.

    Google Scholar 

  14. M. Eisenberg, Engineering traffic networks for more than one busy hour, Bell Systems Technical Journal 56 (1977) 1–20.

    Google Scholar 

  15. R. Elbaum and M. Sidi, Topological design of local area networks using genetic algorithms, in: Proc. of IEEE Conf. on Computer Communications (INFOCOM'95), Boston, MA (April 1995) pp. 64–71.

  16. W.B. Elsner, A descent algorithm for the multihour sizing of traffic networks, Bell Systems Technical Journal 56 (1977) 1405–1429.

    Google Scholar 

  17. J.M. Farvolden, W.B. Powell and I.J. Lustig, A primal partitioning solution for the arc-chain formulation of a multi-commodity network flow problem, Operations Research 41 (1993) 669–693.

    Article  Google Scholar 

  18. M. Florian and S. Nguyen, A Method for computing network equilibrium with elastic demand, Transportation Science 8 (1974) 321–332.

    Google Scholar 

  19. L. Fratta, M. Gerla and L. Kleinrock, The flow deviation method: An approach to store-and-forward computer communication network design, Networks 3 (1973) 97–133.

    Google Scholar 

  20. B. Gavish and S. Hantler, An algorithm for optimal route selection in SNA networks, IEEE Transactions on Communications 31 (1983) 1154–1161.

    Article  Google Scholar 

  21. B. Gavish and I. Newman, Capacity and flow assignment in large computer networks, in: Proc. of IEEE INFOCOM'86 (1986) pp. 275–284.

  22. B. Gavish and I. Neumann, A system for routing and capacity assignment in computer communications networks, IEEE Transactions on Communications 37 (1989) 360–366.

    Article  Google Scholar 

  23. B. Gavish and I. Newman, Routing in a network with unreliable components, IEEE Transactions on Communications 40 (1992) 1249–1258.

    Article  Google Scholar 

  24. M. Gerla, J.A. Suruagy Monteiro and R. Pazos, Topology design and bandwidth allocation in ATM nets, Journal on Selected Areas in Communications 7 (1989) 1253–1262.

    Article  Google Scholar 

  25. A. Girard, Routing and Dimensioning in Circuit-Switched Networks (Addison-Wesley, Reading, MA, 1990).

    Google Scholar 

  26. D.E. Goldberg, Genetic Algorithms in Search, Optimization, and Machine Learning (Addison-Wesley, Reading, MA, 1989).

    Google Scholar 

  27. C.D. Ha, A generalization of the proximal point algorithm, SIAM Journal of Control and Optimization 28 (1990) 503–512.

    Article  Google Scholar 

  28. M. Held, P. Wolfe and H. Crowder, Validation of subgradient optimization, Mathematical Programming 6 (1974) 62–88.

    Article  Google Scholar 

  29. P. Jog, J.Y. Suh and D. Van Gucht, Parallel genetic algorithms applied to the travelling salesman problem, SIAM Journal on Optimization 1 (1991) 515–529.

    Article  Google Scholar 

  30. J. Hui, M. Gursoy, N. Moayeri and R. Yates, A layered broadband switching architecture with physical or virtual path configurations, IEEE Journal on Selected Areas in Communications 9 (1991) 1416–1425.

    Article  Google Scholar 

  31. S. Lanphongpanich and D. Hearn, Simplical decomposition of the assymetric traffic assignment problem, Transportation Research 18 B (1984) 891–904.

    Google Scholar 

  32. E.L. Lawler, Combinatorial Optimization: Networks and Matroids (Holt, Rinehart and Winston, New York, 1976).

    Google Scholar 

  33. D.N. Lee, K.T. Medhi, J. Strand, R. Cox and S. Chen, Solving large telecommunications network loading problems, AT&T Technical Journal 68(3) (1989) 48–56.

    Google Scholar 

  34. F.Y.S. Lin and J.R. Yee, A new multiplier adjustment procedure for the distributed computation of routing assignments in virtual circuit data networks, ORSA Journal on Computing 4 (1992) 250–266.

    Google Scholar 

  35. M. Logothetis and S. Shioda, Centralized virtual path bandwidth allocation scheme for ATM network, IEICE Transactions on Communications E 75-B(10) (1992) 1071–1080.

    Google Scholar 

  36. H. Luss, Operations research and capacity expansion problems: A survey, Operations Research 30 (1982) 907–947.

    Google Scholar 

  37. D. Medhi, A unified approach to network survivability for teletraffic networks: Models, algorithms and analysis, IEEE Transactions on Communications 42 (1994) 534–548.

    Article  Google Scholar 

  38. D. Medhi, Multi-hour, multi-traffic class network design for virtual path-based dynamically reconfigurable wide-area ATM networks, IEEE/ACM Transactions on Networking 3 (1995) 809–818.

    Article  Google Scholar 

  39. D. Medhi, Models for network design, servicing and monitoring of ATM networks based on the virtual path concept, Computer Networks & ISDN Systems 29(3) (1997) 373–386.

    Article  Google Scholar 

  40. D. Medhi and C.D. Ha, Generalized proximal point algorithm for convex optimization, Journal of Optimization Theory and Applications 88(2) (1996) 475–488.

    Article  Google Scholar 

  41. M. Minoux, Mathematical Programming – Theory and Algorithms (Wiley, Chichester, 1986).

    Google Scholar 

  42. H. Mühlenbein, Parallel genetic algorithms in combinatorial optimization, in: Computer Science and Operations Research: New Developments in their Interfaces, eds. O. Balci, R. Sharda and S. Zenios (Pergamon, 1992) pp. 441–453.

  43. T.M. Ng and D.B. Hoang, Joint optimization of capacity and flow assignment in a packet-switched communications network, IEEE Transactions on Communications 35 (1987) 202–209.

    Article  Google Scholar 

  44. K.E. Nygard and C.-H. Yang, Genetic algorithms for the traveling salesman problem with time windows, in: Computer Science and Operations Research: New Developments in their Interfaces, eds. O. Balci, R. Sharda and S. Zenios (Pergamon, 1992) pp. 411–423.

  45. W. Oettli and W. Prager, Optimal and suboptimal capacity allocation in communication networks, Journal of Optimization Theory and Applications 8 (1971) 396–411.

    Article  Google Scholar 

  46. M. Pioro and B. Wallstrom, Multihour optimization of non-hierarchical circuit-switched communication networks with sequential routing, in: 11th Internat. Teletraffic Congress (1985).

  47. R.T. Rockafellar, Augmented Lagrangian and applications of the proximal point algorithm in convex programming, Mathematics of Operations Research 1 (1976) 97–116.

    Google Scholar 

  48. E. Rolland and H. Pirkul, Heuristic solution procedures for the graph partioning problem, in: Computer Science and Operations Research: New Developments in their Interfaces, eds. O. Balci, R. Sharda and S. Zenios (Pergamon, 1992) pp. 475–490.

  49. E. Rosenberg, A nonlinear programming heuristic for computing optimal link capacities in a multihour alternate routing communications network, Operations Research 35 (1987) 354–367.

    Google Scholar 

  50. R. Siebenhaar, Optimized ATM virtual path bandwidth management under fairness constraints, in: Proc. of IEEE GLOBECOM'94 (December 1994) pp. 924–928.

  51. R.L. Smith, Deferral strategies for a dynamic communication network, Networks 9 (1979) 61–87.

    Google Scholar 

  52. W. Stallings, ISDN and Broadband ISDN with Frame Relay and ATM, 3rd ed. (Prentice-Hall, Englewood Cliffs, NJ, 1995).

    Google Scholar 

  53. B. Yaged, Minimum cost routing for dynamic network models, Networks 3 (1973) 193–224.

    Google Scholar 

  54. N. Zadeh, On building minimum cost communications network over time, Networks 4 (1974) 19–34.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Medhi, D., Tipper, D. Some approaches to solving a multihour broadband network capacity design problem with single-path routing. Telecommunication Systems 13, 269–291 (2000). https://doi.org/10.1023/A:1019148207669

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1019148207669

Keywords

Navigation