Sciweavers

237 search results - page 7 / 48
» Core-stateless Guaranteed Throughput Networks
Sort
View
SIGMETRICS
2006
ACM
156views Hardware» more  SIGMETRICS 2006»
14 years 1 months ago
Maximizing throughput in wireless networks via gossiping
A major challenge in the design of wireless networks is the need for distributed scheduling algorithms that will efficiently share the common spectrum. Recently, a few distributed...
Eytan Modiano, Devavrat Shah, Gil Zussman
WCNC
2010
IEEE
13 years 11 months ago
Throughput Analysis for Cooperation in Random Access Networks
—This paper aims at answering the questions of how to enable cooperative communications in random access networks. And, since cooperation introduces extra transmissions in the ch...
Amr El-Sherif, K. J. Ray Liu
WIOPT
2006
IEEE
14 years 1 months ago
Combined QoS scheduling and call admission control algorithm in cellular networks
— In this paper, a scheduling problem in wireless networks is considered when there simultaneously exist CBR (constant bit rate) users requiring exact minimum average throughput ...
Hyang-Won Lee, Song Chong
DATE
2003
IEEE
93views Hardware» more  DATE 2003»
14 years 22 days ago
Trade Offs in the Design of a Router with Both Guaranteed and Best-Effort Services for Networks on Chip
Managing the complexity of designing chips containing billions of transistors requires decoupling computation from communication. For the communication, scalable and compositional...
Edwin Rijpkema, Kees G. W. Goossens, Andrei Radule...
JHSN
2002
80views more  JHSN 2002»
13 years 7 months ago
A network architecture for providing per-flow delay guarantees with scalable core
Abstract. Many real-time applications demand delay guarantees from the network. A network architecture designed to support these applications should be robust and scalable. The Int...
Prasanna Chaporkar, Joy Kuri