document: Multi-hour design of survivable classical IP networks Most of Internet intra-domain routing protocols -LRB- OSPF , RIP , and IS-IS -RRB- are based on shortest path routing . The path length is defined as the sum of metrics associated with the path links . These metrics are often managed by the network administrator . In this context , the design of an Internet backbone network consists in dimensioning the network -LRB- routers and transmission links -RRB- and establishing the metric . Many requirements have to be satisfied . First , Internet traffic is not static as significant variations can be observed during the day . Second , many failures can occur -LRB- cable cuts , hardware failures , software failures , etc. -RRB- . We present algorithms -LRB- meta-heuristics and greedy heuristic -RRB- to design Internet backbone networks , taking into account the multi-hour behaviour of traffic and some survivability requirements . Many multi-hour and protection strategies are studied and numerically compared . Our algorithms can be extended to integrate other quality of service constraints
doc_bio_tags: O O O B I I I O O O O O O O B O B O O O O O O O B I I O O B I O O O O O O O O O O B I O O O O O O O O B I O O O O O O O O O B I I O O O O O O O O B I O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O B I I I
extractive_keyphrases: survivable classical ip networks ospf rip shortest path routing path length path links network administrator internet backbone network internet traffic transmission links survivability requirements quality of service constraints
abstractive_keyphrases: multi-hour design internet intra-domain routing protocols is-is network dimensioning network routers network failures meta-heuristics algorithm greedy heuristic algorithm network protection qos constraints