Sciweavers

74 search results - page 8 / 15
» Approximating the traffic grooming problem
Sort
View
EDBT
2008
ACM
160views Database» more  EDBT 2008»
14 years 11 months ago
Why go logarithmic if we can go linear?: Towards effective distinct counting of search traffic
Estimating the number of distinct elements in a large multiset has several applications, and hence has attracted active research in the past two decades. Several sampling and sket...
Ahmed Metwally, Divyakant Agrawal, Amr El Abbadi
CONEXT
2006
ACM
14 years 4 months ago
Synergy: blending heterogeneous measurement elements for effective network monitoring
Network traffic matrices are important for various network planning and management operations. Previous work for estimation of traffic matrices is based on either link load record...
Awais Ahmed Awan, Andrew W. Moore
INFOCOM
1998
IEEE
14 years 3 months ago
A Stochastic Approximation Approach for Max-Min Fair Adaptive Rate Control of ABR Sessions with MCRs
The ABR sessions in an ATM network share the bandwidth left over after guaranteeing service to CBR and VBR traffic. Hence the bandwidth available to ABR sessions is randomly varyi...
Santosh Paul Abraham, Anurag Kumar
CCS
2007
ACM
14 years 2 months ago
Analyzing network traffic to detect self-decrypting exploit code
Remotely-launched software exploits are a common way for attackers to intrude into vulnerable computer systems. As detection techniques improve, remote exploitation techniques are...
Qinghua Zhang, Douglas S. Reeves, Peng Ning, S. Pu...
SIAMDM
2010
113views more  SIAMDM 2010»
13 years 5 months ago
The VPN Problem with Concave Costs
We consider the following network design problem. We are given an undirected network with costs on the edges, a set of terminals, and an upper bound for each terminal limiting the ...
Samuel Fiorini, Gianpaolo Oriolo, Laura Sanit&agra...