Patents by Inventor William Tuohy

William Tuohy has filed for patents to protect the following inventions. This listing includes patent applications that are pending as well as patents that have already been granted by the United States Patent and Trademark Office (USPTO).

  • Publication number: 20050249128
    Abstract: In a metropolitan area network, a method and system for maintaining an accurate total of the amount of allocated bandwidth on the network. A plurality of incoming packets are assigned to a respective plurality of queues of a metropolitan area network switch. Using a fair arbitration scheme, the respective queues are configured to empty at a specified output rate. A finish time for each respective queue is computed, the finish time describing a time at which the respective queue will be emptied using the output rate. The plurality of queues are grouped into multiple groups in accordance with their respective finish times. The earliest group includes the reserved rates of those queues having a finish time indicating an empty condition at a first time increment. The second earliest group includes the reserved rates of those queues having a finish time indicating an empty condition at a second time increment later than the first time increment, and so on.
    Type: Application
    Filed: July 14, 2005
    Publication date: November 10, 2005
    Applicant: Broadband Royalty Corporation
    Inventors: Adisak Mekkittikul, Nader Vijeh, William Tuohy
  • Publication number: 20050013248
    Abstract: In a metropolitan area network, a method and system for maintaining an accurate total of the amount of allocated bandwidth on the network. A plurality of incoming packets are assigned to a respective plurality of queues of a metropolitan area network switch. Using a fair arbitration scheme, the respective queues are configured to empty at a specified output rate. A finish time for each respective queue is computed, the finish time describing a time at which the respective queue will be emptied using the output rate. The plurality of queues are grouped into multiple groups in accordance with their respective finish times. The earliest group includes the reserved rates of those queues having a finish time indicating an empty condition at a first time increment. The second earliest group includes the reserved rates of those queues having a finish time indicating an empty condition at a second time increment later than the first time increment, and so on.
    Type: Application
    Filed: March 7, 2002
    Publication date: January 20, 2005
    Inventors: Adisak Mekkittikul, Nader Vijeh, William Tuohy