Sciweavers

220 search results - page 38 / 44
» Minimizing Average Flow-time : Upper and Lower Bounds
Sort
View
CN
2002
117views more  CN 2002»
13 years 8 months ago
Achieving differentiated services through multi-class probabilistic priority scheduling
Differentiated Services (DiffServ) is a promising architecture for the next generation Internet due to its scalable and flexible design. In DiffServ, scheduling disciplines play an...
Chen-Khong Tham, Qi Yao, Yuming Jiang
WAOA
2004
Springer
91views Algorithms» more  WAOA 2004»
14 years 1 months ago
Pricing Network Edges to Cross a River
Abstract. We consider a Stackelberg pricing problem in directed networks. Tariffs have to be defined by an operator, the leader, for a subset of the arcs, the tariff arcs. Clien...
Alexander Grigoriev, Stan P. M. van Hoesel, Anton ...
CORR
2010
Springer
153views Education» more  CORR 2010»
13 years 8 months ago
To Feed or Not to Feed Back
We study the communication over Finite State Channels (FSCs), where the encoder and the decoder can control the availability or the quality of the noise-free feedback. Specificall...
Himanshu Asnani, Haim H. Permuter, Tsachy Weissman
INFOCOM
1998
IEEE
14 years 19 days ago
Design of Logical Topologies: A Linear Formulation for Wavelength Routed Optical Networks with No Wavelength Changers
We consider the problem of constructing logical topologies over a wavelength-routed optical network with no wavelength changers. We present a general linear formulation which consi...
Rajesh M. Krishnaswamy, Kumar N. Sivarajan
DCC
2005
IEEE
14 years 8 months ago
Quantization of Multiple Sources Using Integer Bit Allocation
Asymptotically optimal bit allocation among a set of quantizers for a finite collection of sources was determined in 1963 by Huang and Schultheiss. Their solution, however, gives ...
Benjamin Farber, Kenneth Zeger