Sciweavers

112 search results - page 13 / 23
» Best-effort group service in dynamic networks
Sort
View
ICPADS
2008
IEEE
14 years 1 months ago
Query Management in a Sensor Environment
Traditional sensor network deployments consisted of fixed infrastructures and were relatively small in size. More and more, we see the deployment of ad-hoc sensor networks with h...
Martin F. O'Connor, Vincent Andrieu, Mark Roantree
WWCA
1998
Springer
13 years 11 months ago
Compact and Flexible Resolution of CBT Multicast Key-Distribution
In an open network such as the Internet, multicast security services typically start with group session-key distribution. Considering scalability for group communication among wide...
Kanta Matsuura, Yuliang Zheng, Hideki Imai
LCN
2002
IEEE
13 years 11 months ago
Scalable Multicast Routing Protocol Using Anycast and Hierarchical-Trees
A novel efficiency and effectiveness Internet multicast routing protocol is presented with short delay, high throughput, resource utilization and scalability for a single multicas...
Weijia Jia, Pui-on Au, Gaochao Xu, Wei Zhao
INFOCOM
1999
IEEE
13 years 11 months ago
A Rearrangeable Algorithm for the Construction of Delay-Constrained Dynamic Multicast Trees
With the proliferationof multimediagroup applications, the construction of multicast trees satisfying Qualityof ServiceQoS requirementsis becominga problemof prime importance. Man...
R. Sriram, G. Manimaran, C. Siva Ram Murthy
ISPDC
2006
IEEE
14 years 22 days 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