Sciweavers

3267 search results - page 628 / 654
» Generalized quasirandom graphs
Sort
View
SIGCOMM
2004
ACM
14 years 1 months ago
A first-principles approach to understanding the internet's router-level topology
A detailed understanding of the many facets of the Internet’s topological structure is critical for evaluating the performance of networking protocols, for assessing the effecti...
Lun Li, David Alderson, Walter Willinger, John Doy...
SIGCOMM
2004
ACM
14 years 1 months ago
Work-conserving distributed schedulers for Terabit routers
−Buffered multistage interconnection networks offer one of the most scalable and cost-effective approaches to building high capacity routers. Unfortunately, the performance of su...
Prashanth Pappu, Jonathan S. Turner, Kenneth Wong
VRST
2004
ACM
14 years 1 months ago
The MORGAN framework: enabling dynamic multi-user AR and VR projects
The availability of a suitable framework is of vital importance for the development of Augmented Reality (AR) and Virtual Reality (VR) projects. While features such as scalability...
Jan Ohlenburg, Iris Herbst, Irma Lindt, Torsten Fr...
EMSOFT
2004
Springer
14 years 1 months ago
Approximation of the worst-case execution time using structural analysis
We present a technique to approximate the worst-case execution time that combines structural analysis with a loop-bounding algorithm based on local induction variable analysis. St...
Matteo Corti, Thomas R. Gross
IPSN
2004
Springer
14 years 1 months ago
Lattice sensor networks: capacity limits, optimal routing and robustness to failures
We study network capacity limits and optimal routing algorithms for regular sensor networks, namely, square and torus grid sensor networks, in both, the static case (no node failu...
Guillermo Barrenechea, Baltasar Beferull-Lozano, M...