Sciweavers

74 search results - page 6 / 15
» Approximating the traffic grooming problem
Sort
View
TON
2008
98views more  TON 2008»
14 years 9 months ago
A unified framework for multipath routing for unicast and multicast traffic
We study the problem of load balancing the traffic from a set of unicast and multicast sessions. The problem is formulated as an optimization problem. However, we assume that the g...
Tuna Güven, Richard J. La, Mark A. Shayman, B...
INFORMS
2008
241views more  INFORMS 2008»
14 years 9 months ago
Solving the Capacitated Local Access Network Design Problem
We propose an exact solution method for a routing and capacity installation problem in networks. Given an input graph, the problem is to route traffic from a set of source nodes t...
F. Sibel Salman, R. Ravi, John N. Hooker
COMPUTING
2010
14 years 7 months ago
Minimization of SONET ADMs in ring networks revisited
We design improved approximation algorithms for two variants of the ADM minimization problem. SONET add-drop multiplexers (ADMs) are the dominant cost factor in SONET/WDM rings. T...
Leah Epstein, Asaf Levin, Betzalel Menahem
AUTOMATICA
2005
103views more  AUTOMATICA 2005»
14 years 9 months ago
Incorporating state estimation into model predictive control and its application to network traffic control
Model predictive control (MPC) is of interest because it is one of the few control design methods which preserves standard design variables and yet handles constraints. MPC is nor...
Jun Yan, Robert R. Bitmead
JCO
2002
77views more  JCO 2002»
14 years 9 months ago
Traffic Partition in WDM/SONET Rings to Minimize SONET ADMs
SONET(SynchronousOpticalNETworks)add-dropmultiplexers(ADMs)arethedominantcostfactor in the WDM(Wavelength Division Multiplexing)/SONET rings. The number of SONET ADMs required by a...
Gruia Calinescu, Peng-Jun Wan