Sciweavers

7 search results - page 1 / 2
» Extreme point characterizations for infinite network flow pr...
Sort
View
NETWORKS
2006
13 years 4 months ago
Extreme point characterizations for infinite network flow problems
We study capacitated network flow problems with supplies and demands defined on a countably infinite collection of nodes having finite degree. This class of network flow models in...
H. Edwin Romeijn, Dushyant Sharma, Robert L. Smith
JSAC
2010
142views more  JSAC 2010»
13 years 3 months ago
Extreme value FEC for reliable broadcasting in wireless networks
—The advent of practical rateless codes enables implementation of highly efficient packet-level forward error correction (FEC) strategies for reliable data broadcasting in loss-...
Weiyao Xiao, David Starobinski
CSE
2009
IEEE
13 years 11 months ago
Self-Tuning the Parameter of Adaptive Non-linear Sampling Method for Flow Statistics
—Flow statistics is a basic task of passive measurement and has been widely used to characterize the state of the network. Adaptive Non-Linear Sampling (ANLS)is one of the most a...
Chengchen Hu, Bin Liu
INFOCOM
2012
IEEE
11 years 7 months ago
Memory-assisted universal compression of network flows
—Recently, the existence of considerable amount of redundancy in the Internet traffic has stimulated the deployment of several redundancy elimination techniques within the netwo...
Mohsen Sardari, Ahmad Beirami, Faramarz Fekri
FSTTCS
2009
Springer
13 years 11 months ago
Iterative Methods in Combinatorial Optimization
We describe a simple iterative method for proving a variety of results in combinatorial optimization. It is inspired by Jain’s iterative rounding method (FOCS 1998) for designing...
R. Ravi