Abstract
Due to the success of the Internet and the diversity of communication applications, it is becoming increasingly difficult to forecast traffic patterns. To capture the traffic variations, we introduce a flexible model where traffic belongs to a polytope. We assume that the traffic demands between nodes can be carried on many paths, with respect to network resources. Moreover, to guarantee the network stability and to make the routing easy to implement, the proportions of traffic flowing through each path have to be independent of the current traffic demands. We show that a minimum-cost routing satisfying the previous properties can be efficiently computed by column and constraint generations. We then present several strategies related to certain algorithmic details. Finally, theoretical and computational studies show that this new flexible model can be much more economical than a classical deterministic model based on a given traffic matrix. This paper can be considered as a mathematical framework for a new flexible virtual private network service offer. It also introduces a new concept: the routing of a polytope.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
R. K. Ahuja, T. L. Magnanti, and J. B. Orlin, Network Flows, Prentice-Hall, 1993.
G. Ash, Dynamic Routing in Telecommunications Networks, McGraw-Hill, 1998.
D. Avis, On the extreme rays of the metric cone, Can. J. Math. vol. 32, pp. 126–144, 1980.
A. Balakrishnan, T. L. Magnanti, A. Shulman, and R. T. Wang, “Models for planning capacity expansion in local access telecommunication networks,” Annals of Operations Research vol. 33, pp. 239–284, 1991.
Ball et al. eds. Network Models, Elsevier Science, 1995.
F. Barahona, “Network design using cut inequalities,” SIAM Journal on Optimization vol. 6, pp. 823–837, 1996.
W. Ben-Ameur, “Optimisation et Sécurisation de Réseaux,” PhD. Dissertation, ENST Paris, France, 1999.
W. Ben-Ameur, “Constrained length connectivity and survivable networks,” Networks vol. 36, pp. 17–33, 2000.
W. Ben-Ameur and J. Neto, “Acceleration of cutting plane and column generation algorithms,” Submitted, 2003.
W. Ben-Ameur and E. Gourdin, “Internet routing and related topology issues,” SIAM Journal on Discrete Mathematics vol. 17, pp. 18–49, 2003.
W. Ben-Ameur and H. Kerivin, “Flexible VPN framework,” Technical Report NT/DAC/OAT/20.45, France Telecom R&D, 2003.
N. Benameur and J. Roberts, “Inférence des matrices de trafic,” Technical Report NT/DAC/OAT/01.01, France Telecom R&D, 2001.
D. Bienstock, S. Chopra, O. Gnlk, and C.-Y. Tsai, “Minimum cost capacity installation for multicommodity network flows,” Mathematical Programming vol. 81, pp. 177–199, 1998.
R. G. Busacker and P. J. Gowen, “A procedure for determining a family of minimal-cost network flow patterns,” Technical Paper ORO-TP-15, Operations Research Office, The Johns Hopkins University, Bethesda, Maryland, 1960.
R. Callon, M. Suzuki, B. Gleeson, A. Malis, K. Muthukrishnan, E. Rosen, C. Sargor, and J. J. Yu, “A framework for provider provisioned virtual private networks,” IETF draft, work in progress, 2001.
T. Carpenter, D. Heyman, and I. Saniee, “Studies of random demands on network costs,” Telecommunication Systems vol. 10, pp. 409–421, 1998.
E. Crawley, R. Nair, R. Rajagopalan, and H. Sandick, “A framework for QoS-based Routing in the Internet,” IETF Reqest for comments 2386, 1998.
M. Crovella, and A. Bestavros, “Self-similarity in world wide web traffic-evidence and possible causes,” IEEE/ACM Transactions on Networking vol. 6, pp. 835–846, 1997.
G. Dahl, L. Gouveia, and C. Requejo, “On formulations and methods for the hop-constrained spanning tree problem,” Handbook of Optimization in Telecommunications, P. Pardalos and M. Resende (eds.), to appear, 2004.
G. Dahl and M. Stoer, “A cutting plane algorithm for multicommodity survivable network design problems,” INFORMS Journal on Computing vol. 10(1), pp. 1–11, 1998.
B. Davie and L. Peterson, Computer Networks—A Systems Approach, Morgan Kaufmann, 2000.
M. Didi Biha, H. Kerivin, and A. R. Mahjoub, “Steiner trees and polyhedra,” Discrete Applied Mathematics vol. 112(1–3), pp. 101–120, 1998.
E. W. Dijkstra, “A note on two problems in connection with graphs,” Numerische Mathematik vol. 1, pp. 269–271, 1959.
T. Dolan, “Internet pricing, is the end of the world wide wait in view,” Communications & Strategies vol. 37, pp. 15–45, 2000.
Z. Drezner, Facility Location: A Survey of Applications and Methods, Springer: Berlin, 1995.
N. G. Duffield, P. Goyal, A. Greenberg, P. Mishra, K. K. Ramakrishnan, and J.E. van der Merwe, “A flexible model for resource management in virtual private networks,” Proceedings of the ACM SIGCOMM Computer Communication Review vol. 29, pp. 95–109, 1999.
A. Feldmann, A. C. Gibert, P. Huang, and W. Willinger, “Dynamics of IP Traffic: A study of the role of variability and the impact of control,” Proceedings SIGCOMM, 1999.
A. Feldmann, A. Greenberg, C. Lund, N. Reingold, J. Rexford, and F. True, “Deriving traffic demand for operational IP networks,” IEEE/ACM Transactions on Networking vol. 9, pp. 265–279, 2001.
B. Fortz and M. Thorup, “Internet traffic engineering by optimizing OSPF weights,” IEEE INFOCOM, pp. 519–528, 2000.
M. R. Garey and D. S. Johnson, Computers and Intractability–A Guide to the Theory of NP-Completeness, San Francisco, CA: Freeman, 1979.
B. Gavish, “Topological design of telecommunication networks-local access design methods,” Annals of Operations Research vol. 33, pp. 17–71, 1991.
P. C. Gilmore and R. E. Gomory, “A linear programming approach to the cutting-stock problem-Part II,” Operations Research vol. 11, pp. 836–888, 1963.
A. Girard, Routing and Dimensioning in Circuit-switched Networks, Reading, MA: Addison-Wesley, 1990.
L. Gouveia, “Using variable redefinition for computing lower bounds for minimum spanning and steiner trees with hop constraints,” Informs Journal on Computing vol. 10, pp. 180–188, 1998.
M. Grötschel, L. Lovász, and A. Schrijver, “The ellipsoid method and its consequences in combinatorial optimization,” Combinatorica vol. 1, pp. 169–197, 1981.
M. Grötschel, C. L. Monma, and M. Stoer, “Polyhedral and computational investigations for designing communication networks with high survivability requirements,” Operations Research vol. 43, pp. 1012–1024, 1995.
G. Huston, ISP Survival Guide, Wiley, 1998.
ILOG Inc.: 1997, “Using the CPLEX Callable Library,” ILOG Inc.
M. Iri, “On an extension of the maximum-flow minimum-cut theorem to multicommodity flows,” Journal of the Operations Research Society of Japan vol. 13, pp. 129–135, 1971.
F. Kamoun and L. Kleinrock, “Hierarchical routing for large networks: Performance evaluation and optimization,” Computer Networks vol. 1, pp. 155–174, 1977.
F. P. Kelly, A. K. Maulloo, and D. K. H. Tan, “Rate control in communication networks: Shadow prices, proportional fairness and stability,” Journal of the Operation Research Society vol. 49, pp. 237–252, 1998.
H. Kerivin, “Réseaux fiables et Polyèdres,” PhD. Dissertation, Université Blaise Pascal, Clermont-Ferrand, France, 2000.
A. Kumar, R. Rastogi, A. Silberschatz, and B. Yener, “Algorithms for provisioning virtual private networks in the hose model,” in Proceedings of the ACM SIGCOMM, 2001.
A. Lisser, A. Ouorou, and J. -P. Vial, “Capacity planning under uncertain demand in telecommunications networks,” Technical Report NT/CNET/6570, France Telecom R&D, 1999.
D. Lorenz and A. Orda, “QoS routing in networks with uncertain parameters,” IEEE/ACM Transactions on Networking vol. 6, pp. 768–778, 1998.
T. L. Magnanti and R. T. Wong, “Network design and transportation planning: Models and algorithms,” Transportation Science vol. 18, pp. 1–55, 1984.
R. K. Martin, Large Scale Linear and Integer Optimization: A unified approach, Kluwer Academic Publishers, 1999.
M. Minoux, Programmation Mathématique-Théorie et Algorithmes, Dunod, 1983.
M. Minoux, “Network synthesis and optimum network design problems: Models, solution methods and applications,” Networks vol. 19, pp. 313–360, 1989.
M. Nabe, M. Murata, and H. Miyahara, “Analysis and modeling of World Wide Web traffic for capacity dimensioning of Internet access lines,” Performance Evaluation vol. 34, pp. 249–271, 1998.
G.L. Nemhauser and L. A. Wolsey, “Integer and combinatorial optimization,” Wiley, 1988.
K. Onaga and O. Kakusho, “On feasibility conditions of multicommodity flows in networks,” Transactions on Circuit Theory vol. 4, pp. 425–429, 1971.
A. Orda and N. Shimkin, “Incentive pricing in multiclass systems,” Telecommunication Systems vol. 13, pp. 241–267, 2000.
S. Oueslati-Boulahia, “Qualité de service et routage des flots élastiques dans un réseau multiservice,” PhD. Dissertation, ENST Paris, France, 2000.
K. G. Ramakrishnan and A. Rodrigues, “Optimal routing in shortest-path data networks,” Bell Labs Technical Journal, Jan-June, pp. 117–138, 2001.
E. Ramusen, Games and Information, an Introduction to Game Theory, Blackwells, 1994.
J. W. Roberts, “Traffic theory and the internet,” IEEE Communications Magazine vol. 39, no. 1, pp. 94–99, 2001.
U. Sumita, Y. Masuda, and S. Yamakawa, “Optimal internal pricing and capacity planning for service facility with finite buffer,” European Journal of Operational Research vol. 128, pp. 192–205, 2001.
J. W. Suurbale, “Disjoint paths in Networks,” Networks vol. 4, pp. 125–145, 1974.
K. Thomson, G. J. Miller, and R. Wilder, “Wide-area internet traffic patterns and characteristics,” IEEE Network vol. 11, no. 6, pp. 10–23, 1997.
Y. Vardi, “Network tomography: Estimating source-destination traffic intensities from link data,” Journal of the American Statistical Association vol. 91, pp. 365–377, 1996.
B. M. Waxman, “Routing of multipoint connections,” IEEE Journal on Selected Areas in Communications vol. 6, pp. 1617–1622, 1988.
Author information
Authors and Affiliations
Corresponding author
Additional information
This work was done in part while the authors were working at France Telecom Research and Development, Issy-les-Moulineaux, France.
Rights and permissions
About this article
Cite this article
Ben-Ameur, W., Kerivin, H. Routing of Uncertain Traffic Demands. Optim Eng 6, 283–313 (2005). https://doi.org/10.1007/s11081-005-1741-7
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/s11081-005-1741-7