Sciweavers

671 search results - page 72 / 135
» Context-specific Route Directions
Sort
View
ISAAC
2003
Springer
92views Algorithms» more  ISAAC 2003»
14 years 27 days ago
Wavelength Conversion in Shortest-Path All-Optical Networks
We consider all-optical networks with shortest-path routing that use wavelength-division multiplexing and employ wavelength conversion at specific nodes in order to maximize their...
Thomas Erlebach, Stamatis Stefanakos
FTDCS
2004
IEEE
13 years 11 months ago
Random Landmarking in Mobile, Topology-Aware Peer-to-Peer Networks
DHTs can locate objects in a peer-to-peer network within an efficient amount of overlay hops. Since an overlay hop is likely to consist of multiple physical hops, the ratio betwee...
Rolf Winter, Thomas Zahn, Jochen H. Schiller
INFOCOM
2005
IEEE
14 years 1 months ago
BARD: Bayesian-assisted resource discovery in sensor networks
Data dissemination in sensor networks requires four components: resource discovery, route establishment, packet forwarding, and route maintenance. Resource discovery can be the mos...
Fred Stann, John S. Heidemann
ANCS
2010
ACM
13 years 5 months ago
Axon: a flexible substrate for source-routed ethernet
This paper introduces the Axon, an Ethernet-compatible device for creating large-scale datacenter networks. Axons are inexpensive, practical devices that are demonstrated using pr...
Jeffrey Shafer, Brent Stephens, Michael Foss, Scot...
STOC
2004
ACM
131views Algorithms» more  STOC 2004»
14 years 8 months ago
(Almost) tight bounds and existence theorems for confluent flows
A flow is said to be confluent if at any node all the flow leaves along a single edge. Given a directed graph G with k sinks and non-negative demands on all the nodes of G, we con...
Jiangzhuo Chen, Robert D. Kleinberg, Lászl&...