21 search results - page 4 / 5 » Improved Bounds for Online Stochastic Matching |
FOCS
2003
IEEE
13 years 11 months ago
2003
IEEE
The essence of an Internet router is an n ¡ n switch which routes packets from input to output ports. Such a switch can be viewed as a bipartite graph with the input and output p...
ALGORITHMICA
2005
13 years 6 months ago
2005
In an adversarial queueing network, the incoming traffic is decided by an adversary, who operates under a reasonable rate restriction. This model provides a valuable, complementar...
IOPADS
1997
13 years 7 months ago
1997
We provide a competitive analysis framework for online prefetching and buffer management algorithms in parallel I/O systems, using a read-once model of block references. This has ...
FOCS
2007
IEEE
14 years 18 days ago
2007
IEEE
In the weighted paging problem there is a weight (cost) for fetching each page into the cache. We design a randomized O(log k)-competitive online algorithm for the weighted paging...
INFOCOM
2010
IEEE
13 years 4 months ago
2010
IEEE
—Cognitive Radio Networks (CRNs) have recently emerged as a promising technology to improve spectrum utilization by allowing secondary users to dynamically access idle primary ch...