Sciweavers

1663 search results - page 230 / 333
» Compositional Service Trees
Sort
View
103
Voted
ISPDC
2006
IEEE
15 years 8 months ago
How to Achieve High Throughput with Dynamic Tree-Structured Coterie
Data replication permits a better network bandwidth utilization and minimizes the effect of latency in large-scale systems such as computing grids. However, the cost of maintainin...
Ivan Frain, Abdelaziz Mzoughi, Jean Paul Bahsoun
IJIPT
2008
81views more  IJIPT 2008»
15 years 2 months ago
Towards seamless source mobility in SSM: design and evaluation of the Tree Morphing protocol
: Multimedia networking in the near future is expected to be dominated by group applications such as IPTV, MMORPGs, and video conferencing. Hand in hand with new service offers, th...
Olaf Christ, Thomas C. Schmidt, Matthias Wähl...
ENTCS
2007
190views more  ENTCS 2007»
15 years 1 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...
129
Voted
NOMS
2002
IEEE
130views Communications» more  NOMS 2002»
15 years 7 months ago
End-to-end service failure diagnosis using belief networks
We present fault localization techniques suitable for diagnosing end-to-end service problems in communication systems with complex topologies. We refine a layered system model th...
Malgorzata Steinder, Adarshpal S. Sethi
ISCC
2005
IEEE
104views Communications» more  ISCC 2005»
15 years 8 months ago
Reducing the Forwarding State Requirements of Point-to-Multipoint Trees Using MPLS Multicast
IP multicast was first proposed to improve the performance of applications that require group communications. Still, many years after its initial proposal, IP multicast is not wi...
George Apostolopoulos, Ioana Ciurea