Sampling rules for information dissemination

Details Sampling rules for information dissemination Sampling rules for information dissemination

2008-01-30

2011-12-20

Harper, Kevin C (Department: 2466)

Multiplex communications

Network configuration determination

C370S400000, C709S232000

Reexamination Certificate

active

08081581

ABSTRACT:
Sampling rules for information dissemination are described which may be applied in a system containing a number of nodes arranged into groups. A target address is selected using one of two methods: selection of an address from the entire address space of the system and selection of an address from a part of the address space which corresponds to set of groups of nodes. The set of groups of nodes is updated when information is successfully disseminated to a node at a target address selected using the first of the two methods. Rules to determine which of the two methods are used for any particular selection operation are also described.

REFERENCES:
patent: 7080136 (2006-07-01), Duffield et al.
patent: 7133928 (2006-11-01), McCanne
patent: 7512097 (2009-03-01), Jelitto et al.
patent: 2003/0088620 (2003-05-01), Kermarrec et al.
patent: 2005/0102299 (2005-05-01), Mair et al.
patent: 2006/0098585 (2006-05-01), Singh et al.
patent: 2006/0176847 (2006-08-01), Chen et al.
patent: 2006/0239275 (2006-10-01), Zlateff et al.
patent: 2007/0091789 (2007-04-01), Thukral
patent: 2007/0214046 (2007-09-01), Falchuk et al.
patent: 2007/0237080 (2007-10-01), Savagaonkar
patent: 2008/0175169 (2008-07-01), Deb et al.
patent: WO 2007102096 (2007-09-01), None
Riviere, Etienne, et al., “Compositional Gossip: a conceptual architecture for desigining gossip-based applications”, ACM Sigops Operating Systems Review, Oct. 2007.
C. C. Zou, D. Towsley, and W. Gong. “On the Performance of Internet Worm Scanning Strategies,” Technical Report TR-03-CSE-07, UMass ECE Dept., Nov. 2003.
Akdere, et al., “A comparison of epidemic algorithms in wireless sensor networks”, Elsevier B. V. 2006, 2450-2457, pp. 1-8.
Chen, et al., “A Self-Learning Worm Using Importance Scanning”, ACM, 2005, pp. 1-8.
Jelasity, et al., “The Peer Sampling Service: Experimental Evaluation of Unstructured Gossip-Based Implementations*”, 2001, pp. 1-21.
Jesi, et al., “A Secure Peer Sampling Service as a “Hub attack” countermeasure”, May 2006, pp. 1-15.
Vojnovic, et al., “Sampling Strategies for Epidemic-Style Information Dissemination”, Jul. 2007, pp. 1-15.
Xie, et al., “How Dynamic are IP Addresses?”, ACM, 2007, pp. 1-12.
Zou, et al., “On the Performance of Internet Worm Scanning Strategies”, 2007, pp. 1-16.
Hardy, et al., “Inequalities”. Second Edition, Published by the Press Syndicate of the University of Cambridge, Cambridge, United Kingdom, 1988, pp. 16-19.
Gupta, et al., “Efficient Epidemic-style Protocols for Reliable and Scalable Multicast”, In Proceedings of the 21st Symposium on Reliable Distribute Systems, 2002, pp. 1-10.
Kyasanur, et al., “Smart Gossip: Infusing Adaptivity into Gossiping Protocols for Sensor Networks*”, Tech. Report. UIUC, Apr. 2006, pp. 1-25.

Affiliated with

Also associated with

Rating

Sampling rules for information dissemination does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Sampling rules for information dissemination, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Sampling rules for information dissemination will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-4257597