Traffic Engineering Using Overlay Network

Due to integrated high-speed networks accommodating various types of services and applications, the quality of service (QoS) requirements for those networks have also become diverse. The network resources are shared by the individual service traffic in the integrated network. Thus, the QoS of all the services may be degraded indiscriminately when the network becomes congested due to a sudden increase in traffic for a particular service if there is no traffic engineering taking into account each service's QoS requirement. To resolve this problem, we present a method of controlling individual service traffic by using an overlay network, which makes it possible to flexibly add various functionalities. The overlay network provides functionalities to control individual service traffic, such as constructing an overlay network topology for each service, calculating the optimal route for the service's QoS, and caching the content to reduce traffic. Specifically, we present a method of overlay routing that is based on the Hedge algorithm, an online learning algorithm to guarantee an upper bound in the difference from the optimal performance. We show the effectiveness of our overlay routing through simulation analysis for various network topologies.

[1]  Roch Guérin,et al.  How to Select a Good Alternate Path in Large Peer-to-Peer Systems? , 2006, Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications.

[2]  Akihiro Nakao,et al.  Best-Effort Network Layer Packet Reordering in Support of Multipath Overlay Packet Dispersion , 2008, IEEE GLOBECOM 2008 - 2008 IEEE Global Telecommunications Conference.

[3]  Tatsuya Mori,et al.  Packet Sampling TCP Flow Rate Estimation and Performance Degradation Detection Method , 2008, IEICE Trans. Commun..

[4]  Yoav Freund,et al.  A decision-theoretic generalization of on-line learning and an application to boosting , 1997, EuroCOLT.

[5]  Tim Roughgarden,et al.  How bad is selfish routing? , 2000, Proceedings 41st Annual Symposium on Foundations of Computer Science.

[6]  Ryoichi Kawahara,et al.  On the Quality of Triangle Inequality Violation Aware Routing Overlay Architecture , 2009, IEEE INFOCOM 2009.

[7]  Oliver W. W. Yang,et al.  Delay-based adaptive load balancing in MPLS networks , 2002, 2002 IEEE International Conference on Communications. Conference Proceedings. ICC 2002 (Cat. No.02CH37333).

[8]  Hui Zhang,et al.  LIRA: An Approach for Service Differentiation in the Internet , 1998 .

[9]  Suman Banerjee,et al.  The Interdomain Connectivity of PlanetLab Nodes , 2004, PAM.

[10]  Lionel M. Ni,et al.  Traffic engineering with MPLS in the Internet , 2000, IEEE Netw..

[11]  Jasleen Kaur,et al.  Testing the Scalability of Overlay Routing Infrastructures , 2004, PAM.

[12]  Yin Zhang,et al.  On selfish routing in Internet-like environments , 2003, IEEE/ACM Transactions on Networking.

[13]  Ben Y. Zhao,et al.  Understanding user behavior in large-scale video-on-demand systems , 2006, EuroSys.

[14]  Xiaodong Zhang,et al.  ASAP: an AS-Aware Peer-Relay Protocol for High Quality VoIP , 2006, 26th IEEE International Conference on Distributed Computing Systems (ICDCS'06).

[15]  Yoav Freund,et al.  A decision-theoretic generalization of on-line learning and an application to boosting , 1995, EuroCOLT.

[16]  Cheng Jin,et al.  MATE: MPLS adaptive traffic engineering , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).

[17]  Hari Balakrishnan,et al.  Resilient overlay networks , 2001, SOSP.

[18]  Yong Zhu,et al.  Dynamic overlay routing based on available bandwidth estimation: A simulation study , 2006, Comput. Networks.

[19]  Tatsuya Mori,et al.  ISP-Operated CDN , 2009, IEEE INFOCOM Workshops 2009.

[20]  Prasant Mohapatra,et al.  QRON: QoS-aware routing in overlay networks , 2004, IEEE Journal on Selected Areas in Communications.