Sciweavers

70 search results - page 6 / 14
» A Case for Decomposition of FIFO Networks
Sort
View
COLOGNETWENTE
2008
15 years 2 months ago
Constrained Decompositions of Integer Matrices and their Applications to Intensity Modulated Radiation Therapy
We consider combinatorial optimization problems arising in radiation therapy. Given a matrix I with non-negative integer entries, we seek for a decomposition of I as a weighted su...
Céline Engelbeen, Samuel Fiorini
HIPC
2007
Springer
15 years 5 months ago
Accomplishing Approximate FCFS Fairness Without Queues
First Come First Served (FCFS) is a policy that is accepted for implementing fairness in a number of application domains such as scheduling in Operating Systems, scheduling web req...
K. Subramani, Kamesh Madduri
SIAMJO
2011
14 years 8 months ago
A Unifying Polyhedral Approximation Framework for Convex Optimization
Abstract. We propose a unifying framework for polyhedral approximation in convex optimization. It subsumes classical methods, such as cutting plane and simplicial decomposition, bu...
Dimitri P. Bertsekas, Huizhen Yu
ICN
2005
Springer
15 years 6 months ago
Primary/Secondary Path Generation Problem: Reformulation, Solutions and Comparisons
Abstract. This paper considers the primary and secondary path generation problem in traffic engineering. We first present a standard MILP model. Since its size and integrality gap...
Quanshi Xia, Helmut Simonis
NETWORKING
2010
15 years 2 months ago
Stateless RD Network Services
Rate-Delay (RD) Network Services constitute a promising differentiated-services architecture for multi-provider networks, by offering users a choice between high throughput or low ...
Maxim Podlesny, Sergey Gorinsky