Green Optical Networks  with Signal Quality      Guarantee             João Rosa            Maria Stylianou             Za...
Outline●   Introduction●   Problem description●   ILP model●   Heuristic●   Solution comparison●   Conclusions●   Possible...
1Introduction● Optimization is directly related to efficiency.● Problem with power consumed by  communication networks.   ...
2Problem description● Concern about rising energy consumption  and therefore costs of communication  networks.● Energy eff...
3Problem description● In this project we try to minimize:   ○ Number of links on a path.   ○ Energy consumption of a path....
4Environment Example   X1      OA           OA         OA   X2                  ...   Tx                                  ...
5Our Contribution● ILP Model - CPLEX● Heuristic Algorithm (Fasty)● Comparison
6ILP modelSets                          Variables● N: Set of Nodes             ● X[n]: 1 if node n is● L: Set of Links    ...
7ILP model● Objective functionCumulative        Cumulative    Cumulative energyenergy of links   energy of     consumed by...
8ILP model                 For each demand, only one● Constraints:   wavelength can be used in                 all paths
9ILP model● Constraints:                 A wavelength in a path                 can be used only if the                 sa...
10ILP model● Constraints:                 For each link e, ensure that                 the number of wavelengths          ...
11ILP model● Constraints:                 Number of links used by a                 node is less or equal to              ...
12 Heuristic (Fasty)● Own Implementation --> Works like a charm ;)  ○ Code in C  ○ Argument: same data file from CPLEX● Go...
13 Heuristic (Fasty)Greedy Approach for choosing the "right" path  Demand #1 --> satisfied by 1-2-3-4 using λ1  Demand #2 ...
14Solution comparison● Execution time● Optimal solution comparison● Additional power consumption
15Execution time
16Optimal solution comparison                              Limited                              increase
17Additional power consumption                           Heuristic with 8                           demands.              ...
18Conclusions● CPLEX is much slower than the Fasty  heuristic algorithm.● Power increases as the demands increase  but onl...
19Possible future work● Test with larger tables/sets:   ○ Demand-path set.   ○ Path-link set.● Test on multiple network gr...
Green Optical Networks  with Signal Quality      Guarantee             João Rosa            Maria Stylianou             Za...
Upcoming SlideShare
Loading in...5
×

Cano projectGreen Optical Networks with Signal Quality Guarantee

269

Published on

Course: Communication Networks Optimization (UPC)

Published in: Technology
0 Comments
0 Likes
Statistics
Notes
  • Be the first to comment

  • Be the first to like this

No Downloads
Views
Total Views
269
On Slideshare
0
From Embeds
0
Number of Embeds
1
Actions
Shares
0
Downloads
2
Comments
0
Likes
0
Embeds 0
No embeds

No notes for slide

Cano projectGreen Optical Networks with Signal Quality Guarantee

  1. 1. Green Optical Networks with Signal Quality Guarantee João Rosa Maria Stylianou Zafar Gilani CANO - Communication Networks Optimization 2012
  2. 2. Outline● Introduction● Problem description● ILP model● Heuristic● Solution comparison● Conclusions● Possible future work
  3. 3. 1Introduction● Optimization is directly related to efficiency.● Problem with power consumed by communication networks. ○ Optical networks partially resolve the problem by being better at consumption. ○ But need to consider improvements from other related issues (such as efficient routing).
  4. 4. 2Problem description● Concern about rising energy consumption and therefore costs of communication networks.● Energy efficient strategies are required for network design provisioning that supports both static and dynamic routing.
  5. 5. 3Problem description● In this project we try to minimize: ○ Number of links on a path. ○ Energy consumption of a path.● We accomplish this by making improvements in dynamic routing by consideration of: ○ Most economical links ○ Shortest path ○ Lowest power consumption ○ Reusing links or partial paths
  6. 6. 4Environment Example X1 OA OA OA X2 ... Tx Tx X1,X2: Nodes Tx: Transponder OA OA w1...wn OA: Optical Amplifier w1...wn: Wavelengths
  7. 7. 5Our Contribution● ILP Model - CPLEX● Heuristic Algorithm (Fasty)● Comparison
  8. 8. 6ILP modelSets Variables● N: Set of Nodes ● X[n]: 1 if node n is● L: Set of Links used● P: Set of Paths ● E[e]: 1 if link e is used● W: Set of Wavelengths ● Xs[p,w]: 1 if wavelength w for pathConstants p is used● oe: #Optical Amplifiers (OA) ● y[e,w]: 1 if link e and wavelength w is used● eoa:Energy for 1 OA ● h[p]: # hops for each● en: Energy for 1 node path p● ew: Energy for 1 wavelength
  9. 9. 7ILP model● Objective functionCumulative Cumulative Cumulative energyenergy of links energy of consumed byused. nodes used. wavelengths used, hops traversed and nodes used over path p for demand d.
  10. 10. 8ILP model For each demand, only one● Constraints: wavelength can be used in all paths
  11. 11. 9ILP model● Constraints: A wavelength in a path can be used only if the same wavelength is used in the link
  12. 12. 10ILP model● Constraints: For each link e, ensure that the number of wavelengths used does not exceed the maximum number of wavelengths allowed
  13. 13. 11ILP model● Constraints: Number of links used by a node is less or equal to number of links of a node
  14. 14. 12 Heuristic (Fasty)● Own Implementation --> Works like a charm ;) ○ Code in C ○ Argument: same data file from CPLEX● Goal: Satisfy all demands with the minimum power. ○ Minimum Power --> minimum links, nodes, wavelengths used● IDEA: Choose randomly a demand ○ Find all possible paths ○ Keep the path with the least power consumption added
  15. 15. 13 Heuristic (Fasty)Greedy Approach for choosing the "right" path Demand #1 --> satisfied by 1-2-3-4 using λ1 Demand #2 --> satisfied by ? λ1 λ2 1 2 1 2 λ1 λ1 λ1 λ1 λ2 λ1 4 3 4 3 λ1 λ2
  16. 16. 14Solution comparison● Execution time● Optimal solution comparison● Additional power consumption
  17. 17. 15Execution time
  18. 18. 16Optimal solution comparison Limited increase
  19. 19. 17Additional power consumption Heuristic with 8 demands. No additional power consumption for D5 after satisfying D2. Similar case for D3, D0, D6 and D4.
  20. 20. 18Conclusions● CPLEX is much slower than the Fasty heuristic algorithm.● Power increases as the demands increase but only to a certain limit, as used links are reused.● For a given network graph, the heuristic satisfies one demand after the other in such a way as to reduce the cost in terms of power consumed and path length. ○ Effective decrease in power used ○ .. with each new demand.
  21. 21. 19Possible future work● Test with larger tables/sets: ○ Demand-path set. ○ Path-link set.● Test on multiple network graphs. ○ Different topologies. ○ Various routes.
  22. 22. Green Optical Networks with Signal Quality Guarantee João Rosa Maria Stylianou Zafar Gilani CANO - Communication Networks Optimization 2012
  1. A particular slide catching your eye?

    Clipping is a handy way to collect important slides you want to go back to later.

×