DISTRIBUTED PROPAGATION OF DATA IN A WIRELESS COMMUNICATION NETWORK

• US 20120110183A1
• Filed: 10/28/2010
• Published: 05/03/2012
• Est. Priority Date: 10/28/2010
• Status: Active Grant

• Current Assignee: Extreme Networks, Inc.
• Original Assignee: Symbol Technologies, Inc. (Zebra Technologies Corporation)
• Inventors: Miranda, Trevor, Batta, Puneet
• Granted Patent: US 8,352,604 B2
• Time in Patent Office: Days
• US Class Current: 709/226
• CPC Class Codes: H04L 67/104 Peer-to-peer [P2P] networks
• CPC Class Codes: H04L 67/1068 Discovery involving direct consultation or announcement among potential requesting and potential source peers
• CPC Class Codes: H04L 67/1078 Resource delivery mechanisms

Abstract

A technique for distributed propagation of data in a wireless communication network includes providing 600 a unique host identifier for each peer network entity in the wireless communication network, each host identifier having a length of B bits. A next step includes requesting 602 data from peer network entities using a request having a host identifier of the requesting network entity. A next step includes, if a peer network entity is hosting the requested data, comparing 608 the host identifiers of the requesting network entity and the peer network entity receiving the request to determine a match. A next step includes responding 610 to the request if a match is determined.

Claims

1. A method for distributed propagation of data in a wireless communication network, the method comprising:

providing a unique host identifier for peer network entities in the wireless communication network, each host identifier having a length of B bits;

requesting data from peer network entities using a request having a host identifier of the requesting network entity;

if a peer network entity is hosting the requested data, comparing the host identifiers of the requesting network entity and the peer network entity receiving the request to determine a match; and

responding to the request if a match is determined.

2. The method of claim 1, wherein the requesting step is repeated a number of times, Q, up to B+1, and further comprising truncating the length of the host identifiers by one bit for each subsequent repeat, Q, of the request.

3. The method of claim 2, wherein if Q=B+1, then a match is automatically determined.

4. The method of claim 1, wherein the bits in the host identifiers of all the network entities in the communication network have a substantially uniform distribution.

5. The method of claim 1, wherein the host identifier in each network entity is regenerated periodically to change the distribution among the network entities over time.

6. The method of claim 2, wherein providing includes providing a generation identifier for data, and wherein responding includes those network entities hosting data with a generation identifier below a threshold T always respond to the first X number of requests regardless of whether the host identifier bits match.

7. The method of claim 6, wherein T and X are less than B.

8. A method for distributed propagation of data in a wireless communication network, the method comprising:

providing a unique host identifier for each peer network entity in the wireless communication network, each host identifier having a length of B bits;

requesting data from peer network entities using a request having a host identifier of the requesting network entity, wherein this step is repeated a number of times, Q, up B+1;

if a peer network entity is hosting the requested data, truncating the length of the host identifiers of the requesting and peer network entities by one bit for each subsequent repeat, Q, of the request, and comparing the host identifiers of the requesting network entity and the peer network entity receiving the request to determine a match; and

responding to the request if a match is determined.

9. A network entity for distributed propagation of data in a wireless communication network, the network entity comprising:

a transceiver; and

a processor coupled to the transceiver, the processor operable to provide a unique host identifier having a length of B bits for the network entity, receive a request for data from a requesting network entity where the request includes a host identifier of the requesting network entity, wherein if the network entity is hosting the requested data, the processor is operable to comparing its host identifier with that of the requesting network entity to determine a match, and if a match is determined the processor directs the transceiver to respond to the request.

10. The entity of claim 9, wherein the entity is a wireless switch.

11. The entity of claim 9, wherein the transceiver receives requests that are repeated a number of times, Q, up B+1, and wherein the processor truncates the length of the host identifiers by one bit for each subsequent repeat, Q, of the request.

12. The entity of claim 9, wherein if Q=B+1, then a match is automatically determined by the processor.

13. The entity of claim 9, wherein the bits in the host identifiers of all the network entities in the communication network have a substantially uniform distribution.

14. The entity of claim 9, wherein the host identifier in the network entity is regenerated periodically to change the distribution among the network entities in the communication network over time.

15. The entity of claim 11, wherein the processor is operable to provide a generation identifier for hosted data, and wherein the processor directs the transceiver to respond to the first X number of requests if the generation identifier is below a threshold T, regardless of whether the host identifier bits match.

16. The entity of claim 15, wherein T and X are less than B.