Abstract
Estimating point-to-point demands from partially available information, such as total demand volumes originating and terminating at nodes and traffic volumes routed on links, has significant applications in various areas, such as communications network planning and transportation planning. Existing methods include matrix and link scaling methods, statistical methods, more complex mathematical programming models, and forecasting using demographic data. We present a new mathematical programming model based on equitable resource allocation. The model considers multiple services, e.g., data, video, and voice, and generates a point-to-point demand matrix for each service. Originating and terminating demands for each service and link loads, aggregated over all services, are viewed as resources. Each point-to-point demand is associated with a performance function that measures its weighted, normalized deviation from a target defined by a service-dependent community of interest matrix. The model formulation has a lexicographic minimax objective function and multiple knapsack resource constraints. The model has an intuitively appealing interpretation and a specialized algorithm can generate demand matrices for large network problems very fast.
Similar content being viewed by others
References
G.R. Ash, Dynamic Routing in Communications Networks (McGraw-Hill, New York, 1997).
D.E. Boyce, Urban transportation network-equilibrium and design models: Recent achievements and future prospects, Environment and Planning A 16 (1984) 1445-1474.
M. Butto, P.G. Conversi and M. Naldi, Estimation of point-to-point traffic in circuit-switched networks, European Transactions on Communications 10 (1999) 497-504.
E. Cascetta and S. Nguyen, A unified framework for estimating or updating origin/destination matrices from traffic counts, Transportation Research B 22 (1988) 437-455.
S.P. Evans, Derivation and analysis of some models for combining trip distribution and assignment, Transportation Research 10 (1976) 37-57.
T.L. Friesz, An equivalent optimization problem for combined multiclass distribution, assignment, and modal split which obviates symmetry restrictions, Transportation Research B 15 (1981) 361-369.
M. Guizani and A. Rayes, Designing ATM Switching Networks (McGraw-Hill, New York, 1998) chapter 5.
M.D. Hall, D. Van Vliet and L.G. Willumsen, SATURN — A simulation-assignment model for the evaluation of traffic management schemes, Traffic Engineering and Control 21 (1980) 168-176.
R.S. Klein, H. Luss and U.G. Rothblum, Relaxation-based algorithms for minimax optimization problems with resource allocation applications, Mathematical Programming 64 (1994) 337-363.
M.M. Kostreva and W. Ogryczak, Linear optimization with multiple equitable criteria, RAIRO Operations Research 33 (1999) 275-297.
J. Kruithof, Telefoonverkeersrekening, De Ingenieur 52(8) (1937) E15-E25.
R.S. Krupp, Properties of Kruithof's projection method, Bell System Technical Journal 58 (1979) 517-538.
W.H.K. Lam and H.-J. Huang, A combined trip distribution and assignment model for multiple user classes, Transportation Research B 26 (1992) 275-287.
W.H.K. Lam and H.-J. Huang, Calibration of the combined trip distribution and assignment model for multiple user classes, Transportation Research B 26 (1992) 289-305.
L.J. LeBlanc and A. Abdulaal, Combined mode split-assignment and distribution-mode-split-assignment models with multiple groups of travelers, Transportation Science 16 (1982) 430-442.
H.P. Lo, N. Zhang and W.H.K. Lam, Decomposition algorithm for statistical estimation of OD matrix with random link choice proportions from traffic counts, Transportation Research B 33 (1999) 369-385.
H. Luss, On equitable resource allocation problems: A lexicographic minimax approach, Operations Research 47 (1999) 361-378.
H. Luss and D.R. Smith, Resource allocation among competing activities: A lexicographic minimax approach, Operations Research Letters 5 (1986) 227-231.
M.J. Maher, Inferences on trip matrices from observations on link volumes: A Bayesian statistical approach, Transportation Research B 17 (1983) 435-447.
K.N.A. Safwat and T.L. Magnanti, A combined trip generation, trip distribution, modal split, and trip assignment model, Transportation Science 18 (1988) 14-30.
M.H. Schneider and S.A. Zenios, A comparative study of algorithms for matrix balancing, Operations Research 38 (1990) 439-455.
M. Tu, Estimation of point-to-point traffic demand in dynamic routing networks, in: Proc. of the 13th Internat. Teletraffic Congress, Copenhagen, Denmark, June 1991, eds. A. Jensen and V.B. Iversen (Elsevier Science, Amsterdam, 1991) pp. 471-476.
H.J. Van Zuylen and L.G. Willumsen, The most likely trip matrix estimated from traffic counts, Transportation Research B 14 (1980) 281-293.
O.J. Wasem, A.M. Gross and G.A. Tlapa, Forecasting broadband demand between geographic areas, IEEE Communications Magazine, (February 1995) 50-57.
H. Yang, Y. Iida and T. Sasaki, The equilibrium-based origin-destination matrix estimation problem, Transportation Research B 28 (1994) 23-33.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Luss, H., Vakhutinsky, A. A Resource Allocation Approach for the Generation of Service-Dependent Demand Matrices for Communications Networks. Telecommunication Systems 17, 411–433 (2001). https://doi.org/10.1023/A:1016775215940
Issue Date:
DOI: https://doi.org/10.1023/A:1016775215940