Algorithms for provisioning virtual private networks in the hose model
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
A practical algorithm for constructing oblivious routing schemes
Proceedings of the fifteenth annual ACM symposium on Parallel algorithms and architectures
Meet and merge: approximation algorithms for confluent flows
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications
How good can IP routing be?
Approximation algorithms for disjoint paths problems
Approximation algorithms for disjoint paths problems
(Almost) tight bounds and existence theorems for confluent flows
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Traffic engineering with traditional IP routing protocols
IEEE Communications Magazine
Optimizing OSPF/IS-IS weights in a changing world
IEEE Journal on Selected Areas in Communications
| Hi-index | 0.01 |
Service providers rely on the management systems housed in their Network Operations Centers (NOCs) to remotely operate, monitor and provision their data networks. Lately there has been a tremendous increase in management traffic due to the growing complexity and size of the data networks and the services provisioned on them. Traffic engineering for management flows is essential for the smooth functioning of these networks to avoid congestion, which can result in loss of critical data such as billing records, network alarms, etc. As is the case with most intra-domain routing protocols, the management flows in many of these networks are routed on shortest paths connecting the NOC with the service provider's POPs (points of presence). This collection of paths thus forms a "confluent" tree rooted at the gateway router connected to the NOC. The links close to the gateway router may form a bottleneck in this tree resulting in congestion. Typically this congestion is alleviated by adding layer two tunnels (virtual links) that offload the traffic from some links of this tree by routing it directly to the gateway router. The traffic engineering problem is then to minimize the number of virtual links needed for alleviating congestion. The traffic engineering problem described above also has applications to alleviating congestion resulting from focused overloads in VoIP networks and for dealing with congesting resulting from flash crowds in the world wide web.In this paper we formulate a traffic engineering problem motivated by the above mentioned applications. We show that the general versions of this problem are hard to solve. However, for some simpler cases in which the underlying network is a tree, we design efficient algorithms. We use these algorithms as the basis for designing efficient heuristics for alleviating congestion in general (non-tree) service provider network topologies.