Sciweavers

5922 search results - page 631 / 1185
» Navigability of Complex Networks
Sort
View
COMSWARE
2006
IEEE
16 years 1 months ago
Separating control software from routers
Abstract— Control software in routers have gotten increasingly complex today. Further, since the control software runs in every router, managing a large network of routers is com...
Ramachandran Ramjee, Furquan Ansari, Martin Havema...
ICNP
2006
IEEE
16 years 1 months ago
Robust Path-Vector Routing Despite Inconsistent Route Preferences
— Some commonly used inter-domain-routing policies—e.g., those using BGP’s MED attribute for cold-potato routing—are beyond the scope of routing theory developed to date. T...
Aaron D. Jaggard, Vijay Ramachandran
QSHINE
2005
IEEE
16 years 23 days ago
Solving The Multi-Constrained Path Selection Problem By Using Depth First Search
An extended depth-first-search (EDFS) algorithm is proposed to solve the multi-constrained path (MCP) problem in quality-of-service (QoS) routing, which is NP-Complete when the n...
Zhenjiang Li, J. J. Garcia-Luna-Aceves
EUROPAR
2005
Springer
16 years 22 days ago
An Approach to Performance Prediction for Parallel Applications
Abstract. Accurately modeling and predicting performance for largescale applications becomes increasingly difficult as system complexity scales dramatically. Analytic predictive mo...
Engin Ipek, Bronis R. de Supinski, Martin Schulz, ...
VLDB
2005
ACM
129views Database» more  VLDB 2005»
16 years 20 days ago
Sketching Streams Through the Net: Distributed Approximate Query Tracking
Emerging large-scale monitoring applications require continuous tracking of complex dataanalysis queries over collections of physicallydistributed streams. Effective solutions hav...
Graham Cormode, Minos N. Garofalakis