10 search results - page 2 / 2 » Utilization-Bound Based Schedulability Analysis of Weighted ... |
FPL
2006
Springer
13 years 8 months ago
2006
Springer
In this paper we present the design and implementation of a dynamically reconfigurable system for packet queue scheduling. Two widely accepted queue schedulers have been implement...
INFOCOM
2003
IEEE
13 years 10 months ago
2003
IEEE
— In this paper, we consider real-time speech traffic, real-time circuit-switched data (CSD) and non-real-time packetswitched data (PSD) in the UMTS Terrestrial Radio Access Net...
GCC
2006
Springer
13 years 8 months ago
2006
Springer
In this paper, we propose a new scheduling algorithm with economic theory, called Black Scholes Market (BSM) algorithm for a class of Dynamic Jobs (DJ). BSM is based on the classi...
WINET
2010
13 years 3 months ago
2010
Fair scheduling is an ideal candidate for fair bandwidth sharing and thereby achieving fairness among the contending flows in a network. It is particularly challenging for ad hoc ...
ICC
2009
IEEE
13 years 11 months ago
2009
IEEE
—A new variation of the Flow-Aware Networking (FAN) concept is presented in the paper. The proposed solution is based on the Approximate Fair Dropping algorithm and called by us ...