Sciweavers

312 search results - page 4 / 63
» Degree Bounded Network Design with Metric Costs
Sort
View
INFOCOM
2009
IEEE
14 years 2 months ago
Minimum Maximum Degree Publish-Subscribe Overlay Network Design
—Designing an overlay network for publish/subscribe communication in a system where nodes may subscribe to many different topics of interest is of fundamental importance. For sca...
Melih Onus, Andréa W. Richa
NETWORKS
2008
13 years 7 months ago
Lower bounds for two-period grooming via linear programming duality
In a problem arising in grooming for two-period optical networks, it is required to decompose the complete graph on n vertices into subgraphs each containing at most C edges, so t...
Charles J. Colbourn, Gaetano Quattrocchi, Violet R...
PODC
2004
ACM
14 years 26 days ago
Compact routing on euclidian metrics
We consider the problem of designing a compact communication network that supports efficient routing in an Euclidean plane. Our network design and routing scheme achieves 1+ stret...
Ittai Abraham, Dahlia Malkhi
IWQOS
2004
Springer
14 years 24 days ago
Towards content distribution networks with latency guarantees
This paper investigates the performance of a content distribution network designed to provide bounded content access latency. Content can be divided into multiple classes with dif...
Chengdu Huang, Tarek F. Abdelzaher
PDCAT
2005
Springer
14 years 28 days ago
Approximating Spanning Trees with Inner Nodes Cost
We consider the practical NP-complete problem of finding a minimum weight spanning tree with both edge weights and inner nodes weights. We present two polynomial time algorithms ...
Rudolf Fleischer, Qi Ge, Jian Li, Shijun Tian, Hai...