Sciweavers

237 search results - page 28 / 48
» Core-stateless Guaranteed Throughput Networks
Sort
View
JSAC
2007
140views more  JSAC 2007»
13 years 7 months ago
Cross-layer resource allocation over wireless relay networks for quality of service provisioning
— We propose a physical-datalink cross-layer resource allocation scheme over wireless relay networks for quality-ofservice (QoS) guarantees. By integrating information theory wit...
Jia Tang, Xi Zhang
CCR
2006
122views more  CCR 2006»
13 years 7 months ago
Low complexity, stable scheduling algorithms for networks of input queued switches with no or very low speed-up
The delay and throughput characteristics of a packet switch depend mainly on the queueing scheme and the scheduling algorithm deployed at the switch. Early research on scheduling ...
Claus Bauer
INFOCOM
2009
IEEE
14 years 2 months ago
Capacity of Arbitrary Wireless Networks
— In this work we study the problem of determining the throughput capacity of a wireless network. We propose a scheduling algorithm to achieve this capacity within an approximati...
Olga Goussevskaia, Roger Wattenhofer, Magnú...
COOPIS
2002
IEEE
14 years 15 days ago
Composing and Deploying Grid Middleware Web Services Using Model Driven Architecture
Rapid advances in networking, hardware, and middleware technologies are facilitating the development and deployment of complex grid applications, such as large-scale distributed co...
Aniruddha S. Gokhale, Balachandran Natarajan
SIGCOMM
2003
ACM
14 years 23 days ago
Scaling internet routers using optics
Routers built around a single-stage crossbar and a centralized scheduler do not scale, and (in practice) do not provide the throughput guarantees that network operators need to ma...
Isaac Keslassy, Shang-Tse Chuang, Kyoungsik Yu, Da...