2011
DOI: 10.1016/j.comnet.2010.10.013
|View full text |Cite
|
Sign up to set email alerts
|

Multi-hour network planning based on domination between sets of traffic matrices

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
11
0

Year Published

2013
2013
2024
2024

Publication Types

Select...
5
1
1

Relationship

0
7

Authors

Journals

citations
Cited by 9 publications
(11 citation statements)
references
References 21 publications
0
11
0
Order By: Relevance
“…Besides, it has been observed that traffic variation along a given period of time (typically days or weeks) tends to be periodic, making the expected traffic load in a network fairly predictable [56]. Hence, RSA schemes with expansion/contraction features can be better designed having some knowledge of the (expected) traffic fluctuations profile.…”
Section: Time-varying Trafficmentioning
confidence: 99%
“…Besides, it has been observed that traffic variation along a given period of time (typically days or weeks) tends to be periodic, making the expected traffic load in a network fairly predictable [56]. Hence, RSA schemes with expansion/contraction features can be better designed having some knowledge of the (expected) traffic fluctuations profile.…”
Section: Time-varying Trafficmentioning
confidence: 99%
“…The goal is to meet optimization objectives jointly for a set of varying traffic demands that are predictable and periodic along some time period (such as the day or week) [29]. Afterwards, in Section V, we use the models to analyse the impact of spectrum adaptation on network performance.…”
Section: Offline Mh-rsamentioning
confidence: 99%
“…Eventually, the greedy approach with reconfiguration flattening (GARF), also utilizing the tabu search meta-heuristic, is proposed in [19]. Finally, the concept of domination between traffic matrices (TMs) is proposed for large problem instances in [20,21].…”
Section: Related and Previous Workmentioning
confidence: 99%