ADVERTISEMENT



Google       

Home -> Law Blog Directory -> Intellectual Property Law Blogs -> BC Law Intell. Prop. & Tech. Forum

OR PHONE (866) 635-1838 for Bankruptcy Help, (866) 635-6190 for Divorce,
(866) 635-2689 for Personal Injury or (866) 635-9402 for Criminal Defense

Find a Local Lawyer

Bankruptcy (866) 635-1838
Divorce (866) 635-6190
Personal Injury (866) 635-2689
Criminal Defense (866) 635-9402

Bookmark

Intellectual Property Law

: BC Law Intell. Prop. & Tech. Forum

Cool Queuing Theory Model Suggests Continuations Not the Problem at the PTO

By Amy

ADVERTISEMENTS

Recently on Bill Heinze’s I/P Updates, I read about a note published by George Mason authors entitled “Improving Patent Examination Efficiency and Quality, An Operations Research Analysis of the USPTO, Using Queuing Theory“. 17 Fed. Cir. B. J. 133, 163 (2007).    The authors were attempting to validate validate the PTO?s concern with excessive continuation filings and proposed new rules regarding continuations.  The model, which incorporated feedback and branching of applications, was based on two assumptions:

  1. A priority queue processes higher priority items first, giving them a shorter queuing delay ? but at only at the expense of longer queuing delays for lower-priority arrivals. Since the USPTO gives higher priority to RCEs and continuing applications than to regular new applications, large numbers of RCEs and continuing applications should result in disproportionate waiting times for regular new applications.
  2. At the very least, a limit on the number of continuing applications would be desirable because continuing applications can produce multiple generations of unlimited numbers of high priority offspring. RCEs and multiple non-final office actions both contribute to the risk of starvation, but pose less potential risk than continuing applications because they do not produce parallel offspring (branching feedback).

Surprisingly, the study found that continuing applications were not the primary cause of congestion of patent applications at the PTO.  According to the model, the excessive number of non-final rejections per application was the main culprit. The non-final rejections in each round of prosecution exceeded by far the number of second and later RCEs and continuation applications.   Thus, limiting or prohibiting successive generations of RCEs and continuation applications as the only change will not be effective in reducing the backlog.  Instead, reducing non-final rejections per application would be more effective because it would relieve the PTO of its primary burden on the system. 

The note went on to say that hiring additional examiners is not an effective solution because the PTO would need to exponentially increase its personnel in order to keep up with its load of patent applications.  Instead, a policy change addressing the source of the problems is required.

 Thus, it looks like it is time for the PTO to revise its rules, which have already been brought into question by Tafas v. Dudas, described in my blog from Nov. 2.  Using research data and mathematical models may prove to be a valuable aid as the PTO leadership considers its next move. 

Full post as published by BC Law Intell. Prop. & Tech. Forum on December 14, 2007 (boomark / email).

Bloggers, promote your law blog by nominating your blog for inclusion in USLaw.com's Law Blog Directory and RSS Reader. Benefits described.
Related Law Articles

Lawsuits and Settlements

Related Searches

























































































































US Law
#1 Online Legal Resource













Your Blog Subscriptions
Subscribe to blogs

10,000+ Law Job Listings
Lawyer . Police . Paralegal . Etc
Earn a law-related degree
Are you the author of this blog? Adding USLaw.com to your Blogroll increases relevance. You qualify to display a USLaw Network badge.
Suggest changes to this blog's description or nominate another for inclusion. Register for updates.


Practice Area
Zip Code:

Contact a Lawyer Now!






0.014 secs (new cache)