Sciweavers

32 search results - page 3 / 7
» On permutations with bounded drop size
Sort
View
CORR
2010
Springer
97views Education» more  CORR 2010»
13 years 5 months ago
Bin Packing via Discrepancy of Permutations
A well studied special case of bin packing is the 3-partition problem, where n items of size > 1 4 have to be packed in a minimum number of bins of capacity one. The famous Kar...
Friedrich Eisenbrand, Dömötör P&aac...
INFOCOM
2005
IEEE
13 years 10 months ago
Buffer sizing for congested Internet links
— Packet buffers in router/switch interfaces constitute a central element of packet networks. The appropriate sizing of these buffers is an important and open research problem. M...
Amogh Dhamdhere, Hao Jiang, Constantinos Dovrolis
IMC
2006
ACM
13 years 10 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 ...
DAC
1999
ACM
13 years 9 months ago
Using Lower Bounds During Dynamic BDD Minimization
Ordered Binary Decision Diagrams BDDs are a data structure for representation and manipulation of Boolean functions often applied in VLSI CAD. The choice of the variable orderin...
Rolf Drechsler, Wolfgang Günther
SODA
2003
ACM
157views Algorithms» more  SODA 2003»
13 years 6 months ago
Competitive queueing policies for QoS switches
We consider packet scheduling in a network providing differentiated services, where each packet is assigned a value. We study various queueing models for supporting QoS (Quality ...
Nir Andelman, Yishay Mansour, An Zhu