On open shortest path first related network optimisation problems

Performance Evaluation

Volumn 48, Issue 1-4, 2002, Pages 201-223

  Pioro M ^a   Szentesi, A ^a   Harmatos, J ^a   Juttner A ^a   Gajowniczek, P ^a   Kozdrowski, S ^a  

^a WARSAW UNIVERSITY OF TECHNOLOGY   (Poland)

Author keywords

Multicommodity flows; Network optimisation; OSPF; Traffic engineering

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; HEURISTIC METHODS; INTERNET; OPTIMIZATION; PROBLEM SOLVING; RESOURCE ALLOCATION; ROUTERS; TELECOMMUNICATION TRAFFIC;

OPEN SHORTEST PATH FIRST (OSPF) ROUTING;

NETWORK PROTOCOLS;

EID: 0036604974     PISSN: 01665316     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0166-5316(02)00036-6     Document Type: Conference Paper

References (15)

1. Internet traffic engineering by optimizing OSPF weights
2. Dimensioning of internet networks
3. Allocation of administrative weights in PNNI
4. Optimization by simulated annealing: An experimental evaluation
5. Design of robust optical networks
6. Validation of subgradient optimization
7. Robust design of multicommodity integral flow networks
8. Some approaches to solving a multi-hour broadband network capacity design problem with single-path routing
9. Solving multicommodity integral flow problems by simulated allocation