Sciweavers

173 search results - page 10 / 35
» Round Robin Classification
Sort
View
INFOCOM
1996
IEEE
14 years 2 days ago
Latency-Rate Servers: A General Model for Analysis of Traffic Scheduling Algorithms
In this paper, we develop a general model, called Latency-Rate servers (LR servers), for the analysis of traffic scheduling algorithms in broadband packet networks. The behavior of...
Dimitrios Stiliadis, Anujan Varma
FPL
2006
Springer
124views Hardware» more  FPL 2006»
13 years 11 months ago
A Dynamically Reconfigurable Queue Scheduler
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...
Christoforos Kachris, Stamatis Vassiliadis
COMCOM
2004
142views more  COMCOM 2004»
13 years 7 months ago
An adaptive power-conserving service discipline for bluetooth (APCB) wireless networks
Bluetooth is a new short-range radio technology to form a small wireless system. In most of the current Bluetooth products, the master polls the slaves in a round robin manner and...
Hao Zhu, Guohong Cao, George Kesidis, Chita R. Das
NOMS
2010
IEEE
147views Communications» more  NOMS 2010»
13 years 6 months ago
Distributed approaches to S-CSCF selection in an IMS network
—The IP Multimedia Subsystem (IMS) is a generic open-systems architecture offering converged multimedia services over IP. A function in the signaling plane of an IMS network is t...
Plarent Tirana, Deep Medhi
EOR
2007
174views more  EOR 2007»
13 years 7 months ago
A Benders approach for the constrained minimum break problem
This paper presents a hybrid IP/CP algorithm for designing a double round robin schedule with a minimal number of breaks. Both mirrored and non-mirrored schedules with and without ...
Rasmus V. Rasmussen, Michael A. Trick