Sciweavers

83 search results - page 7 / 17
» Arc routing problems with time-dependent service costs
Sort
View
ENTCS
2007
190views more  ENTCS 2007»
13 years 7 months ago
Modelling Multicast QoS Routing by using Best-Tree Search in And-or Graphs and Soft Constraint Logic Programming
We suggest a formal model to represent and solve the multicast routing problem in multicast networks. To attain this, we model the network adapting it to a weighted and-or graph, ...
Stefano Bistarelli, Ugo Montanari, Francesca Rossi...
WDAG
2009
Springer
154views Algorithms» more  WDAG 2009»
14 years 2 months ago
Compact Multicast Routing
In a distributed network, a compact multicast scheme is a routing scheme that allows any source to send messages to any set of targets. We study the trade-off between the space us...
Ittai Abraham, Dahlia Malkhi, David Ratajczak
IPTPS
2005
Springer
14 years 1 months ago
Evaluating DHT-Based Service Placement for Stream-Based Overlays
Stream-based overlay networks (SBONs) are one approach to implementing large-scale stream processing systems. A fundamental consideration in an SBON is that of service placement, ...
Peter R. Pietzuch, Jeffrey Shneidman, Jonathan Led...
CIC
2004
118views Communications» more  CIC 2004»
13 years 9 months ago
An Efficient Delay Sensitive Multicast Routing Algorithm
As a key issue in multicast routing with quality of service (QoS) support, constrained minimum Steiner tree (CMST) problem has been a research focus for more than a decade, and ten...
Gang Feng
GLOBECOM
2008
IEEE
14 years 2 months ago
Optimal Location Updates in Mobile Ad Hoc Networks: A Separable Cost Case
Abstract—We consider the location service in a mobile adhoc network (MANET), where each node needs to maintain its location information in the network by (i) frequently updating ...
Zhenzhen Ye, Alhussein A. Abouzeid