US20070121502A1

System and method for handling network overload

Claim Score by NHIP

Abstract

A system and method for handling network overload includes receiving one or more requests, wherein an originating client originates the one or more requests. It is determined if a network element processing the one or more requests is overloaded. If the network element is overloaded, a pushback message is generated. The pushback message is sent with request gapping information to a previous hop in a network, wherein the previous hop is one or more network elements operable to route the one or more network requests to the network element processing the one or more requests.

US20070121502A1, drawing sheet 1 — Sheet 1 of 4

Term

Projected expiry 13 November 2026.

28 claims: 4 independent, 24 dependent

1
Broadest claimClaim Score 71, broad(NHIP)A method for handling network overload, comprising:receiving one or more requests, wherein an originating client originates the one or more requests;determining if a network element processing the one or more requests is overloaded;generating a pushback message if the network element is overloaded;sending the pushback message with request gapping information to a previous hop in a network, wherein the previous hop is one or more network elements operable to route the one or more requests to the network element processing the one or more requests.
10
A computer readable medium including logic for handling network overload, the logic operable to:receive one or more requests, wherein an originating client originates the one or more requests;determine if a network element processing the one or more requests is overloaded;generate a pushback message if the network element is overloaded;send the pushback message with request gapping information to a previous hop in a network, wherein the previous hop is one or more network elements operable to route the one or more requests to the network element processing the one or more requests.
19
A system for handling network overload, the comprising:one or more clients operable to send and receive one or more requests, wherein an originating client sends one or more requests and a terminating client receives one or more requests from the originating client;one or more network elements operable to route the one or more requests, a network element of the one or more network elements operable to: process the one or more requests;determine if the network element process the one or more requests is overloaded;generate a pushback message if the network element is overloaded;send the pushback message with request gapping information to a previous hop in a network, wherein the previous hop is one or more network elements operable to route the one or more requests to the network element processing the one or more requests.
28
A system for handling network overload, comprising:means for receiving one or more requests, wherein an originating client originates the one or more requests;means for determining if a network element processing the one or more requests is overloaded;means for generating a pushback message if the network element is overloaded;means for sending the pushback message with request gapping information to a previous hop in a network, wherein the previous hop is one or more network elements operable to route the one or more network requests to the network element processing the one or more requests.

Independent claims4

39 paragraphs in 6 sections, as filed

0001This application is related to U.S. Application Ser. No. ______, filed on Nov. 29, 2005 by Steven R. Donovan, et al. and entitled “System and Method for Handling Network Overload.”

TECHNICAL FIELD OF THE INVENTION

0002This invention relates generally to the field of communications and more specifically to a system and method for handling network overload.

BACKGROUND

0003Networks facilitate communication between clients using network elements, which may be arranged in clusters. Conventional methods for handling overload in a network element include ignoring the possibility of overload or discarding requests from a client when the network element becomes full.

0004Another conventional method includes balancing the traffic load between network elements in the cluster, which causes the elements in the cluster to approach overload at approximately the same time. When the element reaches overload, conventional methods include returning a pushback response to be handled by the previous element. The pushback message results in the previous element in the network not sending requests to the overloaded element for a period of time. During this time, traffic diverts to other elements in the cluster. Because the other elements in the cluster continue handling their same traffic load, the additional traffic from the overloaded element causes other elements in the cluster to go into an overloaded state also. Consequently, a portion of the network goes into an overloaded state, which prevents the flow of traffic between clients.

SUMMARY OF THE DISCLOSURE

0005From the foregoing, it may be appreciated by those skilled in the art that a need has arisen for an improved system and method for handling network overload. In accordance with the present invention, disadvantages and problems associated with conventional systems and methods to handle network overload may be reduced or eliminated.

0006According to one embodiment of the present invention, a system and method for handling network overload includes receiving one or more requests, wherein an originating client originates the one or more requests. It is determined if a network element processing the one or more requests is overloaded. If the network element is overloaded, a pushback message is generated. The pushback message is sent with request gapping information to a previous hop in a network, wherein the previous hop is one or more network elements operable to route the one or more network requests to the network element processing the one or more requests.

0007Certain embodiments of the invention may provide one or more technical advantages. A technical advantage of one embodiment includes transmitting a pushback message to a previous hop from the overloaded network element to the client. By transmitting the pushback message to a previous hop, the overloaded network element may regain the ability to process requests without causing an entire cluster of network elements to become overloaded. Another technical advantage of another embodiment includes providing request gapping in the pushback message. Therefore, the remainder of the distributed network may continue to operate without experiencing a shutdown. Yet another technical advantage of another embodiment includes allowing the network element at the previous hop to choose an action in response to the pushback message. For example, the network element may choose to send the request to another network element located in the same or a different cluster. The network element may handle a different level of traffic and allow the request from the client to pass through without encountering an overloaded network element.

0008Certain embodiments of the invention may include none, some, or all of the above technical advantages. One or more other technical advantages may be readily apparent to one skilled in the art from the figures, descriptions, and claims included herein.

BRIEF DESCRIPTION OF THE DRAWINGS

0009For a more complete understanding of the present invention and its features and advantages, reference is now made to the following description, taken in conjunction with the accompanying drawings, wherein like reference numerals represent like parts, in which:

0010<figref idref="DRAWINGS">FIG. 1</figref> illustrates a network that includes network elements to route requests made by clients;

0011<figref idref="DRAWINGS">FIG. 2</figref> illustrates an overloaded network element sending a pushback message toward the client;

0012<figref idref="DRAWINGS">FIG. 3</figref> is a flowchart illustrating a method for sending the pushback message toward the client;

0013<figref idref="DRAWINGS">FIG. 4</figref> illustrates an overloaded network element sending a pushback message with request gapping information;

0014<figref idref="DRAWINGS">FIG. 5</figref> is a flowchart illustrating a method for sending the pushback message with request gapping information;

0015<figref idref="DRAWINGS">FIG. 6</figref> is a flowchart illustrating a method for receiving the pushback message at the previous hop with request gapping information.

DETAILED DESCRIPTION OF THE DRAWINGS

0016<figref idref="DRAWINGS">FIG. 1</figref> illustrates a network 10 that includes network elements to route requests on behalf of clients 100. Network 10 includes network elements, such as servers 106 and 108, that facilitate communication between clients 100 by routing the signaling or control requests of clients 100.

0017Clients 100 exchange audio, voice, data, video, or other information in network 10. To control the exchange of the information, clients 100 send signaling or any suitable control request within network 10 to establish communication with other clients 100. The requests may include any suitable information, such as a message, and the request may be in any suitable communication protocol. Clients 100 may be any combination of hardware and/or software that provide communication services to a user. Client 100 may include analog, digital, or Internet Protocol (IP) telephones, a cellular phone, a wireless fidelity phone, a personal computer with a telephony application, a personal digital assistant, or any other suitable communication device. Although network 10 illustrates a particular number of clients 100, any number and arrangement of clients 100 and network elements is contemplated.

0018Network 10 allows clients 100 to communicate with each other. Network 10 may facilitate communication using messages in any suitable protocol, such as Session Initiation Protocol (SIP) or Signaling System Number 7 (SS7) protocol. In an embodiment, network 10 is a distributed network that distributes client responsibility among different network elements, such as an Internet Multimedia Subsystem (IMS), a SS7 network, or any suitable distributed network. Network 10 may include any combination of servers and any other hardware and/or software.

0019Network elements are included in a Point of Presence (PoP) 102. PoP 102 contains a variety of network elements and may interact with other PoPs 102. Network 10 may include any suitable number of PoPs 102. Each client 100 may be assigned to a particular PoP 102. For example, client 100a may use PoP 102a and PoP 102b to communicate with client 100b, while client 100c uses PoP 102c and PoP 102d to communicate with client 100d.

0020In the illustrated embodiment, each PoP 102 includes separate clusters 104 of servers 106 and 108. Clusters 104 include multiple network elements, and may separate the network elements by type. Servers 106 and 108 may be any suitable server type, such as proxy servers, back-to-back user agent servers, or any suitable combination of servers. For example, cluster 104a includes any suitable number of servers 106, which are proxy servers, while cluster 104b includes any suitable number of servers 108, which are back-to-back user agent servers.

0021Servers 106 participate in routing requests from an originating client 100 to a terminating client 100. In an embodiment, servers 106 are proxy servers. Each server 106 may represent a logical entity that transmits requests, messages, or other communication. Server 106 may handle any suitable number of requests at any suitable rate. Within network 10, servers 106 are the entry and exit points for requests of client 100. In an embodiment, servers 106 are responsible for load balancing requests among servers 108 to provide uniform distribution of traffic within PoP 102. Server 106 may support any suitable communication protocol, and may implement any suitable feature related to request routing, such as authentication, authorization, and compression. For example, if network 10 uses SIP, server 106 may be an edge proxy, whereas if network 10 is an IMS network, server 106 may be a Proxy CSCF (P_CSCF).

0022Servers 108 participate in routing any suitable type of request between clients 100. In an embodiment, servers 108 are back-to-back user agents. In yet another embodiment, servers 108 are proxy servers. In addition to routing requests, servers 108 coordinate the traffic for clients 100 served by PoP 102. In an embodiment, servers 108 load balance the requests among servers 108 in another PoP 102 or among servers 106 in PoP 102. Servers 108 may include any suitable combination or arrangement of logic operating to support routing requests between clients 100. Server 108 may support any suitable communication protocol. For example, if network 10 uses IMS, server 108 is a serving CSCF (S_CSCF).

0023In operation, an originating client 100a sends a request to server 106 in PoP 102a assigned to client 100a. Server 106a routes the request to server 108a in the same PoP 102a. Server 108a routes the request to server 108b in PoP 102b associated with a terminating client 100b. Server 108b routes the request to server 106b, which routes the request to the terminating client 100b. Because the request is routed by each network element, a hop in network 10, from originating client 100a to terminating client 100b, the request is routed hop-by-hop through network 10.

0024Each request from each originating client 100a goes through network 10 hop-by-hop to reach terminating client 100b. Servers 108 may become overloaded while handling the received requests. For example, server 108 becomes overloaded if it receives more requests than it can handle, if the requests come faster than expected, if the traffic is congested, or if any other suitable occurrence happens. When server 108 reaches an overloaded state, the portion of network 10 that includes server 108 may continue to operate if server 108 uses one of the following mechanisms to handle the overload: pushing back to the client or pushing back hop-by-hop using request gapping.

0025Modifications, additions, or omissions may be made to network 10 without departing from the scope of the invention. For example, PoP 102 may include any suitable number of network elements and clusters. As another example, network 10 may facilitate communication between clients 100 using any suitable type of network element. Additionally, operations in network 10 may be performed using any suitable logic.

0026<figref idref="DRAWINGS">FIG. 2</figref> illustrates an overloaded network element sending a pushback message 206 toward client 100. Client 100a sends request 200 to server 106a in its associated PoP 102a. Server 106a routes request 200 to server 108a at message 202. Server 108a routes request 200 to server 108b at message 204. Server 108b is in PoP 102b that is associated with terminating client 100b. In the illustrated embodiment, server 108b has reached an overloaded state. Accordingly, server 108b generates a pushback message 206 to inform client 100a of its overloaded state. Server 108b sends pushback message 206 toward client 100a. Server 108b may send pushback message 206 directly to client 100a or route pushback message 206 to client 100a through intervening servers 106 and 108, as shown in the illustrated embodiment. If pushback message 206 is routed through intervening servers 106 and 108, the intervening servers 106 and 108 do not process or handle pushback message 206.

0027Pushback message 206 is a response from server 108 to request 200 sent from client 100a. Pushback message 206 may be generated by any suitable server, such as a SIP server, an IMS server, or a SS7-enabled server. Pushback message 206 may include any suitable information regarding the overloaded state of server 108. For example, pushback message 206 may include retry-after information that provides a time interval in which client 100 may re-send the request. Client 100 may wait for the indicated time interval to expire, alert the user of the condition of server 108, or send request 200 to another server 108. In an embodiment, server 108 sends pushback message 206 with retry-after information for a single user client 100.

0028As another example, pushback message 206 may include request gapping information. Request gapping information provides client 100 with details about sending requests 200, such as a minimum interval between requests or a maximum frequency to send requests. For example, the request gapping information may inform client 100 to send no more than 100 messages every second, a message no faster than every 10 milliseconds, or any suitable frequency, duration, or interval. When client 100 receives pushback message 206, client 100 may throttle the sending of requests 200 according to the request gapping parameters received in pushback message 206. In an embodiment, server 108 sends pushback message 206 with request gapping information when server 108 can originate requests, such as if server 108 is a conferencing server. Request gapping information is more fully discussed with reference to <figref idref="DRAWINGS">FIG. 4</figref>.

0029<figref idref="DRAWINGS">FIG. 3</figref> is a flowchart illustrating a method for sending pushback message 206 toward client 100. At step 300, server 108 receives request 200 from client 100, which has been routed through network 10 using other network elements, such as other servers 106 and 108. At step 302, it is determined whether server 108 is in an overloaded state. If server 108 is in an overloaded state, it generates pushback message 206 at step 304. Server 108 sends pushback message 206 to originating client 100 at step 306. Client 100 may receive pushback message 206 directly from server 108 or pushback message 206 may be routed through intervening servers 106 and 108. If pushback message 206 is routed through intervening servers 106 and 108, server 106 and 108 do not process or handle pushback message 206. As discussed with reference to <figref idref="DRAWINGS">FIG. 2</figref>, pushback message 206 may include any suitable information, such as retry-after information or request gapping information. The method returns to step 300 after server 108 sends pushback message 206 to originating client 100. The method continues until server 106 is not in an overloaded state.

0030If server 106 is not in an overloaded state, server 108 routes request 200 toward terminating client 100 at step 308. When routing request 200 toward terminating client 100, request 200 may proceed through other network elements before reaching terminating client 100. The method subsequently ends when request 200 is routed toward terminating client 100.

0031<figref idref="DRAWINGS">FIG. 4</figref> illustrates an overloaded network element sending a pushback message 406 to a previous hop with request gapping information. Client 100a sends request 400 to server 106a in its associated PoP 102a. Server 106a routes the request to server 108a at message 402. Server 108a routes the request to server 108b at message 404. In the illustrated embodiment, server 108b has reached an overloaded state. Accordingly, server 108b generates a pushback message 406 to inform client 100a of its overloaded state. In an embodiment, pushback message 406 is a SIP message, such as a 503 Service Unavailable response.

0032Pushback message 406 includes request gapping information. Request gapping information provides server 108a with details about sending request 400, such as a minimum interval between requests or a maximum frequency to send requests. The request gapping information may be included as new parameters within an existing header, such as a Retry-After header, or as a new header. The request gapping information may include any suitable parameters, such as duration, interval, frequency, or any suitable combination of parameters. Duration refers to the duration that request gapping should be applied. Interval refers to the minimum time server 108 must wait between sending requests 400. Frequency refers to the maximum requests server 108 may handle per unit of time. Frequency is an alternative parameter to the interval parameter.

0033Request gapping information may apply to any suitable type of request 400. For example, the request gapping information may apply to all types of incoming requests 400, or the request gapping information may apply to specific types of requests 400. In an embodiment, server 106 may pushback lower priority requests 400 with request gapping information and may allow higher priority requests 400 to flow without gapping.

0034When server 108a receives pushback message 406, server 108a may throttle the sending of requests 400 to server 108b by exercising request gapping options. Request gapping options may include any suitable action to discontinue sending requests 400 to server 108b. For example, a request gapping option may include routing pushback message 406 to another upstream element. In the illustrated embodiment, server 108a routes pushback message 406 to server 106a in message 408. Another request gapping option may include server 108a queuing request 400 for later transmission consistent with the request gapping information. Yet another request gapping option includes server 108a routing request 400 to another downstream server, such as server 108c.

0035<figref idref="DRAWINGS">FIG. 5</figref> is a flowchart illustrating a method for sending pushback message 406 to a previous hop with request gapping information. At step 500, server 108b receives request 400 from client 100, which has been routed through network 10 hop-by-hop using other network elements, such as server 106a and server 108a. At step 502, it is determined whether server 108b is in an overloaded state. If server 108b is in an overloaded state, server 108b generates pushback message 406 at step 504. Server 108b sends pushback message 406 with request gapping information to the previous hop at step 506, which is server 108a in the illustrated embodiment. The method returns to step 500 after server 108 sends pushback message 406 to originating client 100. The method continues until server 106 is not in an overloaded state. When server 108b is not in an overloaded state, server 108b routes request 400 toward terminating client 100 at step 508. When routing request 400 toward terminating client 100, request 400 may proceed through other network elements, such as server 106 before reaching terminating client 100. The method subsequently ends when request 400 is routed toward terminating client 100.

0036<figref idref="DRAWINGS">FIG. 6</figref> is a flowchart illustrating a method for receiving the pushback message at the previous hop with request gapping information. At step 600, server 108a may exercise request gapping options. As discussed with reference to <figref idref="DRAWINGS">FIG. 4</figref>, request gapping options may include server 108a routing pushback message 406 upstream through network 10 hop-by-hop, re-routing request 400 to another downstream server 108, or queuing request 400 for later transmission consistent with the request gapping information.

0037At step 602, it is determined whether request 400 has been re-routed to another downstream server 108. If server 108a re-routes request 400 at step 602, the method subsequently ends. If server 108a does not re-route request 400 to another server at step 602, request 400 is rejected at step 604. The method subsequently ends if request 400 is rejected.

0038The flowcharts are only exemplary illustrations. Modifications, additions, or omissions may be made to the flowcharts. In addition, steps and messages may be performed in any suitable manner.

0039While this disclosure has been described in terms of certain embodiments and generally associated methods, alterations and permutations of the embodiment and methods will be apparent to those skilled in the art. Accordingly, the above description of example embodiments does not constrain this disclosure. Other changes, substitutions, and alterations are also possible without departing from the scope and spirit of this disclosure.

Contents6

Every citation, both ways

Citations
Document	Relation	Office	Cited during
US2009040951A1	Cited by	United States of America	Pre-grant
US7756034B2	Cited by	United States of America	Search report
US2008205386A1	Cited by	United States of America	Pre-grant
US2007121515A1	Cited by	United States of America	Pre-grant
US11765020B2	Cited by	United States of America	Search report
US8380850B1	Cited by	United States of America	Applicant
US2022070055A1	Cited by	United States of America	Search report
US2011276701A1	Cited by	United States of America	Pre-grant
US8392558B1	Cited by	United States of America	Applicant
US8429282B1	Cited by	United States of America	Applicant
US7453803B1	Cited by	United States of America	Search report
US9055517B2	Cited by	United States of America	Applicant
US2004228352A1	Cites	United States of America	Pre-grant
US2005091303A1	Cites	United States of America	Pre-grant
US2007118894A1	Cites	United States of America	Pre-grant
US2007121515A1	Cites	United States of America	Pre-grant
US4511762A	Cites	United States of America	Pre-grant
US5778057A	Cites	United States of America	Pre-grant
US5825860A	Cites	United States of America	Pre-grant
US5878224A	Cites	United States of America	Pre-grant
US5898672A	Cites	United States of America	Pre-grant
US6330313B1	Cites	United States of America	Pre-grant
US6469991B1	Cites	United States of America	Pre-grant
US6563790B1	Cites	United States of America	Pre-grant
US6606327B1	Cites	United States of America	Pre-grant
US6707792B1	Cites	United States of America	Pre-grant
US6792510B1	Cites	United States of America	Pre-grant
US7095754B2	Cites	United States of America	Pre-grant
US7110418B2	Cites	United States of America	Pre-grant
US7124440B2	Cites	United States of America	Pre-grant
US7237034B2	Cites	United States of America	Pre-grant
US7437409B2	Cites	United States of America	Pre-grant
US7453803B1	Cites	United States of America	Pre-grant

9 members in 3 offices

This recordMember, by publication datePriority claim

Priority claims2

Priority claims
Document	Office	Kind	Date
29099705	United States of America	A	2005-11-29
US20050290997	–	–	–

Members9

Family members, oldest first
Document	Office	Kind
US2007121502A1	United States of America	A1	2007-05-31
US2007121515A1	United States of America	A1	2007-05-31
WO2007064422A2	World Intellectual Property Organization (WIPO)	A2	2007-06-07
WO2007064422A8	World Intellectual Property Organization (WIPO)	A8	2007-09-13
EP1955483A2	European Patent Office (EPO)	A2	2008-08-13
WO2007064422A3	World Intellectual Property Organization (WIPO)	A3	2009-05-14
US7756034B2	United States of America	B2	2010-07-13
US7760639B2	United States of America	B2	2010-07-20
EP1955483A4	European Patent Office (EPO)	A4	2013-05-15

77 transactions on the USPTO file

Allowed after 3 non-final rejections, 2 final rejections and 2 RCEs.

Non-final rejections: 3
Final rejections: 2
RCEs: 2
Appeals: 0

Over time

Point at a mark for the transaction

Transactions

Prosecution transactions, newest first
	Event	Code
2022-08-22	Expire PatentEXP.	EXP.
2022-03-07	Maintenance Fee Reminder MailedREM.	REM.
2018-01-22	Payment of Maintenance Fee, 8th Year, Large EntityM1552	M1552
2017-09-11	Correspondence Address ChangeC.ADB	C.ADB
2010-07-20	Recordation of Patent Grant MailedPGM/	PGM/
2010-07-20	Patent Issue Date Used in PTA CalculationAllowedPTAC	PTAC
2010-07-01	Email NotificationEML_NTR	EML_NTR
2010-06-30	Issue Notification MailedAllowedWPIR	WPIR
2010-06-09	Dispatch to FDCD1935	D1935
2010-06-09	Application Is Considered Ready for IssuePILS	PILS
2010-06-07	Issue Fee Payment VerifiedN084	N084
2010-06-07	Issue Fee Payment ReceivedIFEE	IFEE
2010-03-11	Electronic ReviewELC_RVW	ELC_RVW
2010-03-11	Email NotificationEML_NTR	EML_NTR
2010-03-11	Email NotificationEML_NTF	EML_NTF
2010-03-11	Mail Examiner's AmendmentMEX.A	MEX.A
2010-03-11	Mail Notice of AllowanceAllowedMN/=.	MN/=.
2010-03-04	Notice of Allowance Data Verification CompletedAllowedN/=.	N/=.
2010-03-04	Case Docketed to Examiner in GAUDOCK	DOCK
2010-03-04	Examiner's Amendment CommunicationEX.A	EX.A
2010-02-19	Paralegal or electronic terminal disclaimer approvedP574	P574
2010-01-07	Paralegal TD Not acceptedP575	P575
2009-12-27	Date Forwarded to ExaminerFWDX	FWDX
2009-11-30	Response after Non-Final ActionA...	A...
2009-10-06	Case Docketed to Examiner in GAUDOCK	DOCK
2009-09-03	Electronic ReviewELC_RVW	ELC_RVW
2009-09-03	Email NotificationEML_NTF	EML_NTF
2009-09-03	Mail Non-Final RejectionNon-final rejectionMCTNF	MCTNF
2009-08-31	Non-Final RejectionNon-final rejectionCTNF	CTNF
2009-08-20	Date Forwarded to ExaminerFWDX	FWDX
2009-08-20	Date Forwarded to ExaminerFWDX	FWDX
2009-08-20	Disposal for a RCE / CPA / R129AbandonedABN9	ABN9
2009-08-14	Request for Continued Examination (RCE)RCEX	RCEX
2009-08-14	Workflow - Request for RCE - BeginBRCE	BRCE
2009-05-15	Electronic ReviewELC_RVW	ELC_RVW
2009-05-15	Email NotificationEML_NTF	EML_NTF
2009-05-15	Mail Final Rejection (PTOL - 326)Final rejectionMCTFR	MCTFR
2009-05-11	Final RejectionFinal rejectionCTFR	CTFR
2009-03-23	Date Forwarded to ExaminerFWDX	FWDX
2009-02-16	Response after Non-Final ActionA...	A...
2008-11-17	Electronic ReviewELC_RVW	ELC_RVW
2008-11-15	Email NotificationEML_NTF	EML_NTF
2008-11-14	Mail Non-Final RejectionNon-final rejectionMCTNF	MCTNF
2008-11-10	Non-Final RejectionNon-final rejectionCTNF	CTNF
2008-11-02	Date Forwarded to ExaminerFWDX	FWDX
2008-11-02	Date Forwarded to ExaminerFWDX	FWDX
2008-11-02	Disposal for a RCE / CPA / R129AbandonedABN9	ABN9
2008-10-06	Request for Continued Examination (RCE)RCEX	RCEX
2008-10-06	Workflow - Request for RCE - BeginBRCE	BRCE
2008-10-05	Case Docketed to Examiner in GAUDOCK	DOCK
2008-08-05	Electronic ReviewELC_RVW	ELC_RVW
2008-08-05	Email NotificationEML_NTF	EML_NTF
2008-08-05	Mail Final Rejection (PTOL - 326)Final rejectionMCTFR	MCTFR
2008-07-31	Final RejectionFinal rejectionCTFR	CTFR
2008-05-21	Date Forwarded to ExaminerFWDX	FWDX
2008-04-11	New or Additional Drawing FiledC614	C614
2008-04-11	Response after Non-Final ActionA...	A...
2008-01-17	Electronic ReviewELC_RVW	ELC_RVW
2008-01-16	Email NotificationEML_NTF	EML_NTF
2008-01-15	Mail Non-Final RejectionNon-final rejectionMCTNF	MCTNF
2008-01-07	Non-Final RejectionNon-final rejectionCTNF	CTNF
2008-01-07	Case Docketed to Examiner in GAUDOCK	DOCK
2007-10-17	Withdraw Flagged for 5/25W525	W525
2007-10-15	Flagged for 5/25F525	F525
2007-05-31	PG-Pub Issue NotificationPG-ISSUE	PG-ISSUE
2007-01-18	Case Docketed to Examiner in GAUDOCK	DOCK
2006-06-21	IFW TSS Processing by Tech Center CompleteTSSCOMP	TSSCOMP
2006-06-21	Case Docketed to Examiner in GAUDOCK	DOCK
2006-01-06	Application Is Now CompleteCOMP	COMP
2006-01-05	Application Dispatched from OIPEOIPE	OIPE
2005-12-16	Cleared by OIPE CSRL194	L194
2005-12-08	IFW Scan & PACR Auto Security ReviewSCAN	SCAN
2005-11-29	Information Disclosure Statement consideredIDSC	IDSC
2005-11-29	Reference capture on IDSRCAP	RCAP
2005-11-29	Information Disclosure Statement (IDS) FiledM844	M844
2005-11-29	Information Disclosure Statement (IDS) FiledWIDS	WIDS
2005-11-29	Initial Exam Team nnIEXX	IEXX

9 legal events, as the office reported them to INPADOC

Over the term

Point at a mark for the event

Events

Legal events, newest first
	Event	Code
2022-09-13	Lapsed due to failure to pay maintenance feeLapsedFP	FP
2022-08-22	Lapse for failure to pay maintenance feesLapsedPATENT EXPIRED FOR FAILURE TO PAY MAINTENANCE FEES (ORIGINAL EVENT CODE: EXP.); ENTITY STATUS OF PATENT OWNER: LARGE ENTITYLAPS	LAPS
2022-08-22	Information on status: patent discontinuationPATENT EXPIRED DUE TO NONPAYMENT OF MAINTENANCE FEES UNDER 37 CFR 1.362STCH	STCH
2022-03-07	Fee payment procedureMAINTENANCE FEE REMINDER MAILED (ORIGINAL EVENT CODE: REM.); ENTITY STATUS OF PATENT OWNER: LARGE ENTITYFEPP	FEPP
2018-01-22	Maintenance fee paymentMAFP	MAFP
2014-01-20	Fee paymentFPAY	FPAY
2010-06-30	Information on status: patent grantGrantedPATENTED CASESTCF	STCF
2005-11-29	AssignmentAS	AS
2005-11-29	AssignmentAS	AS

System and method for handling network overload

Claim Score by NHIP

Abstract