Sciweavers

16 search results - page 3 / 4
» Improved Competitive Guarantees for QoS Buffering
Sort
View
SODA
2010
ACM
187views Algorithms» more  SODA 2010»
14 years 3 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
ICALP
2009
Springer
14 years 16 days ago
Improved Bounds for Speed Scaling in Devices Obeying the Cube-Root Rule
Speed scaling is a power management technique that involves dynamically changing the speed of a processor. This gives rise to dualobjective scheduling problems, where the operating...
Nikhil Bansal, Ho-Leung Chan, Kirk Pruhs, Dmitriy ...
CORR
2011
Springer
164views Education» more  CORR 2011»
12 years 9 months ago
Online Strategies for Intra and Inter Provider Service Migration in Virtual Networks
Network virtualization allows one to build dynamic distributed systems in which resources can be dynamically allocated at locations where they are most useful. In order to fully e...
Dushyant Arora, Marcin Bienkowski, Anja Feldmann, ...
NETWORKING
2004
13 years 7 months ago
Pricing Differentiated Services: A Game-Theoretic Approach
The goal of this paper is to study pricing of differentiated services and its impact on the choice of service priority at equilibrium. We consider both TCP connections as well as n...
Eitan Altman, Dhiman Barman, Rachid El Azouzi, Dav...
LCN
2005
IEEE
13 years 11 months ago
Implementation and Performance Analysis of a Packet Scheduler on a Programmable Network Processor
— The problem of achieving fairness in the allocation of the bandwidth resource on a link shared by multiple flows of traffic has been extensively researched over the last deca...
Fariza Sabrina, Salil S. Kanhere, Sanjay Jha