Randeep Bhatia
ABSTRACT
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.
- D. Applegate and E. Cohen. Making intra-domain routing robust to changing and uncertain traffic demands: Understanding fundamental tradeoffs. In ACM SIGCOMM, 2003. Google Scholar
Digital Library
- Y. Bejerano and R. Rastogi. Robust monitoring of link delays and faults in IP networks. In IEEE INFOCOM, 2003.Google ScholarCross Ref
- M. Bienkowski, M. Korzeniowski, and H. Räcke. A practical algorithm for constructing oblivious routing schemes. In 15th Annual ACM symp. on Parallel algorithms and architectures (SPAA), pages 24--33, 2003. Google ScholarDigital Library
- Y. Breitbart, C. Y. Chan, M. Garofalakis, R. Rastogi, and A. Silberschatz. Efficiently monitoring bandwidth and latency in ip networks. In IEEE INFOCOM, 2001.Google ScholarCross Ref
- J. Chen, R. Kleinberg, L. Lovasz, R. Rajaraman, R. Sundaram, and A. Vetta. (almost) tight bounds and existence theorems for confluent flows. In Symp. on Theory of Computing (STOC), 2004. Google ScholarDigital Library
- J. Chen, R. Rajaraman, and R. Sundaram. Meet and merge: approximation algorithms for confluent flow. In Symp. on Theory of Computing (STOC), pages 373--382, 2003. Google ScholarDigital Library
- L. Ford and D. Fulkerson. Flows in Network. Princeton University Press, 1962.Google Scholar
- B. Fortz, J. Rexford, and M. Thorup. Internet traffic engineering by optimizing OSPF weights. In IEEE INFOCOM, pages 118--124, 2000.Google ScholarCross Ref
- B. Fortz, J. Rexford, and M. Thorup. Traffic engineering with traditional IP routing protocols. IEEE Communications Magazine, 40(10):118--124, 2002. Google ScholarDigital Library
- B. Fortz and M. Thorup. Optimizing OSPF/IS-IS weights in a changing world. IEEE Journal on Selected Areas in Communications, 20(4):756--767, 2002. Google ScholarDigital Library
- A. Frank. Connectivity augmentation problems in network design. Mathematical Programming: state of the art, pages 34--63, 1994.Google Scholar
- S. Iyer, S. Bhattacharrya, N. Taft, and C. Diot. An approach to alleviate link overload as observed on an IP backbone. In IEEE INFOCOM, 2003.Google Scholar
- S. Jamin, C. Jin, Y. Jin, D. Raz, Y. Shavitt, and L. Zhang. On the placement of internet instrumentation. In IEEE INFOCOM, 2000.Google ScholarCross Ref
- J. Kleinberg. Approximation algorithms for disjoint paths problems. Phd Thesis, MIT, 1996. Google ScholarDigital Library
- A. Kumar, R. Rastogi, A. Siberschatz, and B. Yener. Algorithms for provisioning virtual private networks in the hose model. In ACM SIGCOMM, pages 135--148, 2001. Google ScholarDigital Library
- L. Li, M. Thottan, B. Yao, and S. Paul. Distributed network monitoring with bounded link utilization in ip networks. In IEEE INFOCOM, 2003.Google ScholarCross Ref
- D. Lorenz, A. Orda, D. Raz, and Y. Shavit. How good can IP routing be? In DIMACS technical report: 2001-17, 2001. Google ScholarDigital Library
- J. Wang and K. Nahrsdedt. Hop-by-hop routing algorithms for premimum-class traffic in diffserv networks. In IEEE INFOCOM, 2002.Google Scholar
Index Terms
- Traffic engineering of management flows by link augmentations on confluent trees
Recommendations
Traffic Engineering of Management Flows by Link Augmentations on Confluent Trees
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 ...
MPLS traffic engineering for multimedia on satellite networks
Broadband satellite constellation networks will be required to carry all types of IP traffic, real time interactive traffic as well as non-real time one, warranting the need for appropriate QoS for these different traffic flows. In this paper we ...
Quality of service using traffic engineering over MPLS: an analysis
LCN '00: Proceedings of the 25th Annual IEEE Conference on Local Computer NetworksWe compare the service received by TCP and UDP flows when they share either a link or a Multiprotocol Label Switching (MPLS) traffic trunk. Since MPLS traffic trunks allow non-shortest path links also to be used, the total network throughput goes up ...
Comments