Egress selection in an Internet Service Provider (ISP) is the process of selecting an egress router to route interdomain traffic across the ISP such that a traffic engineering objective is achieved. In traditional ISP networks, traffic through the ISP is carried through the network and exits via an egress that is closest to the source in an attempt to minimize network resources for transit traffic. This exit strategy is known as Hot Potato Routing (HPR). The emerging field of Software-Defined Networking (SDN) has opened up many possibilities and promised to bring new flexibility to the rigid traditional paradigm of networking. In an ISP network, however, completely replacing legacy network devices with SDN nodes is neither simple nor straightforward. This has led to the idea of incremental and selective deployment of SDN nodes in an ISP network. Such a hybrid network gives us control over traffic flows that pass through the SDN nodes without requiring extensive changes to an existing ISP network. In this paper, we look at the problem of choosing an optimal set of egress routers to route inter-domain transit traffic in a hybrid SDN network such that the maximum link utilization of the egress links is minimized. We formulate the optimization problem, show that it is related to the makespan scheduling problem of unrelated parallel machines, and propose heuristics to solve it. We perform simulations to evaluate our heuristic on a real ISP topology and show that even with a small number of SDN nodes in the network, the maximum link utilization on the egress links can be lower than that of traditional HPR.
[1]
Xirong Que,et al.
Maximizing Network Utilization in Hybrid Software-Defined Networks
,
2014,
GLOBECOM 2014.
[2]
Kwan Lawrence Yeung,et al.
Time-efficient algorithms for BGP route configuration
,
2004,
2004 IEEE International Conference on Communications (IEEE Cat. No.04CH37577).
[3]
Ratul Mahajan,et al.
Measuring ISP topologies with rocketfuel
,
2002,
TNET.
[4]
Jan Karel Lenstra,et al.
Approximation algorithms for scheduling unrelated parallel machines
,
1987,
28th Annual Symposium on Foundations of Computer Science (sfcs 1987).
[5]
Nick Feamster,et al.
Guidelines for interdomain traffic engineering
,
2003,
CCRV.
[6]
Rajeev Rastogi,et al.
Optimal configuration for BGP route selection
,
2003,
IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).
[7]
Jianping Wu,et al.
Traffic Engineering in SDN/OSPF Hybrid Network
,
2014,
2014 IEEE 22nd International Conference on Network Protocols.
[8]
Murali S. Kodialam,et al.
Traffic engineering in software defined networks
,
2013,
2013 Proceedings IEEE INFOCOM.
[9]
Ning Wang,et al.
Multi-objective Egress Router Selection Policies for Inter-domain Traffic with Bandwidth Guarantees
,
2004,
NETWORKING.
[10]
Wei Song,et al.
Achieving near-optimal traffic engineering in hybrid Software Defined Networks
,
2015,
2015 IFIP Networking Conference (IFIP Networking).
[11]
Ding-Zhu Du,et al.
Design and Analysis of Approximation Algorithms
,
2011
.