Sciweavers

290 search results - page 28 / 58
» Balancing Applied to Maximum Network Flow Problems
Sort
View
ICN
2005
Springer
15 years 3 months ago
AIMD Penalty Shaper to Enforce Assured Service for TCP Flows
Abstract. Many studies explored the guaranteed TCP throughput problem in DiffServ networks. Several new marking schemes have been proposed in order to solve this problem. Even if ...
Emmanuel Lochin, Pascal Anelli, Serge Fdida
IMC
2006
ACM
15 years 3 months ago
Fisher information of sampled packets: an application to flow size estimation
Packet sampling is widely used in network monitoring. Sampled packet streams are often used to determine flow-level statistics of network traffic. To date there is conflicting e...
Bruno F. Ribeiro, Donald F. Towsley, Tao Ye, Jean ...
IPSN
2010
Springer
15 years 4 months ago
Covering space for in-network sensor data storage
For in-network storage schemes, one maps data, indexed in a logical space, to the distributed sensor locations. When the physical sensor network has an irregular shape and possibl...
Rik Sarkar, Wei Zeng, Jie Gao, Xianfeng David Gu
ICCAD
1994
IEEE
151views Hardware» more  ICCAD 1994»
15 years 1 months ago
Multi-way VLSI circuit partitioning based on dual net representation
In this paper, we study the area-balanced multi-way partitioning problem of VLSI circuits based on a new dual netlist representation named the hybrid dual netlist (HDN), and propo...
Jason Cong, Wilburt Labio, Narayanan Shivakumar
INFOCOM
2012
IEEE
13 years 4 days 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