Sciweavers

66 search results - page 4 / 14
» The Ordered Core Based Tree Protocol
Sort
View
ICNP
1996
IEEE
13 years 10 months ago
A Comparison of Known Classes of Reliable Multicast Protocols
We analyze the maximum throughput that the known classes of reliable multicast protocols can attain. A new taxonomy of reliable multicast protocols is introduced based on the prem...
Brian Neil Levine, J. J. Garcia-Luna-Aceves
WOWMOM
2005
ACM
138views Multimedia» more  WOWMOM 2005»
13 years 11 months ago
A Scenario-Based Performance Evaluation of Multicast Routing Protocols for Ad Hoc Networks
Current ad hoc multicast routing protocols have been designed to build and maintain a tree or mesh in the face of a mobile environment, with fast reaction to network changes in or...
Manoj Pandey, Daniel Zappala
MMS
1998
13 years 5 months ago
A Comparison of Reliable Multicast Protocols
We analyze the maximum throughput that known classes of reliable multicast transport protocols can attain. A new taxonomy of reliable multicast transport protocols is introduced ba...
Brian Neil Levine, J. J. Garcia-Luna-Aceves
ISPDC
2006
IEEE
13 years 11 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
ALENEX
2010
163views Algorithms» more  ALENEX 2010»
13 years 7 months ago
Succinct Trees in Practice
We implement and compare the major current techniques for representing general trees in succinct form. This is important because a general tree of n nodes is usually represented i...
Diego Arroyuelo, Rodrigo Cánovas, Gonzalo N...