Sciweavers

85 search results - page 6 / 17
» Mean-Field Analysis of Buffer Sizing
Sort
View
IPPS
2009
IEEE
15 years 4 months ago
Competitive buffer management with packet dependencies
We introduce the problem of managing a FIFO buffer of bounded space, where arriving packets have dependencies among them. Our model is motivated by the scenario where large data f...
Alexander Kesselman, Boaz Patt-Shamir, Gabriel Sca...
CCR
2005
103views more  CCR 2005»
14 years 10 months ago
Part III: routers with very small buffers
Internet routers require buffers to hold packets during times of congestion. The buffers need to be fast, and so ideally they should be small enough to use fast memory technologie...
Mihaela Enachescu, Yashar Ganjali, Ashish Goel, Ni...
SODA
2010
ACM
187views Algorithms» more  SODA 2010»
15 years 7 months ago
An Improved Competitive Algorithm for Reordering Buffer Management
We design and analyze an on-line reordering buffer management algorithm with improved O log k log log k competitive ratio for non-uniform costs, where k is the buffer size. This i...
Noa Avigdor-Elgrabli, Yuval Rabani
FOCS
1998
IEEE
15 years 2 months ago
Jitter Control in QoS Networks
We study jitter control in networks with guaranteed quality of service (QoS) from the competitive analysis point of view: we propose on-line algorithms that control jitter and comp...
Yishay Mansour, Boaz Patt-Shamir
MOBIHOC
2010
ACM
14 years 8 months ago
Globs in the primordial soup: the emergence of connected crowds in mobile wireless networks
In many practical scenarios, nodes gathering at points of interest yield sizable connected components (clusters), which sometimes comprise the majority of nodes. While recent anal...
Simon Heimlicher, Kavé Salamatian