Sciweavers

1089 search results - page 170 / 218
» NetComplex: A Complexity Metric for Networked System Designs
Sort
View
158
Voted
MMB
2010
Springer
194views Communications» more  MMB 2010»
15 years 8 months ago
Searching for Tight Performance Bounds in Feed-Forward Networks
Abstract. Computing tight performance bounds in feed-forward networks under general assumptions about arrival and server models has turned out to be a challenging problem. Recently...
Andreas Kiefer, Nicos Gollan, Jens B. Schmitt
OSDI
2004
ACM
16 years 4 months ago
FFPF: Fairly Fast Packet Filters
FFPF is a network monitoring framework designed for three things: speed (handling high link rates), scalability (ability to handle multiple applications) and flexibility. Multiple...
Herbert Bos, Willem de Bruijn, Mihai-Lucian Criste...
HPN
1997
15 years 5 months ago
Mobiware: QoS-aware middleware for mobile multimedia communications
Next generation wireless communications system will be required to support the seamless delivery of voice, video and data with high quality. Delivering hard Quality of Service (QO...
Andrew T. Campbell
147
Voted
ANCS
2007
ACM
15 years 7 months ago
Ruler: high-speed packet matching and rewriting on NPUs
Programming specialized network processors (NPU) is inherently difficult. Unlike mainstream processors where architectural features such as out-of-order execution and caches hide ...
Tomas Hruby, Kees van Reeuwijk, Herbert Bos
MOBICOM
2003
ACM
15 years 9 months ago
Minimum energy disjoint path routing in wireless ad-hoc networks
We develop algorithms for finding minimum energy disjoint paths in an all-wireless network, for both the node and linkdisjoint cases. Our major results include a novel polynomial...
Anand Srinivas, Eytan Modiano