Sciweavers

581 search results - page 76 / 117
» Approximation algorithms for constructing wavelength routing...
Sort
View
STOC
2007
ACM
134views Algorithms» more  STOC 2007»
16 years 1 months ago
Hardness of routing with congestion in directed graphs
Given as input a directed graph on N vertices and a set of source-destination pairs, we study the problem of routing the maximum possible number of source-destination pairs on pat...
Julia Chuzhoy, Venkatesan Guruswami, Sanjeev Khann...
ICALP
2010
Springer
15 years 6 months ago
Network Design via Core Detouring for Problems without a Core
Some of the currently best-known approximation algorithms for network design are based on random sampling. One of the key steps of such algorithms is connecting a set of source nod...
Fabrizio Grandoni, Thomas Rothvoß
SASO
2008
IEEE
15 years 7 months ago
On a Self-Organizing MANET Event Routing Architecture with Causal Dependency Awareness
Publish/subscribe (P/S) is a communication paradigm of growing popularity for information dissemination in largescale distributed systems. The strong decoupling between informatio...
Guanhong Pei, Binoy Ravindran, E. Douglas Jensen

Presentation
956views
13 years 7 months ago
A Method for Distributed Computaion of Semi-Optimal Multicast Tree in MANET
In this paper, we propose a new method to construct a semi-optimal QoS-aware multicast tree on MANET using distributed computation of the tree based on Genetic Algorithm (GA). This...
NGC
2001
Springer
196views Communications» more  NGC 2001»
15 years 5 months ago
Application-Level Multicast Using Content-Addressable Networks
Abstract. Most currently proposed solutions to application-level multicast organize the group members into an application-level mesh over which a DistanceVector routing protocol, o...
Sylvia Ratnasamy, Mark Handley, Richard M. Karp, S...