Abstract
We study the complexity of computing a route in a hierarchical PNNI network, with H levels of hierarchy, in which N nodes are grouped into clusters at each level. We determine cluster sizes that minimize an upper bound on the total time for all the path computations required to compute a route. Our model casts the problem as a nonlinear convex optimization problem, and employs nonlinear duality theory. We derive explicit closed form upper bounds on the minimum total path computation time, as a function of N, for H=2 and H=3, and show how the upper bound, and the optimal cluster sizes, can be computed for any H. We provide a conjecture on the complexity of PNNI routing for any H, and use this conjecture to determine the limit of the complexity as H→∞. We also prove that the minimum total path computation time is a non-increasing function of H. Our results provide counterexamples to a claim by Van Mieghem that a related top-down hierarchical routing method has lower computational complexity.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Ahuja RK, Magnanti TL, Orlin JB (1993) Network flows. Prentice-Hall, Englewood Cliffs
Ash J, Choudhury G (2004) PNNI routing congestion control. IEEE Commun Mag 154–160
Duffin RJ (1970) Linearizing geometric programs. SIAM Rev 12:211–227
Duffin RJ, Petersen EL, Zener C (1967) Geometric programming. Wiley, New York
Gill PE, Murray W, Wright MH (1981) Practical optimization. Academic Press, New York
Iliadis I (2004) Optimal PNNI complex node representations for restrictive costs. Comput Commun 27:434–446
Kleinrock L, Kamoun F (1977) Hierarchical routing for large networks: performance evaluation and optimization. Comput Netw 1:155–174
Kleinrock L, Kamoun F (1980) Optimal clustering structures for hierarchical topological design of large computer networks. Networks 10:221–248
Lai WS, Rosenberg E, Amiri L, Ball M, Levy Y, Shulman H, Tong H, Ungar M (2005) Analysis and design of AT&T’s global PNNI network. In: Proc of IEEE Pacific Rim conference on communications, computers, and signal processing (PacRim 2005), August 2005, pp 129–132
Lai WS, Amiri L, Ball M, Rosenberg E, Tong H (2006) The scalable growth of AT&T’s global PNNI network. In: Proc of 2006 symposium on performance evaluation of computer and telecommunication systems (SPECTS 2006), Calgary, Alberta, Canada, 31 July–2 August 2006, pp 363–370
Lai WS, Amiri L, Ball M, Jones D, Rosenberg E, Ungar M (2007) Topology aggregation in PNNI networks, part 1: link aggregation. In: Proc of IEEE Pacific Rim conference on communications, computers, and signal processing (PacRim 2007), 22–24 August 2007, pp 8–11
Masip-Bruin X, Sánchez-López S, Solé-Pareta J, Domingo-Pascual J, Marin-Tordera E (2004) Hierarchical routing with QoS constraints in optical transport networks. In: Lecture notes in computer science, vol 3042. Springer, Heidelberg, pp 662–674
Moy JT (1998) OSPF: anatomy of an Internet routing protocol. Addison-Wesley, Reading
Orda A, Sprintson A (2003) Precomputation schemes for QoS routing. IEEE/ACM Trans Netw 11:578–591
Private network-network interface specification version 1.1 (2002) The ATM Forum Technical Committee. af-pnni-0055.002, April 2002
Rockafellar RT (1970) Convex analysis. Princeton University Press, Princeton
Rosenberg E (1981a) Globally convergent algorithms for convex programming. Math Oper Res 6:437–444
Rosenberg E (1981b) On solving a primal geometric program by partial dual optimization. Math Program 21:319–330
Rosenberg E (1982) A globally convergent condensation method for geometric programming. Utilitas Math 22:47–64
Rosenberg E (2008) Error bounds for hierarchical routing. In: Raghavan S, Golden B, Wasil E (eds) Telecommunications modeling, policy, and technology, Chap 5. Springer, New York, pp 81–100
Rosenberg E (2009) Minimizing hierarchical routing error. Comput Netw 53:1926–1938
Rougier JL, Kofman D, Gravey A (2000) Optimization of hierarchical routing protocols. Perform Evaluation 41:227–245
Sánchez-López S, Solé-Pareta J, Comellas J, Soldatos J, Kylafas G, Jaeger M (2003) PNNI-based control plane for automatically switched optical networks. J Lightwave Technol 21:2673–2682
Simonnard M (1966) Linear programming, translated by WS Jewell. Prentice-Hall, Englewood Cliffs
Stewart JW (1999) BGP4: Inter-domain routing in the Internet. Addison-Wesley, Reading
Van Mieghem P (1997) Estimation of an optimal PNNI topology. In: Proc of IEEE ATM’97 workshop, Lisbon, Portugal, 26–28 May 1997
Van Mieghem P (1998) Routing in a hierarchical structure. In: Proc of the first IEEE internat conf on ATM: ICATM ’98, June 1998, Colmar, France, pp 378–384
Van Mieghem P (1999) Topology information condensation in hierarchical networks. Comput Netw 31:2115–2137
Wilde DJ (1978) Globally optimal design. Wiley, New York
Wu X, Murkerjee B, Ghosal D (2004) Hierarchical architectures in the third-generation cellular network. IEEE Wirel Mag 11:62–71
Zener C (1971) Engineering design by geometric programming. Wiley, New York
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Rosenberg, E. The complexity of routing in hierarchical PNNI networks. Optim Eng 11, 277–302 (2010). https://doi.org/10.1007/s11081-009-9088-0
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11081-009-9088-0