Sciweavers

135 search results - page 2 / 27
» Hierarchical source routing using implied costs
Sort
View
LCN
2002
IEEE
13 years 10 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
MOBICOM
2006
ACM
13 years 11 months ago
On optimal communication cost for gathering correlated data through wireless sensor networks
In many energy-constrained wireless sensor networks, nodes cooperatively forward correlated sensed data to data sinks. In order to reduce the communication cost (e.g. overall ener...
Junning Liu, Micah Adler, Donald F. Towsley, Chun ...
INFOCOM
2006
IEEE
13 years 11 months ago
End-to-End Service Quality Measurement Using Source-Routed Probes
— The need to monitor real time network services has prompted service providers to use new measurement technologies, such as service-specific probes. Service-specific probes ar...
Fei Li, Marina Thottan
TELSYS
2002
128views more  TELSYS 2002»
13 years 5 months ago
An Evaluation of Shared Multicast Trees with Multiple Cores
Native multicast routing protocols have been built and deployed using two basic types of trees: singlesource, shortest-path trees and shared, core-based trees. Core-based multicas...
Daniel Zappala, Aaron Fabbri, Virginia Mary Lo
ICNP
1998
IEEE
13 years 9 months ago
Receiver-based Multicast Scoping: A New Cost-Conscious Join/Leave Paradigm
In Internet multicast, the set of receivers can be dynamic with receivers joining and leaving a group asynchronously and without the knowledge of the sources. The Internet today u...
George F. Riley, Mostafa H. Ammar, Lenitra M. Clay