Internet traffic engineering without full mesh overlaying

摘要: The overlay approach has been widely used by many service providers for traffic engineering in large Internet backbones. In the approach, logical connections are set up between edge nodes to form a full mesh virtual network on top of physical topology. IP routing is then run over network. Traffic objectives achieved through carefully links. Although implemented operational networks, it number well-known scaling issues. This paper proposes new which we call integrated achieve without full-mesh overlaying. runs natively topology rather than realized setting appropriate link metrics protocols. We first illustrate our with simple network, present formal analysis and method deriving weights. Our shows that any given optimal routes respect demands, can exactly same result reproducing them as shortest paths. further extend more generic one: arbitrary routes, long they not loopy, be converted shortest-paths some positive A theoretical insight (with objective function) always path