Sciweavers

59 search results - page 8 / 12
» Buffer allocation in general single-server queueing networks
Sort
View
WIOPT
2010
IEEE
13 years 5 months ago
Delay efficient scheduling via redundant constraints in multihop networks
Abstract--We consider the problem of delay-efficient scheduling in general multihop networks. While the class of max-weight type algorithms are known to be throughput optimal for t...
Longbo Huang, Michael J. Neely
INFOCOM
2003
IEEE
14 years 25 days ago
Dynamic Power Allocation and Routing for Time Varying Wireless Networks
—We consider dynamic routing and power allocation for a wireless network with time-varying channels. The network consists of power constrained nodes that transmit over wireless l...
Michael J. Neely, Eytan Modiano, Charles E. Rohrs
INFOCOM
1998
IEEE
13 years 11 months ago
On Adaptive Bandwidth Sharing with Rate Guarantees
The objective of recent research in fair queueing schemes has been to efficiently emulate a fluid-flow generalized (weighted) processor sharing (GPS) system, as closely as possibl...
Nick G. Duffield, T. V. Lakshman, Dimitrios Stilia...
SBCCI
2005
ACM
123views VLSI» more  SBCCI 2005»
14 years 1 months ago
Fault tolerance overhead in network-on-chip flow control schemes
Flow control mechanisms in Network-on-Chip (NoC) architectures are critical for fast packet propagation across the network and for low idling of network resources. Buffer manageme...
Antonio Pullini, Federico Angiolini, Davide Bertoz...
INFOCOM
2007
IEEE
14 years 1 months ago
Bandwidth Balancing in Multi-Channel IEEE 802.16 Wireless Mesh Networks
Abstract— In wireless mesh networks, the end-to-end throughput of traffic flows depends on the path length, i.e. the higher the number of hops, the lower becomes the throughput...
Claudio Cicconetti, Ian F. Akyildiz, Luciano Lenzi...