Sciweavers

2926 search results - page 18 / 586
» Partially Optimal Routing
Sort
View
INFOCOM
2005
IEEE
14 years 29 days ago
Routing in ad hoc networks: a theoretical framework with practical implications
— In this paper, information theoretic techniques are used to derive analytic expressions for the minimum expected length of control messages exchanged by proactive routing in a ...
Nianjun Zhou, Alhussein A. Abouzeid
ASPDAC
2005
ACM
114views Hardware» more  ASPDAC 2005»
13 years 9 months ago
Redundant-via enhanced maze routing for yield improvement
- Redundant via insertion is a good solution to reduce the yield loss by via failure. However, the existing methods are all post-layout optimizations that insert redundant via afte...
Gang Xu, Li-Da Huang, David Z. Pan, Martin D. F. W...
SIGMOD
2009
ACM
291views Database» more  SIGMOD 2009»
14 years 7 months ago
Partial join order optimization in the paraccel analytic database
The ParAccel Analytic DatabaseTM is a fast shared-nothing parallel relational database system with a columnar orientation, adaptive compression, memory-centric design, and an enha...
Yijou Chen, Richard L. Cole, William J. McKenna, S...
INFOCOM
2005
IEEE
14 years 29 days ago
Joint optimal scheduling and routing for maximum network throughput
— In this paper we consider packet networks loaded by admissible traffic patterns, i.e. by traffic patterns that, if optimally routed, do not overload network resources. In the...
Emilio Leonardi, Marco Mellia, Marco Ajmone Marsan...
COMCOM
2007
78views more  COMCOM 2007»
13 years 7 months ago
Multihoming route control among a group of multihomed stub networks
In recent years, commercial “Multihoming Route Control” devices are used by multihomed stub networks to optimize the routing of their Internet traffic. Previous studies have sh...
Yong Liu, A. L. Narasimha Reddy