Sciweavers

464 search results - page 23 / 93
» Providing Performance Guarantees in an FDDI Network
Sort
View
UAI
2001
15 years 3 months ago
Maximum Likelihood Bounded Tree-Width Markov Networks
We study the problem of projecting a distribution onto (or finding a maximum likelihood distribution among) Markov networks of bounded tree-width. By casting it as the combinatori...
Nathan Srebro
ICC
2000
IEEE
123views Communications» more  ICC 2000»
15 years 6 months ago
A Per-Flow Based Node Architecture for Integrated Services Packet Networks
As the Internet transforms from the traditional best-effort service network into QoS-capable multi-service network, it is essential to have new architectural design and appropriate...
Dapeng Wu, Yiwei Thomas Hou, Takeo Hamada, Zhi-Li ...
ISOLA
2010
Springer
15 years 11 days ago
Flow Control with (Min, +) Algebra
According to the theory of Network Calculus based on the (min,+) algebra, analysis and measure of worst-case performance in communication networks can be made easily. In this conte...
Euriell Le Corronc, Bertrand Cottenceau, Laurent H...
IPPS
1995
IEEE
15 years 5 months ago
The RACE network architecture
The RACE R parallel computer system provides a highperformance parallel interconnection network at low cost. This paper describes the architecture and implementation of the RACE ...
Bradley C. Kuszmaul
HIPEAC
2005
Springer
15 years 7 months ago
Exploiting a Computation Reuse Cache to Reduce Energy in Network Processors
Abstract. High end routers are targeted at providing worst case throughput guarantees over latency. Caches on the other hand are meant to help latency not throughput in a tradition...
Bengu Li, Ganesh Venkatesh, Brad Calder, Rajiv Gup...