[Teas] Re: [Green] Power Aware Traffic Engineering

[Tony Li <[e-mail]>]

[Again redirecting to TEAS, GREEN to bcc]


Hi Robert,

> > This is a distributed computation.  Each node can see reservations 
> > in each direction and can work to consolidate traffic.
> 
> I am struggling to understand how it works. 
> 
> Let's say this is a 1000 node network. For simplicity let's assume 900 are edge routers and 100 are core routers. Those 100  core routers are interconnected with 250 links. 
> 
> How are you correlating between 900 edge nodes on which link (or links) from among the 250  in the core they need to dry out traffic in a bidirectional fashion in a fully distributed manner ? 


Each node can see the power consumption of each link.  Each node can see the traffic reservations on each link.  Each node is motivated to consolidate traffic on links that consume less power or are not power save capable.


> Assume TE LSPs are setup edge to edge. And let's for simplicity also assume there is 100% of unicast TE traffic (even if most of them would go over default SPF path and travel via TE LSPs for accounting) and no multicast.  


Compute a path from source to destination.  Prefer links that are not power-sleep capable or have lower power requirements. Prefer links that have some other traffic on them (but not enough to result in congestion). 

Regards,
Tony