Sciweavers

342 search results - page 34 / 69
» queue 2008
Sort
View
COMCOM
2004
79views more  COMCOM 2004»
13 years 8 months ago
Fair bandwidth sharing between unicast and multicast flows in best-effort networks
In this paper, we propose a simple scheduler called SBQ (Service-Based Queuing) to share the bandwidth fairly between unicast and multicast flows according to a new definition of ...
Fethi Filali, Walid Dabbous
ANOR
2008
112views more  ANOR 2008»
13 years 8 months ago
Analysis of a tandem network model of a single-router Network-on-Chip
We study a single-router Network-on-Chip modelled as a tandem queueing network. The first node is a geoK /D/1 queue (K fixed) representing a network interface, and the second node...
Paul Beekhuizen, Dee Denteneer, Ivo J. B. F. Adan
CN
2008
100views more  CN 2008»
13 years 8 months ago
Stability-throughput tradeoff and routing in multi-hop wireless ad hoc networks
We study the throughput of multi-hop routes and stability of forwarding queues in a wireless ad-hoc network with random access channel. We focus on a wireless network with static ...
Arzad Alam Kherani, Ralph El Khoury, Rachid El Azo...
GRID
2008
Springer
13 years 9 months ago
Rescheduling co-allocation requests based on flexible advance reservations and processor remapping
Large-scale computing environments, such as TeraGrid, Distributed ASCI Supercomputer (DAS), and Grid’5000, have been using resource co-allocation to execute applications on mult...
Marco Aurélio Stelmar Netto, Rajkumar Buyya
ISCA
2008
IEEE
136views Hardware» more  ISCA 2008»
13 years 8 months ago
A Randomized Queueless Algorithm for Breadth-First Search
First Come First Served is a policy that is accepted for implementing fairness in a number of application domains such as scheduling in Operating Systems [28, 11], scheduling web ...
K. Subramani, Kamesh Madduri