Sciweavers

INFOCOM
1995
IEEE
15 years 8 months ago
Complexity of Gradient Projection Method for Optimal Routing in Data Networks
—In this paper, we derive a time-complexity bound for the gradient projection method for optimal routing in data networks. This result shows that the gradient projection algorith...
Wei Kang Tsai, John K. Antonio, Garng M. Huang
119
Voted
INFOCOM
1995
IEEE
15 years 8 months ago
Providing Bandwidth Guarantees in an Input-Buffered Crossbar Switch
Dimitrios Stiliadis, Anujan Varma
INFOCOM
1995
IEEE
15 years 8 months ago
Measuring the Performance of Parallel Message-Based Process Architectures
Message-based process architectures are widely regarded as an effective method for structuring parallel protocol processing on shared memory multi-processor platforms. A message-b...
Douglas C. Schmidt, Tatsuya Suda