Channelization problem in large scale data dissemination

International Conference on Network Protocols

Volumn , Issue , 2001, Pages 100-109

  Adler, Micah ^a   Ge, Zihui ^a   Kurose, James F ^a   Towsley, Don ^a   Zabele, Stephen ^a  

^a NONE

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; COMMUNICATION CHANNELS (INFORMATION THEORY); COMPUTATIONAL COMPLEXITY; HEURISTIC METHODS; MERGING; MULTICASTING;

CHANNELIZATION; LARGE SCALE DATA DISSEMINATION; MULTIPLE MULTICAST;

DATA COMMUNICATION SYSTEMS;

EID: 0035701622     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICNP.2001.992889     Document Type: Conference Paper

References (11)

1. An efficient multicast protocol for content-based publish-subscribe systems
2. Data subscription
3. Achieving scalability and expressiveness in an internet-scale event notification service
4. Record allocation for minimizing expected retrieval costs on drum-like storage devices
5. Channelization problem in large scale data dissemination
6. Consideration of receiver interest for ip multicast delivery
7. Multicast grouping for dynamic data distribution management
8. Router level filtering for receiver interest delivery
9. The set basis problem is np-complete
10. Interest management using an active networks approach