Sciweavers

460 search results - page 45 / 92
» Bounding the locality of distributed routing algorithms
Sort
View
CN
2007
154views more  CN 2007»
13 years 9 months ago
Disjoint multipath routing using colored trees
— Multipath routing (MPR) is an effective strategy to achieve robustness, load balancing, congestion reduction, and increased throughput in computer networks. Disjoint multipath ...
Srinivasan Ramasubramanian, Harish Krishnamoorthy,...
IPPS
2006
IEEE
14 years 3 months ago
Platform-based FPGA architecture: designing high-performance and low-power routing structure for realizing DSP applications
The novel design of an efficient FPGA interconnection architecture with multiple Switch Boxes (SB) and hardwired connections for realizing data intensive applications (i.e. DSP ap...
Kostas Siozios, Konstantinos Tatas, Dimitrios Soud...
DSOM
2009
Springer
14 years 3 months ago
Self-optimizing Hybrid Routing in Publish/Subscribe Systems
Rendering networks and distributed systems self-managing and self-optimizing has become a major research focus. This task is especially important for systems, such as publish/subsc...
Arnd Schröter, Daniel Graff, Gero Mühl, ...
TON
2002
91views more  TON 2002»
13 years 8 months ago
The stable paths problem and interdomain routing
Abstract-Dynamic routing protocols such as RIP and OSPF essentially implement distributed algorithms for solving the Shortest Paths Problem. The Border Gateway Protocol (BGP) is cu...
Timothy Griffin, F. Bruce Shepherd, Gordon T. Wilf...
INFOCOM
2007
IEEE
14 years 3 months ago
Separability and Topology Control of Quasi Unit Disk Graphs
— A deep understanding of the structural properties of wireless networks is critical for evaluating the performance of network protocols and improving their designs. Many protoco...
Jianer Chen, Anxiao Jiang, Iyad A. Kanj, Ge Xia, F...