skip to main content
10.1145/1073970.1074018acmconferencesArticle/Chapter ViewAbstractPublication PagesspaaConference Proceedingsconference-collections
Article

Traffic engineering of management flows by link augmentations on confluent trees

Published: 18 July 2005 Publication History

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.

References

[1]
D. Applegate and E. Cohen. Making intra-domain routing robust to changing and uncertain traffic demands: Understanding fundamental tradeoffs. In ACM SIGCOMM, 2003.
[2]
Y. Bejerano and R. Rastogi. Robust monitoring of link delays and faults in IP networks. In IEEE INFOCOM, 2003.
[3]
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.
[4]
Y. Breitbart, C. Y. Chan, M. Garofalakis, R. Rastogi, and A. Silberschatz. Efficiently monitoring bandwidth and latency in ip networks. In IEEE INFOCOM, 2001.
[5]
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.
[6]
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.
[7]
L. Ford and D. Fulkerson. Flows in Network. Princeton University Press, 1962.
[8]
B. Fortz, J. Rexford, and M. Thorup. Internet traffic engineering by optimizing OSPF weights. In IEEE INFOCOM, pages 118--124, 2000.
[9]
B. Fortz, J. Rexford, and M. Thorup. Traffic engineering with traditional IP routing protocols. IEEE Communications Magazine, 40(10):118--124, 2002.
[10]
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.
[11]
A. Frank. Connectivity augmentation problems in network design. Mathematical Programming: state of the art, pages 34--63, 1994.
[12]
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.
[13]
S. Jamin, C. Jin, Y. Jin, D. Raz, Y. Shavitt, and L. Zhang. On the placement of internet instrumentation. In IEEE INFOCOM, 2000.
[14]
J. Kleinberg. Approximation algorithms for disjoint paths problems. Phd Thesis, MIT, 1996.
[15]
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.
[16]
L. Li, M. Thottan, B. Yao, and S. Paul. Distributed network monitoring with bounded link utilization in ip networks. In IEEE INFOCOM, 2003.
[17]
D. Lorenz, A. Orda, D. Raz, and Y. Shavit. How good can IP routing be? In DIMACS technical report: 2001-17, 2001.
[18]
J. Wang and K. Nahrsdedt. Hop-by-hop routing algorithms for premimum-class traffic in diffserv networks. In IEEE INFOCOM, 2002.

Index Terms

  1. Traffic engineering of management flows by link augmentations on confluent trees

      Recommendations

      Comments

      Information & Contributors

      Information

      Published In

      cover image ACM Conferences
      SPAA '05: Proceedings of the seventeenth annual ACM symposium on Parallelism in algorithms and architectures
      July 2005
      346 pages
      ISBN:1581139861
      DOI:10.1145/1073970
      • General Chair:
      • Phil Gibbons,
      • Program Chair:
      • Paul Spirakis
      Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

      Sponsors

      Publisher

      Association for Computing Machinery

      New York, NY, United States

      Publication History

      Published: 18 July 2005

      Permissions

      Request permissions for this article.

      Check for updates

      Author Tags

      1. approximation algorithms
      2. network management
      3. traffic engineering

      Qualifiers

      • Article

      Conference

      SPAA05

      Acceptance Rates

      Overall Acceptance Rate 447 of 1,461 submissions, 31%

      Upcoming Conference

      SPAA '25
      37th ACM Symposium on Parallelism in Algorithms and Architectures
      July 28 - August 1, 2025
      Portland , OR , USA

      Contributors

      Other Metrics

      Bibliometrics & Citations

      Bibliometrics

      Article Metrics

      • 0
        Total Citations
      • 286
        Total Downloads
      • Downloads (Last 12 months)1
      • Downloads (Last 6 weeks)0
      Reflects downloads up to 17 Jan 2025

      Other Metrics

      Citations

      View Options

      Login options

      View options

      PDF

      View or Download as a PDF file.

      PDF

      eReader

      View online with eReader.

      eReader

      Media

      Figures

      Other

      Tables

      Share

      Share

      Share this Publication link

      Share on social media