Sciweavers

269 search results - page 50 / 54
» Online oblivious routing
Sort
View
FSTTCS
2004
Springer
14 years 26 days ago
Distributed Algorithms for Coloring and Domination in Wireless Ad Hoc Networks
Abstract. We present fast distributed algorithms for coloring and (connected) dominating set construction in wireless ad hoc networks. We present our algorithms in the context of U...
Srinivasan Parthasarathy 0002, Rajiv Gandhi
BROADNETS
2004
IEEE
13 years 11 months ago
Capacity-Efficient Protection with Fast Recovery in Optically Transparent Mesh Networks
Survivability becomes increasingly critical in managing high-speed networks as data traffic continues to grow in both size and importance. In addition, the impact of failures is e...
Sun-il Kim, Steven S. Lumetta
FGCS
1992
103views more  FGCS 1992»
13 years 8 months ago
Parallel Inference Machine PIM
: There have been no major control problems during the first three years of the new Tokaido-Sanyo Shinkansen (bullet train) Programmed Route Control (PRC) computer system. Prior to...
Kazuo Taki
COCOA
2009
Springer
14 years 3 days ago
On Open Rectangle-of-Influence Drawings of Planar Graphs
: Under water sensor network is an important research direction in computer science. There are many interesting optimization problems regarding its design, routing and applications...
Huaming Zhang, Milind Vaidya
FOCS
1995
IEEE
13 years 11 months ago
Disjoint Paths in Densely Embedded Graphs
We consider the following maximum disjoint paths problem (mdpp). We are given a large network, and pairs of nodes that wish to communicate over paths through the network — the g...
Jon M. Kleinberg, Éva Tardos