Apparatus and method for dynamically limiting output queue...

Multiplex communications – Pathfinding or routing – Switching a message which includes an address header

Reexamination Certificate

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

C370S429000

Reexamination Certificate

active

07110415

ABSTRACT:
A method, apparatus, and computer-readable media for sending a frame of data from a first channel to a second channel using at least one of m memory buffers for storing a frame, m being at least 2, in which n of the m buffers have an available status and p of the m buffers have an unavailable status, whereinm=n+p, comprises reserving q of the n buffers having the available status to the first channel, wherein q≦n; when a frame is received from the first channel, storing the frame in i of the q buffers, wherein 1≦i≦q, and changing the status of the i buffers to unavailable; selectively assigning the frame to the second channel; wherein if the frame is assigned to the second channel, the i buffers storing the frame are assigned to the second channel, and when the frame is subsequently sent over the second channel, the status of the i buffers is changed to available; wherein if the frame is not assigned to the second channel, the frame is discarded and the status of the i buffers is changed to available; and wherein selectively assigning comprises selectively assigning the frame to the second channel based on a number of the buffers j assigned to the second channel and a number of the buffers h neither reserved nor assigned to any channel, whereini+j≦mandh+q≦n.

REFERENCES:
patent: 5541912 (1996-07-01), Choudhury et al.
patent: 5889779 (1999-03-01), Lincoln
patent: 5901147 (1999-05-01), Joffe
patent: 5914934 (1999-06-01), Rathnavelu
patent: 6018515 (2000-01-01), Sorber
patent: 6169748 (2001-01-01), Barbas et al.
patent: 6205118 (2001-03-01), Rathnavelu
patent: 6246682 (2001-06-01), Roy et al.
patent: 6256315 (2001-07-01), Barbas et al.
patent: 6262986 (2001-07-01), Oba et al.
patent: 6262989 (2001-07-01), Gemar et al.
patent: 7035273 (2006-04-01), Pannell et al.
U.S. Appl. No. 10/071,417, filed Feb. 6, 2002, Pannell et al.
U.S. Appl. No. 10/141,096, filed May 7, 2002, Walsh et al.
U.S. Appl. No. 10/071,417, filed Feb. 6, 2002, Pannell et al.
Filed May 7, 2002, Walsh et al.
Nong, Ge and Hamdi, Mounir, “On the Provision of Quality-of-Service Guarantees for Input Queued Switches,” IEEE Communications Magazine, Dec. 2000, pp. 62-77.
Seifert, Rich, “The Switch Book: The Complete Guide to LAN Switching Technology,” Wiley Computer Publishing: New York, New York, 2000, Chapter 13, pp. 515-544.
Cyriel Minkenberg and Ton Engbersen, “A Combined Input and Output Queued Packet-Switched System Based on PRIZMA Switch-on-a-Chip Technology,” IEEE Communications Magazine, Dec. 2000, pp. 70-77.
H. Jonathan Chao, Cheuk H. Lam, Eiji Oki, “Broadband Packet Switching Technologies: A Practical Guide to ATM Switches and IP Routers,” New York, New York, 2001, pp. 321-324.
Attorney docket No. MP0173, filed May 7, 2002, Walsh et al.
Abhijit K. Choudhury and Ellen L. Hahne, “Dynamic Queue Length Thresholds for Shared-Memory Packet Switches,” Bell Laboratories, Holmdel, NJ, IEEE/ACM Transactions on Networking, vol. 6, No. 2, Apr. 1998, pp. 130-140.

LandOfFree

Say what you really think

Search LandOfFree.com for the USA inventors and patents. Rate them and share your experience with other people.

Rating

Apparatus and method for dynamically limiting output queue... does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Apparatus and method for dynamically limiting output queue..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Apparatus and method for dynamically limiting output queue... will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFUS-PAI-O-3558449

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.