|
Published Articles >> Table of Contents >> Abstract
10th IEEE International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunications Systems (MASCOTS'02)
p. 0229
Network Level Capacity Planning with Efficiently Computable Global Optimum
A. Faragó
Full Article Text:
  
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/MASCOT.2002.1167082
Send link to a friend
| Abstract |
|
A novel, network level cap acityplanning model
is presented with the following key properties:
(1) The link level traffic and blocking model is
very general. It allows multiclass traffic and the
individual bandwidth demands may aggr egatein
complex, nonlinear ways. The conventional assumptions, such as Poisson arrivals or exponential holding times, are not required, thus allowing
non-standard behaviour patterns, including self-similarity. (2) On the network level, the stochastic behavior of the links is not required to be independent. Thus, we drop the traditional link independence assumption, because it is questionable
in a number of modern networking situations.
(3) Surprisingly, despite the very general setting,
the model yields a convex optimization problem,
in which the global optimum of the cap acityassignment under end-to-end blocking constraints
can be found efficiently (in polynomial time).
|
 Additional Information
|
Citation:
A. Faragó,
"Network Level Capacity Planning with Efficiently Computable Global Optimum,"
mascots,
p. 0229,
10th IEEE International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunications Systems (MASCOTS'02),
2002
|
|
