2012 IEEE Global Communications Conference (GLOBECOM) 2012
DOI: 10.1109/glocom.2012.6503651
|View full text |Cite
|
Sign up to set email alerts
|

Scalability and power consumption of static optical core networks

Abstract: Abstract-A large amount of traffic in core networks is highly aggregated and core nodes are interconnected by high-capacity links. Thus, most of the traffic demands in the core area can be accommodated by providing more or less static connections between ingress and egress nodes. In this paper, we describe and study three particular realizations of static optical core networks and compare them with the dynamic, packet switched architecture based on wavelength-division multiplexing (WDM) transmission and conven… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1

Citation Types

0
3
0

Year Published

2013
2013
2015
2015

Publication Types

Select...
2
1
1

Relationship

2
2

Authors

Journals

citations
Cited by 4 publications
(3 citation statements)
references
References 15 publications
(12 reference statements)
0
3
0
Order By: Relevance
“…Methods for minimizing energy consumption in the WDM based transport architectures are presented in [7]. Particular realizations of static optical core networks are compared with the dynamic packet switched architecture based on the WDM in [8]. Survey of the most relevant research efforts considering backbone networks power consumption reduction is given in [9].…”
Section: Related Workmentioning
confidence: 99%
“…Methods for minimizing energy consumption in the WDM based transport architectures are presented in [7]. Particular realizations of static optical core networks are compared with the dynamic packet switched architecture based on the WDM in [8]. Survey of the most relevant research efforts considering backbone networks power consumption reduction is given in [9].…”
Section: Related Workmentioning
confidence: 99%
“…Similarly to [6] we define the mesh degree M of a network as the ratio of the average node degree of the network under consideration, d, and the node degree of a full-mesh network having the same number of nodes as the considered network, i.e., d mesh =N−1, so we get M = and (c) eventually add these links distributed evenly across the ring (connecting the most-distant nodes, based on the hop count, first). Note that the number of links in such a half-mesh network is given by…”
Section: A Topologiesmentioning
confidence: 99%
“…A similar problem has been faced in our previous work [5], where simulations and an analytical model were used for the power consumption evaluation of bypass and non-bypass scenarios. In the line of these studies, an analytical model based on expectation values has been also developed in [6], where different variations of the optical bypass strategy are evaluated under different mesh degree scenarios, i.e., from a ring up to full-mesh topologies. Capital Expenditure (CapEx) minimized and power minimized networks designed with an ILP and a genetic algorithm have been considered in our previous work [7].…”
Section: Introductionmentioning
confidence: 99%