Home  |   Login  |   Logout  |   Access Information  |   Alerts  |   Purchase History  |   Cart  |   Sitemap  |   Help   
 
Login
BROWSE SEARCH IEEE XPLORE GUIDE SUPPORT
Article Information

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

» View citation and abstract

IEEE Members

Log in by entering your IEEE Web Account Username and Password.

IEEE Communications Society members: If you subscribe to the IEEE Electronic Periodicals Package or IEEE Electronic Periodicals Package Plus, you must access your subscription at www.comsoc.org.

Users at Subscribing Institutions

Check with your librarian, information professional, or system manager to determine if you need to log in. Please complete the online Technical Support Form if you need assistance.

Already Purchased This Article?

Select the Purchase History link to access the document. You will have 5 Days after purchase to access the Full Text PDF. Please complete the online Technical Support Form if you need assistance.

Guests

• Search and access Abstract records free of charge
Register for table of contents alerts
• Purchase Full Text PDF documents

» Learn more about subscription options or how to become an IEEE Member.

You are not logged in.
LOGIN
Username
Password
GO
» Forgot your password?
Please remember to log out when you have finished your session.
You must log in to access:
• Advanced or Author Search
• CrossRef Search
• AbstractPlus Records
• Full Text PDF
• Full Text HTML
Access this document
» Buy this document now
» Learn more about
» Learn more about
   purchasing articles
   and standards
Learn more about IEEE Subscriptions
Indexed by IEE Inspec
© Copyright 2009 IEEE – All Rights Reserved