Previous

Content

Next 


3.3.- TT Properties  

Google
Basic properties of TTs are:
  1. A TT is an "aggregate" of traffic flows belonging to the same class. In some context the definition could include multi-class traffic aggregate.
     
  2. Having a single class service model (for example, best effort) a TT could encapsulate all traffic between an ingress and an egress LSRs, or subsets thereof.
     
  3. TTs are routable objects.
     
  4. TTs are not LSPs. TTs can be moved from one LSP onto another.
     
  5. TTs are unidirectional.
Bidirectional TTs (BTTs)
 
When two TTs are logically coupled, one TT, called the forward TT, carries traffic from an originating node to a destination node. The other TT, called the backward TT, carries traffic from the destination node to the originating node. This set is called a BTT if the following conditions hold:
 
  1. Both TTs are instantiated through an atomic action at one LSR called the originator node, or through an atomic action at a network management station.
     
  2. Neither of the composite TTs can exist without the other. Both are instantiated and destroyed together.
A BTT is "topologically symmetric" if its constituent TTs are routed through the same physical path, and it is "topologically asymetric" if its components are routed through different physical paths.
 
Basic operation on TTs
 
  1. Establish: to create an instance of a TT.
     
  2. Activate: to cause a TT to start passing traffic. Establishment and Activation are logically separated events. However, they may be implemented as one atomic action.
     
  3. Deactivate: to cause a TT to stop passing traffic.
     
  4. Modify Attributes: to cause the attributes of a TT to be modified.
     
  5. Reroute: to cause a TT to change its route. This can be done through administrative action or automatically by the underlying protocol.
     
  6. Destroy: to remove an instance of a TT from the network and reclaim all resources allocated to it.
 
   

 


   


Previous

Content

Next