2011 IEEE Global Telecommunications Conference - GLOBECOM 2011 2011
DOI: 10.1109/glocom.2011.6133539
|View full text |Cite
|
Sign up to set email alerts
|

Hierarchical Dynamic Traffic Engineering Considering the Upper Bounds of Link Utilizations

Abstract: Traffic Engineering (TE) is one efficient approach to handle traffic changes. To perform TE, a server called the Path Computation Element (PCE) collects the traffic information from all nodes within the network. Then, the PCE calculates the routes suitable to the current traffic. However, in a largescale network, it is difficult for one PCE to collect all traffic information in a short period of time. Thus, it takes time to change the routes according to traffic changes. In this paper, we propose a method that… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...

Citation Types

0
0
0

Year Published

2015
2015
2015
2015

Publication Types

Select...
1

Relationship

0
1

Authors

Journals

citations
Cited by 1 publication
references
References 12 publications
(20 reference statements)
0
0
0
Order By: Relevance