74 search results - page 5 / 15 » Approximating the traffic grooming problem |
COMGEO
2012
ACM
12 years 6 months ago
2012
ACM
We study a class of multi-commodity flow problems in geometric domains: For a given planar domain P populated with obstacles (holes) of K ≥ 2 types, compute a set of thick path...
JUCS
2008
13 years 11 months ago
2008
: This article provides a comparison among different methods for estimating the aggregation of Internet traffic resulting from different users, network-access types and correspondi...
STOC
2001
ACM
14 years 11 months ago
2001
ACM
Consider a setting in which a group of nodes, situated in a large underlying network, wishes to reserve bandwidth on which to support communication. Virtual private networks (VPNs...
JCM
2008
13 years 11 months ago
2008
An analytical model is developed to solve the power-rate assignment problem for multi-rate CDMA systems and calculate the probability density function (PDF) for the downlink traffi...
TON
2002
13 years 10 months ago
2002
We consider the problem of multirate network design with point-to-multipoint communications. We give a mathematical formulation for this problem. Using approximations, we show that...