Electrical computers and digital processing systems: multicomput – Computer network managing – Computer network monitoring
Reexamination Certificate
1997-12-24
2001-01-09
Rinehart, Mark H. (Department: 2756)
Electrical computers and digital processing systems: multicomput
Computer network managing
Computer network monitoring
C709S235000, C709S225000, C340S870030, C340S870030, C379S092010
Reexamination Certificate
active
06173323
ABSTRACT:
TECHNICAL FIELD
This invention relates generally to the field of network management and in particular to a method for efficient polling of network hosts and resources and a network manager for implementing the same.
BACKGROUND OF THE INVENTION
Referring to
FIG. 1
, identifying the various hosts and resources
13
,
15
and
17
-
19
, connected and available to a network
18
is a vital part of proper network management. Typically one host on the network is assigned the task of network manager (“NM”)
10
, running appropriate software, while the remaining hosts and resources are identified as agents. The manager
10
will periodically request information from the agents using one of a variety of protocols, e.g. Simple Network Manager Protocol (“SNMP”) at the application layer, or Packet Internet Groper (“PING”) at the IP layer, and expect a response from each agent using the same protocol. This process is referred to as “polling.”
Efficient polling is becoming increasingly important with new bandwidth-intensive applications such as conferencing and web-push applications. Proper monitoring of the network can help deploy such applications. The collected traffic pattern of the network can be used to set and administer policies on application use, to configure intranet switches and routers, and to detect errant behavior. The challenge in polling is to be able to poll with high throughput, yet avoid intruding on the performance of user applications in the network.
Presently, the de facto network management software is marketed by Hewlett Packard under the trade name OpenView (“OV”) and described more fully in R. Sturm, “Q&A”, OpenView Advisor, pp. 11-13, 1(2) (March 1995), hereby incorporated by reference as if fully set forth herein. In operation, OV can transmit a maximum of N outstanding polls, where N is typically 3. For example, NM
10
may send a first poll to node
17
. NM
10
will then wait a time-out period T
1
, for a response. If no response is received, a second poll is sent to node
17
and NM
10
will wait a time-out period 2×T
1
, for a response. This is repeated two more times with corresponding time-out periods of 4×T
1
and 8×T
1
, respectively. NM
10
resends the poll these four times with continuously increasing time-out periods in order to rule out that the lack of a response is due to network traffic. If after four attempts no response to the polls is received, NM
10
concludes that node
17
is unavailable to the network.
It has been reported that the foregoing method of polling network resources is inefficient and leads to network “freeze up” as for example when a succession of nodes are unresponsive. See, A. B. Bondi, “A Nonblocking Mechanism for Regulating the transmission of Network Management Polls” IM '97, pp. 565-80 (May 1997), hereby incorporated by reference as if fully set forth herein. One proposed solution to ameliorate the deficiencies of the OV method is described in Bondi, supra. As described more fully therein, a minimum time threshold &tgr; is set under which no two polls can be transmitted, while the maximum number of polls parameter N of OV is eliminated. As a result, freeze up is avoided by removing the constraint of N and network traffic is managed with constraint &tgr;. However, even this proposal suffers from its inability to provide feedback relating to network congestion. The ability of a poller to quickly adapt to congestion is becoming increasingly important. Newer applications require continual monitoring, for example, at a rate of 5% of network capacity. Such monitoring can cause a network that is already congested with user traffic to collapse.
SUMMARY OF THE INVENTION
Accordingly, the present invention provides an adaptive rate of polling which is sensitive to network congestion. In accordance with the invention the network resources are polled with a minimum rate of transmission to avoid “freeze up,” while also providing feedback as to network congestion. Initially, a baseline rate constraint is set based on desirable engineering factors. Unacknowledged polls are retransmitted with timeouts, successively increasing by a factor of 2. During each polling round, the rate is adapted in accordance with congestion feedback based on earlier poll responses and changes in node status such as recently activated or deactivated nodes.
REFERENCES:
patent: 4598363 (1986-07-01), Clark et al.
patent: 4689619 (1987-08-01), O'Brien
patent: 4905233 (1990-02-01), Cain et al.
patent: 5084875 (1992-01-01), Weinberger et al.
patent: 5193151 (1993-03-01), Jain et al.
patent: 5276677 (1994-01-01), Ramamurthy et al.
patent: 5633859 (1997-05-01), Jain et al.
patent: 5659787 (1997-08-01), Schieltz
patent: 5896561 (1999-04-01), Schrader et al.
patent: 5922051 (1999-07-01), Sidey
A multiple access scheme for Wireless access to a broadband ATM LAN polling and sectored antennas, Mahmoud, A.S.; Mahmoud, S.A.; Falconer, D.D. Dept. of Syst. & Compt. Eng. Carleton Univ., Ottawa, Ont. Canada, pp. 596-608, May, 1996.
Adaptive polling schemes for an ATM bus, Karlsson, J.M.; Perros, H.G.; Viniotis, I., Center for Commun. & Signal Process, North Carolina State Univ., Raleigh, NC, USA, pp. 403-407, ISBN: 0-7803-0006-8, May 1996.
J. Case et al., “A Simple Network Management Protocol (SNMP)”, RFC 1157, Network Working Group, IETF, 1990.
R. Sturm, “Q&A”, Open View Advisor, pp. 11-13, 1(2), Mar. 1995.
A.B. Bondi, “A nonblocking mechanism for regulating the transmission of network management polls”, IM'97, pp. 565-580, May 1997.
Analysis of symmetric nonexhaustive polling with multiple server, Marsanm, de Moraes, Donatelli, Neri, INFOCOM ′90 May 6,1990.*
Lucent Technologies - Inc.
Prieto Beatriz
Rinehart Mark H.
LandOfFree
Adaptive polling rate algorithm for SNMP-based network... does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Adaptive polling rate algorithm for SNMP-based network..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Adaptive polling rate algorithm for SNMP-based network... will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-2447692