Sciweavers

16128 search results - page 2691 / 3226
» Distributed network scheduling
Sort
View
ENTCS
2007
190views more  ENTCS 2007»
15 years 6 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...
PC
2007
112views Management» more  PC 2007»
15 years 6 months ago
Service address routing: a network-embedded resource management layer for cluster computing
Service address routing is introduced as a novel and powerful paradigm for the integration of resource management functions into the interconnection fabric of cluster computers. S...
Isaac D. Scherson, Daniel S. Valencia, Enrique Cau...
IWSEC
2010
Springer
15 years 5 months ago
Securing MANET Multicast Using DIPLOMA
Multicast traffic, such as live audio/video streaming, is an important application for Mobile Ad Hoc Networks (MANETs), including those used by militaries and disaster recovery tea...
Mansoor Alicherry, Angelos D. Keromytis
MICS
2010
134views more  MICS 2010»
15 years 5 months ago
Scale Free Properties of Random k-Trees
Scale free graphs have attracted attention as their non-uniform structure that can be used as a model for many social networks including the WWW and the Internet. In this paper, w...
Colin Cooper, Ryuhei Uehara
174
Voted
WIOPT
2010
IEEE
15 years 5 months ago
Low complexity algorithms for relay selection and power control in interference-limited environments
Abstract—We consider an interference-limited wireless network, where multiple source-destination pairs compete for the same pool of relay nodes. In an attempt to maximize the sum...
Lazaros Gkatzikis, Iordanis Koutsopoulos
« Prev « First page 2691 / 3226 Last » Next »