Sciweavers

312 search results - page 21 / 63
» Degree Bounded Network Design with Metric Costs
Sort
View
HASE
2007
IEEE
14 years 3 months ago
SyncProbe: Providing Assurance of Message Latency through Predictive Monitoring of Internet Paths
SyncProbe improves the end-to-end predictability of distributed systems by providing applications with a real-time estimate of the maximum expected message delay (upper bound on c...
Jawwad Shamsi, Monica Brockmeyer
FOCS
2006
IEEE
14 years 2 months ago
Approximation Algorithms for Non-Uniform Buy-at-Bulk Network Design
We consider approximation algorithms for non-uniform buy-at-bulk network design problems. The first nontrivial approximation algorithm for this problem is due to Charikar and Kar...
Chandra Chekuri, Mohammad Taghi Hajiaghayi, Guy Ko...
SIGMETRICS
2009
ACM
149views Hardware» more  SIGMETRICS 2009»
14 years 3 months ago
On the treeness of internet latency and bandwidth
Existing empirical studies of Internet structure and path properties indicate that the Internet is tree-like. This work quantifies the degree to which at least two important Inte...
Venugopalan Ramasubramanian, Dahlia Malkhi, Fabian...
MP
2006
88views more  MP 2006»
13 years 8 months ago
Two-edge connected subgraphs with bounded rings: Polyhedral results and Branch-and-Cut
Abstract. We consider the network design problem which consists in determining at minimum cost a 2-edge connected network such that the shortest cycle (a "ring") to which...
Bernard Fortz, Ali Ridha Mahjoub, S. Thomas McCorm...
IMA
2009
Springer
132views Cryptology» more  IMA 2009»
14 years 3 months ago
Subspace Codes
Abstract. This paper is a survey of bounds and constructions for subspace codes designed for the injection metric, a distance measure that arises in the context of correcting adver...
Azadeh Khaleghi, Danilo Silva, Frank R. Kschischan...