next up previous contents
Next: List of Tables Up: MPLS_trees Previous: Contents   Contents


List of Figures

  1. Circuit switching
  2. Datagram packet switching
  3. Virtual circuit packet switching
  4. Position of the MPLS stack in the network protocol stack
  5. MPLS forwarding
  6. Nested MPLS domains
  7. Label distribution modes
  8. Multicast achieved through unicast
  9. Shortest path trees
  10. Center-based multicast routing tree
  11. Pre-planning backup paths in a multicast routing tree
  12. MPLS multicast routing tree
  13. Rerouting overview and terminology
  14. SONET self-healing ring: Unidirectional Path-Switched Ring architecture
  15. SONET self-healing ring: Bidirectional Link-Switched Ring architecture
  16. Intelligent Protection Switching with a Resilient Packet Ring
  17. Unicast Fast Reroute mechanism
  18. Network and multicast group model
  19. Link failure rate weight
  20. Protection of a tree from a link failure on the protected path with a backup path
  21. Weight $w$ and metrics $tdrop$ and $adrop$ for all links of a sample tree
  22. Proof of the algorithm
  23. Tree topology modification after a node leaves or joins a multicast group
  24. Computation of $R_d(A, B)$
  25. Worst case for Algorithm 1
  26. Worst case for Algorithm 2
  27. Worst case for Algorithm 3
  28. Multicast Label Switching Path examples
  29. Overview of MPLS multicast Fast Reroute
  30. Link failure detection mechanism
  31. Link failure detection time probability density function
  32. Link repair detection mechanism
  33. Link repair detection time probability density function
  34. Failure notification mechanism
  35. Backup label mappings
  36. Path followed by packets sent by $J$ after switchover
  37. Duplicate packets during switchback
  38. Processing of a packet in the MPLS layer with MPLS-Linux unicast
  39. Processing of a packet in the MPLS layer with MPLS-Linux multicast
  40. Mixed L2/L3 forwarding implementation
  41. General format of a MulTreeLDP message
  42. Description of a tree in a file and in a Explicit Route Tree TLV
  43. Advertisement of a multicast routing tree
  44. Link failure and recovery detection probe format
  45. Failure and recovery notification process
  46. Switchback and switchover
  47. MulTreeLDP header
  48. FEC TLV format
  49. FEC element format
  50. Label TLV format
  51. IPv4 node TLV format
  52. Explicit Route Tree TLV format
  53. New Branch TLV format
  54. End Branch TLV format
  55. Explicit Route Hop TLV format
  56. Routers TLV format
  57. Explicit Route Request message format
  58. Explicit Backup Route Request message format
  59. Label Request message format
  60. Backup Label Request message format
  61. Label Mapping message format
  62. Backup Label Mapping message format
  63. Link Failure Notification message format
  64. Link Recovery Notification message format
  65. The Indra testbed
  66. Setup of the network used during the experiments
  67. Topology of the network used to measure the performance of the MPLS-Linux multicast implementation
  68. Experimental setup for determining the link failure and recovery detection times
  69. Experimental distribution of the link failure detection time
  70. Experimental distribution of the link recovery detection time
  71. Experimental distribution of the link recovery detection time (adjusted model).
  72. Experimental setup for determining the link failure and recovery notification delays
  73. Experimental distribution of the node notification delay
  74. Switchover and switchback in the multicast routing tree setup on our testbed
  75. Experimental distribution of the repair time
  76. Traffic received by PC5 when the tree sustains a failure and a recovery (packets of 8192 bytes)
  77. Traffic received by PC6 when the tree sustains a failure and a recovery (packets of 8192 bytes)
  78. Switchover on PC5 (packets of 8192 bytes)
  79. Switchover on PC6 (packets of 8192 bytes)
  80. Switchback on PC5 (packets of 8192 bytes)
  81. Switchback on PC6 (packets of 8192 bytes)
  82. Traffic received by PC5 when the tree sustains a failure and a recovery (packets of 1024 bytes)
  83. Traffic received by PC6 when the tree sustains a failure and a recovery (packets of 1024 bytes)
  84. Switchback on PC5 (packets of 1024 bytes)
  85. Switchback on PC6 (packets of 1024 bytes)


Yvan Pointurier 2002-08-11