Loading [MathJax]/extensions/MathMenu.js
Recovery techniques in next generation networks | IEEE Journals & Magazine | IEEE Xplore

Recovery techniques in next generation networks


First Page of the Article

Published in: IEEE Communications Surveys & Tutorials ( Volume: 9, Issue: 3, Third Quarter 2007)
Page(s): 2 - 17
Date of Publication: 24 September 2007

ISSN Information:

First Page of the Article

References is not available for this document.

I. Basics of NGNs Recovery

For creating the NGNs, International Telecommunication Union (ITU) and Internet Engineering Task Force (IETF) have standardized Automatically Switched Optical Networks (ASON) and Generalized Multi-Protocol Label Switching (GMPLS) specifications, respectively.

Select All
1.
Z. Rosberg, "Performance Analyses of Optical Burst-Switching Networks", IEEE JSAC, vol. 21, no. 7, pp. 1187-1197, Sept. 2003.
2.
W. Goralski, Optical Networking WDM, McGraw-Hill, June 2001.
3.
2000, [online] Available: http://www.cisco.com/ univercd/cc/td/doc/product/mels/cm1500/dwdm/index.htm.
4.
[online] Available: http://www.xilinx.com/esp/wired/optical/collateral/WDM.pdf.
5.
R. Ramaswami and K. N. Sivarajan, Optical Networks: A Practical Perspective, USA, San Francisco:Morgan Kaufmann Publishers, Inc., 1998.
6.
H. Zhang and O. Yang, "Finding Protection Cycles in DWDM Networks", Proc. IEEE IC02, vol. 5, pp. 2756-2760, 2002-Apr.-May.
7.
G. E. Keiser, FTTX Concepts and Applications, Wiley-IEEE Press, Jan. 2006.
8.
W. Molisz, "Survivability Function A Measure of Disaster-Based Routing Performance", IEEE JSAC, vol. 22, no. 9, pp. 1876-1883, Nov. 2004.
9.
W. D. Grover, Mesh-Based Survivable Networks Options and Strategies for Optical MPLS SONET and ATM Networking, NJ, Upper Saddle River:Prentice Hall PTR, 2004.
10.
S. Ramamurthy, L. Sahasrabuddhe and B. Mukherjee, "Survivable WDM Mesh Networks", IEEE J. Lightwave Technology, vol. 21, no. 4, pp. 870-883, Apr. 2003.
11.
B. S. Davie and Y. Rekhter, MPLS: Technology and Applications, USA, San Francisco:Morgan Kaufmann Publishers, 2000.
12.
A. Jajszczyk and P. Rozycki, "Recovery of the Control Plane after Failures in ASON/GMPLS Networks", IEEE Network, pp. 4-10, Jan.-Feb. 2006.
13.
N. Larkin, ASON and GMPLS-The Battle of the Optical Control Plane An Overview of the Ongoing Work of IETF and ITU to Standardize Optical Control Plane Protocols, Aug. 2004, [online] Available: http://www.dataconnection.com/network/download/whitepapers/asongmpls.pdf.
14.
J. P. Lang and J. Drake, "Mesh Network Resiliency Using GMPLS", Proc. IEEE, vol. 90, no. 9, pp. 1559-1564, Sept. 2002.
15.
D. Xu, "Trap Avoidance and Protection Schemes in Networks with Shared Risk Link Groups", J. Lightwave Technology, vol. 20, no. 11, pp. 2683-2693, Nov. 2003.
16.
A. Farrel, The Internet and Its Protocols: A Comparative Approach, Morgan Kaufmann, 2004.
17.
J. Wu, M. Savoie and H. Mouftah, "Recovery from Control Plane Failures in LDP Signaling Protocol", Elsevier Optical Switching and Networking, vol. 2, pp. 148-162, Aug. 2005.
18.
J. Wu, "Recovery from Control Plane Failures in the CR-LDP Signaling Protocol", Proc. Design of Reliable Communication Networks, pp. 139-146, 2003-Oct.
19.
R. Diestel, Graph Theory, Springer-Verlag, 2005, [online] Available: http://www.math.unihamburg.de/home/diestel/books/ graph.theory/GraphTheoryIII.pdf, http://www1.cs.columbia.edu/ sanders/graphtheory/writings/books.html and http://en. wikipedia.org/wiki/Graph_theory.
20.
J. S. Whalen and J. Kenney, "Finding Maximal Link Disjoint Paths in a Multigraph", Proc. IEEE GLOBECOM 90, vol. 1, pp. 470-474, 1990-Dec.
21.
M. R. Garey and D. S. Johnson, Computers and Intractability, USA:W. H. Freeman and Company, 1979.
22.
M. Serra and K. Kent, "Using FPGAs to solve the Hamiltonian Cycle Problem", Proc. Intl. Symp. Circuits and Systems ISCAS 03, vol. 3, pp. 228-231, 2003-May.
23.
K. Menger, Zur allgemeinen kurventheorie, pp. 96-15, 1927.
24.
E. W. Weisstein, Mengers n-Arc Theorem, [online] Available: http://mathworld.wolfram.com/Mengersn-ArcTheorem.html.
25.
M. Stoer, "Design of Survivable Networks" in lecture Notes in Mathematics, Springer-Verlag, 1992.
26.
A. Kvalbein, "Resilient Routing Layers for Recovery in Packet Networks", Proc. Intl. Conf. Dependable Systems and Networks DSN05, pp. 238-247, 2005-June-July.
27.
A. Medina, "BRITE: An Approach to Universal Topology Generation", Proc. 9th Intl. Symp. Modeling Analysis and Simulation of Computer and Telecommunication Systems, pp. 346-353, 2001-Aug., [online] Available: http://www.cs.bu.edu/brite/index.html.
28.
R. Mahajan, Rocketfuel: An ISP Topology Mapping Engine, 2002, [online] Available: http://www.cs.washington.edu/research/networking/rocketfuel/.
29.
H. Tangmunarunkit, "Network Topology Generators: Degree-Based vs. Structural", Proc. ACM SIGCOMM02, pp. 147-159, 2002-Aug.
30.
E. W. Zegura, K. L. Calvert and M. J. Donahoo, "A Quantitative Comparison of Graph-Based Models for Internet Topology", IEEE/ACM Trans. Net., vol. 5, no. 6, pp. 770-783, Dec. 1997.

Contact IEEE to Subscribe

References

References is not available for this document.