Network-specific estimation in network node discovery

Abstract

Network node discovery is implemented using parameters reflecting network-specific characteristics. Estimates of the number of active nodes in a network are computed based on the presence of dead time (e.g., due to clock latency, device driver delays, etc.), network topology, packet size, network capacity, a tolerable network overload threshold, and other characteristics. A network node enumeration process is therefore parameterized to incorporate consideration of such characteristics. A damping factor that incorporates dead time to set a lower bound for an estimate of remaining active nodes in a network is one example of a network-specific parameter.

1 . A computer-implemented method of managing enumeration traffic in a computer network, the method comprising:
 computing a damping factor based on either or a combination of a dead time metric associated with the computer network or a packet interval associated with the computer network;   computing an estimate of active nodes remaining to respond to an enumeration request in the computer network, wherein the estimate is bounded by a lower bound based on the damping factor; and   scheduling transmission of enumeration responses in accordance with the estimate.   
     
     
         2 . The computer-implemented method of  claim 1  wherein said computing an estimate of active nodes remaining to respond to an enumeration request in the computer network comprises:
 computing an unbounded estimate of active nodes remaining to respond to the enumeration request as a function of a timing round duration in the computer network; and 
 applying the lower bound to obtain the estimate. 
 
     
     
         3 . The computer-implemented method of  claim 1  wherein said computing an estimate of active nodes remaining to respond to an enumeration request in the computer network comprises:
 computing the estimate of active nodes remaining to respond to the enumeration request in a current round as a function of a previously computed estimate of active nodes remaining to respond to the enumeration request in a previous round. 
 
     
     
         4 . The computer-implemented method of  claim 1  wherein, when computed, the packet interval is computed as a function of an expected packet size in the computer network. 
     
     
         5 . The computer-implemented method of  claim 1  wherein, when computed, the packet interval is computed as a function of network capacity in the computer network. 
     
     
         6 . The computer-implemented method of  claim 1  wherein, when computed, the packet interval is computed as a function of a maximum fraction of network capacity allocated to enumeration traffic in the computer network. 
     
     
         7 . The computer-implemented method of  claim 1  wherein said computing an estimate of active nodes remaining to respond to an enumeration request in the computer network comprises:
 computing the estimate of active nodes remaining to respond to the enumeration request as a function of a timing round duration in the computer network; and 
 applying the lower bound to obtain the estimate. 
 
     
     
         8 . One or more computer-readable storage media embodying instructions which, when executed, implement a method comprising:
 computing a damping factor based on either or a combination of a dead time metric associated with the computer network or a packet interval associated with the computer network;   computing an estimate of active nodes remaining to respond to an enumeration request in the computer network, wherein the estimate is bounded by a lower bound based on the damping factor; and   scheduling transmission of enumeration responses in accordance with the estimate.   
     
     
         9 . The one or more computer-readable storage media of  claim 8 , wherein said computing an estimate of active nodes remaining to respond to an enumeration request in the computer network comprises:
 computing an unbounded estimate of active nodes remaining to respond to the enumeration request as a function of a timing round duration in the computer network; and   applying the lower bound to obtain the estimate.   
     
     
         10 . The one or more computer-readable storage media of  claim 8 , wherein said computing an estimate of active nodes remaining to respond to an enumeration request in the computer network comprises:
 computing the estimate of active nodes remaining to respond to the enumeration request in a current round as a function of a previously computed estimate of active nodes remaining to respond to the enumeration request in a previous round.   
     
     
         11 . The one or more computer-readable storage media of  claim 8 wherein, when computed, the packet interval is computed as a function of an expected packet size in the computer network. 
     
     
         12 . The one or more computer-readable storage media of  claim 8 wherein, when computed, the packet interval is computed as a function of network capacity in the computer network. 
     
     
         13 . The one or more computer-readable storage media of  claim 8 wherein, when computed, the packet interval is computed as a function of a maximum fraction of network capacity allocated to enumeration traffic in the computer network. 
     
     
         14 . The one or more computer-readable storage media of  claim 8 , wherein said computing an estimate of active nodes remaining to respond to an enumeration request in the computer network comprises:
 computing the estimate of active nodes remaining to respond to the enumeration request as a function of a timing round duration in the computer network; and   applying the lower bound to obtain the estimate.   
     
     
         15 . A system for managing enumeration traffic in a computer network, the system comprising:
 means for computing a damping factor based on either or a combination of a dead time metric associated with the computer network or a packet interval associated with the computer network;   means for computing an estimate of active nodes remaining to respond to an enumeration request in the computer network, wherein the estimate is bounded by a lower bound based on the damping factor; and   means for scheduling transmission of enumeration responses in accordance with the estimate.   
     
     
         16 . The system of  claim 15  wherein said means for computing an estimate of active nodes remaining to respond to an enumeration request in the computer network comprises:
 means for computing an unbounded estimate of active nodes remaining to respond to the enumeration request as a function of a timing round duration in the computer network; and 
 means for applying the lower bound to obtain the estimate. 
 
     
     
         17 . The system of  claim 15  wherein said means for computing an estimate of active nodes remaining to respond to an enumeration request in the computer network comprises:
 means for computing the estimate of active nodes remaining to respond to the enumeration request in a current round as a function of a previously computed estimate of active nodes remaining to respond to the enumeration request in a previous round. 
 
     
     
         18 . The system of  claim 15  wherein, when computed, the packet interval is computed as either: a function of an expected packet size in the computer network, a function of network capacity in the computer network, or a function of a maximum fraction of network capacity allocated to enumeration traffic in the computer network. 
     
     
         19 . The system of  claim 15  wherein said means for computing an estimate of active nodes remaining to respond to an enumeration request in the computer network comprises:
 means for computing the estimate of active nodes remaining to respond to the enumeration request as a function of a timing round duration in the computer network; and 
 means for applying the lower bound to obtain the estimate.